Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product54_false-unreach-call_false-termination.cil/minepump_spec1_product54_false-unreach-call_false-termination.cil.over.instr.c (Counterexample 1)

Generated on 2017-05-11 17:05:03 by CPAchecker 1.6.1-svn

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_163 = 4; int INPUTS_at_163[4]; int input_at_163_counter = 0;int num_of_inputs_at_183 = 4; int INPUTS_at_183[4]; int input_at_183_counter = 0;int num_of_inputs_at_173 = 4; int INPUTS_at_173[4]; int input_at_173_counter = 0;int num_of_inputs_at_191 = 2; int INPUTS_at_191[2]; int input_at_191_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_163[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_183[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_173[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_191[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
extern int __VERIFIER_nondet_int(void);  
4
//extern int printf (__const char *__restrict __format, ...);  
5
/* Generated by CIL v. 1.3.7 */  
6
/* print_CIL_Input is true */  
7
  
8
struct JoinPoint {  
9
   void **(*fp)(struct JoinPoint * ) ;  
10
   void **args ;  
11
   int argsCount ;  
12
   char const   **argsType ;  
13
   void *(*arg)(int  , struct JoinPoint * ) ;  
14
   char const   *(*argType)(int  , struct JoinPoint * ) ;  
15
   void **retValue ;  
16
   char const   *retType ;  
17
   char const   *funcName ;  
18
   char const   *targetName ;  
19
   char const   *fileName ;  
20
   char const   *kind ;  
21
   void *excep_return ;  
22
};  
23
struct __UTAC__CFLOW_FUNC {  
24
   int (*func)(int  , int  ) ;  
25
   int val ;  
26
   struct __UTAC__CFLOW_FUNC *next ;  
27
};  
28
struct __UTAC__EXCEPTION {  
29
   void *jumpbuf ;  
30
   unsigned long long prtValue ;  
31
   int pops ;  
32
   struct __UTAC__CFLOW_FUNC *cflowfuncs ;  
33
};  
34
typedef unsigned int size_t;  
35
struct __ACC__ERR {  
36
   void *v ;  
37
   struct __ACC__ERR *next ;  
38
};  
39
#pragma merger(0,"Test.i","")  
40
int cleanupTimeShifts  =    4;  
41
void timeShift(void) ;  
42
void cleanup(void)   
43
{ int i ;  
44
  int __cil_tmp2 ;  
45
  
46
  {  
47
  {  
48
  timeShift();  
49
  i = 0;  
50
  }  
51
  {  
52
  while (1) {  
53
    while_0_continue: /* CIL Label */ ;  
54
    {  
55
    __cil_tmp2 = cleanupTimeShifts - 1;  
56
    if (i < __cil_tmp2) {  
57
  
58
    } else {  
59
      goto while_0_break;  
60
    }  
61
    }  
62
    {  
63
    timeShift();  
64
    i = i + 1;  
65
    }  
66
  }  
67
  while_0_break: /* CIL Label */ ;  
68
  }  
69
  return;  
70
}  
71
}  
72
void printPump(void) ;  
73
void waterRise(void) ;  
74
void changeMethaneLevel(void) ;  
75
void Specification2(void)   
76
{   
77
  
78
  {  
79
  {  
80
  timeShift();  
81
  printPump();  
82
  timeShift();  
83
  printPump();  
84
  timeShift();  
85
  printPump();  
86
  waterRise();  
87
  printPump();  
88
  timeShift();  
89
  printPump();  
90
  changeMethaneLevel();  
91
  printPump();  
92
  timeShift();  
93
  printPump();  
94
  cleanup();  
95
  }  
96
  return;  
97
}  
98
}  
99
void setup(void)   
100
{   
101
  
102
  {  
103
  return;  
104
}  
105
}  
106
void test(void) ;  
107
void runTest(void)   
108
{   
109
  
110
  {  
111
  {  
112
  test();  
113
  }  
114
  return;  
115
}  
116
}  
117
void select_helpers(void) ;  
118
void select_features(void) ;  
119
int valid_product(void) ;  
120
int main(void)   
121
{initialize_reads(); int retValue_acc ;  
122
  int tmp ;  
123
  
124
  {  
125
  {  
126
  select_helpers();  
127
  select_features();  
128
  tmp = valid_product();  
129
  }  
130
  if (tmp != 0) {  
131
    {  
132
    setup();  
133
    runTest();  
134
    }  
135
  } else {  
136
  
137
  }  
138
  retValue_acc = 0;  
139
  return (retValue_acc);  
140
  return (retValue_acc);  
141
}  
142
}  
143
#pragma merger(0,"scenario.i","")  
144
void startSystem(void) ;  
145
void test(void)   
146
{ int splverifierCounter ;  
147
  int tmp ;  
148
  int tmp___0 ;  
149
  int tmp___1 ;  
150
  int tmp___2 ;  
151
  
152
  {  
153
  splverifierCounter = 0;  
154
  {  
155
  while (1) {  
156
    while_1_continue: /* CIL Label */ ;  
157
    if (splverifierCounter < 4) {  
158
  
159
    } else {  
160
      goto while_1_break;  
161
    }  
162
    {  
163
    tmp = (input_at_163_counter < num_of_inputs_at_163) ? INPUTS_at_163[input_at_163_counter++] : __VERIFIER_nondet_int() ;  
164
    }  
165
    if (tmp != 0) {  
166
      {  
167
      waterRise();  
168
      }  
169
    } else {  
170
  
171
    }  
172
    {  
173
    tmp___0 = (input_at_173_counter < num_of_inputs_at_173) ? INPUTS_at_173[input_at_173_counter++] : __VERIFIER_nondet_int() ;  
174
    }  
175
    if (tmp___0 != 0) {  
176
      {  
177
      changeMethaneLevel();  
178
      }  
179
    } else {  
180
  
181
    }  
182
    {  
183
    tmp___2 = (input_at_183_counter < num_of_inputs_at_183) ? INPUTS_at_183[input_at_183_counter++] : __VERIFIER_nondet_int() ;  
184
    }  
185
    if (tmp___2 != 0) {  
186
      {  
187
      startSystem();  
188
      }  
189
    } else {  
190
      {  
191
      tmp___1 = (input_at_191_counter < num_of_inputs_at_191) ? INPUTS_at_191[input_at_191_counter++] : __VERIFIER_nondet_int() ;  
192
      }  
193
      if (tmp___1 != 0) {  
194
  
195
      } else {  
196
  
197
      }  
198
    }  
199
    {  
200
    timeShift();  
201
    }  
202
  }  
203
  while_1_break: /* CIL Label */ ;  
204
  }  
205
  {  
206
  cleanup();  
207
  }  
208
  return;  
209
}  
210
}  
211
#pragma merger(0,"wsllib_check.i","")  
212
void __automaton_fail(void)   
213
{   
214
  
215
  {  
216
  __VERIFIER_assume(!((0 != INPUTS_at_163[0] && 0 == INPUTS_at_183[0])));__VERIFIER_assume(!((0 != INPUTS_at_163[0] && 0 != INPUTS_at_173[0])));__VERIFIER_assume(!((0 != INPUTS_at_163[1] && 0 == INPUTS_at_163[0] && 0 == INPUTS_at_183[0] && 0 != INPUTS_at_183[1] && 0 != INPUTS_at_173[0])));__VERIFIER_assume(!((0 != INPUTS_at_183[0])));__VERIFIER_assume(!((0 == INPUTS_at_191[0])));__VERIFIER_assume(!((0 != INPUTS_at_173[1])));__VERIFIER_assume(!((0 == INPUTS_at_163[1])));__VERIFIER_assume(!((0 == INPUTS_at_163[1])));__VERIFIER_error();  
217
  return;  
218
}  
219
}  
220
#pragma merger(0,"MinePump.i","")  
221
void lowerWaterLevel(void) ;  
222
int isMethaneLevelCritical(void) ;  
223
void printEnvironment(void) ;  
224
int isHighWaterSensorDry(void) ;  
225
int isLowWaterSensorDry(void) ;  
226
void activatePump(void) ;  
227
void deactivatePump(void) ;  
228
int isPumpRunning(void) ;  
229
int pumpRunning  =    0;  
230
int systemActive  =    1;  
231
void __utac_acc__Specification1_spec__1(void) ;  
232
void processEnvironment(void) ;  
233
void timeShift(void)   
234
{   
235
  
236
  {  
237
  if (pumpRunning != 0) {  
238
    {  
239
    lowerWaterLevel();  
240
    }  
241
  } else {  
242
  
243
  }  
244
  if (systemActive != 0) {  
245
    {  
246
    processEnvironment();  
247
    }  
248
  } else {  
249
  
250
  }  
251
  {  
252
  __utac_acc__Specification1_spec__1();  
253
  }  
254
  return;  
255
}  
256
}  
257
void processEnvironment__wrappee__base(void)   
258
{   
259
  
260
  {  
261
  return;  
262
}  
263
}  
264
int isHighWaterLevel(void) ;  
265
void processEnvironment__wrappee__highWaterSensor(void)   
266
{ int tmp ;  
267
  
268
  {  
269
  if (! pumpRunning) {  
270
    {  
271
    tmp = isHighWaterLevel();  
272
    }  
273
    if (tmp != 0) {  
274
      {  
275
      activatePump();  
276
      }  
277
    } else {  
278
      {  
279
      processEnvironment__wrappee__base();  
280
      }  
281
    }  
282
  } else {  
283
    {  
284
    processEnvironment__wrappee__base();  
285
    }  
286
  }  
287
  return;  
288
}  
289
}  
290
int isLowWaterLevel(void) ;  
291
void processEnvironment__wrappee__lowWaterSensor(void)   
292
{ int tmp ;  
293
  
294
  {  
295
  if (pumpRunning != 0) {  
296
    {  
297
    tmp = isLowWaterLevel();  
298
    }  
299
    if (tmp != 0) {  
300
      {  
301
      deactivatePump();  
302
      }  
303
    } else {  
304
      {  
305
      processEnvironment__wrappee__highWaterSensor();  
306
      }  
307
    }  
308
  } else {  
309
    {  
310
    processEnvironment__wrappee__highWaterSensor();  
311
    }  
312
  }  
313
  return;  
314
}  
315
}  
316
int isMethaneAlarm(void) ;  
317
void processEnvironment(void)   
318
{ int tmp ;  
319
  
320
  {  
321
  if (pumpRunning != 0) {  
322
    {  
323
    tmp = isMethaneAlarm();  
324
    }  
325
    if (tmp != 0) {  
326
      {  
327
      deactivatePump();  
328
      }  
329
    } else {  
330
      {  
331
      processEnvironment__wrappee__lowWaterSensor();  
332
      }  
333
    }  
334
  } else {  
335
    {  
336
    processEnvironment__wrappee__lowWaterSensor();  
337
    }  
338
  }  
339
  return;  
340
}  
341
}  
342
void activatePump(void)   
343
{   
344
  
345
  {  
346
  pumpRunning = 1;  
347
  return;  
348
}  
349
}  
350
void deactivatePump(void)   
351
{   
352
  
353
  {  
354
  pumpRunning = 0;  
355
  return;  
356
}  
357
}  
358
int isMethaneAlarm(void)   
359
{ int retValue_acc ;  
360
  
361
  {  
362
  {  
363
  retValue_acc = isMethaneLevelCritical();  
364
  }  
365
  return (retValue_acc);  
366
  return (retValue_acc);  
367
}  
368
}  
369
int isPumpRunning(void)   
370
{ int retValue_acc ;  
371
  
372
  {  
373
  retValue_acc = pumpRunning;  
374
  return (retValue_acc);  
375
  return (retValue_acc);  
376
}  
377
}  
378
void printPump(void)   
379
{   
380
  
381
  {  
382
  {  
383
//  printf("Pump(System:");  
384
  }  
385
  if (systemActive != 0) {  
386
    {  
387
//    printf("On");  
388
    }  
389
  } else {  
390
    {  
391
//    printf("Off");  
392
    }  
393
  }  
394
  {  
395
//  printf(",Pump:");  
396
  }  
397
  if (pumpRunning != 0) {  
398
    {  
399
//    printf("On");  
400
    }  
401
  } else {  
402
    {  
403
//    printf("Off");  
404
    }  
405
  }  
406
  {  
407
//  printf(") ");  
408
  printEnvironment();  
409
//  printf("\n");  
410
  }  
411
  return;  
412
}  
413
}  
414
int isHighWaterLevel(void)   
415
{ int retValue_acc ;  
416
  int tmp ;  
417
  int tmp___0 ;  
418
  
419
  {  
420
  {  
421
  tmp = isHighWaterSensorDry();  
422
  }  
423
  if (tmp != 0) {  
424
    tmp___0 = 0;  
425
  } else {  
426
    tmp___0 = 1;  
427
  }  
428
  retValue_acc = tmp___0;  
429
  return (retValue_acc);  
430
  return (retValue_acc);  
431
}  
432
}  
433
int isLowWaterLevel(void)   
434
{ int retValue_acc ;  
435
  int tmp ;  
436
  int tmp___0 ;  
437
  
438
  {  
439
  {  
440
  tmp = isLowWaterSensorDry();  
441
  }  
442
  if (tmp != 0) {  
443
    tmp___0 = 0;  
444
  } else {  
445
    tmp___0 = 1;  
446
  }  
447
  retValue_acc = tmp___0;  
448
  return (retValue_acc);  
449
  return (retValue_acc);  
450
}  
451
}  
452
void startSystem(void)   
453
{   
454
  
455
  {  
456
  systemActive = 1;  
457
  return;  
458
}  
459
}  
460
#pragma merger(0,"featureselect.i","")  
461
int select_one(void) ;  
462
int select_one(void)   
463
{ int retValue_acc ;  
464
  int choice = __VERIFIER_nondet_int();  
465
  
466
  {  
467
  retValue_acc = choice;  
468
  return (retValue_acc);  
469
  return (retValue_acc);  
470
}  
471
}  
472
void select_features(void)   
473
{   
474
  
475
  {  
476
  return;  
477
}  
478
}  
479
void select_helpers(void)   
480
{   
481
  
482
  {  
483
  return;  
484
}  
485
}  
486
int valid_product(void)   
487
{ int retValue_acc ;  
488
  
489
  {  
490
  retValue_acc = 1;  
491
  return (retValue_acc);  
492
  return (retValue_acc);  
493
}  
494
}  
495
#pragma merger(0,"Specification1_spec.i","")  
496
void __utac_acc__Specification1_spec__1(void)   
497
{ int tmp ;  
498
  int tmp___0 ;  
499
  
500
  {  
501
  {  
502
  tmp = isMethaneLevelCritical();  
503
  }  
504
  if (tmp != 0) {  
505
    {  
506
    tmp___0 = isPumpRunning();  
507
    }  
508
    if (tmp___0 != 0) {  
509
      {  
510
      __automaton_fail();  
511
      }  
512
    } else {  
513
  
514
    }  
515
  } else {  
516
  
517
  }  
518
  return;  
519
}  
520
}  
521
#pragma merger(0,"libacc.i","")  
522
extern  __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const   *__assertion ,  
523
                                                                      char const   *__file ,  
524
                                                                      unsigned int __line ,  
525
                                                                      char const   *__function ) ;  
526
extern  __attribute__((__nothrow__)) void *malloc(size_t __size )  __attribute__((__malloc__)) ;  
527
extern  __attribute__((__nothrow__)) void free(void *__ptr ) ;  
528
void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int  ,  
529
                                                                           int  ) ,  
530
                                       int val )   
531
{ struct __UTAC__EXCEPTION *excep ;  
532
  struct __UTAC__CFLOW_FUNC *cf ;  
533
  void *tmp ;  
534
  unsigned long __cil_tmp7 ;  
535
  unsigned long __cil_tmp8 ;  
536
  unsigned long __cil_tmp9 ;  
537
  unsigned long __cil_tmp10 ;  
538
  unsigned long __cil_tmp11 ;  
539
  unsigned long __cil_tmp12 ;  
540
  unsigned long __cil_tmp13 ;  
541
  unsigned long __cil_tmp14 ;  
542
  int (**mem_15)(int  , int  ) ;  
543
  int *mem_16 ;  
544
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
545
  struct __UTAC__CFLOW_FUNC **mem_18 ;  
546
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
547
  
548
  {  
549
  {  
550
  excep = (struct __UTAC__EXCEPTION *)exception;  
551
  tmp = malloc(24UL);  
552
  cf = (struct __UTAC__CFLOW_FUNC *)tmp;  
553
  mem_15 = (int (**)(int  , int  ))cf;  
554
  *mem_15 = cflow_func;  
555
  __cil_tmp7 = (unsigned long )cf;  
556
  __cil_tmp8 = __cil_tmp7 + 8;  
557
  mem_16 = (int *)__cil_tmp8;  
558
  *mem_16 = val;  
559
  __cil_tmp9 = (unsigned long )cf;  
560
  __cil_tmp10 = __cil_tmp9 + 16;  
561
  __cil_tmp11 = (unsigned long )excep;  
562
  __cil_tmp12 = __cil_tmp11 + 24;  
563
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10;  
564
  mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12;  
565
  *mem_17 = *mem_18;  
566
  __cil_tmp13 = (unsigned long )excep;  
567
  __cil_tmp14 = __cil_tmp13 + 24;  
568
  mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
569
  *mem_19 = cf;  
570
  }  
571
  return;  
572
}  
573
}  
574
void __utac__exception__cf_handler_free(void *exception )   
575
{ struct __UTAC__EXCEPTION *excep ;  
576
  struct __UTAC__CFLOW_FUNC *cf ;  
577
  struct __UTAC__CFLOW_FUNC *tmp ;  
578
  unsigned long __cil_tmp5 ;  
579
  unsigned long __cil_tmp6 ;  
580
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
581
  unsigned long __cil_tmp8 ;  
582
  unsigned long __cil_tmp9 ;  
583
  unsigned long __cil_tmp10 ;  
584
  unsigned long __cil_tmp11 ;  
585
  void *__cil_tmp12 ;  
586
  unsigned long __cil_tmp13 ;  
587
  unsigned long __cil_tmp14 ;  
588
  struct __UTAC__CFLOW_FUNC **mem_15 ;  
589
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
590
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
591
  
592
  {  
593
  excep = (struct __UTAC__EXCEPTION *)exception;  
594
  __cil_tmp5 = (unsigned long )excep;  
595
  __cil_tmp6 = __cil_tmp5 + 24;  
596
  mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
597
  cf = *mem_15;  
598
  {  
599
  while (1) {  
600
    while_2_continue: /* CIL Label */ ;  
601
    {  
602
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
603
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
604
    __cil_tmp9 = (unsigned long )cf;  
605
    if (__cil_tmp9 != __cil_tmp8) {  
606
  
607
    } else {  
608
      goto while_2_break;  
609
    }  
610
    }  
611
    {  
612
    tmp = cf;  
613
    __cil_tmp10 = (unsigned long )cf;  
614
    __cil_tmp11 = __cil_tmp10 + 16;  
615
    mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11;  
616
    cf = *mem_16;  
617
    __cil_tmp12 = (void *)tmp;  
618
    free(__cil_tmp12);  
619
    }  
620
  }  
621
  while_2_break: /* CIL Label */ ;  
622
  }  
623
  __cil_tmp13 = (unsigned long )excep;  
624
  __cil_tmp14 = __cil_tmp13 + 24;  
625
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
626
  *mem_17 = (struct __UTAC__CFLOW_FUNC *)0;  
627
  return;  
628
}  
629
}  
630
void __utac__exception__cf_handler_reset(void *exception )   
631
{ struct __UTAC__EXCEPTION *excep ;  
632
  struct __UTAC__CFLOW_FUNC *cf ;  
633
  unsigned long __cil_tmp5 ;  
634
  unsigned long __cil_tmp6 ;  
635
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
636
  unsigned long __cil_tmp8 ;  
637
  unsigned long __cil_tmp9 ;  
638
  int (*__cil_tmp10)(int  , int  ) ;  
639
  unsigned long __cil_tmp11 ;  
640
  unsigned long __cil_tmp12 ;  
641
  int __cil_tmp13 ;  
642
  unsigned long __cil_tmp14 ;  
643
  unsigned long __cil_tmp15 ;  
644
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
645
  int (**mem_17)(int  , int  ) ;  
646
  int *mem_18 ;  
647
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
648
  
649
  {  
650
  excep = (struct __UTAC__EXCEPTION *)exception;  
651
  __cil_tmp5 = (unsigned long )excep;  
652
  __cil_tmp6 = __cil_tmp5 + 24;  
653
  mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
654
  cf = *mem_16;  
655
  {  
656
  while (1) {  
657
    while_3_continue: /* CIL Label */ ;  
658
    {  
659
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
660
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
661
    __cil_tmp9 = (unsigned long )cf;  
662
    if (__cil_tmp9 != __cil_tmp8) {  
663
  
664
    } else {  
665
      goto while_3_break;  
666
    }  
667
    }  
668
    {  
669
    mem_17 = (int (**)(int  , int  ))cf;  
670
    __cil_tmp10 = *mem_17;  
671
    __cil_tmp11 = (unsigned long )cf;  
672
    __cil_tmp12 = __cil_tmp11 + 8;  
673
    mem_18 = (int *)__cil_tmp12;  
674
    __cil_tmp13 = *mem_18;  
675
    (*__cil_tmp10)(4, __cil_tmp13);  
676
    __cil_tmp14 = (unsigned long )cf;  
677
    __cil_tmp15 = __cil_tmp14 + 16;  
678
    mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15;  
679
    cf = *mem_19;  
680
    }  
681
  }  
682
  while_3_break: /* CIL Label */ ;  
683
  }  
684
  {  
685
  __utac__exception__cf_handler_free(exception);  
686
  }  
687
  return;  
688
}  
689
}  
690
void *__utac__error_stack_mgt(void *env , int mode , int count ) ;  
691
static struct __ACC__ERR *head  =    (struct __ACC__ERR *)0;  
692
void *__utac__error_stack_mgt(void *env , int mode , int count )   
693
{ void *retValue_acc ;  
694
  struct __ACC__ERR *new ;  
695
  void *tmp ;  
696
  struct __ACC__ERR *temp ;  
697
  struct __ACC__ERR *next ;  
698
  void *excep ;  
699
  unsigned long __cil_tmp10 ;  
700
  unsigned long __cil_tmp11 ;  
701
  unsigned long __cil_tmp12 ;  
702
  unsigned long __cil_tmp13 ;  
703
  void *__cil_tmp14 ;  
704
  unsigned long __cil_tmp15 ;  
705
  unsigned long __cil_tmp16 ;  
706
  void *__cil_tmp17 ;  
707
  void **mem_18 ;  
708
  struct __ACC__ERR **mem_19 ;  
709
  struct __ACC__ERR **mem_20 ;  
710
  void **mem_21 ;  
711
  struct __ACC__ERR **mem_22 ;  
712
  void **mem_23 ;  
713
  void **mem_24 ;  
714
  
715
  {  
716
  if (count == 0) {  
717
    return (retValue_acc);  
718
  } else {  
719
  
720
  }  
721
  if (mode == 0) {  
722
    {  
723
    tmp = malloc(16UL);  
724
    new = (struct __ACC__ERR *)tmp;  
725
    mem_18 = (void **)new;  
726
    *mem_18 = env;  
727
    __cil_tmp10 = (unsigned long )new;  
728
    __cil_tmp11 = __cil_tmp10 + 8;  
729
    mem_19 = (struct __ACC__ERR **)__cil_tmp11;  
730
    *mem_19 = head;  
731
    head = new;  
732
    retValue_acc = (void *)new;  
733
    }  
734
    return (retValue_acc);  
735
  } else {  
736
  
737
  }  
738
  if (mode == 1) {  
739
    temp = head;  
740
    {  
741
    while (1) {  
742
      while_4_continue: /* CIL Label */ ;  
743
      if (count > 1) {  
744
  
745
      } else {  
746
        goto while_4_break;  
747
      }  
748
      {  
749
      __cil_tmp12 = (unsigned long )temp;  
750
      __cil_tmp13 = __cil_tmp12 + 8;  
751
      mem_20 = (struct __ACC__ERR **)__cil_tmp13;  
752
      next = *mem_20;  
753
      mem_21 = (void **)temp;  
754
      excep = *mem_21;  
755
      __cil_tmp14 = (void *)temp;  
756
      free(__cil_tmp14);  
757
      __utac__exception__cf_handler_reset(excep);  
758
      temp = next;  
759
      count = count - 1;  
760
      }  
761
    }  
762
    while_4_break: /* CIL Label */ ;  
763
    }  
764
    {  
765
    __cil_tmp15 = (unsigned long )temp;  
766
    __cil_tmp16 = __cil_tmp15 + 8;  
767
    mem_22 = (struct __ACC__ERR **)__cil_tmp16;  
768
    head = *mem_22;  
769
    mem_23 = (void **)temp;  
770
    excep = *mem_23;  
771
    __cil_tmp17 = (void *)temp;  
772
    free(__cil_tmp17);  
773
    __utac__exception__cf_handler_reset(excep);  
774
    retValue_acc = excep;  
775
    }  
776
    return (retValue_acc);  
777
  } else {  
778
  
779
  }  
780
  if (mode == 2) {  
781
    if (head != 0) {  
782
      mem_24 = (void **)head;  
783
      retValue_acc = *mem_24;  
784
      return (retValue_acc);  
785
    } else {  
786
      retValue_acc = (void *)0;  
787
      return (retValue_acc);  
788
    }  
789
  } else {  
790
  
791
  }  
792
  return (retValue_acc);  
793
}  
794
}  
795
void *__utac__get_this_arg(int i , struct JoinPoint *this )   
796
{ void *retValue_acc ;  
797
  unsigned long __cil_tmp4 ;  
798
  unsigned long __cil_tmp5 ;  
799
  int __cil_tmp6 ;  
800
  int __cil_tmp7 ;  
801
  unsigned long __cil_tmp8 ;  
802
  unsigned long __cil_tmp9 ;  
803
  void **__cil_tmp10 ;  
804
  void **__cil_tmp11 ;  
805
  int *mem_12 ;  
806
  void ***mem_13 ;  
807
  
808
  {  
809
  if (i > 0) {  
810
    {  
811
    __cil_tmp4 = (unsigned long )this;  
812
    __cil_tmp5 = __cil_tmp4 + 16;  
813
    mem_12 = (int *)__cil_tmp5;  
814
    __cil_tmp6 = *mem_12;  
815
    if (i <= __cil_tmp6) {  
816
  
817
    } else {  
818
      {  
819
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
820
                    123U, "__utac__get_this_arg");  
821
      }  
822
    }  
823
    }  
824
  } else {  
825
    {  
826
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
827
                  123U, "__utac__get_this_arg");  
828
    }  
829
  }  
830
  __cil_tmp7 = i - 1;  
831
  __cil_tmp8 = (unsigned long )this;  
832
  __cil_tmp9 = __cil_tmp8 + 8;  
833
  mem_13 = (void ***)__cil_tmp9;  
834
  __cil_tmp10 = *mem_13;  
835
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
836
  retValue_acc = *__cil_tmp11;  
837
  return (retValue_acc);  
838
  return (retValue_acc);  
839
}  
840
}  
841
char const   *__utac__get_this_argtype(int i , struct JoinPoint *this )   
842
{ char const   *retValue_acc ;  
843
  unsigned long __cil_tmp4 ;  
844
  unsigned long __cil_tmp5 ;  
845
  int __cil_tmp6 ;  
846
  int __cil_tmp7 ;  
847
  unsigned long __cil_tmp8 ;  
848
  unsigned long __cil_tmp9 ;  
849
  char const   **__cil_tmp10 ;  
850
  char const   **__cil_tmp11 ;  
851
  int *mem_12 ;  
852
  char const   ***mem_13 ;  
853
  
854
  {  
855
  if (i > 0) {  
856
    {  
857
    __cil_tmp4 = (unsigned long )this;  
858
    __cil_tmp5 = __cil_tmp4 + 16;  
859
    mem_12 = (int *)__cil_tmp5;  
860
    __cil_tmp6 = *mem_12;  
861
    if (i <= __cil_tmp6) {  
862
  
863
    } else {  
864
      {  
865
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
866
                    131U, "__utac__get_this_argtype");  
867
      }  
868
    }  
869
    }  
870
  } else {  
871
    {  
872
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
873
                  131U, "__utac__get_this_argtype");  
874
    }  
875
  }  
