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

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

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

2017-05-11 16:01:04:697	INFO	CFACreationUtils.addEdgeToCFA	line 51: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:700	INFO	CFACreationUtils.addEdgeToCFA	line 74: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:798	INFO	CFACreationUtils.addEdgeToCFA	line 266: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:814	INFO	CFACreationUtils.addEdgeToCFA	line 275: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:822	INFO	CFACreationUtils.addEdgeToCFA	line 330: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:841	INFO	CFACreationUtils.addEdgeToCFA	line 426: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:887	INFO	CFACreationUtils.addEdgeToCFA	line 484: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:890	INFO	CFACreationUtils.addEdgeToCFA	line 516: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:904	INFO	CFACreationUtils.addEdgeToCFA	line 530: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:993	INFO	CFACreationUtils.addEdgeToCFA	line 850: Dead code detected: return (retValue_acc);

2017-05-11 16:01:04:997	INFO	CFACreationUtils.addEdgeToCFA	line 896: Dead code detected: return (retValue_acc);

2017-05-11 16:01:05:265	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 687: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 16:01:06:965	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 16:01:07:013	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 16:01:07:057	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 16:01:07:351	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 16:01:08:201	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 16:01:08:378	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 16:01:08:575	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 16:01:09:137	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 16:01:09:141	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 16:01:09:153	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 16:01:09:168	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 16:01:09:954	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:01:15:125	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:01:15:192	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:01:15:532	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 16:01:15:534	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:15:545	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:16:208	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:01:21:381	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 16:01:21:382	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:21:382	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:25:578	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 16:01:25:579	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:25:579	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:27:493	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 16:01:27:494	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

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

2017-05-11 16:01:30:317	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 16:01:30:337	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:30:337	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:32:012	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 16:01:32:020	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:32:027	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:33:264	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 16:01:33:265	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:33:265	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:34:241	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 16:01:34:241	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:34:242	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 16:01:35:393	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:35:393	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:36:401	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 19

2017-05-11 16:01:36:416	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:36:416	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:37:284	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 16:01:37:296	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:37:296	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:38:106	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 16:01:38:107	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:38:108	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:38:568	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:01:40:233	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 16:01:40:233	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:40:233	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:42:350	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 43

2017-05-11 16:01:42:351	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:42:362	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:45:072	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

2017-05-11 16:01:45:072	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:45:072	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:01:50:902	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 16:01:50:903	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:01:50:913	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:01:50:915	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:01:50:969	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:01:51:396	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 49

2017-05-11 16:01:51:397	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:01:51:397	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:02:00:438	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 16:02:00:438	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:02:00:439	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:02:02:179	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:02:15:431	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 16:02:15:432	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:02:15:442	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:02:15:443	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:02:15:521	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:02:23:376	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:02:26:935	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 51

2017-05-11 16:02:26:936	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

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

2017-05-11 16:02:44:837	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 16:02:44:838	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:02:44:850	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:02:44:855	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:02:44:957	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:02:56:442	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:03:11:792	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 16:03:11:794	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:03:11:805	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:03:11:806	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:03:11:919	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

2017-05-11 16:03:17:664	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

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

2017-05-11 16:03:25:675	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:04:03:578	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 16:04:03:579	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:04:03:587	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:04:03:589	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:04:03:727	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:04:06:534	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 54

2017-05-11 16:04:06:534	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:04:06:535	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:04:24:113	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:05:01:930	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 55

2017-05-11 16:05:01:931	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

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

2017-05-11 16:05:51:961	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 16:05:51:962	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:05:51:971	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:05:51:972	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:05:52:253	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:05:58:478	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 16:05:58:479	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

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

2017-05-11 16:06:22:247	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:07:28:273	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 57

2017-05-11 16:07:28:273	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6875ec7d

2017-05-11 16:07:28:273	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:08:12:721	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 16:08:12:730	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:08:13:667	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:08:25:481	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 16:08:29:989	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:08:30:577	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:08:30:577	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:08:31:202	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:08:31:202	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:08:31:911	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:08:31:911	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:08:32:728	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:08:32:728	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

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

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

