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