876
  __cil_tmp7 = i - 1;  
877
  __cil_tmp8 = (unsigned long )this;  
878
  __cil_tmp9 = __cil_tmp8 + 24;  
879
  mem_13 = (char const   ***)__cil_tmp9;  
880
  __cil_tmp10 = *mem_13;  
881
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
882
  retValue_acc = *__cil_tmp11;  
883
  return (retValue_acc);  
884
  return (retValue_acc);  
885
}  
886
}  
887
#pragma merger(0,"Environment.i","")  
888
int getWaterLevel(void) ;  
889
int waterLevel  =    1;  
890
int methaneLevelCritical  =    0;  
891
void lowerWaterLevel(void)   
892
{   
893
  
894
  {  
895
  if (waterLevel > 0) {  
896
    waterLevel = waterLevel - 1;  
897
  } else {  
898
  
899
  }  
900
  return;  
901
}  
902
}  
903
void waterRise(void)   
904
{   
905
  
906
  {  
907
  if (waterLevel < 2) {  
908
    waterLevel = waterLevel + 1;  
909
  } else {  
910
  
911
  }  
912
  return;  
913
}  
914
}  
915
void changeMethaneLevel(void)   
916
{   
917
  
918
  {  
919
  if (methaneLevelCritical != 0) {  
920
    methaneLevelCritical = 0;  
921
  } else {  
922
    methaneLevelCritical = 1;  
923
  }  
924
  return;  
925
}  
926
}  
927
int isMethaneLevelCritical(void)   
928
{ int retValue_acc ;  
929
  
930
  {  
931
  retValue_acc = methaneLevelCritical;  
932
  return (retValue_acc);  
933
  return (retValue_acc);  
934
}  
935
}  
936
void printEnvironment(void)   
937
{   
938
  
939
  {  
940
  {  
941
//  printf("Env(Water:%i", waterLevel);  
942
//  printf(",Meth:");  
943
  }  
944
  if (methaneLevelCritical != 0) {  
945
    {  
946
//    printf("CRIT");  
947
    }  
948
  } else {  
949
    {  
950
//    printf("OK");  
951
    }  
952
  }  
953
  {  
954
//  printf(")");  
955
  }  
956
  return;  
957
}  
958
}  
959
int getWaterLevel(void)   
960
{ int retValue_acc ;  
961
  
962
  {  
963
  retValue_acc = waterLevel;  
964
  return (retValue_acc);  
965
  return (retValue_acc);  
966
}  
967
}  
968
int isHighWaterSensorDry(void)   
969
{ int retValue_acc ;  
970
  
971
  {  
972
  if (waterLevel < 2) {  
973
    retValue_acc = 1;  
974
    return (retValue_acc);  
975
  } else {  
976
    retValue_acc = 0;  
977
    return (retValue_acc);  
978
  }  
979
  return (retValue_acc);  
980
}  
981
}  
982
int isLowWaterSensorDry(void)   
983
{ int retValue_acc ;  
984
  
985
  {  
986
  retValue_acc = waterLevel == 0;  
987
  return (retValue_acc);  
988
  return (retValue_acc);  
989
}  
990
}  
2017-05-11 17:02:32:841	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 17:02:32:959	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 17:02:34:746	INFO	CFACreationUtils.addEdgeToCFA	line 140: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:803	INFO	CFACreationUtils.addEdgeToCFA	line 366: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:805	INFO	CFACreationUtils.addEdgeToCFA	line 375: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:808	INFO	CFACreationUtils.addEdgeToCFA	line 430: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:811	INFO	CFACreationUtils.addEdgeToCFA	line 449: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:813	INFO	CFACreationUtils.addEdgeToCFA	line 469: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:816	INFO	CFACreationUtils.addEdgeToCFA	line 492: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:900	INFO	CFACreationUtils.addEdgeToCFA	line 838: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:907	INFO	CFACreationUtils.addEdgeToCFA	line 884: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:914	INFO	CFACreationUtils.addEdgeToCFA	line 933: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:915	INFO	CFACreationUtils.addEdgeToCFA	line 965: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:917	INFO	CFACreationUtils.addEdgeToCFA	line 979: Dead code detected: return (retValue_acc);

