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