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

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

2017-05-11 18:24:15:726	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 18:24:17:399	INFO	CFACreationUtils.addEdgeToCFA	line 140: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:482	INFO	CFACreationUtils.addEdgeToCFA	line 489: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:487	INFO	CFACreationUtils.addEdgeToCFA	line 535: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:541	INFO	CFACreationUtils.addEdgeToCFA	line 682: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:542	INFO	CFACreationUtils.addEdgeToCFA	line 691: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:545	INFO	CFACreationUtils.addEdgeToCFA	line 746: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:550	INFO	CFACreationUtils.addEdgeToCFA	line 802: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:558	INFO	CFACreationUtils.addEdgeToCFA	line 834: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:559	INFO	CFACreationUtils.addEdgeToCFA	line 848: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:602	INFO	CFACreationUtils.addEdgeToCFA	line 927: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:612	INFO	CFACreationUtils.addEdgeToCFA	line 950: Dead code detected: return (retValue_acc);

2017-05-11 18:24:17:841	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 326: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 18:24:19:500	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 18:24:19:548	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 18:24:19:593	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 18:24:19:873	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 18:24:20:616	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 18:24:20:768	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 18:24:20:899	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 18:24:21:511	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 18:24:21:518	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 18:24:21:531	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 18:24:21:540	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 18:24:22:254	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:24:25:767	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:24:25:799	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:24:26:435	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:24:30:461	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 18:24:30:462	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:30:462	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:36:175	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 18:24:36:176	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:36:176	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:39:792	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 18:24:39:792	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:39:804	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:43:639	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 18:24:43:640	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:43:640	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:46:232	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 18:24:46:232	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:46:233	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:47:829	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 18:24:47:830	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:47:841	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:48:957	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 18:24:48:958	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:48:958	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:49:709	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 18:24:49:709	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:49:710	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:50:283	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 18:24:50:283	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:50:283	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:50:411	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:24:51:229	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 18:24:51:244	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:51:245	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:52:115	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 18:24:52:116	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:52:116	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:52:667	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 18:24:52:667	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:52:678	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:54:816	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 18:24:54:816	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:24:54:827	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:24:55:094	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 18:24:55:095	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:24:55:117	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:24:55:118	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:24:55:185	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:24:58:257	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 18:24:58:257	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

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

2017-05-11 18:25:01:826	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 18:25:01:827	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

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

2017-05-11 18:25:03:587	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 37

2017-05-11 18:25:03:598	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:25:03:599	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 18:25:04:772	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 41

2017-05-11 18:25:04:772	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

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

2017-05-11 18:25:07:058	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 43

2017-05-11 18:25:07:058	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:25:07:058	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:25:09:080	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

2017-05-11 18:25:09:080	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:25:09:080	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:25:10:911	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 55

2017-05-11 18:25:10:912	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:25:10:912	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:25:15:829	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 18:25:15:830	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:25:15:839	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:25:15:840	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:25:15:921	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:25:20:632	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:25:27:868	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 18:25:27:870	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:25:27:882	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:25:27:885	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:25:27:995	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:25:29:678	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 59

2017-05-11 18:25:29:679	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:25:29:679	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:25:39:843	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:25:47:329	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 67

2017-05-11 18:25:47:330	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

2017-05-11 18:25:47:330	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:26:05:105	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 18:26:05:107	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:26:05:119	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:26:05:120	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:26:05:233	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:26:15:032	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:26:36:274	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 18:26:36:276	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:26:36:285	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:26:36:287	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:26:36:448	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:26:46:396	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:26:56:489	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 71

2017-05-11 18:26:56:489	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

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

2017-05-11 18:27:34:183	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 18:27:34:184	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:27:34:193	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:27:34:194	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:27:34:354	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

2017-05-11 18:28:04:108	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 79

2017-05-11 18:28:04:109	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3595c104

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

2017-05-11 18:28:43:254	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 18:28:43:255	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:28:43:263	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:28:43:264	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:28:43:448	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:29:25:653	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:30:52:023	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 9

2017-05-11 18:30:52:024	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:30:53:054	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:31:04:843	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 18:31:10:179	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

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

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

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

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

2017-05-11 18:31:12:745	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 18:31:12:745	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 18:31:13:699	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 18:31:13:700	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 18:31:15:206	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 18:31:15:207	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 18:31:17:452	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 18:31:17:453	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 18:31:19:470	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 18:31:19:470	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 18:31:20:945	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 18:31:20:945	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 18:31:22:890	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 18:31:22:906	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 18:31:22:907	INFO	CPAchecker.runAlgorithm	Stopping analysis ...

    
Parallel Algorithm statistics
-----------------------------
Number of algorithms used:        2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================