2017-05-11 17:02:34:918	INFO	CFACreationUtils.addEdgeToCFA	line 988: Dead code detected: return (retValue_acc);

2017-05-11 17:02:35:102	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 675: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 17:02:37:511	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 17:02:37:609	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 17:02:37:747	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 17:02:38:170	WARNING	Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 17:02:38:958	INFO	Parallel analysis 1:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 17:02:39:118	WARNING	Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 17:02:39:431	WARNING	Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 17:02:39:908	WARNING	Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 17:02:39:911	INFO	Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 17:02:39:926	WARNING	Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 17:02:39:961	WARNING	Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 17:02:41:119	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 17:02:45:493	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 17:02:45:494	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:45:494	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:02:45:530	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 17:02:45:564	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 17:02:46:145	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 17:02:49:812	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 17:02:49:813	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:49:813	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:02:52:589	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 17:02:52:590	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:52:590	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:02:54:610	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 17:02:54:611	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:54:616	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:02:56:662	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 17:02:56:663	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:56:663	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:02:58:689	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 17:02:58:691	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:58:691	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:02:59:848	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 17:02:59:848	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:02:59:851	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:01:860	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 17:03:01:861	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:01:876	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:04:068	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 17

2017-05-11 17:03:04:074	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:04:082	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:06:269	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 19

2017-05-11 17:03:06:269	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:06:269	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:08:371	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 17:03:08:372	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:08:373	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:09:641	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 17:03:09:641	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:09:641	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:09:652	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 17:03:10:820	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

