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