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_304 = 3; int INPUTS_at_304[3]; int input_at_304_counter = 0;int num_of_inputs_at_324 = 3; int INPUTS_at_324[3]; int input_at_324_counter = 0;int num_of_inputs_at_314 = 3; int INPUTS_at_314[3]; int input_at_314_counter = 0;int num_of_inputs_at_332 = 2; int INPUTS_at_332[2]; int input_at_332_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_304[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_324[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_314[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_332[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,"featureselect.i","") |
40 | int select_one(void) ; |
41 | void select_features(void) ; |
42 | void select_helpers(void) ; |
43 | int valid_product(void) ; |
44 | int select_one(void) |
45 | { int retValue_acc ; |
46 | int choice = __VERIFIER_nondet_int(); |
47 | |
48 | { |
49 | retValue_acc = choice; |
50 | return (retValue_acc); |
51 | return (retValue_acc); |
52 | } |
53 | } |
54 | void select_features(void) |
55 | { |
56 | |
57 | { |
58 | return; |
59 | } |
60 | } |
61 | void select_helpers(void) |
62 | { |
63 | |
64 | { |
65 | return; |
66 | } |
67 | } |
68 | int valid_product(void) |
69 | { int retValue_acc ; |
70 | |
71 | { |
72 | retValue_acc = 1; |
73 | return (retValue_acc); |
74 | return (retValue_acc); |
75 | } |
76 | } |
77 | #pragma merger(0,"MinePump.i","") |
78 | void lowerWaterLevel(void) ; |
79 | int isMethaneLevelCritical(void) ; |
80 | void printEnvironment(void) ; |
81 | int isLowWaterSensorDry(void) ; |
82 | void timeShift(void) ; |
83 | void activatePump(void) ; |
84 | void deactivatePump(void) ; |
85 | int isPumpRunning(void) ; |
86 | void printPump(void) ; |
87 | void stopSystem(void) ; |
88 | void startSystem(void) ; |
89 | int pumpRunning = 0; |
90 | int systemActive = 1; |
91 | void __utac_acc__Specification3_spec__1(void) ; |
92 | void processEnvironment(void) ; |
93 | void timeShift(void) |
94 | { |
95 | |
96 | { |
97 | if (pumpRunning != 0) { |
98 | { |
99 | lowerWaterLevel(); |
100 | } |
101 | } else { |
102 | |
103 | } |
104 | if (systemActive != 0) { |
105 | { |
106 | processEnvironment(); |
107 | } |
108 | } else { |
109 | |
110 | } |
111 | { |
112 | __utac_acc__Specification3_spec__1(); |
113 | } |
114 | return; |
115 | } |
116 | } |
117 | void processEnvironment__wrappee__base(void) |
118 | { |
119 | |
120 | { |
121 | return; |
122 | } |
123 | } |
124 | int isLowWaterLevel(void) ; |
125 | void processEnvironment(void) |
126 | { int tmp ; |
127 | |
128 | { |
129 | if (pumpRunning != 0) { |
130 | { |
131 | tmp = isLowWaterLevel(); |
132 | } |
133 | if (tmp != 0) { |
134 | { |
135 | deactivatePump(); |
136 | } |
137 | } else { |
138 | { |
139 | processEnvironment__wrappee__base(); |
140 | } |
141 | } |
142 | } else { |
143 | { |
144 | processEnvironment__wrappee__base(); |
145 | } |
146 | } |
147 | return; |
148 | } |
149 | } |
150 | void activatePump__wrappee__lowWaterSensor(void) |
151 | { |
152 | |
153 | { |
154 | pumpRunning = 1; |
155 | return; |
156 | } |
157 | } |
158 | int isMethaneAlarm(void) ; |
159 | void activatePump(void) |
160 | { int tmp ; |
161 | |
162 | { |
163 | { |
164 | tmp = isMethaneAlarm(); |
165 | } |
166 | if (tmp != 0) { |
167 | |
168 | } else { |
169 | { |
170 | activatePump__wrappee__lowWaterSensor(); |
171 | } |
172 | } |
173 | return; |
174 | } |
175 | } |
176 | void deactivatePump(void) |
177 | { |
178 | |
179 | { |
180 | pumpRunning = 0; |
181 | return; |
182 | } |
183 | } |
184 | int isMethaneAlarm(void) |
185 | { int retValue_acc ; |
186 | |
187 | { |
188 | { |
189 | retValue_acc = isMethaneLevelCritical(); |
190 | } |
191 | return (retValue_acc); |
192 | return (retValue_acc); |
193 | } |
194 | } |
195 | int isPumpRunning(void) |
196 | { int retValue_acc ; |
197 | |
198 | { |
199 | retValue_acc = pumpRunning; |
200 | return (retValue_acc); |
201 | return (retValue_acc); |
202 | } |
203 | } |
204 | void printPump(void) |
205 | { |
206 | |
207 | { |
208 | { |
209 | // printf("Pump(System:"); |
210 | } |
211 | if (systemActive != 0) { |
212 | { |
213 | // printf("On"); |
214 | } |
215 | } else { |
216 | { |
217 | // printf("Off"); |
218 | } |
219 | } |
220 | { |
221 | // printf(",Pump:"); |
222 | } |
223 | if (pumpRunning != 0) { |
224 | { |
225 | // printf("On"); |
226 | } |
227 | } else { |
228 | { |
229 | // printf("Off"); |
230 | } |
231 | } |
232 | { |
233 | // printf(") "); |
234 | printEnvironment(); |
235 | // printf("\n"); |
236 | } |
237 | return; |
238 | } |
239 | } |
240 | int isLowWaterLevel(void) |
241 | { int retValue_acc ; |
242 | int tmp ; |
243 | int tmp___0 ; |
244 | |
245 | { |
246 | { |
247 | tmp = isLowWaterSensorDry(); |
248 | } |
249 | if (tmp != 0) { |
250 | tmp___0 = 0; |
251 | } else { |
252 | tmp___0 = 1; |
253 | } |
254 | retValue_acc = tmp___0; |
255 | return (retValue_acc); |
256 | return (retValue_acc); |
257 | } |
258 | } |
259 | void stopSystem(void) |
260 | { |
261 | |
262 | { |
263 | if (pumpRunning != 0) { |
264 | { |
265 | deactivatePump(); |
266 | } |
267 | } else { |
268 | |
269 | } |
270 | systemActive = 0; |
271 | return; |
272 | } |
273 | } |
274 | void startSystem(void) |
275 | { |
276 | |
277 | { |
278 | systemActive = 1; |
279 | return; |
280 | } |
281 | } |
282 | #pragma merger(0,"scenario.i","") |
283 | void waterRise(void) ; |
284 | void changeMethaneLevel(void) ; |
285 | void cleanup(void) ; |
286 | void test(void) |
287 | { int splverifierCounter ; |
288 | int tmp ; |
289 | int tmp___0 ; |
290 | int tmp___1 ; |
291 | int tmp___2 ; |
292 | |
293 | { |
294 | splverifierCounter = 0; |
295 | { |
296 | while (1) { |
297 | while_0_continue: /* CIL Label */ ; |
298 | if (splverifierCounter < 4) { |
299 | |
300 | } else { |
301 | goto while_0_break; |
302 | } |
303 | { |
304 | tmp = (input_at_304_counter < num_of_inputs_at_304) ? INPUTS_at_304[input_at_304_counter++] : __VERIFIER_nondet_int() ; |
305 | } |
306 | if (tmp != 0) { |
307 | { |
308 | waterRise(); |
309 | } |
310 | } else { |
311 | |
312 | } |
313 | { |
314 | tmp___0 = (input_at_314_counter < num_of_inputs_at_314) ? INPUTS_at_314[input_at_314_counter++] : __VERIFIER_nondet_int() ; |
315 | } |
316 | if (tmp___0 != 0) { |
317 | { |
318 | changeMethaneLevel(); |
319 | } |
320 | } else { |
321 | |
322 | } |
323 | { |
324 | tmp___2 = (input_at_324_counter < num_of_inputs_at_324) ? INPUTS_at_324[input_at_324_counter++] : __VERIFIER_nondet_int() ; |
325 | } |
326 | if (tmp___2 != 0) { |
327 | { |
328 | startSystem(); |
329 | } |
330 | } else { |
331 | { |
332 | tmp___1 = (input_at_332_counter < num_of_inputs_at_332) ? INPUTS_at_332[input_at_332_counter++] : __VERIFIER_nondet_int() ; |
333 | } |
334 | if (tmp___1 != 0) { |
335 | { |
336 | stopSystem(); |
337 | } |
338 | } else { |
339 | |
340 | } |
341 | } |
342 | { |
343 | timeShift(); |
344 | } |
345 | } |
346 | while_0_break: /* CIL Label */ ; |
347 | } |
348 | { |
349 | cleanup(); |
350 | } |
351 | return; |
352 | } |
353 | } |
354 | #pragma merger(0,"Environment.i","") |
355 | int getWaterLevel(void) ; |
356 | int waterLevel = 1; |
357 | int methaneLevelCritical = 0; |
358 | void lowerWaterLevel(void) |
359 | { |
360 | |
361 | { |
362 | if (waterLevel > 0) { |
363 | waterLevel = waterLevel - 1; |
364 | } else { |
365 | |
366 | } |
367 | return; |
368 | } |
369 | } |
370 | void waterRise(void) |
371 | { |
372 | |
373 | { |
374 | if (waterLevel < 2) { |
375 | waterLevel = waterLevel + 1; |
376 | } else { |
377 | |
378 | } |
379 | return; |
380 | } |
381 | } |
382 | void changeMethaneLevel(void) |
383 | { |
384 | |
385 | { |
386 | if (methaneLevelCritical != 0) { |
387 | methaneLevelCritical = 0; |
388 | } else { |
389 | methaneLevelCritical = 1; |
390 | } |
391 | return; |
392 | } |
393 | } |
394 | int isMethaneLevelCritical(void) |
395 | { int retValue_acc ; |
396 | |
397 | { |
398 | retValue_acc = methaneLevelCritical; |
399 | return (retValue_acc); |
400 | return (retValue_acc); |
401 | } |
402 | } |
403 | void printEnvironment(void) |
404 | { |
405 | |
406 | { |
407 | { |
408 | // printf("Env(Water:%i", waterLevel); |
409 | // printf(",Meth:"); |
410 | } |
411 | if (methaneLevelCritical != 0) { |
412 | { |
413 | // printf("CRIT"); |
414 | } |
415 | } else { |
416 | { |
417 | // printf("OK"); |
418 | } |
419 | } |
420 | { |
421 | // printf(")"); |
422 | } |
423 | return; |
424 | } |
425 | } |
426 | int getWaterLevel(void) |
427 | { int retValue_acc ; |
428 | |
429 | { |
430 | retValue_acc = waterLevel; |
431 | return (retValue_acc); |
432 | return (retValue_acc); |
433 | } |
434 | } |
435 | int isLowWaterSensorDry(void) |
436 | { int retValue_acc ; |
437 | |
438 | { |
439 | retValue_acc = waterLevel == 0; |
440 | return (retValue_acc); |
441 | return (retValue_acc); |
442 | } |
443 | } |
444 | #pragma merger(0,"Test.i","") |
445 | int cleanupTimeShifts = 4; |
446 | void cleanup(void) |
447 | { int i ; |
448 | int __cil_tmp2 ; |
449 | |
450 | { |
451 | { |
452 | timeShift(); |
453 | i = 0; |
454 | } |
455 | { |
456 | while (1) { |
457 | while_1_continue: /* CIL Label */ ; |
458 | { |
459 | __cil_tmp2 = cleanupTimeShifts - 1; |
460 | if (i < __cil_tmp2) { |
461 | |
462 | } else { |
463 | goto while_1_break; |
464 | } |
465 | } |
466 | { |
467 | timeShift(); |
468 | i = i + 1; |
469 | } |
470 | } |
471 | while_1_break: /* CIL Label */ ; |
472 | } |
473 | return; |
474 | } |
475 | } |
476 | void Specification2(void) |
477 | { |
478 | |
479 | { |
480 | { |
481 | timeShift(); |
482 | printPump(); |
483 | timeShift(); |
484 | printPump(); |
485 | timeShift(); |
486 | printPump(); |
487 | waterRise(); |
488 | printPump(); |
489 | timeShift(); |
490 | printPump(); |
491 | changeMethaneLevel(); |
492 | printPump(); |
493 | timeShift(); |
494 | printPump(); |
495 | cleanup(); |
496 | } |
497 | return; |
498 | } |
499 | } |
500 | void setup(void) |
501 | { |
502 | |
503 | { |
504 | return; |
505 | } |
506 | } |
507 | void runTest(void) |
508 | { |
509 | |
510 | { |
511 | { |
512 | test(); |
513 | } |
514 | return; |
515 | } |
516 | } |
517 | int main(void) |
518 | {initialize_reads(); int retValue_acc ; |
519 | int tmp ; |
520 | |
521 | { |
522 | { |
523 | select_helpers(); |
524 | select_features(); |
525 | tmp = valid_product(); |
526 | } |
527 | if (tmp != 0) { |
528 | { |
529 | setup(); |
530 | runTest(); |
531 | } |
532 | } else { |
533 | |
534 | } |
535 | retValue_acc = 0; |
536 | return (retValue_acc); |
537 | return (retValue_acc); |
538 | } |
539 | } |
540 | #pragma merger(0,"wsllib_check.i","") |
541 | void __automaton_fail(void) |
542 | { |
543 | |
544 | { |
545 | __VERIFIER_assume(!((0 == INPUTS_at_314[0] && 0 == INPUTS_at_324[0])));__VERIFIER_assume(!((0 != INPUTS_at_314[0] && 0 == INPUTS_at_324[0])));__VERIFIER_assume(!((0 != INPUTS_at_324[1] && 0 != INPUTS_at_314[0])));__VERIFIER_assume(!((0 == INPUTS_at_332[1])));__VERIFIER_error(); |
546 | return; |
547 | } |
548 | } |
549 | #pragma merger(0,"Specification3_spec.i","") |
550 | void __utac_acc__Specification3_spec__1(void) |
551 | { int tmp ; |
552 | int tmp___0 ; |
553 | int tmp___1 ; |
554 | |
555 | { |
556 | { |
557 | tmp = isMethaneLevelCritical(); |
558 | } |
559 | if (tmp != 0) { |
560 | |
561 | } else { |
562 | { |
563 | tmp___0 = getWaterLevel(); |
564 | } |
565 | if (tmp___0 == 2) { |
566 | { |
567 | tmp___1 = isPumpRunning(); |
568 | } |
569 | if (tmp___1 != 0) { |
570 | |
571 | } else { |
572 | { |
573 | __automaton_fail(); |
574 | } |
575 | } |
576 | } else { |
577 | |
578 | } |
579 | } |
580 | return; |
581 | } |
582 | } |
583 | #pragma merger(0,"libacc.i","") |
584 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
585 | char const *__file , |
586 | unsigned int __line , |
587 | char const *__function ) ; |
588 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
589 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
590 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
591 | int ) , |
592 | int val ) |
593 | { struct __UTAC__EXCEPTION *excep ; |
594 | struct __UTAC__CFLOW_FUNC *cf ; |
595 | void *tmp ; |
596 | unsigned long __cil_tmp7 ; |
597 | unsigned long __cil_tmp8 ; |
598 | unsigned long __cil_tmp9 ; |
599 | unsigned long __cil_tmp10 ; |
600 | unsigned long __cil_tmp11 ; |
601 | unsigned long __cil_tmp12 ; |
602 | unsigned long __cil_tmp13 ; |
603 | unsigned long __cil_tmp14 ; |
604 | int (**mem_15)(int , int ) ; |
605 | int *mem_16 ; |
606 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
607 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
608 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
609 | |
610 | { |
611 | { |
612 | excep = (struct __UTAC__EXCEPTION *)exception; |
613 | tmp = malloc(24UL); |
614 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
615 | mem_15 = (int (**)(int , int ))cf; |
616 | *mem_15 = cflow_func; |
617 | __cil_tmp7 = (unsigned long )cf; |
618 | __cil_tmp8 = __cil_tmp7 + 8; |
619 | mem_16 = (int *)__cil_tmp8; |
620 | *mem_16 = val; |
621 | __cil_tmp9 = (unsigned long )cf; |
622 | __cil_tmp10 = __cil_tmp9 + 16; |
623 | __cil_tmp11 = (unsigned long )excep; |
624 | __cil_tmp12 = __cil_tmp11 + 24; |
625 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
626 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
627 | *mem_17 = *mem_18; |
628 | __cil_tmp13 = (unsigned long )excep; |
629 | __cil_tmp14 = __cil_tmp13 + 24; |
630 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
631 | *mem_19 = cf; |
632 | } |
633 | return; |
634 | } |
635 | } |
636 | void __utac__exception__cf_handler_free(void *exception ) |
637 | { struct __UTAC__EXCEPTION *excep ; |
638 | struct __UTAC__CFLOW_FUNC *cf ; |
639 | struct __UTAC__CFLOW_FUNC *tmp ; |
640 | unsigned long __cil_tmp5 ; |
641 | unsigned long __cil_tmp6 ; |
642 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
643 | unsigned long __cil_tmp8 ; |
644 | unsigned long __cil_tmp9 ; |
645 | unsigned long __cil_tmp10 ; |
646 | unsigned long __cil_tmp11 ; |
647 | void *__cil_tmp12 ; |
648 | unsigned long __cil_tmp13 ; |
649 | unsigned long __cil_tmp14 ; |
650 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
651 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
652 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
653 | |
654 | { |
655 | excep = (struct __UTAC__EXCEPTION *)exception; |
656 | __cil_tmp5 = (unsigned long )excep; |
657 | __cil_tmp6 = __cil_tmp5 + 24; |
658 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
659 | cf = *mem_15; |
660 | { |
661 | while (1) { |
662 | while_2_continue: /* CIL Label */ ; |
663 | { |
664 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
665 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
666 | __cil_tmp9 = (unsigned long )cf; |
667 | if (__cil_tmp9 != __cil_tmp8) { |
668 | |
669 | } else { |
670 | goto while_2_break; |
671 | } |
672 | } |
673 | { |
674 | tmp = cf; |
675 | __cil_tmp10 = (unsigned long )cf; |
676 | __cil_tmp11 = __cil_tmp10 + 16; |
677 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
678 | cf = *mem_16; |
679 | __cil_tmp12 = (void *)tmp; |
680 | free(__cil_tmp12); |
681 | } |
682 | } |
683 | while_2_break: /* CIL Label */ ; |
684 | } |
685 | __cil_tmp13 = (unsigned long )excep; |
686 | __cil_tmp14 = __cil_tmp13 + 24; |
687 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
688 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
689 | return; |
690 | } |
691 | } |
692 | void __utac__exception__cf_handler_reset(void *exception ) |
693 | { struct __UTAC__EXCEPTION *excep ; |
694 | struct __UTAC__CFLOW_FUNC *cf ; |
695 | unsigned long __cil_tmp5 ; |
696 | unsigned long __cil_tmp6 ; |
697 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
698 | unsigned long __cil_tmp8 ; |
699 | unsigned long __cil_tmp9 ; |
700 | int (*__cil_tmp10)(int , int ) ; |
701 | unsigned long __cil_tmp11 ; |
702 | unsigned long __cil_tmp12 ; |
703 | int __cil_tmp13 ; |
704 | unsigned long __cil_tmp14 ; |
705 | unsigned long __cil_tmp15 ; |
706 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
707 | int (**mem_17)(int , int ) ; |
708 | int *mem_18 ; |
709 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
710 | |
711 | { |
712 | excep = (struct __UTAC__EXCEPTION *)exception; |
713 | __cil_tmp5 = (unsigned long )excep; |
714 | __cil_tmp6 = __cil_tmp5 + 24; |
715 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
716 | cf = *mem_16; |
717 | { |
718 | while (1) { |
719 | while_3_continue: /* CIL Label */ ; |
720 | { |
721 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
722 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
723 | __cil_tmp9 = (unsigned long )cf; |
724 | if (__cil_tmp9 != __cil_tmp8) { |
725 | |
726 | } else { |
727 | goto while_3_break; |
728 | } |
729 | } |
730 | { |
731 | mem_17 = (int (**)(int , int ))cf; |
732 | __cil_tmp10 = *mem_17; |
733 | __cil_tmp11 = (unsigned long )cf; |
734 | __cil_tmp12 = __cil_tmp11 + 8; |
735 | mem_18 = (int *)__cil_tmp12; |
736 | __cil_tmp13 = *mem_18; |
737 | (*__cil_tmp10)(4, __cil_tmp13); |
738 | __cil_tmp14 = (unsigned long )cf; |
739 | __cil_tmp15 = __cil_tmp14 + 16; |
740 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
741 | cf = *mem_19; |
742 | } |
743 | } |
744 | while_3_break: /* CIL Label */ ; |
745 | } |
746 | { |
747 | __utac__exception__cf_handler_free(exception); |
748 | } |
749 | return; |
750 | } |
751 | } |
752 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
753 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
754 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
755 | { void *retValue_acc ; |
756 | struct __ACC__ERR *new ; |
757 | void *tmp ; |
758 | struct __ACC__ERR *temp ; |
759 | struct __ACC__ERR *next ; |
760 | void *excep ; |
761 | unsigned long __cil_tmp10 ; |
762 | unsigned long __cil_tmp11 ; |
763 | unsigned long __cil_tmp12 ; |
764 | unsigned long __cil_tmp13 ; |
765 | void *__cil_tmp14 ; |
766 | unsigned long __cil_tmp15 ; |
767 | unsigned long __cil_tmp16 ; |
768 | void *__cil_tmp17 ; |
769 | void **mem_18 ; |
770 | struct __ACC__ERR **mem_19 ; |
771 | struct __ACC__ERR **mem_20 ; |
772 | void **mem_21 ; |
773 | struct __ACC__ERR **mem_22 ; |
774 | void **mem_23 ; |
775 | void **mem_24 ; |
776 | |
777 | { |
778 | if (count == 0) { |
779 | return (retValue_acc); |
780 | } else { |
781 | |
782 | } |
783 | if (mode == 0) { |
784 | { |
785 | tmp = malloc(16UL); |
786 | new = (struct __ACC__ERR *)tmp; |
787 | mem_18 = (void **)new; |
788 | *mem_18 = env; |
789 | __cil_tmp10 = (unsigned long )new; |
790 | __cil_tmp11 = __cil_tmp10 + 8; |
791 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
792 | *mem_19 = head; |
793 | head = new; |
794 | retValue_acc = (void *)new; |
795 | } |
796 | return (retValue_acc); |
797 | } else { |
798 | |
799 | } |
800 | if (mode == 1) { |
801 | temp = head; |
802 | { |
803 | while (1) { |
804 | while_4_continue: /* CIL Label */ ; |
805 | if (count > 1) { |
806 | |
807 | } else { |
808 | goto while_4_break; |
809 | } |
810 | { |
811 | __cil_tmp12 = (unsigned long )temp; |
812 | __cil_tmp13 = __cil_tmp12 + 8; |
813 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
814 | next = *mem_20; |
815 | mem_21 = (void **)temp; |
816 | excep = *mem_21; |
817 | __cil_tmp14 = (void *)temp; |
818 | free(__cil_tmp14); |
819 | __utac__exception__cf_handler_reset(excep); |
820 | temp = next; |
821 | count = count - 1; |
822 | } |
823 | } |
824 | while_4_break: /* CIL Label */ ; |
825 | } |
826 | { |
827 | __cil_tmp15 = (unsigned long )temp; |
828 | __cil_tmp16 = __cil_tmp15 + 8; |
829 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
830 | head = *mem_22; |
831 | mem_23 = (void **)temp; |
832 | excep = *mem_23; |
833 | __cil_tmp17 = (void *)temp; |
834 | free(__cil_tmp17); |
835 | __utac__exception__cf_handler_reset(excep); |
836 | retValue_acc = excep; |
837 | } |
838 | return (retValue_acc); |
839 | } else { |
840 | |
841 | } |
842 | if (mode == 2) { |
843 | if (head != 0) { |
844 | mem_24 = (void **)head; |
845 | retValue_acc = *mem_24; |
846 | return (retValue_acc); |
847 | } else { |
848 | retValue_acc = (void *)0; |
849 | return (retValue_acc); |
850 | } |
851 | } else { |
852 | |
853 | } |
854 | return (retValue_acc); |
855 | } |
856 | } |
857 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
858 | { void *retValue_acc ; |
859 | unsigned long __cil_tmp4 ; |
860 | unsigned long __cil_tmp5 ; |
861 | int __cil_tmp6 ; |
862 | int __cil_tmp7 ; |
863 | unsigned long __cil_tmp8 ; |
864 | unsigned long __cil_tmp9 ; |
865 | void **__cil_tmp10 ; |
866 | void **__cil_tmp11 ; |
867 | int *mem_12 ; |
868 | void ***mem_13 ; |
869 | |
870 | { |
871 | if (i > 0) { |
872 | { |
873 | __cil_tmp4 = (unsigned long )this; |
874 | __cil_tmp5 = __cil_tmp4 + 16; |
875 | mem_12 = (int *)__cil_tmp5; |
876 | __cil_tmp6 = *mem_12; |
877 | if (i <= __cil_tmp6) { |
878 | |
879 | } else { |
880 | { |
881 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
882 | 123U, "__utac__get_this_arg"); |
883 | } |
884 | } |
885 | } |
886 | } else { |
887 | { |
888 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
889 | 123U, "__utac__get_this_arg"); |
890 | } |
891 | } |
892 | __cil_tmp7 = i - 1; |
893 | __cil_tmp8 = (unsigned long )this; |
894 | __cil_tmp9 = __cil_tmp8 + 8; |
895 | mem_13 = (void ***)__cil_tmp9; |
896 | __cil_tmp10 = *mem_13; |
897 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
898 | retValue_acc = *__cil_tmp11; |
899 | return (retValue_acc); |
900 | return (retValue_acc); |
901 | } |
902 | } |
903 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
904 | { char const *retValue_acc ; |
905 | unsigned long __cil_tmp4 ; |
906 | unsigned long __cil_tmp5 ; |
907 | int __cil_tmp6 ; |
908 | int __cil_tmp7 ; |
909 | unsigned long __cil_tmp8 ; |
910 | unsigned long __cil_tmp9 ; |
911 | char const **__cil_tmp10 ; |
912 | char const **__cil_tmp11 ; |
913 | int *mem_12 ; |
914 | char const ***mem_13 ; |
915 | |
916 | { |
917 | if (i > 0) { |
918 | { |
919 | __cil_tmp4 = (unsigned long )this; |
920 | __cil_tmp5 = __cil_tmp4 + 16; |
921 | mem_12 = (int *)__cil_tmp5; |
922 | __cil_tmp6 = *mem_12; |
923 | if (i <= __cil_tmp6) { |
924 | |
925 | } else { |
926 | { |
927 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
928 | 131U, "__utac__get_this_argtype"); |
929 | } |
930 | } |
931 | } |
932 | } else { |
933 | { |
934 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
935 | 131U, "__utac__get_this_argtype"); |
936 | } |
937 | } |
938 | __cil_tmp7 = i - 1; |
939 | __cil_tmp8 = (unsigned long )this; |
940 | __cil_tmp9 = __cil_tmp8 + 24; |
941 | mem_13 = (char const ***)__cil_tmp9; |
942 | __cil_tmp10 = *mem_13; |
943 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
944 | retValue_acc = *__cil_tmp11; |
945 | return (retValue_acc); |
946 | return (retValue_acc); |
947 | } |
948 | } |
2017-05-11 13:19:18:643 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:19:18:728 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 13:19:19:969 INFO CFACreationUtils.addEdgeToCFA line 51: Dead code detected: return (retValue_acc);
2017-05-11 13:19:19:973 INFO CFACreationUtils.addEdgeToCFA line 74: Dead code detected: return (retValue_acc);
2017-05-11 13:19:19:992 INFO CFACreationUtils.addEdgeToCFA line 192: Dead code detected: return (retValue_acc);
2017-05-11 13:19:19:995 INFO CFACreationUtils.addEdgeToCFA line 201: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:000 INFO CFACreationUtils.addEdgeToCFA line 256: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:039 INFO CFACreationUtils.addEdgeToCFA line 400: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:043 INFO CFACreationUtils.addEdgeToCFA line 432: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:045 INFO CFACreationUtils.addEdgeToCFA line 441: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:066 INFO CFACreationUtils.addEdgeToCFA line 537: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:133 INFO CFACreationUtils.addEdgeToCFA line 900: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:138 INFO CFACreationUtils.addEdgeToCFA line 946: Dead code detected: return (retValue_acc);
2017-05-11 13:19:20:264 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 737: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 13:19:21:238 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 13:19:21:301 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:19:21:327 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:19:21:515 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 13:19:22:205 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 13:19:22:316 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 13:19:22:405 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 13:19:22:674 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 13:19:22:677 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 13:19:22:688 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 13:19:22:698 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 13:19:23:016 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:19:24:523 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 13:19:24:527 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:24:528 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:24:958 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:19:25:011 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:19:25:630 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:19:26:612 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 13:19:26:613 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:26:614 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:28:468 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 13:19:28:469 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:28:469 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:29:512 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 13:19:29:518 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:29:518 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:30:528 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 13:19:30:528 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:30:529 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:32:098 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 13:19:32:118 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:32:118 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:33:784 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 2
2017-05-11 13:19:33:784 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:33:784 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:35:330 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 28
2017-05-11 13:19:35:331 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:35:332 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:37:293 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:19:39:032 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 13:19:39:033 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:19:39:062 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:19:39:063 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:19:39:084 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:19:40:145 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 13:19:40:156 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:40:156 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:19:44:078 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:19:47:847 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 13:19:47:848 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:19:47:854 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:19:47:855 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:19:47:877 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:19:52:730 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:19:53:184 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 34
2017-05-11 13:19:53:185 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:19:53:185 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:20:03:743 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 38
2017-05-11 13:20:03:744 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56ee9d67
2017-05-11 13:20:03:744 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:20:19:820 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 13:20:19:820 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:20:19:964 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:20:20:973 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 13:20:21:839 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:20:22:120 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:20:22:121 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:20:22:421 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:20:22:421 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:20:22:699 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:20:22:700 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:20:23:008 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:20:23:012 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 13:20:23:017 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 13:20:23:017 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: 114
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 294
Number of predicates discovered: 0
Time for post operator: 1.431s
Time for path formula creation: 1.428s
Time for strengthen operator: 0.026s
Time for prec operator: 0.004s
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.017s
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: 11545 (count: 740, min: 0, max: 22, avg: 15.60)
Number of global variables: 7922 (count: 740, min: 0, max: 14, avg: 10.71)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 799
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.051s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 42
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 256
Number of deterministic Assumptions: 102
Level of Determinism: 40%
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: 799 (count: 803, min: 0, max: 1, avg: 1.00) [0 x 4, 1 x 799]
CPA algorithm statistics
------------------------
Number of iterations: 746
Max size of waitlist: 7
Average size of waitlist: 2
Number of computed successors: 799
Max successors for one state: 2
Number of times merged: 57
Number of times stopped: 57
Number of times breaked: 0
Total time for CPA algorithm: 2.100s (Max: 1.924s)
Time for choose from waitlist: 0.002s
Time for precision adjustment: 0.123s
Time for transfer relation: 1.912s
Time for merge operator: 0.018s
Time for stop operator: 0.002s
Time for adding to reached set: 0.012s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 2.110s
Time for final sat check: 1.018s
Time for error path creation: 0.742s
Time for bounding assertions check: 0.488s
Time for induction formula creation: 21.496s
Time for induction check: 32.536s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 1.170s
Time for running CBMC: 1.079s
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.360s
Automaton transfers with branching: 0
Automaton transfer successors: 57107 (count: 57371, min: 0, max: 1, avg: 1.00) [0 x 264, 1 x 57107]
CPA algorithm statistics
------------------------
Number of iterations: 53941
Max size of waitlist: 209
Average size of waitlist: 69
Number of computed successors: 57107
Max successors for one state: 2
Number of times merged: 12706
Number of times stopped: 13849
Number of times breaked: 0
Total time for CPA algorithm: 59.182s (Max: 19.248s)
Time for choose from waitlist: 0.133s
Time for precision adjustment: 0.811s
Time for transfer relation: 9.607s
Time for merge operator: 44.723s
Time for stop operator: 3.076s
Time for adding to reached set: 0.251s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.526
Visited lines: 92
Total lines: 419
Line coverage: 0.220
Visited conditions: 60
Total conditions: 106
Condition coverage: 0.566
CPAchecker general statistics
-----------------------------
Number of program locations: 692
Number of CFA edges: 803
Number of relevant variables: 149
Number of functions: 38
Number of loops: 9
Size of reached set: 740
Number of reached locations: 279 (40%)
Avg states per location: 2
Max states per location: 5 (at node N166)
Number of reached functions: 20 (53%)
Number of partitions: 740
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 4
Time for analysis setup: 2.484s
Time for loading CPAs: 0.609s
Time for loading parser: 0.470s
Time for CFA construction: 1.333s
Time for parsing file(s): 0.350s
Time for AST to CFA: 0.445s
Time for CFA sanity check: 0.092s
Time for post-processing: 0.382s
Time for var class.: 0.222s
Time for CFA export: 0.516s
Time for Analysis: 61.776s
CPU time for analysis: 171.160s
Time for analyzing result: 0.000s
Total time for CPAchecker: 64.273s
Total CPU time for CPAchecker: 177.460s
Time for statistics: 1.699s
Time for Garbage Collector: 4.827s (in 57 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 498MB ( 475 MiB) max; 233MB ( 222 MiB) avg; 519MB ( 495 MiB) peak
Used non-heap memory: 53MB ( 51 MiB) max; 50MB ( 47 MiB) avg; 59MB ( 56 MiB) peak
Used in PS Old Gen pool: 87MB ( 83 MiB) max; 47MB ( 44 MiB) avg; 87MB ( 83 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 787MB ( 750 MiB) avg
Allocated non-heap memory: 55MB ( 53 MiB) max; 51MB ( 49 MiB) avg
Total process virtual memory: 8369MB ( 7981 MiB) max; 8088MB ( 7713 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product28_false-unreach-call_false-termination.cil/minepump_spec3_product28_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_product28_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