2017-05-11 17:03:10:820	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:10:820	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:15:027	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 17:03:15:029	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 17:03:15:042	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 17:03:15:047	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 17:03:15:074	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 17:03:24:151	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 17:03:29:508	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 17:03:29:508	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 17:03:29:516	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 17:03:29:516	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 17:03:29:556	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 17:03:34:637	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 17:03:40:309	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 55

2017-05-11 17:03:40:310	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:03:40:310	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:03:57:554	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 17:03:57:554	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 17:03:57:564	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 17:03:57:566	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 17:03:57:615	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 17:04:12:738	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 17:04:18:209	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 59

2017-05-11 17:04:18:210	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:04:18:210	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:04:50:444	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 17:04:50:446	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 17:04:50:890	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 17:04:53:361	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 17:04:55:672	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 17:04:56:022	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 17:04:56:022	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 17:04:56:156	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 61

2017-05-11 17:04:56:156	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44231278

2017-05-11 17:04:56:157	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:04:56:593	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 17:04:56:593	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 17:04:57:143	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 17:04:57:144	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 17:04:57:902	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 17:04:57:902	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 17:04:58:714	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 17:04:58:717	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 17:04:58:721	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 17:04:58:722	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:         306
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       529
Number of predicates discovered:          0

Time for post operator:                  3.449s
  Time for path formula creation:        3.445s
