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_259 = 9; int INPUTS_at_259[9]; int input_at_259_counter = 0;int num_of_inputs_at_279 = 9; int INPUTS_at_279[9]; int input_at_279_counter = 0;int num_of_inputs_at_269 = 9; int INPUTS_at_269[9]; int input_at_269_counter = 0;int num_of_inputs_at_287 = 9; int INPUTS_at_287[9]; int input_at_287_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<9; instrumentation_index++) INPUTS_at_259[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<9; instrumentation_index++) INPUTS_at_279[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<9; instrumentation_index++) INPUTS_at_269[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<9; instrumentation_index++) INPUTS_at_287[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(void); |
4 | //extern int printf (__const char *__restrict __format, ...); |
5 | /* Generated by CIL v. 1.3.7 */ |
6 | /* print_CIL_Input is true */ |
7 | |
8 | struct JoinPoint { |
9 | void **(*fp)(struct JoinPoint * ) ; |
10 | void **args ; |
11 | int argsCount ; |
12 | char const **argsType ; |
13 | void *(*arg)(int , struct JoinPoint * ) ; |
14 | char const *(*argType)(int , struct JoinPoint * ) ; |
15 | void **retValue ; |
16 | char const *retType ; |
17 | char const *funcName ; |
18 | char const *targetName ; |
19 | char const *fileName ; |
20 | char const *kind ; |
21 | void *excep_return ; |
22 | }; |
23 | struct __UTAC__CFLOW_FUNC { |
24 | int (*func)(int , int ) ; |
25 | int val ; |
26 | struct __UTAC__CFLOW_FUNC *next ; |
27 | }; |
28 | struct __UTAC__EXCEPTION { |
29 | void *jumpbuf ; |
30 | unsigned long long prtValue ; |
31 | int pops ; |
32 | struct __UTAC__CFLOW_FUNC *cflowfuncs ; |
33 | }; |
34 | typedef unsigned int size_t; |
35 | struct __ACC__ERR { |
36 | void *v ; |
37 | struct __ACC__ERR *next ; |
38 | }; |
39 | #pragma merger(0,"wsllib_check.i","") |
40 | void __automaton_fail(void) |
41 | { |
42 | |
43 | { |
44 | __VERIFIER_assume(!((0 == INPUTS_at_269[0] && 0 != INPUTS_at_279[0])));__VERIFIER_assume(!((0 == INPUTS_at_279[0] && 0 == INPUTS_at_269[0])));__VERIFIER_assume(!((0 == INPUTS_at_259[1] && 0 != INPUTS_at_279[1] && 0 != INPUTS_at_269[0])));__VERIFIER_assume(!((0 == INPUTS_at_269[0] && 0 == INPUTS_at_287[0] && 0 != INPUTS_at_279[0])));__VERIFIER_assume(!((0 == INPUTS_at_269[0] && 0 == INPUTS_at_287[0] && 0 == INPUTS_at_279[0])));__VERIFIER_assume(!((0 == INPUTS_at_259[0] && 0 != INPUTS_at_287[0] && 0 == INPUTS_at_279[0])));__VERIFIER_assume(!((0 != INPUTS_at_287[0] && 0 == INPUTS_at_279[0])));__VERIFIER_assume(!((0 != INPUTS_at_287[0] && 0 != INPUTS_at_279[0])));__VERIFIER_assume(!((0 == INPUTS_at_279[0])));__VERIFIER_error(); |
45 | return; |
46 | } |
47 | } |
48 | #pragma merger(0,"featureselect.i","") |
49 | int select_one(void) ; |
50 | void select_features(void) ; |
51 | void select_helpers(void) ; |
52 | int valid_product(void) ; |
53 | int select_one(void) |
54 | { int retValue_acc ; |
55 | int choice = __VERIFIER_nondet_int(); |
56 | |
57 | { |
58 | retValue_acc = choice; |
59 | return (retValue_acc); |
60 | return (retValue_acc); |
61 | } |
62 | } |
63 | void select_features(void) |
64 | { |
65 | |
66 | { |
67 | return; |
68 | } |
69 | } |
70 | void select_helpers(void) |
71 | { |
72 | |
73 | { |
74 | return; |
75 | } |
76 | } |
77 | int valid_product(void) |
78 | { int retValue_acc ; |
79 | |
80 | { |
81 | retValue_acc = 1; |
82 | return (retValue_acc); |
83 | return (retValue_acc); |
84 | } |
85 | } |
86 | #pragma merger(0,"MinePump.i","") |
87 | void lowerWaterLevel(void) ; |
88 | int isMethaneLevelCritical(void) ; |
89 | void printEnvironment(void) ; |
90 | void timeShift(void) ; |
91 | void activatePump(void) ; |
92 | void deactivatePump(void) ; |
93 | int isPumpRunning(void) ; |
94 | void printPump(void) ; |
95 | void startSystem(void) ; |
96 | int pumpRunning = 0; |
97 | int systemActive = 1; |
98 | void __utac_acc__Specification3_spec__1(void) ; |
99 | void processEnvironment(void) ; |
100 | void timeShift(void) |
101 | { |
102 | |
103 | { |
104 | if (pumpRunning != 0) { |
105 | { |
106 | lowerWaterLevel(); |
107 | } |
108 | } else { |
109 | |
110 | } |
111 | if (systemActive != 0) { |
112 | { |
113 | processEnvironment(); |
114 | } |
115 | } else { |
116 | |
117 | } |
118 | { |
119 | __utac_acc__Specification3_spec__1(); |
120 | } |
121 | return; |
122 | } |
123 | } |
124 | void processEnvironment__wrappee__base(void) |
125 | { |
126 | |
127 | { |
128 | return; |
129 | } |
130 | } |
131 | int isMethaneAlarm(void) ; |
132 | void processEnvironment(void) |
133 | { int tmp ; |
134 | |
135 | { |
136 | if (pumpRunning != 0) { |
137 | { |
138 | tmp = isMethaneAlarm(); |
139 | } |
140 | if (tmp != 0) { |
141 | { |
142 | deactivatePump(); |
143 | } |
144 | } else { |
145 | { |
146 | processEnvironment__wrappee__base(); |
147 | } |
148 | } |
149 | } else { |
150 | { |
151 | processEnvironment__wrappee__base(); |
152 | } |
153 | } |
154 | return; |
155 | } |
156 | } |
157 | void activatePump(void) |
158 | { |
159 | |
160 | { |
161 | pumpRunning = 1; |
162 | return; |
163 | } |
164 | } |
165 | void deactivatePump(void) |
166 | { |
167 | |
168 | { |
169 | pumpRunning = 0; |
170 | return; |
171 | } |
172 | } |
173 | int isMethaneAlarm(void) |
174 | { int retValue_acc ; |
175 | |
176 | { |
177 | { |
178 | retValue_acc = isMethaneLevelCritical(); |
179 | } |
180 | return (retValue_acc); |
181 | return (retValue_acc); |
182 | } |
183 | } |
184 | int isPumpRunning(void) |
185 | { int retValue_acc ; |
186 | |
187 | { |
188 | retValue_acc = pumpRunning; |
189 | return (retValue_acc); |
190 | return (retValue_acc); |
191 | } |
192 | } |
193 | void printPump(void) |
194 | { |
195 | |
196 | { |
197 | { |
198 | // printf("Pump(System:"); |
199 | } |
200 | if (systemActive != 0) { |
201 | { |
202 | // printf("On"); |
203 | } |
204 | } else { |
205 | { |
206 | // printf("Off"); |
207 | } |
208 | } |
209 | { |
210 | // printf(",Pump:"); |
211 | } |
212 | if (pumpRunning != 0) { |
213 | { |
214 | // printf("On"); |
215 | } |
216 | } else { |
217 | { |
218 | // printf("Off"); |
219 | } |
220 | } |
221 | { |
222 | // printf(") "); |
223 | printEnvironment(); |
224 | // printf("\n"); |
225 | } |
226 | return; |
227 | } |
228 | } |
229 | void startSystem(void) |
230 | { |
231 | |
232 | { |
233 | systemActive = 1; |
234 | return; |
235 | } |
236 | } |
237 | #pragma merger(0,"scenario.i","") |
238 | void waterRise(void) ; |
239 | void changeMethaneLevel(void) ; |
240 | void cleanup(void) ; |
241 | void test(void) |
242 | { int splverifierCounter ; |
243 | int tmp ; |
244 | int tmp___0 ; |
245 | int tmp___1 ; |
246 | int tmp___2 ; |
247 | |
248 | { |
249 | splverifierCounter = 0; |
250 | { |
251 | while (1) { |
252 | while_0_continue: /* CIL Label */ ; |
253 | if (splverifierCounter < 4) { |
254 | |
255 | } else { |
256 | goto while_0_break; |
257 | } |
258 | { |
259 | tmp = (input_at_259_counter < num_of_inputs_at_259) ? INPUTS_at_259[input_at_259_counter++] : __VERIFIER_nondet_int() ; |
260 | } |
261 | if (tmp != 0) { |
262 | { |
263 | waterRise(); |
264 | } |
265 | } else { |
266 | |
267 | } |
268 | { |
269 | tmp___0 = (input_at_269_counter < num_of_inputs_at_269) ? INPUTS_at_269[input_at_269_counter++] : __VERIFIER_nondet_int() ; |
270 | } |
271 | if (tmp___0 != 0) { |
272 | { |
273 | changeMethaneLevel(); |
274 | } |
275 | } else { |
276 | |
277 | } |
278 | { |
279 | tmp___2 = (input_at_279_counter < num_of_inputs_at_279) ? INPUTS_at_279[input_at_279_counter++] : __VERIFIER_nondet_int() ; |
280 | } |
281 | if (tmp___2 != 0) { |
282 | { |
283 | startSystem(); |
284 | } |
285 | } else { |
286 | { |
287 | tmp___1 = (input_at_287_counter < num_of_inputs_at_287) ? INPUTS_at_287[input_at_287_counter++] : __VERIFIER_nondet_int() ; |
288 | } |
289 | if (tmp___1 != 0) { |
290 | |
291 | } else { |
292 | |
293 | } |
294 | } |
295 | { |
296 | timeShift(); |
297 | } |
298 | } |
299 | while_0_break: /* CIL Label */ ; |
300 | } |
301 | { |
302 | cleanup(); |
303 | } |
304 | return; |
305 | } |
306 | } |
307 | #pragma merger(0,"Environment.i","") |
308 | int getWaterLevel(void) ; |
309 | int waterLevel = 1; |
310 | int methaneLevelCritical = 0; |
311 | void lowerWaterLevel(void) |
312 | { |
313 | |
314 | { |
315 | if (waterLevel > 0) { |
316 | waterLevel = waterLevel - 1; |
317 | } else { |
318 | |
319 | } |
320 | return; |
321 | } |
322 | } |
323 | void waterRise(void) |
324 | { |
325 | |
326 | { |
327 | if (waterLevel < 2) { |
328 | waterLevel = waterLevel + 1; |
329 | } else { |
330 | |
331 | } |
332 | return; |
333 | } |
334 | } |
335 | void changeMethaneLevel(void) |
336 | { |
337 | |
338 | { |
339 | if (methaneLevelCritical != 0) { |
340 | methaneLevelCritical = 0; |
341 | } else { |
342 | methaneLevelCritical = 1; |
343 | } |
344 | return; |
345 | } |
346 | } |
347 | int isMethaneLevelCritical(void) |
348 | { int retValue_acc ; |
349 | |
350 | { |
351 | retValue_acc = methaneLevelCritical; |
352 | return (retValue_acc); |
353 | return (retValue_acc); |
354 | } |
355 | } |
356 | void printEnvironment(void) |
357 | { |
358 | |
359 | { |
360 | { |
361 | // printf("Env(Water:%i", waterLevel); |
362 | // printf(",Meth:"); |
363 | } |
364 | if (methaneLevelCritical != 0) { |
365 | { |
366 | // printf("CRIT"); |
367 | } |
368 | } else { |
369 | { |
370 | // printf("OK"); |
371 | } |
372 | } |
373 | { |
374 | // printf(")"); |
375 | } |
376 | return; |
377 | } |
378 | } |
379 | int getWaterLevel(void) |
380 | { int retValue_acc ; |
381 | |
382 | { |
383 | retValue_acc = waterLevel; |
384 | return (retValue_acc); |
385 | return (retValue_acc); |
386 | } |
387 | } |
388 | #pragma merger(0,"Test.i","") |
389 | int cleanupTimeShifts = 4; |
390 | void cleanup(void) |
391 | { int i ; |
392 | int __cil_tmp2 ; |
393 | |
394 | { |
395 | { |
396 | timeShift(); |
397 | i = 0; |
398 | } |
399 | { |
400 | while (1) { |
401 | while_1_continue: /* CIL Label */ ; |
402 | { |
403 | __cil_tmp2 = cleanupTimeShifts - 1; |
404 | if (i < __cil_tmp2) { |
405 | |
406 | } else { |
407 | goto while_1_break; |
408 | } |
409 | } |
410 | { |
411 | timeShift(); |
412 | i = i + 1; |
413 | } |
414 | } |
415 | while_1_break: /* CIL Label */ ; |
416 | } |
417 | return; |
418 | } |
419 | } |
420 | void Specification2(void) |
421 | { |
422 | |
423 | { |
424 | { |
425 | timeShift(); |
426 | printPump(); |
427 | timeShift(); |
428 | printPump(); |
429 | timeShift(); |
430 | printPump(); |
431 | waterRise(); |
432 | printPump(); |
433 | timeShift(); |
434 | printPump(); |
435 | changeMethaneLevel(); |
436 | printPump(); |
437 | timeShift(); |
438 | printPump(); |
439 | cleanup(); |
440 | } |
441 | return; |
442 | } |
443 | } |
444 | void setup(void) |
445 | { |
446 | |
447 | { |
448 | return; |
449 | } |
450 | } |
451 | void runTest(void) |
452 | { |
453 | |
454 | { |
455 | { |
456 | test(); |
457 | } |
458 | return; |
459 | } |
460 | } |
461 | int main(void) |
462 | {initialize_reads(); int retValue_acc ; |
463 | int tmp ; |
464 | |
465 | { |
466 | { |
467 | select_helpers(); |
468 | select_features(); |
469 | tmp = valid_product(); |
470 | } |
471 | if (tmp != 0) { |
472 | { |
473 | setup(); |
474 | runTest(); |
475 | } |
476 | } else { |
477 | |
478 | } |
479 | retValue_acc = 0; |
480 | return (retValue_acc); |
481 | return (retValue_acc); |
482 | } |
483 | } |
484 | #pragma merger(0,"libacc.i","") |
485 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
486 | char const *__file , |
487 | unsigned int __line , |
488 | char const *__function ) ; |
489 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
490 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
491 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
492 | int ) , |
493 | int val ) |
494 | { struct __UTAC__EXCEPTION *excep ; |
495 | struct __UTAC__CFLOW_FUNC *cf ; |
496 | void *tmp ; |
497 | unsigned long __cil_tmp7 ; |
498 | unsigned long __cil_tmp8 ; |
499 | unsigned long __cil_tmp9 ; |
500 | unsigned long __cil_tmp10 ; |
501 | unsigned long __cil_tmp11 ; |
502 | unsigned long __cil_tmp12 ; |
503 | unsigned long __cil_tmp13 ; |
504 | unsigned long __cil_tmp14 ; |
505 | int (**mem_15)(int , int ) ; |
506 | int *mem_16 ; |
507 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
508 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
509 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
510 | |
511 | { |
512 | { |
513 | excep = (struct __UTAC__EXCEPTION *)exception; |
514 | tmp = malloc(24UL); |
515 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
516 | mem_15 = (int (**)(int , int ))cf; |
517 | *mem_15 = cflow_func; |
518 | __cil_tmp7 = (unsigned long )cf; |
519 | __cil_tmp8 = __cil_tmp7 + 8; |
520 | mem_16 = (int *)__cil_tmp8; |
521 | *mem_16 = val; |
522 | __cil_tmp9 = (unsigned long )cf; |
523 | __cil_tmp10 = __cil_tmp9 + 16; |
524 | __cil_tmp11 = (unsigned long )excep; |
525 | __cil_tmp12 = __cil_tmp11 + 24; |
526 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
527 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
528 | *mem_17 = *mem_18; |
529 | __cil_tmp13 = (unsigned long )excep; |
530 | __cil_tmp14 = __cil_tmp13 + 24; |
531 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
532 | *mem_19 = cf; |
533 | } |
534 | return; |
535 | } |
536 | } |
537 | void __utac__exception__cf_handler_free(void *exception ) |
538 | { struct __UTAC__EXCEPTION *excep ; |
539 | struct __UTAC__CFLOW_FUNC *cf ; |
540 | struct __UTAC__CFLOW_FUNC *tmp ; |
541 | unsigned long __cil_tmp5 ; |
542 | unsigned long __cil_tmp6 ; |
543 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
544 | unsigned long __cil_tmp8 ; |
545 | unsigned long __cil_tmp9 ; |
546 | unsigned long __cil_tmp10 ; |
547 | unsigned long __cil_tmp11 ; |
548 | void *__cil_tmp12 ; |
549 | unsigned long __cil_tmp13 ; |
550 | unsigned long __cil_tmp14 ; |
551 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
552 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
553 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
554 | |
555 | { |
556 | excep = (struct __UTAC__EXCEPTION *)exception; |
557 | __cil_tmp5 = (unsigned long )excep; |
558 | __cil_tmp6 = __cil_tmp5 + 24; |
559 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
560 | cf = *mem_15; |
561 | { |
562 | while (1) { |
563 | while_2_continue: /* CIL Label */ ; |
564 | { |
565 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
566 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
567 | __cil_tmp9 = (unsigned long )cf; |
568 | if (__cil_tmp9 != __cil_tmp8) { |
569 | |
570 | } else { |
571 | goto while_2_break; |
572 | } |
573 | } |
574 | { |
575 | tmp = cf; |
576 | __cil_tmp10 = (unsigned long )cf; |
577 | __cil_tmp11 = __cil_tmp10 + 16; |
578 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
579 | cf = *mem_16; |
580 | __cil_tmp12 = (void *)tmp; |
581 | free(__cil_tmp12); |
582 | } |
583 | } |
584 | while_2_break: /* CIL Label */ ; |
585 | } |
586 | __cil_tmp13 = (unsigned long )excep; |
587 | __cil_tmp14 = __cil_tmp13 + 24; |
588 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
589 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
590 | return; |
591 | } |
592 | } |
593 | void __utac__exception__cf_handler_reset(void *exception ) |
594 | { struct __UTAC__EXCEPTION *excep ; |
595 | struct __UTAC__CFLOW_FUNC *cf ; |
596 | unsigned long __cil_tmp5 ; |
597 | unsigned long __cil_tmp6 ; |
598 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
599 | unsigned long __cil_tmp8 ; |
600 | unsigned long __cil_tmp9 ; |
601 | int (*__cil_tmp10)(int , int ) ; |
602 | unsigned long __cil_tmp11 ; |
603 | unsigned long __cil_tmp12 ; |
604 | int __cil_tmp13 ; |
605 | unsigned long __cil_tmp14 ; |
606 | unsigned long __cil_tmp15 ; |
607 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
608 | int (**mem_17)(int , int ) ; |
609 | int *mem_18 ; |
610 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
611 | |
612 | { |
613 | excep = (struct __UTAC__EXCEPTION *)exception; |
614 | __cil_tmp5 = (unsigned long )excep; |
615 | __cil_tmp6 = __cil_tmp5 + 24; |
616 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
617 | cf = *mem_16; |
618 | { |
619 | while (1) { |
620 | while_3_continue: /* CIL Label */ ; |
621 | { |
622 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
623 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
624 | __cil_tmp9 = (unsigned long )cf; |
625 | if (__cil_tmp9 != __cil_tmp8) { |
626 | |
627 | } else { |
628 | goto while_3_break; |
629 | } |
630 | } |
631 | { |
632 | mem_17 = (int (**)(int , int ))cf; |
633 | __cil_tmp10 = *mem_17; |
634 | __cil_tmp11 = (unsigned long )cf; |
635 | __cil_tmp12 = __cil_tmp11 + 8; |
636 | mem_18 = (int *)__cil_tmp12; |
637 | __cil_tmp13 = *mem_18; |
638 | (*__cil_tmp10)(4, __cil_tmp13); |
639 | __cil_tmp14 = (unsigned long )cf; |
640 | __cil_tmp15 = __cil_tmp14 + 16; |
641 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
642 | cf = *mem_19; |
643 | } |
644 | } |
645 | while_3_break: /* CIL Label */ ; |
646 | } |
647 | { |
648 | __utac__exception__cf_handler_free(exception); |
649 | } |
650 | return; |
651 | } |
652 | } |
653 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
654 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
655 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
656 | { void *retValue_acc ; |
657 | struct __ACC__ERR *new ; |
658 | void *tmp ; |
659 | struct __ACC__ERR *temp ; |
660 | struct __ACC__ERR *next ; |
661 | void *excep ; |
662 | unsigned long __cil_tmp10 ; |
663 | unsigned long __cil_tmp11 ; |
664 | unsigned long __cil_tmp12 ; |
665 | unsigned long __cil_tmp13 ; |
666 | void *__cil_tmp14 ; |
667 | unsigned long __cil_tmp15 ; |
668 | unsigned long __cil_tmp16 ; |
669 | void *__cil_tmp17 ; |
670 | void **mem_18 ; |
671 | struct __ACC__ERR **mem_19 ; |
672 | struct __ACC__ERR **mem_20 ; |
673 | void **mem_21 ; |
674 | struct __ACC__ERR **mem_22 ; |
675 | void **mem_23 ; |
676 | void **mem_24 ; |
677 | |
678 | { |
679 | if (count == 0) { |
680 | return (retValue_acc); |
681 | } else { |
682 | |
683 | } |
684 | if (mode == 0) { |
685 | { |
686 | tmp = malloc(16UL); |
687 | new = (struct __ACC__ERR *)tmp; |
688 | mem_18 = (void **)new; |
689 | *mem_18 = env; |
690 | __cil_tmp10 = (unsigned long )new; |
691 | __cil_tmp11 = __cil_tmp10 + 8; |
692 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
693 | *mem_19 = head; |
694 | head = new; |
695 | retValue_acc = (void *)new; |
696 | } |
697 | return (retValue_acc); |
698 | } else { |
699 | |
700 | } |
701 | if (mode == 1) { |
702 | temp = head; |
703 | { |
704 | while (1) { |
705 | while_4_continue: /* CIL Label */ ; |
706 | if (count > 1) { |
707 | |
708 | } else { |
709 | goto while_4_break; |
710 | } |
711 | { |
712 | __cil_tmp12 = (unsigned long )temp; |
713 | __cil_tmp13 = __cil_tmp12 + 8; |
714 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
715 | next = *mem_20; |
716 | mem_21 = (void **)temp; |
717 | excep = *mem_21; |
718 | __cil_tmp14 = (void *)temp; |
719 | free(__cil_tmp14); |
720 | __utac__exception__cf_handler_reset(excep); |
721 | temp = next; |
722 | count = count - 1; |
723 | } |
724 | } |
725 | while_4_break: /* CIL Label */ ; |
726 | } |
727 | { |
728 | __cil_tmp15 = (unsigned long )temp; |
729 | __cil_tmp16 = __cil_tmp15 + 8; |
730 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
731 | head = *mem_22; |
732 | mem_23 = (void **)temp; |
733 | excep = *mem_23; |
734 | __cil_tmp17 = (void *)temp; |
735 | free(__cil_tmp17); |
736 | __utac__exception__cf_handler_reset(excep); |
737 | retValue_acc = excep; |
738 | } |
739 | return (retValue_acc); |
740 | } else { |
741 | |
742 | } |
743 | if (mode == 2) { |
744 | if (head != 0) { |
745 | mem_24 = (void **)head; |
746 | retValue_acc = *mem_24; |
747 | return (retValue_acc); |
748 | } else { |
749 | retValue_acc = (void *)0; |
750 | return (retValue_acc); |
751 | } |
752 | } else { |
753 | |
754 | } |
755 | return (retValue_acc); |
756 | } |
757 | } |
758 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
759 | { void *retValue_acc ; |
760 | unsigned long __cil_tmp4 ; |
761 | unsigned long __cil_tmp5 ; |
762 | int __cil_tmp6 ; |
763 | int __cil_tmp7 ; |
764 | unsigned long __cil_tmp8 ; |
765 | unsigned long __cil_tmp9 ; |
766 | void **__cil_tmp10 ; |
767 | void **__cil_tmp11 ; |
768 | int *mem_12 ; |
769 | void ***mem_13 ; |
770 | |
771 | { |
772 | if (i > 0) { |
773 | { |
774 | __cil_tmp4 = (unsigned long )this; |
775 | __cil_tmp5 = __cil_tmp4 + 16; |
776 | mem_12 = (int *)__cil_tmp5; |
777 | __cil_tmp6 = *mem_12; |
778 | if (i <= __cil_tmp6) { |
779 | |
780 | } else { |
781 | { |
782 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
783 | 123U, "__utac__get_this_arg"); |
784 | } |
785 | } |
786 | } |
787 | } else { |
788 | { |
789 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
790 | 123U, "__utac__get_this_arg"); |
791 | } |
792 | } |
793 | __cil_tmp7 = i - 1; |
794 | __cil_tmp8 = (unsigned long )this; |
795 | __cil_tmp9 = __cil_tmp8 + 8; |
796 | mem_13 = (void ***)__cil_tmp9; |
797 | __cil_tmp10 = *mem_13; |
798 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
799 | retValue_acc = *__cil_tmp11; |
800 | return (retValue_acc); |
801 | return (retValue_acc); |
802 | } |
803 | } |
804 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
805 | { char const *retValue_acc ; |
806 | unsigned long __cil_tmp4 ; |
807 | unsigned long __cil_tmp5 ; |
808 | int __cil_tmp6 ; |
809 | int __cil_tmp7 ; |
810 | unsigned long __cil_tmp8 ; |
811 | unsigned long __cil_tmp9 ; |
812 | char const **__cil_tmp10 ; |
813 | char const **__cil_tmp11 ; |
814 | int *mem_12 ; |
815 | char const ***mem_13 ; |
816 | |
817 | { |
818 | if (i > 0) { |
819 | { |
820 | __cil_tmp4 = (unsigned long )this; |
821 | __cil_tmp5 = __cil_tmp4 + 16; |
822 | mem_12 = (int *)__cil_tmp5; |
823 | __cil_tmp6 = *mem_12; |
824 | if (i <= __cil_tmp6) { |
825 | |
826 | } else { |
827 | { |
828 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
829 | 131U, "__utac__get_this_argtype"); |
830 | } |
831 | } |
832 | } |
833 | } else { |
834 | { |
835 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
836 | 131U, "__utac__get_this_argtype"); |
837 | } |
838 | } |
839 | __cil_tmp7 = i - 1; |
840 | __cil_tmp8 = (unsigned long )this; |
841 | __cil_tmp9 = __cil_tmp8 + 24; |
842 | mem_13 = (char const ***)__cil_tmp9; |
843 | __cil_tmp10 = *mem_13; |
844 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
845 | retValue_acc = *__cil_tmp11; |
846 | return (retValue_acc); |
847 | return (retValue_acc); |
848 | } |
849 | } |
850 | #pragma merger(0,"Specification3_spec.i","") |
851 | void __utac_acc__Specification3_spec__1(void) |
852 | { int tmp ; |
853 | int tmp___0 ; |
854 | int tmp___1 ; |
855 | |
856 | { |
857 | { |
858 | tmp = isMethaneLevelCritical(); |
859 | } |
860 | if (tmp != 0) { |
861 | |
862 | } else { |
863 | { |
864 | tmp___0 = getWaterLevel(); |
865 | } |
866 | if (tmp___0 == 2) { |
867 | { |
868 | tmp___1 = isPumpRunning(); |
869 | } |
870 | if (tmp___1 != 0) { |
871 | |
872 | } else { |
873 | { |
874 | __automaton_fail(); |
875 | } |
876 | } |
877 | } else { |
878 | |
879 | } |
880 | } |
881 | return; |
882 | } |
883 | } |
2017-05-11 15:54:46:888 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 15:54:47:028 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 15:54:48:786 INFO CFACreationUtils.addEdgeToCFA line 60: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:789 INFO CFACreationUtils.addEdgeToCFA line 83: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:798 INFO CFACreationUtils.addEdgeToCFA line 181: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:800 INFO CFACreationUtils.addEdgeToCFA line 190: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:844 INFO CFACreationUtils.addEdgeToCFA line 353: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:849 INFO CFACreationUtils.addEdgeToCFA line 385: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:876 INFO CFACreationUtils.addEdgeToCFA line 481: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:952 INFO CFACreationUtils.addEdgeToCFA line 801: Dead code detected: return (retValue_acc);
2017-05-11 15:54:48:965 INFO CFACreationUtils.addEdgeToCFA line 847: Dead code detected: return (retValue_acc);
2017-05-11 15:54:49:124 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 638: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 15:54:51:358 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 15:54:51:472 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 15:54:51:544 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 15:54:51:883 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 15:54:52:609 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 15:54:52:778 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 15:54:53:011 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 15:54:53:419 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 15:54:53:422 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 15:54:53:437 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 15:54:53:485 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 15:54:54:002 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:54:58:011 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 15:54:58:012 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:54:58:012 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:54:58:838 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:54:58:892 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:54:59:507 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:55:00:953 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 15:55:00:954 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:00:954 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:04:004 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 3
2017-05-11 15:55:04:005 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:04:005 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:06:287 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 5
2017-05-11 15:55:06:288 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:06:288 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:08:060 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 9
2017-05-11 15:55:08:075 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:08:080 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:09:400 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 17
2017-05-11 15:55:09:402 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:09:402 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:10:969 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 21
2017-05-11 15:55:10:969 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:10:969 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:12:415 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 15:55:12:429 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:12:429 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:13:372 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 29
2017-05-11 15:55:13:372 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:13:373 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:16:561 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 33
2017-05-11 15:55:16:562 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:16:602 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:20:320 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 35
2017-05-11 15:55:20:331 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:20:331 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:21:240 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:55:26:833 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 15:55:26:835 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:55:26:848 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:55:26:854 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:55:26:948 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:55:28:277 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 36
2017-05-11 15:55:28:289 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:28:291 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:34:999 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:55:36:940 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 37
2017-05-11 15:55:36:941 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:36:941 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:42:555 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 39
2017-05-11 15:55:42:555 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:42:556 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:48:925 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 40
2017-05-11 15:55:48:926 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:48:926 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:55:54:317 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 42
2017-05-11 15:55:54:318 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:55:54:318 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:56:00:007 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 43
2017-05-11 15:56:00:008 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:56:00:008 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:56:05:256 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 45
2017-05-11 15:56:05:259 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:56:05:259 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:56:13:770 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 15:56:13:771 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:56:13:782 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:56:13:783 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:56:13:849 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 46
2017-05-11 15:56:13:849 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:56:13:849 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:56:13:890 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:56:18:984 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:56:22:711 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 47
2017-05-11 15:56:22:712 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:56:22:712 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:56:31:986 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 15:56:31:987 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:56:32:000 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:56:32:001 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:56:32:135 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:56:37:167 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:56:41:169 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 48
2017-05-11 15:56:41:169 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:56:41:169 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:56:58:227 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 50
2017-05-11 15:56:58:227 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:56:58:227 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:57:15:440 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 51
2017-05-11 15:57:15:440 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:57:15:441 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:57:31:691 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 5
2017-05-11 15:57:31:694 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:57:31:703 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:57:31:704 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:57:31:855 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:57:33:138 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 52
2017-05-11 15:57:33:139 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:57:33:140 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:57:40:194 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:57:51:023 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 53
2017-05-11 15:57:51:023 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:57:51:023 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:08:791 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 55
2017-05-11 15:58:08:799 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:58:08:799 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:22:971 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 6
2017-05-11 15:58:22:972 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:58:22:982 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:58:22:983 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:58:23:175 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:58:27:138 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 56
2017-05-11 15:58:27:147 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:58:27:147 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:32:834 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:58:44:354 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 58
2017-05-11 15:58:44:355 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:58:44:355 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:01:047 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 7
2017-05-11 15:59:01:048 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:59:01:058 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:59:01:059 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:59:01:434 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:59:01:916 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 59
2017-05-11 15:59:01:916 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:59:01:917 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:10:100 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:59:19:355 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 61
2017-05-11 15:59:19:356 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:59:19:357 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:36:725 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 65
2017-05-11 15:59:36:725 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@76ded7c5
2017-05-11 15:59:36:725 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:53:753 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 8
2017-05-11 15:59:53:754 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:59:53:764 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:59:53:765 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:59:54:038 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 16:00:02:701 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 16:00:28:704 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 9
2017-05-11 16:00:28:705 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 16:00:28:715 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 16:00:28:716 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 16:00:28:999 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 16:00:56:799 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 16:02:20:809 WARNING ForceTerminationOnShutdown$1.shutdownRequested Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.
2017-05-11 16:02:20:811 WARNING AbstractFuture.get Warning: Analysis interrupted
2017-05-11 16:02:20:813 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
===================================================================================================================================
Cannot print statistics for this analysis because it is still running.
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.373s
Time for transition matches: 0.672s
Time for transition assertions: 0.000s
Time for transition actions: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 356673 (count: 358019, min: 0, max: 1, avg: 1.00) [0 x 1346, 1 x 356673]
CPA algorithm statistics
------------------------
Number of iterations: 331153
Max size of waitlist: 297
Average size of waitlist: 102
Number of computed successors: 356673
Max successors for one state: 2
Number of times merged: 67713
Number of times stopped: 71920
Number of times breaked: 0
Total time for CPA algorithm: 444.171s (Max: 164.064s)
Time for choose from waitlist: 0.333s
Time for precision adjustment: 4.360s
Time for transfer relation: 53.154s
Time for merge operator: 365.221s
Time for stop operator: 17.269s
Time for adding to reached set: 1.358s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.029
Visited lines: 0
Total lines: 397
Line coverage: 0.000
Visited conditions: 0
Total conditions: 138
Condition coverage: 0.000
CPAchecker general statistics
-----------------------------
Number of program locations: 691
Number of CFA edges: 807
Number of relevant variables: 145
Number of functions: 34
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 N342)
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: 4.292s
Time for loading CPAs: 1.749s
Time for loading parser: 0.721s
Time for CFA construction: 1.712s
Time for parsing file(s): 0.468s
Time for AST to CFA: 0.558s
Time for CFA sanity check: 0.142s
Time for post-processing: 0.453s
Time for var class.: 0.260s
Time for CFA export: 1.369s
Time for Analysis: 449.442s
CPU time for analysis: 892.430s
Total time for CPAchecker: 453.758s
Total CPU time for CPAchecker: 900.010s
Time for statistics: 0.058s
Time for Garbage Collector: 47.844s (in 380 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 949MB ( 905 MiB) max; 456MB ( 435 MiB) avg; 994MB ( 948 MiB) peak
Used non-heap memory: 52MB ( 50 MiB) max; 51MB ( 48 MiB) avg; 53MB ( 50 MiB) peak
Used in PS Old Gen pool: 556MB ( 530 MiB) max; 260MB ( 248 MiB) avg; 560MB ( 534 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 1028MB ( 980 MiB) avg
Allocated non-heap memory: 55MB ( 52 MiB) max; 54MB ( 51 MiB) avg
Total process virtual memory: 7325MB ( 6985 MiB) max; 6693MB ( 6383 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product06_false-unreach-call_false-termination.cil/minepump_spec3_product06_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product06_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