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