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

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

2017-05-11 13:26:38:162	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 13:26:39:420	INFO	CFACreationUtils.addEdgeToCFA	line 90: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:423	INFO	CFACreationUtils.addEdgeToCFA	line 122: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:483	INFO	CFACreationUtils.addEdgeToCFA	line 442: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:489	INFO	CFACreationUtils.addEdgeToCFA	line 488: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:491	INFO	CFACreationUtils.addEdgeToCFA	line 503: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:492	INFO	CFACreationUtils.addEdgeToCFA	line 526: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:502	INFO	CFACreationUtils.addEdgeToCFA	line 625: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:522	INFO	CFACreationUtils.addEdgeToCFA	line 735: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:523	INFO	CFACreationUtils.addEdgeToCFA	line 744: Dead code detected: return (retValue_acc);

2017-05-11 13:26:39:686	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 279: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 13:26:40:635	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

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

2017-05-11 13:26:41:392	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 13:26:41:488	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 13:26:41:576	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 13:26:41:853	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 13:26:41:855	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 13:26:41:882	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 13:26:41:891	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 13:26:42:167	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:26:43:696	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 13:26:43:697	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:44:451	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:26:44:497	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:26:45:019	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:26:45:585	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 13:26:45:609	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:47:197	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 13:26:47:197	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:48:479	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 13:26:48:480	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:49:363	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 13:26:49:364	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:50:655	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 13:26:50:672	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:52:002	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 13:26:52:002	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:52:754	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 13:26:52:755	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:26:54:852	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 13:26:56:855	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 13:26:56:855	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:26:56:862	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:26:56:863	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:26:56:880	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:26:59:129	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 13:27:01:376	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 13:27:01:377	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:27:01:383	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:27:01:383	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:27:01:407	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:27:06:934	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 13:27:06:935	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7a8bebe0

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

2017-05-11 13:27:08:270	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 13:27:20:591	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 13:27:20:591	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:27:20:760	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:27:21:992	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

2017-05-11 13:27:23:119	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 13:27:23:120	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 13:27:23:393	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 13:27:23:393	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 13:27:23:681	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 13:27:23:682	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 13:27:24:002	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 13:27:24:005	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 13:27:24:010	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 13:27:24:010	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:            4 (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:         4 (100%)
  Times precision was empty:       4 (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:         138
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  1.737s
  Time for path formula creation:        1.737s
Time for strengthen operator:            0.005s
Time for prec operator:                  0.005s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 4)
    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.022s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 288
   Number of created targets for uf: *signed_int is 73



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

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

Bounds CPA statistics
---------------------
Bound k:                                           4
Maximum loop iteration reached:                    5


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  12075 (count: 752, min: 0, max: 24, avg: 16.06)
Number of global variables:                            8124 (count: 752, min: 0, max: 14, avg: 10.80)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                     823
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.022s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                45

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  290
Number of deterministic Assumptions:                     96
Level of Determinism:                              33%

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:                          823 (count: 827, min: 0, max: 1, avg: 1.00) [0 x 4, 1 x 823]

CPA algorithm statistics
------------------------
Number of iterations:            758
Max size of waitlist:            9
Average size of waitlist:        2
Number of computed successors:   823
Max successors for one state:    2
Number of times merged:          69
Number of times stopped:         69
Number of times breaked:         0

Total time for CPA algorithm:         2.433s (Max:     2.257s)
  Time for choose from waitlist:      0.000s
  Time for precision adjustment:      0.087s
  Time for transfer relation:         2.278s
  Time for merge operator:            0.025s
  Time for stop operator:             0.005s
  Time for adding to reached set:     0.002s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           2.442s
Time for final sat check:                1.265s
Time for error path creation:            0.722s
Time for bounding assertions check:      0.375s
Time for induction formula creation:    18.935s
Time for induction check:               16.533s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         2 (200%)
Time for counterexample checks:         1.168s
Time for running CBMC:                  1.067s


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

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.212s
Automaton transfers with branching:                0
Automaton transfer successors:                        31911 (count: 32058, min: 0, max: 1, avg: 1.00) [0 x 147, 1 x 31911]

CPA algorithm statistics
------------------------
Number of iterations:            29835
Max size of waitlist:            222
Average size of waitlist:        75
Number of computed successors:   31911
Max successors for one state:    2
Number of times merged:          6808
Number of times stopped:         7302
Number of times breaked:         0

Total time for CPA algorithm:        41.067s (Max:    17.051s)
  Time for choose from waitlist:      0.061s
  Time for precision adjustment:      0.555s
  Time for transfer relation:         7.736s
  Time for merge operator:           30.031s
  Time for stop operator:             2.121s
  Time for adding to reached set:     0.165s


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

Code Coverage
-----------------------------
  Function coverage:      0.559
  Visited lines:          88
  Total lines:            394
  Line coverage:          0.223
  Visited conditions:     69
  Total conditions:       108
  Condition coverage:     0.639

CPAchecker general statistics
-----------------------------
Number of program locations:     657
Number of CFA edges:             757
Number of relevant variables:    137
Number of functions:             34
Number of loops:                 9
Size of reached set:             752
  Number of reached locations:   278 (42%)
    Avg states per location:     2
    Max states per location:     5 (at node N590)
  Number of reached functions:   19 (56%)
  Number of partitions:          752
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       4

Time for analysis setup:          2.443s
  Time for loading CPAs:          0.593s
  Time for loading parser:        0.493s
  Time for CFA construction:      1.279s
    Time for parsing file(s):     0.335s
    Time for AST to CFA:          0.402s
    Time for CFA sanity check:    0.090s
    Time for post-processing:     0.385s
      Time for var class.:        0.211s
    Time for CFA export:          0.481s
Time for Analysis:               43.372s
CPU time for analysis:          132.320s
Time for analyzing result:        0.001s
Total time for CPAchecker:       45.830s
Total CPU time for CPAchecker:  138.460s
Time for statistics:              1.560s

Time for Garbage Collector:       3.644s (in 35 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                467MB (   445 MiB) max;    216MB (   206 MiB) avg;    487MB (   464 MiB) peak
Used non-heap memory:             55MB (    52 MiB) max;     49MB (    46 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:          68MB (    64 MiB) max;     37MB (    35 MiB) avg;     68MB (    64 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    949MB (   905 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     51MB (    48 MiB) avg
Total process virtual memory:   8369MB (  7981 MiB) max;   8061MB (  7688 MiB) avg

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