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