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

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

2017-05-11 22:25:58:674	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 22:26:00:457	INFO	CFACreationUtils.addEdgeToCFA	line 208: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:459	INFO	CFACreationUtils.addEdgeToCFA	line 217: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:462	INFO	CFACreationUtils.addEdgeToCFA	line 272: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:473	INFO	CFACreationUtils.addEdgeToCFA	line 394: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:475	INFO	CFACreationUtils.addEdgeToCFA	line 406: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:477	INFO	CFACreationUtils.addEdgeToCFA	line 429: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:563	INFO	CFACreationUtils.addEdgeToCFA	line 758: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:568	INFO	CFACreationUtils.addEdgeToCFA	line 804: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:571	INFO	CFACreationUtils.addEdgeToCFA	line 853: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:575	INFO	CFACreationUtils.addEdgeToCFA	line 885: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:576	INFO	CFACreationUtils.addEdgeToCFA	line 899: Dead code detected: return (retValue_acc);

2017-05-11 22:26:00:692	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 595: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 22:26:02:734	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 22:26:03:429	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 22:26:04:359	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 22:26:04:501	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 22:26:04:618	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 22:26:05:152	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 22:26:05:155	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 22:26:05:165	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 22:26:05:173	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 22:26:05:746	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:26:08:210	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:26:08:227	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:26:08:904	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:26:11:194	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 22:26:11:195	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:11:195	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:16:876	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 22:26:16:877	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:16:877	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:20:798	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 22:26:20:799	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:20:818	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:23:851	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 22:26:23:851	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:23:851	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:26:451	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 22:26:26:452	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:26:459	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:28:280	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 22:26:28:281	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:28:291	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:31:920	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:26:34:721	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 22:26:34:727	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:34:727	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:26:43:935	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 22:26:43:935	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:26:43:949	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:26:43:951	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:26:44:017	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:26:50:717	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:26:55:135	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 22:26:55:163	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:26:55:187	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:26:55:213	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:26:55:350	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:26:56:993	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 22:26:56:994	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:26:56:994	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:27:02:872	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:27:11:562	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 22:27:11:563	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:27:11:563	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:27:23:421	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 22:27:23:422	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:27:23:435	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:27:23:437	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:27:23:543	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:27:31:080	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:27:42:186	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 22:27:42:188	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:27:42:198	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:27:42:199	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:27:42:316	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:27:52:766	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:28:09:942	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 22:28:09:943	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:28:09:951	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:28:09:952	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:28:10:114	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:28:18:189	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:28:49:929	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 22:28:49:932	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:28:49:943	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:28:49:944	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:28:50:107	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:28:59:851	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:29:27:803	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 64

2017-05-11 22:29:27:803	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:29:27:804	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:30:21:279	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 22:30:21:280	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:30:21:292	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:30:21:294	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:30:21:482	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:30:48:393	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:31:37:541	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 80

2017-05-11 22:31:37:544	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6b941179

2017-05-11 22:31:37:546	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:32:55:701	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 9