PredicateCPA statistics
-----------------------
Number of abstractions:            9 (0% of all post computations)
  Times abstraction was reused:    0
  Because of function entry/exit:  0 (0%)
  Because of loop head:            0 (0%)
  Because of join nodes:           0 (0%)
  Because of threshold:            0 (0%)
  Because of target state:         9 (100%)
  Times precision was empty:       9 (100%)
  Times precision was {false}:     0 (0%)
  Times result was cached:         0 (0%)
  Times cartesian abs was used:    0 (0%)
  Times boolean abs was used:      0 (0%)
  Times result was 'false':        0 (0%)
Number of strengthen sat checks:   0
Number of coverage checks:         1110
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  3.252s
  Time for path formula creation:        3.245s
Time for strengthen operator:            0.019s
Time for prec operator:                  0.011s
  Time for abstraction:                  0.002s (Max:     0.001s, Count: 9)
    Solving time:                        0.000s (Max:     0.000s)
    Model enumeration time:              0.000s
    Time for BDD construction:           0.000s (Max:     0.000s)
Time for merge operator:                 0.057s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 1568
   Number of created targets for uf: *signed_int is 449



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  52242 (count: 3096, min: 0, max: 29, avg: 16.87)
Number of global variables:                           34661 (count: 3096, min: 0, max: 20, avg: 11.20)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    3658
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.046s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                63

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 1474
Number of deterministic Assumptions:                    202
Level of Determinism:                              14%

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

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

Total time for CPA algorithm:         4.560s (Max:     3.470s)
  Time for choose from waitlist:      0.005s
  Time for precision adjustment:      0.150s
  Time for transfer relation:         4.235s
  Time for merge operator:            0.100s
  Time for stop operator:             0.014s
  Time for adding to reached set:     0.029s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.586s
Time for final sat check:               11.790s
Time for error path creation:            3.927s
Time for bounding assertions check:      1.250s
Time for induction formula creation:   128.822s
Time for induction check:              255.143s

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


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

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  1.119s
  Time for transition matches:                         0.371s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       245818 (count: 246282, min: 0, max: 1, avg: 1.00) [0 x 464, 1 x 245818]

CPA algorithm statistics
------------------------
Number of iterations:            220851
Max size of waitlist:            542
Average size of waitlist:        155
Number of computed successors:   245818
Max successors for one state:    2
Number of times merged:          47704
Number of times stopped:         51323
Number of times breaked:         0

Total time for CPA algorithm:       418.425s (Max:   198.763s)
  Time for choose from waitlist:      0.346s
  Time for precision adjustment:      3.729s
  Time for transfer relation:        45.277s
  Time for merge operator:          348.113s
  Time for stop operator:            17.841s
  Time for adding to reached set:     1.337s


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

Code Coverage
-----------------------------
  Function coverage:      0.711
  Visited lines:          128
  Total lines:            422
  Line coverage:          0.303
  Visited conditions:     154
  Total conditions:       190
  Condition coverage:     0.811

CPAchecker general statistics
-----------------------------
Number of program locations:     744
Number of CFA edges:             895
Number of relevant variables:    150
Number of functions:             38
Number of loops:                 9
Size of reached set:             3096
  Number of reached locations:   390 (52%)
    Avg states per location:     7
    Max states per location:     25 (at node N489)
  Number of reached functions:   27 (71%)
  Number of partitions:          3096
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       9

Time for analysis setup:          3.737s
  Time for loading CPAs:          1.111s
  Time for loading parser:        0.636s
  Time for CFA construction:      1.895s
    Time for parsing file(s):     0.457s
    Time for AST to CFA:          0.590s
    Time for CFA sanity check:    0.231s
    Time for post-processing:     0.563s
      Time for var class.:        0.282s
    Time for CFA export:          1.047s
Time for Analysis:              423.403s
CPU time for analysis:          831.410s
Time for analyzing result:        0.002s
Total time for CPAchecker:      427.162s
Total CPU time for CPAchecker:  837.850s
Time for statistics:              8.346s

Time for Garbage Collector:      42.018s (in 347 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                836MB (   798 MiB) max;    438MB (   418 MiB) avg;    862MB (   822 MiB) peak
Used non-heap memory:             55MB (    52 MiB) max;     51MB (    49 MiB) avg;     61MB (    59 MiB) peak
Used in PS Old Gen pool:         425MB (   405 MiB) max;    241MB (   230 MiB) avg;    427MB (   407 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    971MB (   926 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     55MB (    52 MiB) avg
Total process virtual memory:   7233MB (  6898 MiB) max;   6747MB (  6434 MiB) avg

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