/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/2,eval_foo_bb2_in/2,eval_foo_bb3_in/2,eval_foo_bb4_in/2]
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/2]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb1_in/2
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/2

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

### Specialization of cost equations eval_foo_bb1_in/2 
* CE 8 is refined into CE [9] 
* CE 5 is refined into CE [10] 
* CE 4 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] 


### Cost equations --> "Loop" of eval_foo_bb1_in/2 
* CEs [10] --> Loop 9 
* CEs [11] --> Loop 10 
* CEs [12] --> Loop 11 
* CEs [13] --> Loop 12 
* CEs [14] --> Loop 13 
* CEs [9] --> Loop 14 

### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
* RF of phase [9]: [V__0]

#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    V__0


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


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

### 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/2 
* CE 1 is refined into CE [21,22,23,24,25,26] 


### Cost equations --> "Loop" of eval_foo_start/2 
* CEs [26] --> Loop 21 
* CEs [25] --> Loop 22 
* CEs [24] --> Loop 23 
* CEs [23] --> Loop 24 
* CEs [22] --> Loop 25 
* CEs [21] --> Loop 26 

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

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


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

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

* Chain [[10]]...: 1*it(10)+0
  with precondition: [V__0>=31,35>=V__0,B=2] 

* Chain [[9],14]: 1*it(9)+0
  Such that:it(9) =< V__0

  with precondition: [B=2,30>=V__0,V__0>=1] 

* Chain [14]: 0
  with precondition: [V__0=0,B=2] 

* Chain [12,14]: 1
  with precondition: [B=2,0>=V__0+6] 

* Chain [11,14]: 1
  with precondition: [B=2,V__0>=36] 


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

* Chain [19]: 1*s(1)+0
  Such that:s(1) =< V_i

  with precondition: [30>=V_i,V_i>=1] 

* Chain [18]: 1
  with precondition: [0>=V_i+6] 

* Chain [17]: 1
  with precondition: [V_i>=36] 

* Chain [16]...: 1*s(2)+0
  with precondition: [35>=V_i,V_i>=31] 

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


#### Cost of chains of eval_foo_start(V_i,B):
* Chain [26]: 0
  with precondition: [V_i=0] 

* Chain [25]: 1*s(4)+0
  Such that:s(4) =< V_i

  with precondition: [30>=V_i,V_i>=1] 

* Chain [24]: 1
  with precondition: [0>=V_i+6] 

* Chain [23]: 1
  with precondition: [V_i>=36] 

* Chain [22]...: 1*s(5)+0
  with precondition: [35>=V_i,V_i>=31] 

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


Closed-form bounds of eval_foo_start(V_i,B): 
-------------------------------------
* Chain [26] with precondition: [V_i=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [25] with precondition: [30>=V_i,V_i>=1] 
    - Upper bound: V_i 
    - Complexity: n 
* Chain [24] with precondition: [0>=V_i+6] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [23] with precondition: [V_i>=36] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [22]... with precondition: [35>=V_i,V_i>=31] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [21]... with precondition: [0>=V_i+1,V_i+5>=0] 
    - Upper bound: inf 
    - Complexity: infinity 

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