2017-05-11 22:32:55:702	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:32:56:292	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:33:08:230	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 22:33:12:459	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:13:033	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:13:034	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:13:453	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:13:453	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:13:963	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:13:963	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:14:631	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:14:631	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:15:315	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:15:316	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:16:421	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:16:422	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:18:341	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:18:341	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:19:607	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:33:19:608	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:33:20:705	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 22:33:20:709	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 22:33:20:720	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 22:33:20:721	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:            9 (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:         9 (100%)
  Times precision was empty:       9 (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:         616
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  1.895s
  Time for path formula creation:        1.892s
Time for strengthen operator:            0.002s
Time for prec operator:                  0.003s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 9)
    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.049s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 1682
   Number of created targets for uf: *signed_int is 291



PrecisionBootstrap statistics
-----------------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

Bounds CPA statistics
---------------------
Bound k:                                           9
Maximum loop iteration reached:                    10


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  31712 (count: 2039, min: 0, max: 31, avg: 15.55)
Number of global variables:                           21604 (count: 2039, min: 0, max: 25, avg: 10.60)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2354
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.060s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                60

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  930
Number of deterministic Assumptions:                    170
Level of Determinism:                              18%

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.009s
Automaton transfers with branching:                0
Automaton transfer successors:                         2354 (count: 2363, min: 0, max: 1, avg: 1.00) [0 x 9, 1 x 2354]

CPA algorithm statistics
------------------------
Number of iterations:            2055
Max size of waitlist:            10
Average size of waitlist:        3
Number of computed successors:   2354
Max successors for one state:    2
Number of times merged:          308
Number of times stopped:         308
Number of times breaked:         0

Total time for CPA algorithm:         3.079s (Max:     2.412s)
  Time for choose from waitlist:      0.004s
  Time for precision adjustment:      0.142s
  Time for transfer relation:         2.825s
  Time for merge operator:            0.080s
  Time for stop operator:             0.003s
  Time for adding to reached set:     0.004s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           3.094s
Time for final sat check:               11.938s
Time for error path creation:            3.070s
Time for bounding assertions check:      1.277s
Time for induction formula creation:    99.788s
Time for induction check:              305.575s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         8 (800%)
Time for counterexample checks:         8.246s
Time for running CBMC:                  7.558s


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  1.115s
  Time for transition matches:                         0.436s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.002s
Automaton transfers with branching:                0
Automaton transfer successors:                       175433 (count: 175961, min: 0, max: 1, avg: 1.00) [0 x 528, 1 x 175433]

CPA algorithm statistics
------------------------
Number of iterations:            158391
Max size of waitlist:            650
Average size of waitlist:        237
Number of computed successors:   175433
Max successors for one state:    2
Number of times merged:          39826
Number of times stopped:         43419
Number of times breaked:         0

Total time for CPA algorithm:       433.060s (Max:   136.198s)
  Time for choose from waitlist:      0.314s
  Time for precision adjustment:      2.572s
  Time for transfer relation:        33.401s
  Time for merge operator:          368.616s
  Time for stop operator:            25.858s
  Time for adding to reached set:     0.929s


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

Code Coverage
-----------------------------
  Function coverage:      0.649
  Visited lines:          114
  Total lines:            414
  Line coverage:          0.275
  Visited conditions:     103
  Total conditions:       138
  Condition coverage:     0.746

CPAchecker general statistics
-----------------------------
Number of program locations:     695
Number of CFA edges:             814
Number of relevant variables:    139
Number of functions:             37
Number of loops:                 9
Size of reached set:             2039
  Number of reached locations:   332 (48%)
    Avg states per location:     6
    Max states per location:     17 (at node N106)
  Number of reached functions:   24 (65%)
  Number of partitions:          2039
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       9

Time for analysis setup:          4.014s
  Time for loading CPAs:          1.491s
  Time for loading parser:        0.702s
  Time for CFA construction:      1.677s
    Time for parsing file(s):     0.473s
    Time for AST to CFA:          0.538s
    Time for CFA sanity check:    0.098s
    Time for post-processing:     0.486s
      Time for var class.:        0.297s
    Time for CFA export:          1.254s
Time for Analysis:              437.983s
CPU time for analysis:          865.010s
Time for analyzing result:        0.002s
Total time for CPAchecker:      442.019s
Total CPU time for CPAchecker:  871.880s
Time for statistics:              5.812s

Time for Garbage Collector:      39.793s (in 371 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                759MB (   724 MiB) max;    392MB (   374 MiB) avg;    786MB (   749 MiB) peak
Used non-heap memory:             54MB (    51 MiB) max;     51MB (    48 MiB) avg;     60MB (    58 MiB) peak
Used in PS Old Gen pool:         352MB (   336 MiB) max;    196MB (   187 MiB) avg;    352MB (   336 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    984MB (   939 MiB) avg
Allocated non-heap memory:        56MB (    53 MiB) max;     54MB (    52 MiB) avg
Total process virtual memory:   7302MB (  6964 MiB) max;   6775MB (  6461 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec4_product36_false-unreach-call_false-termination.cil/minepump_spec4_product36_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec4_product36_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc