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_560 = 10; int INPUTS_at_560[10]; int input_at_560_counter = 0;int num_of_inputs_at_580 = 10; int INPUTS_at_580[10]; int input_at_580_counter = 0;int num_of_inputs_at_570 = 10; int INPUTS_at_570[10]; int input_at_570_counter = 0;int num_of_inputs_at_588 = 10; int INPUTS_at_588[10]; int input_at_588_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<10; instrumentation_index++) INPUTS_at_560[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<10; instrumentation_index++) INPUTS_at_580[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<10; instrumentation_index++) INPUTS_at_570[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<10; instrumentation_index++) INPUTS_at_588[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,"featureselect.i","") |
40 | int select_one(void) ; |
41 | void select_features(void) ; |
42 | void select_helpers(void) ; |
43 | int valid_product(void) ; |
44 | int select_one(void) |
45 | { int retValue_acc ; |
46 | int choice = __VERIFIER_nondet_int(); |
47 | |
48 | { |
49 | retValue_acc = choice; |
50 | return (retValue_acc); |
51 | return (retValue_acc); |
52 | } |
53 | } |
54 | void select_features(void) |
55 | { |
56 | |
57 | { |
58 | return; |
59 | } |
60 | } |
61 | void select_helpers(void) |
62 | { |
63 | |
64 | { |
65 | return; |
66 | } |
67 | } |
68 | int valid_product(void) |
69 | { int retValue_acc ; |
70 | |
71 | { |
72 | retValue_acc = 1; |
73 | return (retValue_acc); |
74 | return (retValue_acc); |
75 | } |
76 | } |
77 | #pragma merger(0,"Environment.i","") |
78 | void lowerWaterLevel(void) ; |
79 | void waterRise(void) ; |
80 | void changeMethaneLevel(void) ; |
81 | int isMethaneLevelCritical(void) ; |
82 | int getWaterLevel(void) ; |
83 | void printEnvironment(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 | #pragma merger(0,"wsllib_check.i","") |
164 | void __automaton_fail(void) |
165 | { |
166 | |
167 | { |
168 | __VERIFIER_assume(!((0 == INPUTS_at_580[0] && 0 == INPUTS_at_570[0])));__VERIFIER_assume(!((0 == INPUTS_at_580[0] && 0 != INPUTS_at_570[0])));__VERIFIER_assume(!((0 != INPUTS_at_570[0] && 0 == INPUTS_at_580[0])));__VERIFIER_assume(!((0 != INPUTS_at_580[1] && 0 != INPUTS_at_570[0])));__VERIFIER_assume(!((0 == INPUTS_at_570[0] && 0 == INPUTS_at_570[1] && 0 == INPUTS_at_580[2] && 0 == INPUTS_at_588[0] && 0 != INPUTS_at_580[0])));__VERIFIER_error(); |
169 | return; |
170 | } |
171 | } |
172 | #pragma merger(0,"libacc.i","") |
173 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
174 | char const *__file , |
175 | unsigned int __line , |
176 | char const *__function ) ; |
177 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
178 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
179 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
180 | int ) , |
181 | int val ) |
182 | { struct __UTAC__EXCEPTION *excep ; |
183 | struct __UTAC__CFLOW_FUNC *cf ; |
184 | void *tmp ; |
185 | unsigned long __cil_tmp7 ; |
186 | unsigned long __cil_tmp8 ; |
187 | unsigned long __cil_tmp9 ; |
188 | unsigned long __cil_tmp10 ; |
189 | unsigned long __cil_tmp11 ; |
190 | unsigned long __cil_tmp12 ; |
191 | unsigned long __cil_tmp13 ; |
192 | unsigned long __cil_tmp14 ; |
193 | int (**mem_15)(int , int ) ; |
194 | int *mem_16 ; |
195 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
196 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
197 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
198 | |
199 | { |
200 | { |
201 | excep = (struct __UTAC__EXCEPTION *)exception; |
202 | tmp = malloc(24UL); |
203 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
204 | mem_15 = (int (**)(int , int ))cf; |
205 | *mem_15 = cflow_func; |
206 | __cil_tmp7 = (unsigned long )cf; |
207 | __cil_tmp8 = __cil_tmp7 + 8; |
208 | mem_16 = (int *)__cil_tmp8; |
209 | *mem_16 = val; |
210 | __cil_tmp9 = (unsigned long )cf; |
211 | __cil_tmp10 = __cil_tmp9 + 16; |
212 | __cil_tmp11 = (unsigned long )excep; |
213 | __cil_tmp12 = __cil_tmp11 + 24; |
214 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
215 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
216 | *mem_17 = *mem_18; |
217 | __cil_tmp13 = (unsigned long )excep; |
218 | __cil_tmp14 = __cil_tmp13 + 24; |
219 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
220 | *mem_19 = cf; |
221 | } |
222 | return; |
223 | } |
224 | } |
225 | void __utac__exception__cf_handler_free(void *exception ) |
226 | { struct __UTAC__EXCEPTION *excep ; |
227 | struct __UTAC__CFLOW_FUNC *cf ; |
228 | struct __UTAC__CFLOW_FUNC *tmp ; |
229 | unsigned long __cil_tmp5 ; |
230 | unsigned long __cil_tmp6 ; |
231 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
232 | unsigned long __cil_tmp8 ; |
233 | unsigned long __cil_tmp9 ; |
234 | unsigned long __cil_tmp10 ; |
235 | unsigned long __cil_tmp11 ; |
236 | void *__cil_tmp12 ; |
237 | unsigned long __cil_tmp13 ; |
238 | unsigned long __cil_tmp14 ; |
239 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
240 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
241 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
242 | |
243 | { |
244 | excep = (struct __UTAC__EXCEPTION *)exception; |
245 | __cil_tmp5 = (unsigned long )excep; |
246 | __cil_tmp6 = __cil_tmp5 + 24; |
247 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
248 | cf = *mem_15; |
249 | { |
250 | while (1) { |
251 | while_0_continue: /* CIL Label */ ; |
252 | { |
253 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
254 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
255 | __cil_tmp9 = (unsigned long )cf; |
256 | if (__cil_tmp9 != __cil_tmp8) { |
257 | |
258 | } else { |
259 | goto while_0_break; |
260 | } |
261 | } |
262 | { |
263 | tmp = cf; |
264 | __cil_tmp10 = (unsigned long )cf; |
265 | __cil_tmp11 = __cil_tmp10 + 16; |
266 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
267 | cf = *mem_16; |
268 | __cil_tmp12 = (void *)tmp; |
269 | free(__cil_tmp12); |
270 | } |
271 | } |
272 | while_0_break: /* CIL Label */ ; |
273 | } |
274 | __cil_tmp13 = (unsigned long )excep; |
275 | __cil_tmp14 = __cil_tmp13 + 24; |
276 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
277 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
278 | return; |
279 | } |
280 | } |
281 | void __utac__exception__cf_handler_reset(void *exception ) |
282 | { struct __UTAC__EXCEPTION *excep ; |
283 | struct __UTAC__CFLOW_FUNC *cf ; |
284 | unsigned long __cil_tmp5 ; |
285 | unsigned long __cil_tmp6 ; |
286 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
287 | unsigned long __cil_tmp8 ; |
288 | unsigned long __cil_tmp9 ; |
289 | int (*__cil_tmp10)(int , int ) ; |
290 | unsigned long __cil_tmp11 ; |
291 | unsigned long __cil_tmp12 ; |
292 | int __cil_tmp13 ; |
293 | unsigned long __cil_tmp14 ; |
294 | unsigned long __cil_tmp15 ; |
295 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
296 | int (**mem_17)(int , int ) ; |
297 | int *mem_18 ; |
298 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
299 | |
300 | { |
301 | excep = (struct __UTAC__EXCEPTION *)exception; |
302 | __cil_tmp5 = (unsigned long )excep; |
303 | __cil_tmp6 = __cil_tmp5 + 24; |
304 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
305 | cf = *mem_16; |
306 | { |
307 | while (1) { |
308 | while_1_continue: /* CIL Label */ ; |
309 | { |
310 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
311 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
312 | __cil_tmp9 = (unsigned long )cf; |
313 | if (__cil_tmp9 != __cil_tmp8) { |
314 | |
315 | } else { |
316 | goto while_1_break; |
317 | } |
318 | } |
319 | { |
320 | mem_17 = (int (**)(int , int ))cf; |
321 | __cil_tmp10 = *mem_17; |
322 | __cil_tmp11 = (unsigned long )cf; |
323 | __cil_tmp12 = __cil_tmp11 + 8; |
324 | mem_18 = (int *)__cil_tmp12; |
325 | __cil_tmp13 = *mem_18; |
326 | (*__cil_tmp10)(4, __cil_tmp13); |
327 | __cil_tmp14 = (unsigned long )cf; |
328 | __cil_tmp15 = __cil_tmp14 + 16; |
329 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
330 | cf = *mem_19; |
331 | } |
332 | } |
333 | while_1_break: /* CIL Label */ ; |
334 | } |
335 | { |
336 | __utac__exception__cf_handler_free(exception); |
337 | } |
338 | return; |
339 | } |
340 | } |
341 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
342 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
343 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
344 | { void *retValue_acc ; |
345 | struct __ACC__ERR *new ; |
346 | void *tmp ; |
347 | struct __ACC__ERR *temp ; |
348 | struct __ACC__ERR *next ; |
349 | void *excep ; |
350 | unsigned long __cil_tmp10 ; |
351 | unsigned long __cil_tmp11 ; |
352 | unsigned long __cil_tmp12 ; |
353 | unsigned long __cil_tmp13 ; |
354 | void *__cil_tmp14 ; |
355 | unsigned long __cil_tmp15 ; |
356 | unsigned long __cil_tmp16 ; |
357 | void *__cil_tmp17 ; |
358 | void **mem_18 ; |
359 | struct __ACC__ERR **mem_19 ; |
360 | struct __ACC__ERR **mem_20 ; |
361 | void **mem_21 ; |
362 | struct __ACC__ERR **mem_22 ; |
363 | void **mem_23 ; |
364 | void **mem_24 ; |
365 | |
366 | { |
367 | if (count == 0) { |
368 | return (retValue_acc); |
369 | } else { |
370 | |
371 | } |
372 | if (mode == 0) { |
373 | { |
374 | tmp = malloc(16UL); |
375 | new = (struct __ACC__ERR *)tmp; |
376 | mem_18 = (void **)new; |
377 | *mem_18 = env; |
378 | __cil_tmp10 = (unsigned long )new; |
379 | __cil_tmp11 = __cil_tmp10 + 8; |
380 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
381 | *mem_19 = head; |
382 | head = new; |
383 | retValue_acc = (void *)new; |
384 | } |
385 | return (retValue_acc); |
386 | } else { |
387 | |
388 | } |
389 | if (mode == 1) { |
390 | temp = head; |
391 | { |
392 | while (1) { |
393 | while_2_continue: /* CIL Label */ ; |
394 | if (count > 1) { |
395 | |
396 | } else { |
397 | goto while_2_break; |
398 | } |
399 | { |
400 | __cil_tmp12 = (unsigned long )temp; |
401 | __cil_tmp13 = __cil_tmp12 + 8; |
402 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
403 | next = *mem_20; |
404 | mem_21 = (void **)temp; |
405 | excep = *mem_21; |
406 | __cil_tmp14 = (void *)temp; |
407 | free(__cil_tmp14); |
408 | __utac__exception__cf_handler_reset(excep); |
409 | temp = next; |
410 | count = count - 1; |
411 | } |
412 | } |
413 | while_2_break: /* CIL Label */ ; |
414 | } |
415 | { |
416 | __cil_tmp15 = (unsigned long )temp; |
417 | __cil_tmp16 = __cil_tmp15 + 8; |
418 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
419 | head = *mem_22; |
420 | mem_23 = (void **)temp; |
421 | excep = *mem_23; |
422 | __cil_tmp17 = (void *)temp; |
423 | free(__cil_tmp17); |
424 | __utac__exception__cf_handler_reset(excep); |
425 | retValue_acc = excep; |
426 | } |
427 | return (retValue_acc); |
428 | } else { |
429 | |
430 | } |
431 | if (mode == 2) { |
432 | if (head != 0) { |
433 | mem_24 = (void **)head; |
434 | retValue_acc = *mem_24; |
435 | return (retValue_acc); |
436 | } else { |
437 | retValue_acc = (void *)0; |
438 | return (retValue_acc); |
439 | } |
440 | } else { |
441 | |
442 | } |
443 | return (retValue_acc); |
444 | } |
445 | } |
446 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
447 | { void *retValue_acc ; |
448 | unsigned long __cil_tmp4 ; |
449 | unsigned long __cil_tmp5 ; |
450 | int __cil_tmp6 ; |
451 | int __cil_tmp7 ; |
452 | unsigned long __cil_tmp8 ; |
453 | unsigned long __cil_tmp9 ; |
454 | void **__cil_tmp10 ; |
455 | void **__cil_tmp11 ; |
456 | int *mem_12 ; |
457 | void ***mem_13 ; |
458 | |
459 | { |
460 | if (i > 0) { |
461 | { |
462 | __cil_tmp4 = (unsigned long )this; |
463 | __cil_tmp5 = __cil_tmp4 + 16; |
464 | mem_12 = (int *)__cil_tmp5; |
465 | __cil_tmp6 = *mem_12; |
466 | if (i <= __cil_tmp6) { |
467 | |
468 | } else { |
469 | { |
470 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
471 | 123U, "__utac__get_this_arg"); |
472 | } |
473 | } |
474 | } |
475 | } else { |
476 | { |
477 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
478 | 123U, "__utac__get_this_arg"); |
479 | } |
480 | } |
481 | __cil_tmp7 = i - 1; |
482 | __cil_tmp8 = (unsigned long )this; |
483 | __cil_tmp9 = __cil_tmp8 + 8; |
484 | mem_13 = (void ***)__cil_tmp9; |
485 | __cil_tmp10 = *mem_13; |
486 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
487 | retValue_acc = *__cil_tmp11; |
488 | return (retValue_acc); |
489 | return (retValue_acc); |
490 | } |
491 | } |
492 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
493 | { char const *retValue_acc ; |
494 | unsigned long __cil_tmp4 ; |
495 | unsigned long __cil_tmp5 ; |
496 | int __cil_tmp6 ; |
497 | int __cil_tmp7 ; |
498 | unsigned long __cil_tmp8 ; |
499 | unsigned long __cil_tmp9 ; |
500 | char const **__cil_tmp10 ; |
501 | char const **__cil_tmp11 ; |
502 | int *mem_12 ; |
503 | char const ***mem_13 ; |
504 | |
505 | { |
506 | if (i > 0) { |
507 | { |
508 | __cil_tmp4 = (unsigned long )this; |
509 | __cil_tmp5 = __cil_tmp4 + 16; |
510 | mem_12 = (int *)__cil_tmp5; |
511 | __cil_tmp6 = *mem_12; |
512 | if (i <= __cil_tmp6) { |
513 | |
514 | } else { |
515 | { |
516 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
517 | 131U, "__utac__get_this_argtype"); |
518 | } |
519 | } |
520 | } |
521 | } else { |
522 | { |
523 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
524 | 131U, "__utac__get_this_argtype"); |
525 | } |
526 | } |
527 | __cil_tmp7 = i - 1; |
528 | __cil_tmp8 = (unsigned long )this; |
529 | __cil_tmp9 = __cil_tmp8 + 24; |
530 | mem_13 = (char const ***)__cil_tmp9; |
531 | __cil_tmp10 = *mem_13; |
532 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
533 | retValue_acc = *__cil_tmp11; |
534 | return (retValue_acc); |
535 | return (retValue_acc); |
536 | } |
537 | } |
538 | #pragma merger(0,"scenario.i","") |
539 | void startSystem(void) ; |
540 | void timeShift(void) ; |
541 | void cleanup(void) ; |
542 | void test(void) |
543 | { int splverifierCounter ; |
544 | int tmp ; |
545 | int tmp___0 ; |
546 | int tmp___1 ; |
547 | int tmp___2 ; |
548 | |
549 | { |
550 | splverifierCounter = 0; |
551 | { |
552 | while (1) { |
553 | while_3_continue: /* CIL Label */ ; |
554 | if (splverifierCounter < 4) { |
555 | |
556 | } else { |
557 | goto while_3_break; |
558 | } |
559 | { |
560 | tmp = (input_at_560_counter < num_of_inputs_at_560) ? INPUTS_at_560[input_at_560_counter++] : __VERIFIER_nondet_int() ; |
561 | } |
562 | if (tmp != 0) { |
563 | { |
564 | waterRise(); |
565 | } |
566 | } else { |
567 | |
568 | } |
569 | { |
570 | tmp___0 = (input_at_570_counter < num_of_inputs_at_570) ? INPUTS_at_570[input_at_570_counter++] : __VERIFIER_nondet_int() ; |
571 | } |
572 | if (tmp___0 != 0) { |
573 | { |
574 | changeMethaneLevel(); |
575 | } |
576 | } else { |
577 | |
578 | } |
579 | { |
580 | tmp___2 = (input_at_580_counter < num_of_inputs_at_580) ? INPUTS_at_580[input_at_580_counter++] : __VERIFIER_nondet_int() ; |
581 | } |
582 | if (tmp___2 != 0) { |
583 | { |
584 | startSystem(); |
585 | } |
586 | } else { |
587 | { |
588 | tmp___1 = (input_at_588_counter < num_of_inputs_at_588) ? INPUTS_at_588[input_at_588_counter++] : __VERIFIER_nondet_int() ; |
589 | } |
590 | if (tmp___1 != 0) { |
591 | |
592 | } else { |
593 | |
594 | } |
595 | } |
596 | { |
597 | timeShift(); |
598 | } |
599 | } |
600 | while_3_break: /* CIL Label */ ; |
601 | } |
602 | { |
603 | cleanup(); |
604 | } |
605 | return; |
606 | } |
607 | } |
608 | #pragma merger(0,"MinePump.i","") |
609 | void activatePump(void) ; |
610 | void deactivatePump(void) ; |
611 | int isPumpRunning(void) ; |
612 | void printPump(void) ; |
613 | int pumpRunning = 0; |
614 | int systemActive = 1; |
615 | void __utac_acc__Specification3_spec__1(void) ; |
616 | void processEnvironment(void) ; |
617 | void timeShift(void) |
618 | { |
619 | |
620 | { |
621 | if (pumpRunning != 0) { |
622 | { |
623 | lowerWaterLevel(); |
624 | } |
625 | } else { |
626 | |
627 | } |
628 | if (systemActive != 0) { |
629 | { |
630 | processEnvironment(); |
631 | } |
632 | } else { |
633 | |
634 | } |
635 | { |
636 | __utac_acc__Specification3_spec__1(); |
637 | } |
638 | return; |
639 | } |
640 | } |
641 | void processEnvironment(void) |
642 | { |
643 | |
644 | { |
645 | return; |
646 | } |
647 | } |
648 | void activatePump__wrappee__base(void) |
649 | { |
650 | |
651 | { |
652 | pumpRunning = 1; |
653 | return; |
654 | } |
655 | } |
656 | int isMethaneAlarm(void) ; |
657 | void activatePump(void) |
658 | { int tmp ; |
659 | |
660 | { |
661 | { |
662 | tmp = isMethaneAlarm(); |
663 | } |
664 | if (tmp != 0) { |
665 | |
666 | } else { |
667 | { |
668 | activatePump__wrappee__base(); |
669 | } |
670 | } |
671 | return; |
672 | } |
673 | } |
674 | void deactivatePump(void) |
675 | { |
676 | |
677 | { |
678 | pumpRunning = 0; |
679 | return; |
680 | } |
681 | } |
682 | int isMethaneAlarm(void) |
683 | { int retValue_acc ; |
684 | |
685 | { |
686 | { |
687 | retValue_acc = isMethaneLevelCritical(); |
688 | } |
689 | return (retValue_acc); |
690 | return (retValue_acc); |
691 | } |
692 | } |
693 | int isPumpRunning(void) |
694 | { int retValue_acc ; |
695 | |
696 | { |
697 | retValue_acc = pumpRunning; |
698 | return (retValue_acc); |
699 | return (retValue_acc); |
700 | } |
701 | } |
702 | void printPump(void) |
703 | { |
704 | |
705 | { |
706 | { |
707 | // printf("Pump(System:"); |
708 | } |
709 | if (systemActive != 0) { |
710 | { |
711 | // printf("On"); |
712 | } |
713 | } else { |
714 | { |
715 | // printf("Off"); |
716 | } |
717 | } |
718 | { |
719 | // printf(",Pump:"); |
720 | } |
721 | if (pumpRunning != 0) { |
722 | { |
723 | // printf("On"); |
724 | } |
725 | } else { |
726 | { |
727 | // printf("Off"); |
728 | } |
729 | } |
730 | { |
731 | // printf(") "); |
732 | printEnvironment(); |
733 | // printf("\n"); |
734 | } |
735 | return; |
736 | } |
737 | } |
738 | void startSystem(void) |
739 | { |
740 | |
741 | { |
742 | systemActive = 1; |
743 | return; |
744 | } |
745 | } |
746 | #pragma merger(0,"Specification3_spec.i","") |
747 | void __utac_acc__Specification3_spec__1(void) |
748 | { int tmp ; |
749 | int tmp___0 ; |
750 | int tmp___1 ; |
751 | |
752 | { |
753 | { |
754 | tmp = isMethaneLevelCritical(); |
755 | } |
756 | if (tmp != 0) { |
757 | |
758 | } else { |
759 | { |
760 | tmp___0 = getWaterLevel(); |
761 | } |
762 | if (tmp___0 == 2) { |
763 | { |
764 | tmp___1 = isPumpRunning(); |
765 | } |
766 | if (tmp___1 != 0) { |
767 | |
768 | } else { |
769 | { |
770 | __automaton_fail(); |
771 | } |
772 | } |
773 | } else { |
774 | |
775 | } |
776 | } |
777 | return; |
778 | } |
779 | } |
780 | #pragma merger(0,"Test.i","") |
781 | int cleanupTimeShifts = 4; |
782 | void cleanup(void) |
783 | { int i ; |
784 | int __cil_tmp2 ; |
785 | |
786 | { |
787 | { |
788 | timeShift(); |
789 | i = 0; |
790 | } |
791 | { |
792 | while (1) { |
793 | while_4_continue: /* CIL Label */ ; |
794 | { |
795 | __cil_tmp2 = cleanupTimeShifts - 1; |
796 | if (i < __cil_tmp2) { |
797 | |
798 | } else { |
799 | goto while_4_break; |
800 | } |
801 | } |
802 | { |
803 | timeShift(); |
804 | i = i + 1; |
805 | } |
806 | } |
807 | while_4_break: /* CIL Label */ ; |
808 | } |
809 | return; |
810 | } |
811 | } |
812 | void Specification2(void) |
813 | { |
814 | |
815 | { |
816 | { |
817 | timeShift(); |
818 | printPump(); |
819 | timeShift(); |
820 | printPump(); |
821 | timeShift(); |
822 | printPump(); |
823 | waterRise(); |
824 | printPump(); |
825 | timeShift(); |
826 | printPump(); |
827 | changeMethaneLevel(); |
828 | printPump(); |
829 | timeShift(); |
830 | printPump(); |
831 | cleanup(); |
832 | } |
833 | return; |
834 | } |
835 | } |
836 | void setup(void) |
837 | { |
838 | |
839 | { |
840 | return; |
841 | } |
842 | } |
843 | void runTest(void) |
844 | { |
845 | |
846 | { |
847 | { |
848 | test(); |
849 | } |
850 | return; |
851 | } |
852 | } |
853 | int main(void) |
854 | {initialize_reads(); int retValue_acc ; |
855 | int tmp ; |
856 | |
857 | { |
858 | { |
859 | select_helpers(); |
860 | select_features(); |
861 | tmp = valid_product(); |
862 | } |
863 | if (tmp != 0) { |
864 | { |
865 | setup(); |
866 | runTest(); |
867 | } |
868 | } else { |
869 | |
870 | } |
871 | retValue_acc = 0; |
872 | return (retValue_acc); |
873 | return (retValue_acc); |
874 | } |
875 | } |
2017-05-11 14:50:26:399 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:50:26:525 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 14:50:28:323 INFO CFACreationUtils.addEdgeToCFA line 51: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:326 INFO CFACreationUtils.addEdgeToCFA line 74: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:334 INFO CFACreationUtils.addEdgeToCFA line 128: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:336 INFO CFACreationUtils.addEdgeToCFA line 160: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:505 INFO CFACreationUtils.addEdgeToCFA line 489: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:528 INFO CFACreationUtils.addEdgeToCFA line 535: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:595 INFO CFACreationUtils.addEdgeToCFA line 690: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:597 INFO CFACreationUtils.addEdgeToCFA line 699: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:627 INFO CFACreationUtils.addEdgeToCFA line 873: Dead code detected: return (retValue_acc);
2017-05-11 14:50:28:812 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 326: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 14:50:30:483 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 14:50:30:508 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:50:30:555 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:50:30:877 WARNING Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:50:31:700 INFO Parallel analysis 1:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:50:31:820 WARNING Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:50:32:001 WARNING Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:50:32:436 WARNING Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:50:32:440 INFO Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:50:32:463 WARNING Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:50:32:490 WARNING Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:50:32:935 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:50:36:182 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 14:50:36:183 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:50:36:183 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:37:150 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:50:37:175 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:50:38:062 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:50:39:323 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 14:50:39:324 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:50:39:324 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:42:230 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 14:50:42:247 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:50:42:248 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:44:784 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 14:50:44:826 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:50:44:826 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:46:610 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 14:50:46:611 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:50:46:611 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:47:871 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 14:50:47:894 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:50:47:894 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:57:527 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:51:00:017 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 14:51:00:020 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:51:00:034 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:51:00:036 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:51:00:129 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:51:03:714 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:51:06:835 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 14:51:06:846 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:51:06:870 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:51:06:890 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:51:07:125 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:51:13:067 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:51:15:833 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 40
2017-05-11 14:51:15:833 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:51:15:833 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:51:26:449 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 14:51:26:450 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:51:26:464 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:51:26:467 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:51:26:631 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:51:31:899 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:51:33:760 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 14:51:33:761 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:51:33:761 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:51:46:137 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 5
2017-05-11 14:51:46:138 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:51:46:148 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:51:46:149 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:51:46:348 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:51:50:623 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 56
2017-05-11 14:51:50:624 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@25cf84ad
2017-05-11 14:51:50:624 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:51:52:945 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:52:09:997 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 6
2017-05-11 14:52:09:998 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:52:10:009 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:52:10:010 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:52:10:224 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:52:16:797 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:52:32:452 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 7
2017-05-11 14:52:32:457 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:52:32:472 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:52:32:473 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:52:32:710 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:52:39:472 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:53:04:039 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 8
2017-05-11 14:53:04:039 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:53:04:050 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:53:04:051 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:53:04:390 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:53:11:956 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:53:52:198 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 9
2017-05-11 14:53:52:200 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:53:52:216 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:53:52:217 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:53:52:538 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:53:58:878 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:54:29:214 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 10
2017-05-11 14:54:29:214 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:54:29:229 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:54:29:233 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:54:29:674 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:54:52:056 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:57:21:432 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 11
2017-05-11 14:57:21:432 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:57:22:210 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:57:43:405 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 14:57:50:677 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:51:210 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 14:57:51:210 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:51:674 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 14:57:51:674 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:52:112 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:52:113 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:52:584 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:52:585 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:53:252 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:53:252 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:53:783 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:53:784 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:54:493 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:54:493 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:55:814 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:55:814 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:56:944 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:56:944 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:57:840 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:57:57:840 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:57:58:773 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 14:57:58:777 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 14:57:58:781 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 14:57:58:782 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: 11 (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: 11 (100%)
Times precision was empty: 11 (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: 456
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 713
Number of predicates discovered: 0
Time for post operator: 3.789s
Time for path formula creation: 3.784s
Time for strengthen operator: 0.007s
Time for prec operator: 0.003s
Time for abstraction: 0.000s (Max: 0.000s, Count: 11)
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.077s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 3200
Number of created targets for uf: *signed_int is 801
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 11
Maximum loop iteration reached: 12
ValueAnalysisCPA statistics
---------------------------
Number of variables: 32772 (count: 1881, min: 0, max: 27, avg: 17.42)
Number of global variables: 21535 (count: 1881, min: 0, max: 15, avg: 11.45)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 2118
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.034s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 46
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 838
Number of deterministic Assumptions: 250
Level of Determinism: 30%
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: 2118 (count: 2129, min: 0, max: 1, avg: 0.99) [0 x 11, 1 x 2118]
CPA algorithm statistics
------------------------
Number of iterations: 1901
Max size of waitlist: 8
Average size of waitlist: 2
Number of computed successors: 2118
Max successors for one state: 2
Number of times merged: 228
Number of times stopped: 228
Number of times breaked: 0
Total time for CPA algorithm: 5.061s (Max: 4.171s)
Time for choose from waitlist: 0.002s
Time for precision adjustment: 0.121s
Time for transfer relation: 4.752s
Time for merge operator: 0.120s
Time for stop operator: 0.009s
Time for adding to reached set: 0.011s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 5.070s
Time for final sat check: 21.197s
Time for error path creation: 4.846s
Time for bounding assertions check: 2.853s
Time for induction formula creation: 90.291s
Time for induction check: 310.159s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 8 (800%)
Time for counterexample checks: 8.096s
Time for running CBMC: 7.750s
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.647s
Time for transition matches: 0.307s
Time for transition assertions: 0.002s
Time for transition actions: 0.000s
Automaton transfers with branching: 0
Automaton transfer successors: 89854 (count: 90242, min: 0, max: 1, avg: 1.00) [0 x 388, 1 x 89854]
CPA algorithm statistics
------------------------
Number of iterations: 84099
Max size of waitlist: 223
Average size of waitlist: 101
Number of computed successors: 89854
Max successors for one state: 2
Number of times merged: 17127
Number of times stopped: 18350
Number of times breaked: 0
Total time for CPA algorithm: 444.618s (Max: 368.122s)
Time for choose from waitlist: 0.249s
Time for precision adjustment: 1.503s
Time for transfer relation: 20.876s
Time for merge operator: 404.091s
Time for stop operator: 15.804s
Time for adding to reached set: 0.636s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.529
Visited lines: 84
Total lines: 394
Line coverage: 0.213
Visited conditions: 73
Total conditions: 114
Condition coverage: 0.640
CPAchecker general statistics
-----------------------------
Number of program locations: 662
Number of CFA edges: 766
Number of relevant variables: 142
Number of functions: 34
Number of loops: 9
Size of reached set: 1881
Number of reached locations: 275 (42%)
Avg states per location: 6
Max states per location: 12 (at node N444)
Number of reached functions: 18 (53%)
Number of partitions: 1881
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 11
Time for analysis setup: 3.919s
Time for loading CPAs: 1.106s
Time for loading parser: 0.742s
Time for CFA construction: 1.975s
Time for parsing file(s): 0.474s
Time for AST to CFA: 0.643s
Time for CFA sanity check: 0.156s
Time for post-processing: 0.558s
Time for var class.: 0.336s
Time for CFA export: 0.997s
Time for Analysis: 448.295s
CPU time for analysis: 884.080s
Time for analyzing result: 0.001s
Total time for CPAchecker: 452.230s
Total CPU time for CPAchecker: 890.930s
Time for statistics: 10.231s
Time for Garbage Collector: 34.153s (in 346 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 662MB ( 632 MiB) max; 359MB ( 342 MiB) avg; 684MB ( 653 MiB) peak
Used non-heap memory: 54MB ( 51 MiB) max; 51MB ( 48 MiB) avg; 61MB ( 58 MiB) peak
Used in PS Old Gen pool: 249MB ( 237 MiB) max; 161MB ( 153 MiB) avg; 250MB ( 238 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 980MB ( 934 MiB) avg
Allocated non-heap memory: 56MB ( 53 MiB) max; 54MB ( 51 MiB) avg
Total process virtual memory: 7900MB ( 7534 MiB) max; 7048MB ( 6721 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product10_false-unreach-call_false-termination.cil/minepump_spec3_product10_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_product10_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