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