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