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