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