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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb3_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/1]
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/1
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 4 is refined into CE [5] 
* CE 3 is refined into CE [6] 


### Cost equations --> "Loop" of eval_foo_bb1_in/3 
* CEs [6] --> Loop 5 
* CEs [5] --> Loop 6 

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* RF of phase [5]: [V__0-5000,-V__01+5001]

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [5]:
  - RF of loop [5:1]:
    V__0-5000
    -V__01+5001


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


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

### 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 [8] 


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

### 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_bb1_in(V__01,V__0,B):
* Chain [[5],6]: 1*it(5)+0
  Such that:it(5) =< V__0

  with precondition: [B=2,V__0+V__01=10001,10000>=V__0,V__0>=5001] 


#### Cost of chains of eval_foo_bb0_in(B):
* Chain [7]: 1*s(1)+0
  Such that:s(1) =< 10000

  with precondition: [] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [8]: 1*s(2)+0
  Such that:s(2) =< 10000

  with precondition: [] 


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [8] with precondition: [] 
    - Upper bound: 10000 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_i,V_j,B): 10000 
Asymptotic class: constant 
* Total analysis performed in 39 ms.