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

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

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

2017-05-11 18:12:17:887	INFO	CFACreationUtils.addEdgeToCFA	line 394: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:902	INFO	CFACreationUtils.addEdgeToCFA	line 440: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:915	INFO	CFACreationUtils.addEdgeToCFA	line 544: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:924	INFO	CFACreationUtils.addEdgeToCFA	line 690: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:926	INFO	CFACreationUtils.addEdgeToCFA	line 699: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:928	INFO	CFACreationUtils.addEdgeToCFA	line 754: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:931	INFO	CFACreationUtils.addEdgeToCFA	line 773: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:958	INFO	CFACreationUtils.addEdgeToCFA	line 850: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:961	INFO	CFACreationUtils.addEdgeToCFA	line 873: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:964	INFO	CFACreationUtils.addEdgeToCFA	line 922: Dead code detected: return (retValue_acc);

2017-05-11 18:12:17:966	INFO	CFACreationUtils.addEdgeToCFA	line 954: Dead code detected: return (retValue_acc);

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

2017-05-11 18:12:17:969	INFO	CFACreationUtils.addEdgeToCFA	line 977: Dead code detected: return (retValue_acc);

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

2017-05-11 18:12:20:358	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 18:12:20:939	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:12:21:820	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:12:21:988	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:12:22:290	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:12:23:081	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:12:23:093	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:12:23:112	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:12:23:133	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:12:24:461	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:12:28:683	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 18:12:28:684	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

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

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

2017-05-11 18:12:29:574	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:12:34:096	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 18:12:34:096	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:34:101	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:38:152	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 18:12:38:153	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:38:154	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:40:268	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 18:12:40:278	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:40:280	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:42:895	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 18:12:42:896	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:42:930	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:44:497	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 18:12:44:498	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:44:498	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:45:951	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 18:12:45:952	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:45:963	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:46:988	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 18:12:46:988	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:12:47:985	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 18:12:47:988	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:12:49:118	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 22

2017-05-11 18:12:49:119	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:12:50:602	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 18:12:50:603	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:12:52:004	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 25

2017-05-11 18:12:52:009	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:12:53:918	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 26

2017-05-11 18:12:53:919	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:53:919	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:55:275	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 18:12:55:289	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:55:290	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:56:283	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:12:56:583	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 18:12:56:584	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:12:57:833	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 18:12:57:834	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:57:834	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:12:59:752	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 18:12:59:752	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:12:59:752	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:13:00:860	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 52

2017-05-11 18:13:00:861	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:13:00:861	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 18:13:05:081	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

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

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

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

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

2017-05-11 18:13:10:092	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:13:14:727	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 18:13:14:727	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:13:14:735	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:13:14:737	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:13:14:782	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:13:20:597	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 18:13:20:597	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:13:20:597	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 18:13:36:593	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 64

2017-05-11 18:13:36:594	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:14:09:064	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 68

2017-05-11 18:14:09:065	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:14:36:563	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

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

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

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

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

2017-05-11 18:14:42:764	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 70

2017-05-11 18:14:42:764	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

2017-05-11 18:14:42:765	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 18:15:16:390	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 74

2017-05-11 18:15:16:391	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:15:49:274	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 82

2017-05-11 18:15:49:274	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:16:21:723	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 98

2017-05-11 18:16:21:724	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@f22db17

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

2017-05-11 18:16:54:129	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 18:16:54:130	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 18:16:54:138	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 18:16:54:143	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 18:16:54:223	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 18:17:18:425	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 18:18:10:053	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

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

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

2017-05-11 18:18:15:994	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

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

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

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

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

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

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

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

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

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

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

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

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