Time for strengthen operator:            0.025s
Time for prec operator:                  0.006s
  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.046s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 392
   Number of created targets for uf: *signed_int is 57



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:                                  27215 (count: 1705, min: 0, max: 21, avg: 15.96)
Number of global variables:                           18222 (count: 1705, min: 0, max: 14, avg: 10.69)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1861
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.084s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                51

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  522
Number of deterministic Assumptions:                    126
Level of Determinism:                              24%

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.008s
Automaton transfers with branching:                0
Automaton transfer successors:                         1861 (count: 1866, min: 0, max: 1, avg: 1.00) [0 x 5, 1 x 1861]

CPA algorithm statistics
------------------------
Number of iterations:            1713
Max size of waitlist:            11
Average size of waitlist:        3
Number of computed successors:   1861
Max successors for one state:    2
Number of times merged:          153
Number of times stopped:         153
Number of times breaked:         0

Total time for CPA algorithm:         4.847s (Max:     4.384s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.152s
  Time for transfer relation:         4.522s
  Time for merge operator:            0.076s
  Time for stop operator:             0.056s
  Time for adding to reached set:     0.014s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.871s
Time for final sat check:                2.472s
Time for error path creation:            1.998s
Time for bounding assertions check:      0.273s
Time for induction formula creation:    52.726s
Time for induction check:               71.298s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         4 (400%)
Time for counterexample checks:         3.043s
Time for running CBMC:                  2.774s


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.603s
  Time for transition matches:                         0.299s
  Time for transition assertions:                      0.001s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       116480 (count: 116707, min: 0, max: 1, avg: 1.00) [0 x 227, 1 x 116480]

CPA algorithm statistics
------------------------
Number of iterations:            111723
Max size of waitlist:            288
Average size of waitlist:        100
Number of computed successors:   116480
Max successors for one state:    2
Number of times merged:          15676
Number of times stopped:         17340
Number of times breaked:         0

Total time for CPA algorithm:       135.929s (Max:    37.856s)
  Time for choose from waitlist:      0.511s
  Time for precision adjustment:      1.796s
  Time for transfer relation:        25.297s
  Time for merge operator:           99.232s
  Time for stop operator:             6.936s
  Time for adding to reached set:     0.770s


Other statistics
================

Code Coverage
-----------------------------
  Function coverage:      0.700
  Visited lines:          140
  Total lines:            437
  Line coverage:          0.320
  Visited conditions:     91
  Total conditions:       126
  Condition coverage:     0.722

CPAchecker general statistics
-----------------------------
Number of program locations:     732
Number of CFA edges:             855
Number of relevant variables:    154
Number of functions:             40
Number of loops:                 9
Size of reached set:             1705
  Number of reached locations:   373 (51%)
    Avg states per location:     4
    Max states per location:     17 (at node N202)
  Number of reached functions:   28 (70%)
  Number of partitions:          1705
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       5

Time for analysis setup:          4.508s
  Time for loading CPAs:          1.834s
  Time for loading parser:        0.681s
  Time for CFA construction:      1.842s
    Time for parsing file(s):     0.497s
    Time for AST to CFA:          0.575s
    Time for CFA sanity check:    0.180s
    Time for post-processing:     0.494s
      Time for var class.:        0.268s
    Time for CFA export:          1.444s
Time for Analysis:              141.203s
CPU time for analysis:          278.130s
Time for analyzing result:        0.001s
Total time for CPAchecker:      145.736s
Total CPU time for CPAchecker:  286.030s
Time for statistics:              4.667s

Time for Garbage Collector:      11.831s (in 107 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                584MB (   557 MiB) max;    273MB (   260 MiB) avg;    611MB (   583 MiB) peak
Used non-heap memory:             53MB (    51 MiB) max;     49MB (    47 MiB) avg;     59MB (    57 MiB) peak
Used in PS Old Gen pool:         180MB (   172 MiB) max;     82MB (    78 MiB) avg;    183MB (   174 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    959MB (   915 MiB) avg
Allocated non-heap memory:        56MB (    53 MiB) max;     52MB (    49 MiB) avg
Total process virtual memory:   6869MB (  6551 MiB) max;   6505MB (  6203 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product54_false-unreach-call_false-termination.cil/minepump_spec1_product54_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product54_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