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