Matches in value-assignements (V): {{numOfValueMatches}}
Matches in edge-description: {{numOfDescriptionMatches}}
-V- |
{{line.desc}}
|
Zoom Factor (%)
Run scripts/report-generator.py to display CFAs.
Zoom Factor (%)
Run scripts/report-generator.py to display ARG.
1 | int num_of_inputs_at_532 = 3; int INPUTS_at_532[3]; int input_at_532_counter = 0;int num_of_inputs_at_552 = 3; int INPUTS_at_552[3]; int input_at_552_counter = 0;int num_of_inputs_at_542 = 3; int INPUTS_at_542[3]; int input_at_542_counter = 0;int num_of_inputs_at_558 = 2; int INPUTS_at_558[2]; int input_at_558_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_532[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_552[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_542[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_558[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(void); |
4 | //extern int printf (__const char *__restrict __format, ...); |
5 | /* Generated by CIL v. 1.3.7 */ |
6 | /* print_CIL_Input is true */ |
7 | |
8 | struct JoinPoint { |
9 | void **(*fp)(struct JoinPoint * ) ; |
10 | void **args ; |
11 | int argsCount ; |
12 | char const **argsType ; |
13 | void *(*arg)(int , struct JoinPoint * ) ; |
14 | char const *(*argType)(int , struct JoinPoint * ) ; |
15 | void **retValue ; |
16 | char const *retType ; |
17 | char const *funcName ; |
18 | char const *targetName ; |
19 | char const *fileName ; |
20 | char const *kind ; |
21 | void *excep_return ; |
22 | }; |
23 | struct __UTAC__CFLOW_FUNC { |
24 | int (*func)(int , int ) ; |
25 | int val ; |
26 | struct __UTAC__CFLOW_FUNC *next ; |
27 | }; |
28 | struct __UTAC__EXCEPTION { |
29 | void *jumpbuf ; |
30 | unsigned long long prtValue ; |
31 | int pops ; |
32 | struct __UTAC__CFLOW_FUNC *cflowfuncs ; |
33 | }; |
34 | typedef unsigned int size_t; |
35 | struct __ACC__ERR { |
36 | void *v ; |
37 | struct __ACC__ERR *next ; |
38 | }; |
39 | #pragma merger(0,"Environment.i","") |
40 | void lowerWaterLevel(void) ; |
41 | void waterRise(void) ; |
42 | void changeMethaneLevel(void) ; |
43 | int isMethaneLevelCritical(void) ; |
44 | int getWaterLevel(void) ; |
45 | void printEnvironment(void) ; |
46 | int isLowWaterSensorDry(void) ; |
47 | int waterLevel = 1; |
48 | int methaneLevelCritical = 0; |
49 | void lowerWaterLevel(void) |
50 | { |
51 | |
52 | { |
53 | if (waterLevel > 0) { |
54 | waterLevel = waterLevel - 1; |
55 | } else { |
56 | |
57 | } |
58 | return; |
59 | } |
60 | } |
61 | void waterRise(void) |
62 | { |
63 | |
64 | { |
65 | if (waterLevel < 2) { |
66 | waterLevel = waterLevel + 1; |
67 | } else { |
68 | |
69 | } |
70 | return; |
71 | } |
72 | } |
73 | void changeMethaneLevel(void) |
74 | { |
75 | |
76 | { |
77 | if (methaneLevelCritical != 0) { |
78 | methaneLevelCritical = 0; |
79 | } else { |
80 | methaneLevelCritical = 1; |
81 | } |
82 | return; |
83 | } |
84 | } |
85 | int isMethaneLevelCritical(void) |
86 | { int retValue_acc ; |
87 | |
88 | { |
89 | retValue_acc = methaneLevelCritical; |
90 | return (retValue_acc); |
91 | return (retValue_acc); |
92 | } |
93 | } |
94 | void printEnvironment(void) |
95 | { |
96 | |
97 | { |
98 | { |
99 | // printf("Env(Water:%i", waterLevel); |
100 | // printf(",Meth:"); |
101 | } |
102 | if (methaneLevelCritical != 0) { |
103 | { |
104 | // printf("CRIT"); |
105 | } |
106 | } else { |
107 | { |
108 | // printf("OK"); |
109 | } |
110 | } |
111 | { |
112 | // printf(")"); |
113 | } |
114 | return; |
115 | } |
116 | } |
117 | int getWaterLevel(void) |
118 | { int retValue_acc ; |
119 | |
120 | { |
121 | retValue_acc = waterLevel; |
122 | return (retValue_acc); |
123 | return (retValue_acc); |
124 | } |
125 | } |
126 | int isLowWaterSensorDry(void) |
127 | { int retValue_acc ; |
128 | |
129 | { |
130 | retValue_acc = waterLevel == 0; |
131 | return (retValue_acc); |
132 | return (retValue_acc); |
133 | } |
134 | } |
135 | #pragma merger(0,"wsllib_check.i","") |
136 | void __automaton_fail(void) |
137 | { |
138 | |
139 | { |
140 | __VERIFIER_assume(!((0 == INPUTS_at_542[0])));__VERIFIER_assume(!((0 == INPUTS_at_532[1] && 0 != INPUTS_at_552[1])));__VERIFIER_assume(!((0 == INPUTS_at_532[0] && 0 != INPUTS_at_558[0])));__VERIFIER_assume(!((0 != INPUTS_at_558[0])));__VERIFIER_assume(!((0 == INPUTS_at_552[1] && 0 == INPUTS_at_542[0])));__VERIFIER_assume(!((0 != INPUTS_at_558[0] && 0 == INPUTS_at_552[1])));__VERIFIER_assume(!((0 == INPUTS_at_558[1] && 0 == INPUTS_at_552[1] && 0 == INPUTS_at_542[0])));__VERIFIER_assume(!((0 == INPUTS_at_558[1] && 0 == INPUTS_at_552[1] && 0 == INPUTS_at_532[0])));__VERIFIER_assume(!((0 == INPUTS_at_552[1])));__VERIFIER_assume(!((0 != INPUTS_at_552[0])));__VERIFIER_assume(!((0 != INPUTS_at_532[1] && 0 == INPUTS_at_532[0])));__VERIFIER_assume(!((0 == INPUTS_at_542[2])));__VERIFIER_error(); |
141 | return; |
142 | } |
143 | } |
144 | #pragma merger(0,"libacc.i","") |
145 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
146 | char const *__file , |
147 | unsigned int __line , |
148 | char const *__function ) ; |
149 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
150 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
151 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
152 | int ) , |
153 | int val ) |
154 | { struct __UTAC__EXCEPTION *excep ; |
155 | struct __UTAC__CFLOW_FUNC *cf ; |
156 | void *tmp ; |
157 | unsigned long __cil_tmp7 ; |
158 | unsigned long __cil_tmp8 ; |
159 | unsigned long __cil_tmp9 ; |
160 | unsigned long __cil_tmp10 ; |
161 | unsigned long __cil_tmp11 ; |
162 | unsigned long __cil_tmp12 ; |
163 | unsigned long __cil_tmp13 ; |
164 | unsigned long __cil_tmp14 ; |
165 | int (**mem_15)(int , int ) ; |
166 | int *mem_16 ; |
167 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
168 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
169 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
170 | |
171 | { |
172 | { |
173 | excep = (struct __UTAC__EXCEPTION *)exception; |
174 | tmp = malloc(24UL); |
175 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
176 | mem_15 = (int (**)(int , int ))cf; |
177 | *mem_15 = cflow_func; |
178 | __cil_tmp7 = (unsigned long )cf; |
179 | __cil_tmp8 = __cil_tmp7 + 8; |
180 | mem_16 = (int *)__cil_tmp8; |
181 | *mem_16 = val; |
182 | __cil_tmp9 = (unsigned long )cf; |
183 | __cil_tmp10 = __cil_tmp9 + 16; |
184 | __cil_tmp11 = (unsigned long )excep; |
185 | __cil_tmp12 = __cil_tmp11 + 24; |
186 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
187 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
188 | *mem_17 = *mem_18; |
189 | __cil_tmp13 = (unsigned long )excep; |
190 | __cil_tmp14 = __cil_tmp13 + 24; |
191 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
192 | *mem_19 = cf; |
193 | } |
194 | return; |
195 | } |
196 | } |
197 | void __utac__exception__cf_handler_free(void *exception ) |
198 | { struct __UTAC__EXCEPTION *excep ; |
199 | struct __UTAC__CFLOW_FUNC *cf ; |
200 | struct __UTAC__CFLOW_FUNC *tmp ; |
201 | unsigned long __cil_tmp5 ; |
202 | unsigned long __cil_tmp6 ; |
203 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
204 | unsigned long __cil_tmp8 ; |
205 | unsigned long __cil_tmp9 ; |
206 | unsigned long __cil_tmp10 ; |
207 | unsigned long __cil_tmp11 ; |
208 | void *__cil_tmp12 ; |
209 | unsigned long __cil_tmp13 ; |
210 | unsigned long __cil_tmp14 ; |
211 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
212 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
213 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
214 | |
215 | { |
216 | excep = (struct __UTAC__EXCEPTION *)exception; |
217 | __cil_tmp5 = (unsigned long )excep; |
218 | __cil_tmp6 = __cil_tmp5 + 24; |
219 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
220 | cf = *mem_15; |
221 | { |
222 | while (1) { |
223 | while_0_continue: /* CIL Label */ ; |
224 | { |
225 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
226 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
227 | __cil_tmp9 = (unsigned long )cf; |
228 | if (__cil_tmp9 != __cil_tmp8) { |
229 | |
230 | } else { |
231 | goto while_0_break; |
232 | } |
233 | } |
234 | { |
235 | tmp = cf; |
236 | __cil_tmp10 = (unsigned long )cf; |
237 | __cil_tmp11 = __cil_tmp10 + 16; |
238 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
239 | cf = *mem_16; |
240 | __cil_tmp12 = (void *)tmp; |
241 | free(__cil_tmp12); |
242 | } |
243 | } |
244 | while_0_break: /* CIL Label */ ; |
245 | } |
246 | __cil_tmp13 = (unsigned long )excep; |
247 | __cil_tmp14 = __cil_tmp13 + 24; |
248 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
249 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
250 | return; |
251 | } |
252 | } |
253 | void __utac__exception__cf_handler_reset(void *exception ) |
254 | { struct __UTAC__EXCEPTION *excep ; |
255 | struct __UTAC__CFLOW_FUNC *cf ; |
256 | unsigned long __cil_tmp5 ; |
257 | unsigned long __cil_tmp6 ; |
258 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
259 | unsigned long __cil_tmp8 ; |
260 | unsigned long __cil_tmp9 ; |
261 | int (*__cil_tmp10)(int , int ) ; |
262 | unsigned long __cil_tmp11 ; |
263 | unsigned long __cil_tmp12 ; |
264 | int __cil_tmp13 ; |
265 | unsigned long __cil_tmp14 ; |
266 | unsigned long __cil_tmp15 ; |
267 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
268 | int (**mem_17)(int , int ) ; |
269 | int *mem_18 ; |
270 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
271 | |
272 | { |
273 | excep = (struct __UTAC__EXCEPTION *)exception; |
274 | __cil_tmp5 = (unsigned long )excep; |
275 | __cil_tmp6 = __cil_tmp5 + 24; |
276 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
277 | cf = *mem_16; |
278 | { |
279 | while (1) { |
280 | while_1_continue: /* CIL Label */ ; |
281 | { |
282 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
283 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
284 | __cil_tmp9 = (unsigned long )cf; |
285 | if (__cil_tmp9 != __cil_tmp8) { |
286 | |
287 | } else { |
288 | goto while_1_break; |
289 | } |
290 | } |
291 | { |
292 | mem_17 = (int (**)(int , int ))cf; |
293 | __cil_tmp10 = *mem_17; |
294 | __cil_tmp11 = (unsigned long )cf; |
295 | __cil_tmp12 = __cil_tmp11 + 8; |
296 | mem_18 = (int *)__cil_tmp12; |
297 | __cil_tmp13 = *mem_18; |
298 | (*__cil_tmp10)(4, __cil_tmp13); |
299 | __cil_tmp14 = (unsigned long )cf; |
300 | __cil_tmp15 = __cil_tmp14 + 16; |
301 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
302 | cf = *mem_19; |
303 | } |
304 | } |
305 | while_1_break: /* CIL Label */ ; |
306 | } |
307 | { |
308 | __utac__exception__cf_handler_free(exception); |
309 | } |
310 | return; |
311 | } |
312 | } |
313 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
314 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
315 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
316 | { void *retValue_acc ; |
317 | struct __ACC__ERR *new ; |
318 | void *tmp ; |
319 | struct __ACC__ERR *temp ; |
320 | struct __ACC__ERR *next ; |
321 | void *excep ; |
322 | unsigned long __cil_tmp10 ; |
323 | unsigned long __cil_tmp11 ; |
324 | unsigned long __cil_tmp12 ; |
325 | unsigned long __cil_tmp13 ; |
326 | void *__cil_tmp14 ; |
327 | unsigned long __cil_tmp15 ; |
328 | unsigned long __cil_tmp16 ; |
329 | void *__cil_tmp17 ; |
330 | void **mem_18 ; |
331 | struct __ACC__ERR **mem_19 ; |
332 | struct __ACC__ERR **mem_20 ; |
333 | void **mem_21 ; |
334 | struct __ACC__ERR **mem_22 ; |
335 | void **mem_23 ; |
336 | void **mem_24 ; |
337 | |
338 | { |
339 | if (count == 0) { |
340 | return (retValue_acc); |
341 | } else { |
342 | |
343 | } |
344 | if (mode == 0) { |
345 | { |
346 | tmp = malloc(16UL); |
347 | new = (struct __ACC__ERR *)tmp; |
348 | mem_18 = (void **)new; |
349 | *mem_18 = env; |
350 | __cil_tmp10 = (unsigned long )new; |
351 | __cil_tmp11 = __cil_tmp10 + 8; |
352 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
353 | *mem_19 = head; |
354 | head = new; |
355 | retValue_acc = (void *)new; |
356 | } |
357 | return (retValue_acc); |
358 | } else { |
359 | |
360 | } |
361 | if (mode == 1) { |
362 | temp = head; |
363 | { |
364 | while (1) { |
365 | while_2_continue: /* CIL Label */ ; |
366 | if (count > 1) { |
367 | |
368 | } else { |
369 | goto while_2_break; |
370 | } |
371 | { |
372 | __cil_tmp12 = (unsigned long )temp; |
373 | __cil_tmp13 = __cil_tmp12 + 8; |
374 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
375 | next = *mem_20; |
376 | mem_21 = (void **)temp; |
377 | excep = *mem_21; |
378 | __cil_tmp14 = (void *)temp; |
379 | free(__cil_tmp14); |
380 | __utac__exception__cf_handler_reset(excep); |
381 | temp = next; |
382 | count = count - 1; |
383 | } |
384 | } |
385 | while_2_break: /* CIL Label */ ; |
386 | } |
387 | { |
388 | __cil_tmp15 = (unsigned long )temp; |
389 | __cil_tmp16 = __cil_tmp15 + 8; |
390 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
391 | head = *mem_22; |
392 | mem_23 = (void **)temp; |
393 | excep = *mem_23; |
394 | __cil_tmp17 = (void *)temp; |
395 | free(__cil_tmp17); |
396 | __utac__exception__cf_handler_reset(excep); |
397 | retValue_acc = excep; |
398 | } |
399 | return (retValue_acc); |
400 | } else { |
401 | |
402 | } |
403 | if (mode == 2) { |
404 | if (head != 0) { |
405 | mem_24 = (void **)head; |
406 | retValue_acc = *mem_24; |
407 | return (retValue_acc); |
408 | } else { |
409 | retValue_acc = (void *)0; |
410 | return (retValue_acc); |
411 | } |
412 | } else { |
413 | |
414 | } |
415 | return (retValue_acc); |
416 | } |
417 | } |
418 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
419 | { void *retValue_acc ; |
420 | unsigned long __cil_tmp4 ; |
421 | unsigned long __cil_tmp5 ; |
422 | int __cil_tmp6 ; |
423 | int __cil_tmp7 ; |
424 | unsigned long __cil_tmp8 ; |
425 | unsigned long __cil_tmp9 ; |
426 | void **__cil_tmp10 ; |
427 | void **__cil_tmp11 ; |
428 | int *mem_12 ; |
429 | void ***mem_13 ; |
430 | |
431 | { |
432 | if (i > 0) { |
433 | { |
434 | __cil_tmp4 = (unsigned long )this; |
435 | __cil_tmp5 = __cil_tmp4 + 16; |
436 | mem_12 = (int *)__cil_tmp5; |
437 | __cil_tmp6 = *mem_12; |
438 | if (i <= __cil_tmp6) { |
439 | |
440 | } else { |
441 | { |
442 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
443 | 123U, "__utac__get_this_arg"); |
444 | } |
445 | } |
446 | } |
447 | } else { |
448 | { |
449 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
450 | 123U, "__utac__get_this_arg"); |
451 | } |
452 | } |
453 | __cil_tmp7 = i - 1; |
454 | __cil_tmp8 = (unsigned long )this; |
455 | __cil_tmp9 = __cil_tmp8 + 8; |
456 | mem_13 = (void ***)__cil_tmp9; |
457 | __cil_tmp10 = *mem_13; |
458 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
459 | retValue_acc = *__cil_tmp11; |
460 | return (retValue_acc); |
461 | return (retValue_acc); |
462 | } |
463 | } |
464 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
465 | { char const *retValue_acc ; |
466 | unsigned long __cil_tmp4 ; |
467 | unsigned long __cil_tmp5 ; |
468 | int __cil_tmp6 ; |
469 | int __cil_tmp7 ; |
470 | unsigned long __cil_tmp8 ; |
471 | unsigned long __cil_tmp9 ; |
472 | char const **__cil_tmp10 ; |
473 | char const **__cil_tmp11 ; |
474 | int *mem_12 ; |
475 | char const ***mem_13 ; |
476 | |
477 | { |
478 | if (i > 0) { |
479 | { |
480 | __cil_tmp4 = (unsigned long )this; |
481 | __cil_tmp5 = __cil_tmp4 + 16; |
482 | mem_12 = (int *)__cil_tmp5; |
483 | __cil_tmp6 = *mem_12; |
484 | if (i <= __cil_tmp6) { |
485 | |
486 | } else { |
487 | { |
488 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
489 | 131U, "__utac__get_this_argtype"); |
490 | } |
491 | } |
492 | } |
493 | } else { |
494 | { |
495 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
496 | 131U, "__utac__get_this_argtype"); |
497 | } |
498 | } |
499 | __cil_tmp7 = i - 1; |
500 | __cil_tmp8 = (unsigned long )this; |
501 | __cil_tmp9 = __cil_tmp8 + 24; |
502 | mem_13 = (char const ***)__cil_tmp9; |
503 | __cil_tmp10 = *mem_13; |
504 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
505 | retValue_acc = *__cil_tmp11; |
506 | return (retValue_acc); |
507 | return (retValue_acc); |
508 | } |
509 | } |
510 | #pragma merger(0,"scenario.i","") |
511 | void stopSystem(void) ; |
512 | void timeShift(void) ; |
513 | void cleanup(void) ; |
514 | void test(void) |
515 | { int splverifierCounter ; |
516 | int tmp ; |
517 | int tmp___0 ; |
518 | int tmp___1 ; |
519 | int tmp___2 ; |
520 | |
521 | { |
522 | splverifierCounter = 0; |
523 | { |
524 | while (1) { |
525 | while_3_continue: /* CIL Label */ ; |
526 | if (splverifierCounter < 4) { |
527 | |
528 | } else { |
529 | goto while_3_break; |
530 | } |
531 | { |
532 | tmp = (input_at_532_counter < num_of_inputs_at_532) ? INPUTS_at_532[input_at_532_counter++] : __VERIFIER_nondet_int() ; |
533 | } |
534 | if (tmp != 0) { |
535 | { |
536 | waterRise(); |
537 | } |
538 | } else { |
539 | |
540 | } |
541 | { |
542 | tmp___0 = (input_at_542_counter < num_of_inputs_at_542) ? INPUTS_at_542[input_at_542_counter++] : __VERIFIER_nondet_int() ; |
543 | } |
544 | if (tmp___0 != 0) { |
545 | { |
546 | changeMethaneLevel(); |
547 | } |
548 | } else { |
549 | |
550 | } |
551 | { |
552 | tmp___2 = (input_at_552_counter < num_of_inputs_at_552) ? INPUTS_at_552[input_at_552_counter++] : __VERIFIER_nondet_int() ; |
553 | } |
554 | if (tmp___2 != 0) { |
555 | |
556 | } else { |
557 | { |
558 | tmp___1 = (input_at_558_counter < num_of_inputs_at_558) ? INPUTS_at_558[input_at_558_counter++] : __VERIFIER_nondet_int() ; |
559 | } |
560 | if (tmp___1 != 0) { |
561 | { |
562 | stopSystem(); |
563 | } |
564 | } else { |
565 | |
566 | } |
567 | } |
568 | { |
569 | timeShift(); |
570 | } |
571 | } |
572 | while_3_break: /* CIL Label */ ; |
573 | } |
574 | { |
575 | cleanup(); |
576 | } |
577 | return; |
578 | } |
579 | } |
580 | #pragma merger(0,"MinePump.i","") |
581 | void activatePump(void) ; |
582 | void deactivatePump(void) ; |
583 | int isPumpRunning(void) ; |
584 | void printPump(void) ; |
585 | int pumpRunning = 0; |
586 | int systemActive = 1; |
587 | void __utac_acc__Specification3_spec__1(void) ; |
588 | void processEnvironment(void) ; |
589 | void timeShift(void) |
590 | { |
591 | |
592 | { |
593 | if (pumpRunning != 0) { |
594 | { |
595 | lowerWaterLevel(); |
596 | } |
597 | } else { |
598 | |
599 | } |
600 | if (systemActive != 0) { |
601 | { |
602 | processEnvironment(); |
603 | } |
604 | } else { |
605 | |
606 | } |
607 | { |
608 | __utac_acc__Specification3_spec__1(); |
609 | } |
610 | return; |
611 | } |
612 | } |
613 | void processEnvironment__wrappee__base(void) |
614 | { |
615 | |
616 | { |
617 | return; |
618 | } |
619 | } |
620 | int isLowWaterLevel(void) ; |
621 | void processEnvironment__wrappee__methaneQuery(void) |
622 | { int tmp ; |
623 | |
624 | { |
625 | if (pumpRunning != 0) { |
626 | { |
627 | tmp = isLowWaterLevel(); |
628 | } |
629 | if (tmp != 0) { |
630 | { |
631 | deactivatePump(); |
632 | } |
633 | } else { |
634 | { |
635 | processEnvironment__wrappee__base(); |
636 | } |
637 | } |
638 | } else { |
639 | { |
640 | processEnvironment__wrappee__base(); |
641 | } |
642 | } |
643 | return; |
644 | } |
645 | } |
646 | int isMethaneAlarm(void) ; |
647 | void processEnvironment(void) |
648 | { int tmp ; |
649 | |
650 | { |
651 | if (pumpRunning != 0) { |
652 | { |
653 | tmp = isMethaneAlarm(); |
654 | } |
655 | if (tmp != 0) { |
656 | { |
657 | deactivatePump(); |
658 | } |
659 | } else { |
660 | { |
661 | processEnvironment__wrappee__methaneQuery(); |
662 | } |
663 | } |
664 | } else { |
665 | { |
666 | processEnvironment__wrappee__methaneQuery(); |
667 | } |
668 | } |
669 | return; |
670 | } |
671 | } |
672 | void activatePump__wrappee__lowWaterSensor(void) |
673 | { |
674 | |
675 | { |
676 | pumpRunning = 1; |
677 | return; |
678 | } |
679 | } |
680 | void activatePump(void) |
681 | { int tmp ; |
682 | |
683 | { |
684 | { |
685 | tmp = isMethaneAlarm(); |
686 | } |
687 | if (tmp != 0) { |
688 | |
689 | } else { |
690 | { |
691 | activatePump__wrappee__lowWaterSensor(); |
692 | } |
693 | } |
694 | return; |
695 | } |
696 | } |
697 | void deactivatePump(void) |
698 | { |
699 | |
700 | { |
701 | pumpRunning = 0; |
702 | return; |
703 | } |
704 | } |
705 | int isMethaneAlarm(void) |
706 | { int retValue_acc ; |
707 | |
708 | { |
709 | { |
710 | retValue_acc = isMethaneLevelCritical(); |
711 | } |
712 | return (retValue_acc); |
713 | return (retValue_acc); |
714 | } |
715 | } |
716 | int isPumpRunning(void) |
717 | { int retValue_acc ; |
718 | |
719 | { |
720 | retValue_acc = pumpRunning; |
721 | return (retValue_acc); |
722 | return (retValue_acc); |
723 | } |
724 | } |
725 | void printPump(void) |
726 | { |
727 | |
728 | { |
729 | { |
730 | // printf("Pump(System:"); |
731 | } |
732 | if (systemActive != 0) { |
733 | { |
734 | // printf("On"); |
735 | } |
736 | } else { |
737 | { |
738 | // printf("Off"); |
739 | } |
740 | } |
741 | { |
742 | // printf(",Pump:"); |
743 | } |
744 | if (pumpRunning != 0) { |
745 | { |
746 | // printf("On"); |
747 | } |
748 | } else { |
749 | { |
750 | // printf("Off"); |
751 | } |
752 | } |
753 | { |
754 | // printf(") "); |
755 | printEnvironment(); |
756 | // printf("\n"); |
757 | } |
758 | return; |
759 | } |
760 | } |
761 | int isLowWaterLevel(void) |
762 | { int retValue_acc ; |
763 | int tmp ; |
764 | int tmp___0 ; |
765 | |
766 | { |
767 | { |
768 | tmp = isLowWaterSensorDry(); |
769 | } |
770 | if (tmp != 0) { |
771 | tmp___0 = 0; |
772 | } else { |
773 | tmp___0 = 1; |
774 | } |
775 | retValue_acc = tmp___0; |
776 | return (retValue_acc); |
777 | return (retValue_acc); |
778 | } |
779 | } |
780 | void stopSystem(void) |
781 | { |
782 | |
783 | { |
784 | if (pumpRunning != 0) { |
785 | { |
786 | deactivatePump(); |
787 | } |
788 | } else { |
789 | |
790 | } |
791 | systemActive = 0; |
792 | return; |
793 | } |
794 | } |
795 | #pragma merger(0,"Specification3_spec.i","") |
796 | void __utac_acc__Specification3_spec__1(void) |
797 | { int tmp ; |
798 | int tmp___0 ; |
799 | int tmp___1 ; |
800 | |
801 | { |
802 | { |
803 | tmp = isMethaneLevelCritical(); |
804 | } |
805 | if (tmp != 0) { |
806 | |
807 | } else { |
808 | { |
809 | tmp___0 = getWaterLevel(); |
810 | } |
811 | if (tmp___0 == 2) { |
812 | { |
813 | tmp___1 = isPumpRunning(); |
814 | } |
815 | if (tmp___1 != 0) { |
816 | |
817 | } else { |
818 | { |
819 | __automaton_fail(); |
820 | } |
821 | } |
822 | } else { |
823 | |
824 | } |
825 | } |
826 | return; |
827 | } |
828 | } |
829 | #pragma merger(0,"featureselect.i","") |
830 | int select_one(void) ; |
831 | void select_features(void) ; |
832 | void select_helpers(void) ; |
833 | int valid_product(void) ; |
834 | int select_one(void) |
835 | { int retValue_acc ; |
836 | int choice = __VERIFIER_nondet_int(); |
837 | |
838 | { |
839 | retValue_acc = choice; |
840 | return (retValue_acc); |
841 | return (retValue_acc); |
842 | } |
843 | } |
844 | void select_features(void) |
845 | { |
846 | |
847 | { |
848 | return; |
849 | } |
850 | } |
851 | void select_helpers(void) |
852 | { |
853 | |
854 | { |
855 | return; |
856 | } |
857 | } |
858 | int valid_product(void) |
859 | { int retValue_acc ; |
860 | |
861 | { |
862 | retValue_acc = 1; |
863 | return (retValue_acc); |
864 | return (retValue_acc); |
865 | } |
866 | } |
867 | #pragma merger(0,"Test.i","") |
868 | int cleanupTimeShifts = 4; |
869 | void cleanup(void) |
870 | { int i ; |
871 | int __cil_tmp2 ; |
872 | |
873 | { |
874 | { |
875 | timeShift(); |
876 | i = 0; |
877 | } |
878 | { |
879 | while (1) { |
880 | while_4_continue: /* CIL Label */ ; |
881 | { |
882 | __cil_tmp2 = cleanupTimeShifts - 1; |
883 | if (i < __cil_tmp2) { |
884 | |
885 | } else { |
886 | goto while_4_break; |
887 | } |
888 | } |
889 | { |
890 | timeShift(); |
891 | i = i + 1; |
892 | } |
893 | } |
894 | while_4_break: /* CIL Label */ ; |
895 | } |
896 | return; |
897 | } |
898 | } |
899 | void Specification2(void) |
900 | { |
901 | |
902 | { |
903 | { |
904 | timeShift(); |
905 | printPump(); |
906 | timeShift(); |
907 | printPump(); |
908 | timeShift(); |
909 | printPump(); |
910 | waterRise(); |
911 | printPump(); |
912 | timeShift(); |
913 | printPump(); |
914 | changeMethaneLevel(); |
915 | printPump(); |
916 | timeShift(); |
917 | printPump(); |
918 | cleanup(); |
919 | } |
920 | return; |
921 | } |
922 | } |
923 | void setup(void) |
924 | { |
925 | |
926 | { |
927 | return; |
928 | } |
929 | } |
930 | void runTest(void) |
931 | { |
932 | |
933 | { |
934 | { |
935 | test(); |
936 | } |
937 | return; |
938 | } |
939 | } |
940 | int main(void) |
941 | {initialize_reads(); int retValue_acc ; |
942 | int tmp ; |
943 | |
944 | { |
945 | { |
946 | select_helpers(); |
947 | select_features(); |
948 | tmp = valid_product(); |
949 | } |
950 | if (tmp != 0) { |
951 | { |
952 | setup(); |
953 | runTest(); |
954 | } |
955 | } else { |
956 | |
957 | } |
958 | retValue_acc = 0; |
959 | return (retValue_acc); |
960 | return (retValue_acc); |
961 | } |
962 | } |
2017-05-11 14:44:40:060 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:44:40:148 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 14:44:41:373 INFO CFACreationUtils.addEdgeToCFA line 91: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:381 INFO CFACreationUtils.addEdgeToCFA line 123: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:383 INFO CFACreationUtils.addEdgeToCFA line 132: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:483 INFO CFACreationUtils.addEdgeToCFA line 461: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:489 INFO CFACreationUtils.addEdgeToCFA line 507: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:524 INFO CFACreationUtils.addEdgeToCFA line 713: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:528 INFO CFACreationUtils.addEdgeToCFA line 722: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:534 INFO CFACreationUtils.addEdgeToCFA line 777: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:543 INFO CFACreationUtils.addEdgeToCFA line 841: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:546 INFO CFACreationUtils.addEdgeToCFA line 864: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:556 INFO CFACreationUtils.addEdgeToCFA line 960: Dead code detected: return (retValue_acc);
2017-05-11 14:44:41:706 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 298: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 14:44:42:664 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 14:44:42:685 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:44:42:714 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:44:42:914 WARNING Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:44:43:437 INFO Parallel analysis 1:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:44:43:524 WARNING Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:44:43:612 WARNING Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:44:43:901 WARNING Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:44:43:904 INFO Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:44:43:924 WARNING Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:44:43:933 WARNING Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:44:44:284 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:44:45:741 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:44:45:769 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:44:46:161 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:44:46:889 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 14:44:46:889 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:46:890 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:49:463 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 14:44:49:464 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:49:464 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:50:716 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 14:44:50:717 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:50:717 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:52:047 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 5
2017-05-11 14:44:52:055 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:52:055 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:52:983 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 14:44:52:998 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:52:999 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:54:107 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 7
2017-05-11 14:44:54:107 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:54:107 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:54:862 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 14:44:54:862 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:54:862 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:55:290 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 10
2017-05-11 14:44:55:290 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:55:290 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:56:084 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 11
2017-05-11 14:44:56:085 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:56:085 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:56:419 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 13
2017-05-11 14:44:56:419 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:56:419 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:56:783 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 14
2017-05-11 14:44:56:783 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:56:783 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:57:146 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 14:44:57:146 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:57:147 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:57:427 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 14:44:57:427 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:57:427 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:57:663 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:44:57:720 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 22
2017-05-11 14:44:57:721 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:57:721 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:58:121 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 23
2017-05-11 14:44:58:121 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:58:121 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:58:585 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 24
2017-05-11 14:44:58:586 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:58:586 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:59:573 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 25
2017-05-11 14:44:59:573 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:59:574 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:44:59:952 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 27
2017-05-11 14:44:59:952 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:44:59:953 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:01:213 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 28
2017-05-11 14:45:01:213 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:01:215 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:02:432 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 30
2017-05-11 14:45:02:433 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:02:433 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:04:705 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 31
2017-05-11 14:45:04:705 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:04:706 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:08:555 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 14:45:08:555 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:08:555 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:12:436 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 33
2017-05-11 14:45:12:437 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:12:437 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:16:356 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 34
2017-05-11 14:45:16:357 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:16:357 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:20:049 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 36
2017-05-11 14:45:20:050 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:20:050 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:23:865 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 37
2017-05-11 14:45:23:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:23:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:27:653 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 39
2017-05-11 14:45:27:654 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:27:654 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:31:316 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 43
2017-05-11 14:45:31:316 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:31:316 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:34:768 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 51
2017-05-11 14:45:34:768 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@70d01cb0
2017-05-11 14:45:34:768 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:41:132 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 14:45:41:132 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:45:41:139 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:45:41:140 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:45:41:156 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:45:46:500 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:45:50:768 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 14:45:50:769 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:45:50:775 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:45:50:776 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:45:50:799 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:45:56:636 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:46:07:944 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 14:46:07:945 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:46:08:134 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:46:09:564 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 14:46:10:466 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:46:10:764 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:46:10:765 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:46:11:073 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 14:46:11:073 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:46:11:374 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:46:11:374 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:46:11:697 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:46:11:700 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 14:46:11:705 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 14:46:11:705 INFO CPAchecker.runAlgorithm Stopping analysis ...
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 4 (0% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 0 (0%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Because of target state: 4 (100%)
Times precision was empty: 4 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 0
Number of coverage checks: 178
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 327
Number of predicates discovered: 0
Time for post operator: 1.217s
Time for path formula creation: 1.214s
Time for strengthen operator: 0.010s
Time for prec operator: 0.007s
Time for abstraction: 0.000s (Max: 0.000s, Count: 4)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.018s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 242
Number of created targets for uf: *signed_int is 45
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 4
Maximum loop iteration reached: 5
ValueAnalysisCPA statistics
---------------------------
Number of variables: 15165 (count: 888, min: 0, max: 28, avg: 17.08)
Number of global variables: 9698 (count: 888, min: 0, max: 14, avg: 10.92)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 979
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.009s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 50
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 400
Number of deterministic Assumptions: 126
Level of Determinism: 32%
ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA: 0.000s
Replaced symbolic expressions: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.002s
Automaton transfers with branching: 0
Automaton transfer successors: 979 (count: 983, min: 0, max: 1, avg: 1.00) [0 x 4, 1 x 979]
CPA algorithm statistics
------------------------
Number of iterations: 894
Max size of waitlist: 14
Average size of waitlist: 3
Number of computed successors: 979
Max successors for one state: 2
Number of times merged: 89
Number of times stopped: 89
Number of times breaked: 0
Total time for CPA algorithm: 1.647s (Max: 1.450s)
Time for choose from waitlist: 0.002s
Time for precision adjustment: 0.071s
Time for transfer relation: 1.534s
Time for merge operator: 0.023s
Time for stop operator: 0.004s
Time for adding to reached set: 0.004s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 1.653s
Time for final sat check: 1.446s
Time for error path creation: 0.795s
Time for bounding assertions check: 0.247s
Time for induction formula creation: 22.662s
Time for induction check: 58.971s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 3 (300%)
Time for counterexample checks: 1.231s
Time for running CBMC: 1.120s
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.680s
Time for transition matches: 0.278s
Time for transition assertions: 0.000s
Time for transition actions: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 109234 (count: 109652, min: 0, max: 1, avg: 1.00) [0 x 418, 1 x 109234]
CPA algorithm statistics
------------------------
Number of iterations: 101265
Max size of waitlist: 572
Average size of waitlist: 83
Number of computed successors: 109234
Max successors for one state: 2
Number of times merged: 22803
Number of times stopped: 24800
Number of times breaked: 0
Total time for CPA algorithm: 84.897s (Max: 36.800s)
Time for choose from waitlist: 0.101s
Time for precision adjustment: 0.997s
Time for transfer relation: 16.478s
Time for merge operator: 61.998s
Time for stop operator: 4.038s
Time for adding to reached set: 0.443s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.526
Visited lines: 93
Total lines: 424
Line coverage: 0.219
Visited conditions: 93
Total conditions: 146
Condition coverage: 0.637
CPAchecker general statistics
-----------------------------
Number of program locations: 739
Number of CFA edges: 868
Number of relevant variables: 154
Number of functions: 38
Number of loops: 9
Size of reached set: 888
Number of reached locations: 316 (43%)
Avg states per location: 2
Max states per location: 5 (at node N443)
Number of reached functions: 20 (53%)
Number of partitions: 888
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 4
Time for analysis setup: 2.486s
Time for loading CPAs: 0.580s
Time for loading parser: 0.469s
Time for CFA construction: 1.362s
Time for parsing file(s): 0.341s
Time for AST to CFA: 0.459s
Time for CFA sanity check: 0.131s
Time for post-processing: 0.378s
Time for var class.: 0.228s
Time for CFA export: 0.520s
Time for Analysis: 89.039s
CPU time for analysis: 240.720s
Time for analyzing result: 0.001s
Total time for CPAchecker: 91.539s
Total CPU time for CPAchecker: 246.970s
Time for statistics: 1.889s
Time for Garbage Collector: 7.788s (in 90 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 573MB ( 546 MiB) max; 274MB ( 261 MiB) avg; 596MB ( 568 MiB) peak
Used non-heap memory: 55MB ( 52 MiB) max; 51MB ( 48 MiB) avg; 60MB ( 57 MiB) peak
Used in PS Old Gen pool: 166MB ( 159 MiB) max; 84MB ( 80 MiB) avg; 166MB ( 159 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 959MB ( 915 MiB) avg
Allocated non-heap memory: 57MB ( 54 MiB) max; 53MB ( 50 MiB) avg
Total process virtual memory: 8436MB ( 8045 MiB) max; 8066MB ( 7692 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product31_false-unreach-call_false-termination.cil/minepump_spec3_product31_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product31_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc