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