/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/3]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb5_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/2]
5. non_recursive  : [eval_foo_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb1_in/3
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into eval_foo_bb0_in/2
5. SCC is partially evaluated into eval_foo_start/3

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations eval_foo_bb1_in/3 
* CE 9 is refined into CE [10] 
* CE 8 is refined into CE [11] 
* CE 6 is refined into CE [12] 
* CE 7 is refined into CE [13] 
* CE 3 is refined into CE [14] 
* CE 4 is refined into CE [15] 
* CE 5 is refined into CE [16] 


### Cost equations --> "Loop" of eval_foo_bb1_in/3 
* CEs [14] --> Loop 10 
* CEs [15] --> Loop 11 
* CEs [16] --> Loop 12 
* CEs [13] --> Loop 13 
* CEs [12] --> Loop 14 
* CEs [10] --> Loop 15 
* CEs [11] --> Loop 16 

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* RF of phase [10]: [V__0-1]

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    V__0-1
* Partial RF of phase [13,14]:
  - RF of loop [13:1]:
    -V__0/8-15/8 depends on loops [14:1] 
  - RF of loop [14:1]:
    V__0/8-15/8 depends on loops [13:1] 


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [17,18,19,20,21,22] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [22] --> Loop 17 
* CEs [21] --> Loop 18 
* CEs [19] --> Loop 19 
* CEs [18] --> Loop 20 
* CEs [20] --> Loop 21 
* CEs [17] --> Loop 22 

### Ranking functions of CR eval_foo_bb0_in(V_i,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 


### Specialization of cost equations eval_foo_start/3 
* CE 1 is refined into CE [23,24,25,26,27,28] 


### Cost equations --> "Loop" of eval_foo_start/3 
* CEs [28] --> Loop 23 
* CEs [27] --> Loop 24 
* CEs [26] --> Loop 25 
* CEs [25] --> Loop 26 
* CEs [24] --> Loop 27 
* CEs [23] --> Loop 28 

### Ranking functions of CR eval_foo_start(V_i,V_range,B) 

#### Partial ranking functions of CR eval_foo_start(V_i,V_range,B) 


Computing Bounds
=====================================

#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
* Chain [[13,14]]...: 2*it(13)+0
  with precondition: [V__01=20,20>=V__0,V__0+20>=0,B=2] 

* Chain [[11]]...: 1*it(11)+0
  with precondition: [0>=V__0,V__01>=20,V__0+V__01>=5,B=2] 

* Chain [[10],12,16]: 1*it(10)+1
  Such that:it(10) =< V__0

  with precondition: [B=2,V__01>=20,V__0>=2,V__01>=V__0+5] 

* Chain [[10],12,15]: 1*it(10)+1
  Such that:it(10) =< V__0

  with precondition: [B=2,V__01>=20,V__0>=2,V__01>=V__0+5] 

* Chain [16]: 0
  with precondition: [B=2,20>=V__01,V__01+1>=0,0>=V__0+V__01+1] 

* Chain [15]: 0
  with precondition: [B=2,20>=V__01,V__01+1>=0,V__0>=V__01+1] 

* Chain [12,16]: 1
  with precondition: [V__0=1,B=2,V__01>=20] 

* Chain [12,15]: 1
  with precondition: [V__0=1,B=2,V__01>=20] 


#### Cost of chains of eval_foo_bb0_in(V_i,B):
* Chain [22]: 1
  with precondition: [V_i=1] 

* Chain [21]: 2*s(4)+1
  Such that:s(3) =< V_i
s(4) =< s(3)

  with precondition: [15>=V_i,V_i>=2] 

* Chain [20]: 0
  with precondition: [0>=V_i+21] 

* Chain [19]: 0
  with precondition: [V_i>=21] 

* Chain [18]...: 2*s(5)+0
  with precondition: [20>=V_i,V_i+20>=0] 

* Chain [17]...: 1*s(6)+0
  with precondition: [0>=V_i,V_i+15>=0] 


#### Cost of chains of eval_foo_start(V_i,V_range,B):
* Chain [28]: 1
  with precondition: [V_i=1] 

* Chain [27]: 2*s(8)+1
  Such that:s(7) =< V_i
s(8) =< s(7)

  with precondition: [15>=V_i,V_i>=2] 

* Chain [26]: 0
  with precondition: [0>=V_i+21] 

* Chain [25]: 0
  with precondition: [V_i>=21] 

* Chain [24]...: 2*s(9)+0
  with precondition: [20>=V_i,V_i+20>=0] 

* Chain [23]...: 1*s(10)+0
  with precondition: [0>=V_i,V_i+15>=0] 


Closed-form bounds of eval_foo_start(V_i,V_range,B): 
-------------------------------------
* Chain [28] with precondition: [V_i=1] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [27] with precondition: [15>=V_i,V_i>=2] 
    - Upper bound: 2*V_i+1 
    - Complexity: n 
* Chain [26] with precondition: [0>=V_i+21] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [25] with precondition: [V_i>=21] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [24]... with precondition: [20>=V_i,V_i+20>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [23]... with precondition: [0>=V_i,V_i+15>=0] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,V_range,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 171 ms.