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


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


MAYBE

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

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

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

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

### Specialization of cost equations eval_foo_bb2_in/2 
* CE 6 is discarded (unfeasible) 
* CE 5 is refined into CE [7] 


### Cost equations --> "Loop" of eval_foo_bb2_in/2 
* CEs [7] --> Loop 7 

### Ranking functions of CR eval_foo_bb2_in(V__01,B) 

#### Partial ranking functions of CR eval_foo_bb2_in(V__01,B) 

Warning: no base case found for predicate

### Specialization of cost equations eval_foo_bb1_in/2 
* CE 4 is refined into CE [8] 
* CE 3 is refined into CE [9] 


### Cost equations --> "Loop" of eval_foo_bb1_in/2 
* CEs [9] --> Loop 8 
* CEs [8] --> Loop 9 

### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
* RF of phase [8]: [-V__0+100]

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


### Specialization of cost equations eval_foo_bb0_in/1 
* CE 2 is refined into CE [10] 


### Cost equations --> "Loop" of eval_foo_bb0_in/1 
* CEs [10] --> Loop 10 

### Ranking functions of CR eval_foo_bb0_in(B) 

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


### Specialization of cost equations eval_foo_start/3 
* CE 1 is refined into CE [11] 


### Cost equations --> "Loop" of eval_foo_start/3 
* CEs [11] --> Loop 11 

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

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


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

#### Cost of chains of eval_foo_bb2_in(V__01,B):
* Chain [[7]]...: 1*it(7)+0
  with precondition: [V__01=0,B=2] 


#### Cost of chains of eval_foo_bb1_in(V__0,B):
* Chain [[8],9]: 1*it(8)+1*s(3)+0
  Such that:it(8) =< -V__0+100

  with precondition: [B=3,99>=V__0,V__0>=0] 


#### Cost of chains of eval_foo_bb0_in(B):
* Chain [10]: 1*s(4)+1*s(5)+0
  Such that:s(4) =< 100

  with precondition: [] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [11]: 1*s(6)+1*s(7)+0
  Such that:s(6) =< 100

  with precondition: [] 


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [11] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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