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_784 = 8; int INPUTS_at_784[8]; int input_at_784_counter = 0;int num_of_inputs_at_804 = 8; int INPUTS_at_804[8]; int input_at_804_counter = 0;int num_of_inputs_at_794 = 8; int INPUTS_at_794[8]; int input_at_794_counter = 0;int num_of_inputs_at_810 = 5; int INPUTS_at_810[5]; int input_at_810_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<8; instrumentation_index++) INPUTS_at_784[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<8; instrumentation_index++) INPUTS_at_804[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<8; instrumentation_index++) INPUTS_at_794[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<5; instrumentation_index++) INPUTS_at_810[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,"Test.i","") |
406 | int cleanupTimeShifts = 4; |
407 | void timeShift(void) ; |
408 | void cleanup(void) |
409 | { int i ; |
410 | int __cil_tmp2 ; |
411 | |
412 | { |
413 | { |
414 | timeShift(); |
415 | i = 0; |
416 | } |
417 | { |
418 | while (1) { |
419 | while_3_continue: /* CIL Label */ ; |
420 | { |
421 | __cil_tmp2 = cleanupTimeShifts - 1; |
422 | if (i < __cil_tmp2) { |
423 | |
424 | } else { |
425 | goto while_3_break; |
426 | } |
427 | } |
428 | { |
429 | timeShift(); |
430 | i = i + 1; |
431 | } |
432 | } |
433 | while_3_break: /* CIL Label */ ; |
434 | } |
435 | return; |
436 | } |
437 | } |
438 | void printPump(void) ; |
439 | void waterRise(void) ; |
440 | void changeMethaneLevel(void) ; |
441 | void Specification2(void) |
442 | { |
443 | |
444 | { |
445 | { |
446 | timeShift(); |
447 | printPump(); |
448 | timeShift(); |
449 | printPump(); |
450 | timeShift(); |
451 | printPump(); |
452 | waterRise(); |
453 | printPump(); |
454 | timeShift(); |
455 | printPump(); |
456 | changeMethaneLevel(); |
457 | printPump(); |
458 | timeShift(); |
459 | printPump(); |
460 | cleanup(); |
461 | } |
462 | return; |
463 | } |
464 | } |
465 | void setup(void) |
466 | { |
467 | |
468 | { |
469 | return; |
470 | } |
471 | } |
472 | void test(void) ; |
473 | void runTest(void) |
474 | { |
475 | |
476 | { |
477 | { |
478 | test(); |
479 | } |
480 | return; |
481 | } |
482 | } |
483 | void select_helpers(void) ; |
484 | void select_features(void) ; |
485 | int valid_product(void) ; |
486 | int main(void) |
487 | {initialize_reads(); int retValue_acc ; |
488 | int tmp ; |
489 | |
490 | { |
491 | { |
492 | select_helpers(); |
493 | select_features(); |
494 | tmp = valid_product(); |
495 | } |
496 | if (tmp != 0) { |
497 | { |
498 | setup(); |
499 | runTest(); |
500 | } |
501 | } else { |
502 | |
503 | } |
504 | retValue_acc = 0; |
505 | return (retValue_acc); |
506 | return (retValue_acc); |
507 | } |
508 | } |
509 | #pragma merger(0,"Specification1_spec.i","") |
510 | void __automaton_fail(void) ; |
511 | int isPumpRunning(void) ; |
512 | int isMethaneLevelCritical(void) ; |
513 | inline static void __utac_acc__Specification1_spec__1(void) |
514 | { int tmp ; |
515 | int tmp___0 ; |
516 | |
517 | { |
518 | { |
519 | tmp = isMethaneLevelCritical(); |
520 | } |
521 | if (tmp != 0) { |
522 | { |
523 | tmp___0 = isPumpRunning(); |
524 | } |
525 | if (tmp___0 != 0) { |
526 | { |
527 | __automaton_fail(); |
528 | } |
529 | } else { |
530 | |
531 | } |
532 | } else { |
533 | |
534 | } |
535 | return; |
536 | } |
537 | } |
538 | #pragma merger(0,"wsllib_check.i","") |
539 | void __automaton_fail(void) |
540 | { |
541 | |
542 | { |
543 | __VERIFIER_assume(!((0 != INPUTS_at_784[0] && 0 != INPUTS_at_804[0])));__VERIFIER_assume(!((0 != INPUTS_at_784[0])));__VERIFIER_assume(!((0 != INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_784[1] && 0 != INPUTS_at_810[0])));__VERIFIER_assume(!((0 != INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_784[1])));__VERIFIER_assume(!((0 != INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_794[1] && 0 != INPUTS_at_804[0])));__VERIFIER_assume(!((0 != INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_794[1])));__VERIFIER_assume(!((0 != INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_784[1] && 0 != INPUTS_at_804[0])));__VERIFIER_assume(!((0 != INPUTS_at_784[2] && 0 == INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_794[1] && 0 == INPUTS_at_784[1] && 0 != INPUTS_at_804[0])));__VERIFIER_assume(!((0 != INPUTS_at_794[1])));__VERIFIER_assume(!((0 != INPUTS_at_804[1])));__VERIFIER_assume(!((0 != INPUTS_at_794[2])));__VERIFIER_assume(!((0 == INPUTS_at_794[4])));__VERIFIER_assume(!((0 != INPUTS_at_810[0] && 0 == INPUTS_at_804[0] && 0 == INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_804[4] && 0 == INPUTS_at_794[4] && 0 == INPUTS_at_784[4])));__VERIFIER_assume(!((0 != INPUTS_at_794[3])));__VERIFIER_assume(!((0 != INPUTS_at_784[1] && 0 == INPUTS_at_810[0] && 0 == INPUTS_at_804[0] && 0 == INPUTS_at_794[0] && 0 == INPUTS_at_784[0] && 0 == INPUTS_at_804[5] && 0 == INPUTS_at_794[5] && 0 == INPUTS_at_784[5] && 0 == INPUTS_at_804[4] && 0 != INPUTS_at_794[3] && 0 != INPUTS_at_784[3] && 0 != INPUTS_at_804[2] && 0 != INPUTS_at_784[2])));__VERIFIER_assume(!((0 == INPUTS_at_784[5])));__VERIFIER_error(); |
544 | return; |
545 | } |
546 | } |
547 | #pragma merger(0,"featureselect.i","") |
548 | int select_one(void) ; |
549 | int select_one(void) |
550 | { int retValue_acc ; |
551 | int choice = __VERIFIER_nondet_int(); |
552 | |
553 | { |
554 | retValue_acc = choice; |
555 | return (retValue_acc); |
556 | return (retValue_acc); |
557 | } |
558 | } |
559 | void select_features(void) |
560 | { |
561 | |
562 | { |
563 | return; |
564 | } |
565 | } |
566 | void select_helpers(void) |
567 | { |
568 | |
569 | { |
570 | return; |
571 | } |
572 | } |
573 | int valid_product(void) |
574 | { int retValue_acc ; |
575 | |
576 | { |
577 | retValue_acc = 1; |
578 | return (retValue_acc); |
579 | return (retValue_acc); |
580 | } |
581 | } |
582 | #pragma merger(0,"MinePump.i","") |
583 | void lowerWaterLevel(void) ; |
584 | void printEnvironment(void) ; |
585 | int isHighWaterSensorDry(void) ; |
586 | void activatePump(void) ; |
587 | void deactivatePump(void) ; |
588 | int pumpRunning = 0; |
589 | int systemActive = 1; |
590 | void processEnvironment(void) ; |
591 | void timeShift(void) |
592 | { |
593 | |
594 | { |
595 | if (pumpRunning != 0) { |
596 | { |
597 | lowerWaterLevel(); |
598 | } |
599 | } else { |
600 | |
601 | } |
602 | if (systemActive != 0) { |
603 | { |
604 | processEnvironment(); |
605 | } |
606 | } else { |
607 | |
608 | } |
609 | { |
610 | __utac_acc__Specification1_spec__1(); |
611 | } |
612 | return; |
613 | } |
614 | } |
615 | void processEnvironment__wrappee__base(void) |
616 | { |
617 | |
618 | { |
619 | return; |
620 | } |
621 | } |
622 | int isHighWaterLevel(void) ; |
623 | void processEnvironment__wrappee__highWaterSensor(void) |
624 | { int tmp ; |
625 | |
626 | { |
627 | if (! pumpRunning) { |
628 | { |
629 | tmp = isHighWaterLevel(); |
630 | } |
631 | if (tmp != 0) { |
632 | { |
633 | activatePump(); |
634 | } |
635 | } else { |
636 | { |
637 | processEnvironment__wrappee__base(); |
638 | } |
639 | } |
640 | } else { |
641 | { |
642 | processEnvironment__wrappee__base(); |
643 | } |
644 | } |
645 | return; |
646 | } |
647 | } |
648 | int isMethaneAlarm(void) ; |
649 | void processEnvironment(void) |
650 | { int tmp ; |
651 | |
652 | { |
653 | if (pumpRunning != 0) { |
654 | { |
655 | tmp = isMethaneAlarm(); |
656 | } |
657 | if (tmp != 0) { |
658 | { |
659 | deactivatePump(); |
660 | } |
661 | } else { |
662 | { |
663 | processEnvironment__wrappee__highWaterSensor(); |
664 | } |
665 | } |
666 | } else { |
667 | { |
668 | processEnvironment__wrappee__highWaterSensor(); |
669 | } |
670 | } |
671 | return; |
672 | } |
673 | } |
674 | void activatePump(void) |
675 | { |
676 | |
677 | { |
678 | pumpRunning = 1; |
679 | return; |
680 | } |
681 | } |
682 | void deactivatePump(void) |
683 | { |
684 | |
685 | { |
686 | pumpRunning = 0; |
687 | return; |
688 | } |
689 | } |
690 | int isMethaneAlarm(void) |
691 | { int retValue_acc ; |
692 | |
693 | { |
694 | { |
695 | retValue_acc = isMethaneLevelCritical(); |
696 | } |
697 | return (retValue_acc); |
698 | return (retValue_acc); |
699 | } |
700 | } |
701 | int isPumpRunning(void) |
702 | { int retValue_acc ; |
703 | |
704 | { |
705 | retValue_acc = pumpRunning; |
706 | return (retValue_acc); |
707 | return (retValue_acc); |
708 | } |
709 | } |
710 | void printPump(void) |
711 | { |
712 | |
713 | { |
714 | { |
715 | // printf("Pump(System:"); |
716 | } |
717 | if (systemActive != 0) { |
718 | { |
719 | // printf("On"); |
720 | } |
721 | } else { |
722 | { |
723 | // printf("Off"); |
724 | } |
725 | } |
726 | { |
727 | // printf(",Pump:"); |
728 | } |
729 | if (pumpRunning != 0) { |
730 | { |
731 | // printf("On"); |
732 | } |
733 | } else { |
734 | { |
735 | // printf("Off"); |
736 | } |
737 | } |
738 | { |
739 | // printf(") "); |
740 | printEnvironment(); |
741 | // printf("\n"); |
742 | } |
743 | return; |
744 | } |
745 | } |
746 | int isHighWaterLevel(void) |
747 | { int retValue_acc ; |
748 | int tmp ; |
749 | int tmp___0 ; |
750 | |
751 | { |
752 | { |
753 | tmp = isHighWaterSensorDry(); |
754 | } |
755 | if (tmp != 0) { |
756 | tmp___0 = 0; |
757 | } else { |
758 | tmp___0 = 1; |
759 | } |
760 | retValue_acc = tmp___0; |
761 | return (retValue_acc); |
762 | return (retValue_acc); |
763 | } |
764 | } |
765 | #pragma merger(0,"scenario.i","") |
766 | void test(void) |
767 | { int splverifierCounter ; |
768 | int tmp ; |
769 | int tmp___0 ; |
770 | int tmp___1 ; |
771 | int tmp___2 ; |
772 | |
773 | { |
774 | splverifierCounter = 0; |
775 | { |
776 | while (1) { |
777 | while_4_continue: /* CIL Label */ ; |
778 | if (splverifierCounter < 4) { |
779 | |
780 | } else { |
781 | goto while_4_break; |
782 | } |
783 | { |
784 | tmp = (input_at_784_counter < num_of_inputs_at_784) ? INPUTS_at_784[input_at_784_counter++] : __VERIFIER_nondet_int() ; |
785 | } |
786 | if (tmp != 0) { |
787 | { |
788 | waterRise(); |
789 | } |
790 | } else { |
791 | |
792 | } |
793 | { |
794 | tmp___0 = (input_at_794_counter < num_of_inputs_at_794) ? INPUTS_at_794[input_at_794_counter++] : __VERIFIER_nondet_int() ; |
795 | } |
796 | if (tmp___0 != 0) { |
797 | { |
798 | changeMethaneLevel(); |
799 | } |
800 | } else { |
801 | |
802 | } |
803 | { |
804 | tmp___2 = (input_at_804_counter < num_of_inputs_at_804) ? INPUTS_at_804[input_at_804_counter++] : __VERIFIER_nondet_int() ; |
805 | } |
806 | if (tmp___2 != 0) { |
807 | |
808 | } else { |
809 | { |
810 | tmp___1 = (input_at_810_counter < num_of_inputs_at_810) ? INPUTS_at_810[input_at_810_counter++] : __VERIFIER_nondet_int() ; |
811 | } |
812 | if (tmp___1 != 0) { |
813 | |
814 | } else { |
815 | |
816 | } |
817 | } |
818 | { |
819 | timeShift(); |
820 | } |
821 | } |
822 | while_4_break: /* CIL Label */ ; |
823 | } |
824 | { |
825 | cleanup(); |
826 | } |
827 | return; |
828 | } |
829 | } |
830 | #pragma merger(0,"Environment.i","") |
831 | int getWaterLevel(void) ; |
832 | int waterLevel = 1; |
833 | int methaneLevelCritical = 0; |
834 | void lowerWaterLevel(void) |
835 | { |
836 | |
837 | { |
838 | if (waterLevel > 0) { |
839 | waterLevel = waterLevel - 1; |
840 | } else { |
841 | |
842 | } |
843 | return; |
844 | } |
845 | } |
846 | void waterRise(void) |
847 | { |
848 | |
849 | { |
850 | if (waterLevel < 2) { |
851 | waterLevel = waterLevel + 1; |
852 | } else { |
853 | |
854 | } |
855 | return; |
856 | } |
857 | } |
858 | void changeMethaneLevel(void) |
859 | { |
860 | |
861 | { |
862 | if (methaneLevelCritical != 0) { |
863 | methaneLevelCritical = 0; |
864 | } else { |
865 | methaneLevelCritical = 1; |
866 | } |
867 | return; |
868 | } |
869 | } |
870 | int isMethaneLevelCritical(void) |
871 | { int retValue_acc ; |
872 | |
873 | { |
874 | retValue_acc = methaneLevelCritical; |
875 | return (retValue_acc); |
876 | return (retValue_acc); |
877 | } |
878 | } |
879 | void printEnvironment(void) |
880 | { |
881 | |
882 | { |
883 | { |
884 | // printf("Env(Water:%i", waterLevel); |
885 | // printf(",Meth:"); |
886 | } |
887 | if (methaneLevelCritical != 0) { |
888 | { |
889 | // printf("CRIT"); |
890 | } |
891 | } else { |
892 | { |
893 | // printf("OK"); |
894 | } |
895 | } |
896 | { |
897 | // printf(")"); |
898 | } |
899 | return; |
900 | } |
901 | } |
902 | int getWaterLevel(void) |
903 | { int retValue_acc ; |
904 | |
905 | { |
906 | retValue_acc = waterLevel; |
907 | return (retValue_acc); |
908 | return (retValue_acc); |
909 | } |
910 | } |
911 | int isHighWaterSensorDry(void) |
912 | { int retValue_acc ; |
913 | |
914 | { |
915 | if (waterLevel < 2) { |
916 | retValue_acc = 1; |
917 | return (retValue_acc); |
918 | } else { |
919 | retValue_acc = 0; |
920 | return (retValue_acc); |
921 | } |
922 | return (retValue_acc); |
923 | } |
924 | } |
2017-05-11 22:33:32:439 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 22:33:32:544 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 22:33:34:283 INFO CFACreationUtils.addEdgeToCFA line 356: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:288 INFO CFACreationUtils.addEdgeToCFA line 402: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:300 INFO CFACreationUtils.addEdgeToCFA line 506: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:349 INFO CFACreationUtils.addEdgeToCFA line 556: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:351 INFO CFACreationUtils.addEdgeToCFA line 579: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:358 INFO CFACreationUtils.addEdgeToCFA line 698: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:360 INFO CFACreationUtils.addEdgeToCFA line 707: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:363 INFO CFACreationUtils.addEdgeToCFA line 762: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:408 INFO CFACreationUtils.addEdgeToCFA line 876: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:410 INFO CFACreationUtils.addEdgeToCFA line 908: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:411 INFO CFACreationUtils.addEdgeToCFA line 922: Dead code detected: return (retValue_acc);
2017-05-11 22:33:34:672 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 22:33:36:537 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 22:33:36:568 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 22:33:36:598 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 22:33:36:907 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 22:33:37:694 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 22:33:37:815 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 22:33:38:017 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 22:33:38:557 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 22:33:38:570 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 22:33:38:588 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 22:33:38:605 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 22:33:39:456 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:33:43:937 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:33:43:968 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:33:44:597 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 22:33:44:648 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:33:44:649 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:33:44:710 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:33:49:326 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 22:33:49:331 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:33:49:331 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:33:52:880 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 22:33:52:892 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:33:52:904 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:33:55:524 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 22:33:55:525 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:33:55:525 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:33:56:975 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 22:33:56:976 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:33:56:977 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:33:58:943 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 22:33:58:944 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:33:58:944 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:00:740 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 22:34:00:741 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:00:741 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:01:709 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 28
2017-05-11 22:34:01:715 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:01:715 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:02:818 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 22:34:02:821 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:02:834 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:05:147 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 34
2017-05-11 22:34:05:147 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:05:148 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:06:638 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 38
2017-05-11 22:34:06:639 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:06:639 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:08:490 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:34:08:950 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 40
2017-05-11 22:34:08:950 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:08:953 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:10:750 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 44
2017-05-11 22:34:10:752 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:10:754 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:12:455 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 52
2017-05-11 22:34:12:456 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:12:456 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:18:126 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 22:34:18:126 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:34:18:137 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:34:18:142 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:34:18:199 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:34:26:260 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:34:30:217 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 22:34:30:218 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:34:30:227 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:34:30:228 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:34:30:312 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:34:33:972 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:34:34:153 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 56
2017-05-11 22:34:34:153 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:34:153 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:34:50:310 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 64
2017-05-11 22:34:50:311 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:34:50:311 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:35:09:072 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 22:35:09:074 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:35:09:085 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:35:09:089 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:35:09:202 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:35:19:626 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:35:29:153 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 68
2017-05-11 22:35:29:154 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:35:29:154 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:36:01:692 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 5
2017-05-11 22:36:01:693 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:36:01:703 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:36:01:705 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:36:01:824 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:36:08:134 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 70
2017-05-11 22:36:08:135 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:36:08:135 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:36:19:139 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:36:43:863 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 6
2017-05-11 22:36:43:864 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:36:43:873 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:36:43:873 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:36:44:036 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:36:46:434 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 74
2017-05-11 22:36:46:434 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:36:46:434 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:36:58:939 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:37:23:415 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 82
2017-05-11 22:37:23:415 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@314720e8
2017-05-11 22:37:23:415 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 22:37:48:559 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 7
2017-05-11 22:37:48:560 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:37:48:570 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:37:48:571 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:37:48:807 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:38:03:956 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:38:42:807 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 8
2017-05-11 22:38:42:808 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:38:42:820 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:38:42:821 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 22:38:43:017 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 22:39:13:530 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 22:40:34:922 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 9
2017-05-11 22:40:34:923 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 22:40:35:890 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 22:40:49:090 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 22:40:54:302 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:40:55:240 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:40:55:241 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:40:55:785 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:40:55:785 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:40:56:522 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:40:56:523 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:40:57:188 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:40:57:188 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:40:58:025 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:40:58:025 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:40:59:358 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:40:59:359 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:41:01:112 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:41:01:113 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:41:02:204 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 22:41:02:205 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 22:41:03:593 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 22:41:03:597 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 22:41:03:603 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 22:41:03:604 INFO CPAchecker.runAlgorithm Stopping analysis ...
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 9 (0% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 0 (0%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Because of target state: 9 (100%)
Times precision was empty: 9 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 0
Number of coverage checks: 932
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 870
Number of predicates discovered: 0
Time for post operator: 4.239s
Time for path formula creation: 4.232s
Time for strengthen operator: 0.010s
Time for prec operator: 0.006s
Time for abstraction: 0.000s (Max: 0.000s, Count: 9)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.041s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 1682
Number of created targets for uf: *signed_int is 291
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 9
Maximum loop iteration reached: 10
ValueAnalysisCPA statistics
---------------------------
Number of variables: 53059 (count: 2991, min: 0, max: 35, avg: 17.74)
Number of global variables: 33853 (count: 2991, min: 0, max: 22, avg: 11.32)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 3464
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.087s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 63
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 1586
Number of deterministic Assumptions: 366
Level of Determinism: 23%
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.011s
Automaton transfers with branching: 0
Automaton transfer successors: 3464 (count: 3473, min: 0, max: 1, avg: 1.00) [0 x 9, 1 x 3464]
CPA algorithm statistics
------------------------
Number of iterations: 3007
Max size of waitlist: 18
Average size of waitlist: 4
Number of computed successors: 3464
Max successors for one state: 2
Number of times merged: 466
Number of times stopped: 466
Number of times breaked: 0
Total time for CPA algorithm: 5.448s (Max: 4.424s)
Time for choose from waitlist: 0.003s
Time for precision adjustment: 0.160s
Time for transfer relation: 5.141s
Time for merge operator: 0.079s
Time for stop operator: 0.008s
Time for adding to reached set: 0.012s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 5.479s
Time for final sat check: 13.201s
Time for error path creation: 3.726s
Time for bounding assertions check: 1.283s
Time for induction formula creation: 123.572s
Time for induction check: 285.117s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 8 (800%)
Time for counterexample checks: 9.291s
Time for running CBMC: 8.825s
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 1.140s
Time for transition matches: 0.471s
Time for transition assertions: 0.001s
Time for transition actions: 0.000s
Automaton transfers with branching: 0
Automaton transfer successors: 253736 (count: 254136, min: 0, max: 1, avg: 1.00) [0 x 400, 1 x 253736]
CPA algorithm statistics
------------------------
Number of iterations: 233097
Max size of waitlist: 482
Average size of waitlist: 145
Number of computed successors: 253736
Max successors for one state: 2
Number of times merged: 39599
Number of times stopped: 42224
Number of times breaked: 0
Total time for CPA algorithm: 441.996s (Max: 220.152s)
Time for choose from waitlist: 0.352s
Time for precision adjustment: 2.908s
Time for transfer relation: 44.861s
Time for merge operator: 372.098s
Time for stop operator: 18.588s
Time for adding to reached set: 1.412s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.667
Visited lines: 117
Total lines: 414
Line coverage: 0.283
Visited conditions: 159
Total conditions: 210
Condition coverage: 0.757
CPAchecker general statistics
-----------------------------
Number of program locations: 762
Number of CFA edges: 911
Number of relevant variables: 151
Number of functions: 36
Number of loops: 9
Size of reached set: 2991
Number of reached locations: 398 (52%)
Avg states per location: 7
Max states per location: 25 (at node N539)
Number of reached functions: 24 (67%)
Number of partitions: 2991
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 9
Time for analysis setup: 3.945s
Time for loading CPAs: 1.259s
Time for loading parser: 0.672s
Time for CFA construction: 1.919s
Time for parsing file(s): 0.449s
Time for AST to CFA: 0.560s
Time for CFA sanity check: 0.195s
Time for post-processing: 0.657s
Time for var class.: 0.344s
Time for CFA export: 1.112s
Time for Analysis: 447.062s
CPU time for analysis: 880.220s
Time for analyzing result: 0.002s
Total time for CPAchecker: 451.029s
Total CPU time for CPAchecker: 887.240s
Time for statistics: 8.399s
Time for Garbage Collector: 43.420s (in 372 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 904MB ( 862 MiB) max; 492MB ( 469 MiB) avg; 929MB ( 886 MiB) peak
Used non-heap memory: 54MB ( 52 MiB) max; 51MB ( 48 MiB) avg; 61MB ( 58 MiB) peak
Used in PS Old Gen pool: 491MB ( 468 MiB) max; 296MB ( 282 MiB) avg; 494MB ( 471 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 959MB ( 914 MiB) avg
Allocated non-heap memory: 57MB ( 54 MiB) max; 55MB ( 52 MiB) avg
Total process virtual memory: 7330MB ( 6990 MiB) max; 6740MB ( 6428 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product37_false-unreach-call_false-termination.cil/minepump_spec1_product37_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_spec1_product37_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