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

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

Matches in value-assignements (V): {{numOfValueMatches}}

Matches in edge-description: {{numOfDescriptionMatches}}

-V-
{{line.desc}}

Zoom Factor (%)

Run scripts/report-generator.py to display CFAs.

Zoom Factor (%)

Run scripts/report-generator.py to display ARG.

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

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

2017-05-11 14:57:24:663	INFO	CFACreationUtils.addEdgeToCFA	line 178: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:665	INFO	CFACreationUtils.addEdgeToCFA	line 187: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:727	INFO	CFACreationUtils.addEdgeToCFA	line 558: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:735	INFO	CFACreationUtils.addEdgeToCFA	line 604: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:737	INFO	CFACreationUtils.addEdgeToCFA	line 619: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:740	INFO	CFACreationUtils.addEdgeToCFA	line 642: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:760	INFO	CFACreationUtils.addEdgeToCFA	line 782: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:763	INFO	CFACreationUtils.addEdgeToCFA	line 830: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:765	INFO	CFACreationUtils.addEdgeToCFA	line 862: Dead code detected: return (retValue_acc);

2017-05-11 14:57:24:869	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 395: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 14:57:27:191	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 14:57:27:280	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 14:57:27:430	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

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

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

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

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

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

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

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

2017-05-11 14:57:30:237	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:57:32:965	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:57:33:017	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:57:33:332	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:57:33:851	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 14:57:33:851	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:33:852	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:38:058	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 14:57:38:064	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:38:071	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:41:301	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 14:57:41:312	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:41:312	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:43:880	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 14:57:43:880	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:43:881	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:45:066	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 14:57:45:066	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:45:066	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:46:370	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 14:57:46:370	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:46:371	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:48:112	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 14:57:48:112	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:48:112	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:49:872	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 14:57:49:873	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:49:873	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:55:576	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:57:59:917	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 14:57:59:919	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

2017-05-11 14:57:59:919	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:58:09:891	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 14:58:09:892	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:09:900	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:09:900	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:58:09:923	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:58:18:224	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:58:23:178	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 14:58:23:182	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:23:195	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:23:198	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:58:23:227	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:58:29:561	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:58:39:853	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 14:58:39:853	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d83132a

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

2017-05-11 14:58:54:692	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 14:58:54:694	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:55:052	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:56:901	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

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

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

2017-05-11 14:58:59:014	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 14:58:59:014	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:58:59:387	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 14:58:59:388	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:58:59:880	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 14:58:59:892	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 14:58:59:892	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:         154
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  1.938s
  Time for path formula creation:        1.927s
Time for strengthen operator:            0.002s
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.035s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 242
   Number of created targets for uf: *signed_int is 45



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:                                  12396 (count: 759, min: 0, max: 25, avg: 16.33)
Number of global variables:                            8181 (count: 759, min: 0, max: 14, avg: 10.78)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                     838
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.049s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                48

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  320
Number of deterministic Assumptions:                    102
Level of Determinism:                              32%

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.014s
Automaton transfers with branching:                0
Automaton transfer successors:                          838 (count: 842, min: 0, max: 1, avg: 1.00) [0 x 4, 1 x 838]

CPA algorithm statistics
------------------------
Number of iterations:            765
Max size of waitlist:            10
Average size of waitlist:        2
Number of computed successors:   838
Max successors for one state:    2
Number of times merged:          77
Number of times stopped:         77
Number of times breaked:         0

Total time for CPA algorithm:         3.080s (Max:     2.708s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.144s
  Time for transfer relation:         2.826s
  Time for merge operator:            0.052s
  Time for stop operator:             0.001s
  Time for adding to reached set:     0.006s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           3.096s
Time for final sat check:                1.848s
Time for error path creation:            1.167s
Time for bounding assertions check:      0.166s
Time for induction formula creation:    36.850s
Time for induction check:               44.364s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         3 (300%)
Time for counterexample checks:         1.650s
Time for running CBMC:                  1.452s


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.472s
Automaton transfers with branching:                0
Automaton transfer successors:                        40489 (count: 40656, min: 0, max: 1, avg: 1.00) [0 x 167, 1 x 40489]

CPA algorithm statistics
------------------------
Number of iterations:            37688
Max size of waitlist:            316
Average size of waitlist:        105
Number of computed successors:   40489
Max successors for one state:    2
Number of times merged:          8897
Number of times stopped:         9525
Number of times breaked:         0

Total time for CPA algorithm:        88.430s (Max:    39.862s)
  Time for choose from waitlist:      0.166s
  Time for precision adjustment:      0.887s
  Time for transfer relation:        17.297s
  Time for merge operator:           65.182s
  Time for stop operator:             3.546s
  Time for adding to reached set:     0.421s


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

Code Coverage
-----------------------------
  Function coverage:      0.545
  Visited lines:          85
  Total lines:            391
  Line coverage:          0.217
  Visited conditions:     76
  Total conditions:       116
  Condition coverage:     0.655

CPAchecker general statistics
-----------------------------
Number of program locations:     660
Number of CFA edges:             761
Number of relevant variables:    138
Number of functions:             33
Number of loops:                 9
Size of reached set:             759
  Number of reached locations:   280 (42%)
    Avg states per location:     2
    Max states per location:     5 (at node N36)
  Number of reached functions:   18 (55%)
  Number of partitions:          759
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       4

Time for analysis setup:          4.271s
  Time for loading CPAs:          1.754s
  Time for loading parser:        0.679s
  Time for CFA construction:      1.712s
    Time for parsing file(s):     0.481s
    Time for AST to CFA:          0.517s
    Time for CFA sanity check:    0.101s
    Time for post-processing:     0.491s
      Time for var class.:        0.290s
    Time for CFA export:          1.386s
Time for Analysis:               92.690s
CPU time for analysis:          183.100s
Time for analyzing result:        0.000s
Total time for CPAchecker:       96.986s
Total CPU time for CPAchecker:  190.630s
Time for statistics:              3.207s

Time for Garbage Collector:       6.320s (in 63 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                490MB (   467 MiB) max;    222MB (   211 MiB) avg;    511MB (   487 MiB) peak
Used non-heap memory:             53MB (    50 MiB) max;     48MB (    46 MiB) avg;     58MB (    55 MiB) peak
Used in PS Old Gen pool:          86MB (    82 MiB) max;     41MB (    39 MiB) avg;     86MB (    82 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    969MB (   924 MiB) avg
Allocated non-heap memory:        56MB (    53 MiB) max;     50MB (    48 MiB) avg
Total process virtual memory:   6735MB (  6423 MiB) max;   6431MB (  6133 MiB) avg

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