2017-05-11 18:18:25:941	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 18:18:25:941	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:            6 (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:         6 (100%)
  Times precision was empty:       6 (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:         842
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  4.072s
  Time for path formula creation:        4.037s
Time for strengthen operator:            0.031s
Time for prec operator:                  0.009s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 6)
    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.083s
Time for coverage check:                 0.001s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 648
   Number of created targets for uf: *signed_int is 109



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

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

Bounds CPA statistics
---------------------
Bound k:                                           6
Maximum loop iteration reached:                    7


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  46215 (count: 2568, min: 0, max: 31, avg: 18.00)
Number of global variables:                           29068 (count: 2568, min: 0, max: 16, avg: 11.32)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2993
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.045s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                65

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 1412
Number of deterministic Assumptions:                    414
Level of Determinism:                              29%

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.006s
Automaton transfers with branching:                0
Automaton transfer successors:                         2993 (count: 2999, min: 0, max: 1, avg: 1.00) [0 x 6, 1 x 2993]

CPA algorithm statistics
------------------------
Number of iterations:            2578
Max size of waitlist:            15
Average size of waitlist:        4
Number of computed successors:   2993
Max successors for one state:    2
Number of times merged:          421
Number of times stopped:         421
Number of times breaked:         0

Total time for CPA algorithm:         5.430s (Max:     4.373s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.124s
  Time for transfer relation:         5.109s
  Time for merge operator:            0.150s
  Time for stop operator:             0.004s
  Time for adding to reached set:     0.013s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           5.463s
Time for final sat check:                4.909s
Time for error path creation:            2.121s
Time for bounding assertions check:      0.383s
Time for induction formula creation:    84.222s
Time for induction check:              255.742s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         5 (500%)
Time for counterexample checks:         6.793s
Time for running CBMC:                  6.377s


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.406s
  Time for transition matches:                         0.470s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.002s
Automaton transfers with branching:                0
Automaton transfer successors:                       315601 (count: 316066, min: 0, max: 1, avg: 1.00) [0 x 465, 1 x 315601]

CPA algorithm statistics
------------------------
Number of iterations:            282939
Max size of waitlist:            433
Average size of waitlist:        133
Number of computed successors:   315601
Max successors for one state:    2
Number of times merged:          53473
Number of times stopped:         56472
Number of times breaked:         0

Total time for CPA algorithm:       358.300s (Max:   123.739s)
  Time for choose from waitlist:      0.252s
  Time for precision adjustment:      3.979s
  Time for transfer relation:        52.655s
  Time for merge operator:          283.131s
  Time for stop operator:            14.537s
  Time for adding to reached set:     1.901s


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

Code Coverage
-----------------------------
  Function coverage:      0.692
  Visited lines:          137
  Total lines:            434
  Line coverage:          0.316
  Visited conditions:     199
  Total conditions:       256
  Condition coverage:     0.777

CPAchecker general statistics
-----------------------------
Number of program locations:     822
Number of CFA edges:             1002
Number of relevant variables:    162
Number of functions:             39
Number of loops:                 9
Size of reached set:             2568
  Number of reached locations:   457 (56%)
    Avg states per location:     5
    Max states per location:     21 (at node N541)
  Number of reached functions:   27 (69%)
  Number of partitions:          2568
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       6

Time for analysis setup:          4.314s
  Time for loading CPAs:          1.639s
  Time for loading parser:        0.706s
  Time for CFA construction:      1.848s
    Time for parsing file(s):     0.510s
    Time for AST to CFA:          0.568s
    Time for CFA sanity check:    0.185s
    Time for post-processing:     0.498s
      Time for var class.:        0.287s
    Time for CFA export:          1.370s
Time for Analysis:              365.579s
CPU time for analysis:          721.050s
Time for analyzing result:        0.002s
Total time for CPAchecker:      369.915s
Total CPU time for CPAchecker:  728.680s
Time for statistics:              5.505s

Time for Garbage Collector:      41.390s (in 314 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                897MB (   856 MiB) max;    466MB (   444 MiB) avg;    923MB (   880 MiB) peak
Used non-heap memory:             54MB (    51 MiB) max;     50MB (    48 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:         490MB (   468 MiB) max;    272MB (   260 MiB) avg;    491MB (   468 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    967MB (   923 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     54MB (    52 MiB) avg
Total process virtual memory:   6936MB (  6615 MiB) max;   6579MB (  6274 MiB) avg

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