2017-05-11 16:08:34:737	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:08:34:737	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:08:37:015	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:08:37:016	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:08:38:406	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 16:08:38:410	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 16:08:38:416	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 16:08:38:417	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:            8 (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:         8 (100%)
  Times precision was empty:       8 (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:         906
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  4.227s
  Time for path formula creation:        4.222s
Time for strengthen operator:            0.013s
Time for prec operator:                  0.016s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 8)
    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.039s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 1458
   Number of created targets for uf: *signed_int is 325



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  39183 (count: 2355, min: 0, max: 27, avg: 16.64)
Number of global variables:                           26168 (count: 2355, min: 0, max: 18, avg: 11.11)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2814
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.050s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                61

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 1172
Number of deterministic Assumptions:                    170
Level of Determinism:                              15%

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.018s
Automaton transfers with branching:                0
Automaton transfer successors:                         2814 (count: 2822, min: 0, max: 1, avg: 1.00) [0 x 8, 1 x 2814]

CPA algorithm statistics
------------------------
Number of iterations:            2369
Max size of waitlist:            8
Average size of waitlist:        2
Number of computed successors:   2814
Max successors for one state:    2
Number of times merged:          453
Number of times stopped:         453
Number of times breaked:         0

Total time for CPA algorithm:         6.121s (Max:     5.139s)
  Time for choose from waitlist:      0.004s
  Time for precision adjustment:      0.273s
  Time for transfer relation:         5.704s
  Time for merge operator:            0.088s
  Time for stop operator:             0.011s
  Time for adding to reached set:     0.015s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           6.141s
Time for final sat check:               11.853s
Time for error path creation:            3.251s
Time for bounding assertions check:      1.345s
Time for induction formula creation:   116.899s
Time for induction check:              298.558s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         7 (700%)
Time for counterexample checks:         8.418s
Time for running CBMC:                  7.929s


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.748s
  Time for transition matches:                         0.539s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.003s
Automaton transfers with branching:                0
Automaton transfer successors:                       376323 (count: 377401, min: 0, max: 1, avg: 1.00) [0 x 1078, 1 x 376323]

CPA algorithm statistics
------------------------
Number of iterations:            328509
Max size of waitlist:            599
Average size of waitlist:        202
Number of computed successors:   376323
Max successors for one state:    2
Number of times merged:          78789
Number of times stopped:         84517
Number of times breaked:         0

Total time for CPA algorithm:       446.468s (Max:    89.750s)
  Time for choose from waitlist:      0.430s
  Time for precision adjustment:      4.601s
  Time for transfer relation:        62.069s
  Time for merge operator:          347.755s
  Time for stop operator:            27.700s
  Time for adding to reached set:     1.713s


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

Code Coverage
-----------------------------
  Function coverage:      0.694
  Visited lines:          120
  Total lines:            414
  Line coverage:          0.290
  Visited conditions:     139
  Total conditions:       174
  Condition coverage:     0.799

CPAchecker general statistics
-----------------------------
Number of program locations:     718
Number of CFA edges:             860
Number of relevant variables:    149
Number of functions:             36
Number of loops:                 9
Size of reached set:             2355
  Number of reached locations:   364 (51%)
    Avg states per location:     6
    Max states per location:     22 (at node N128)
  Number of reached functions:   25 (69%)
  Number of partitions:          2355
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       8

Time for analysis setup:          3.949s
  Time for loading CPAs:          1.175s
  Time for loading parser:        0.700s
  Time for CFA construction:      1.966s
    Time for parsing file(s):     0.491s
    Time for AST to CFA:          0.681s
    Time for CFA sanity check:    0.173s
    Time for post-processing:     0.558s
      Time for var class.:        0.298s
    Time for CFA export:          1.070s
Time for Analysis:              451.449s
CPU time for analysis:          887.760s
Time for analyzing result:        0.002s
Total time for CPAchecker:      455.417s
Total CPU time for CPAchecker:  894.610s
Time for statistics:              6.155s

Time for Garbage Collector:      51.366s (in 385 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                951MB (   907 MiB) max;    468MB (   446 MiB) avg;    978MB (   933 MiB) peak
Used non-heap memory:             54MB (    52 MiB) max;     51MB (    48 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:         544MB (   519 MiB) max;    274MB (   261 MiB) avg;    545MB (   519 MiB) peak
Allocated heap memory:          1255MB (  1197 MiB) max;   1011MB (   964 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     54MB (    52 MiB) avg
Total process virtual memory:   7138MB (  6807 MiB) max;   6710MB (  6399 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec4_product37_false-unreach-call_false-termination.cil/minepump_spec4_product37_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_product37_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