/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. recursive  : [eval_foo_bb3_in/2,eval_foo_bb4_in/2]
2. non_recursive  : [eval_foo_stop/1]
3. non_recursive  : [eval_foo_bb5_in/1]
4. non_recursive  : [eval_foo_bb3_in_loop_cont/2]
5. non_recursive  : [eval_foo_bb1_in_loop_cont/3]
6. non_recursive  : [eval_foo_bb0_in/1]
7. 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 partially evaluated into eval_foo_bb3_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_bb1_in_loop_cont/3
6. SCC is partially evaluated into eval_foo_bb0_in/1
7. 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 [8] 
* CE 3 is refined into CE [9] 


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

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

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


### Specialization of cost equations eval_foo_bb3_in/2 
* CE 7 is refined into CE [10] 
* CE 6 is refined into CE [11] 


### Cost equations --> "Loop" of eval_foo_bb3_in/2 
* CEs [11] --> Loop 10 
* CEs [10] --> Loop 11 

### Ranking functions of CR eval_foo_bb3_in(V__01,B) 
* RF of phase [10]: [-V__01/3+7]

#### Partial ranking functions of CR eval_foo_bb3_in(V__01,B) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    -V__01/3+7


### Specialization of cost equations eval_foo_bb1_in_loop_cont/3 
* CE 5 is refined into CE [12,13] 


### Cost equations --> "Loop" of eval_foo_bb1_in_loop_cont/3 
* CEs [13] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR eval_foo_bb1_in_loop_cont(A,B,C) 

#### Partial ranking functions of CR eval_foo_bb1_in_loop_cont(A,B,C) 


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


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

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


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

### 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__0,B,C):
* Chain [[8],9]: 1*it(8)+0
  Such that:it(8) =< -V__0+100

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


#### Cost of chains of eval_foo_bb3_in(V__01,B):
* Chain [[10],11]: 1*it(10)+0
  Such that:it(10) =< -V__01/3+7

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

* Chain [11]: 0
  with precondition: [B=2,V__01>=21] 


#### Cost of chains of eval_foo_bb1_in_loop_cont(A,B,C):
* Chain [13]: 1*s(1)+0
  Such that:s(1) =< -B/3+7

  with precondition: [A=3,20>=B] 

* Chain [12]: 0
  with precondition: [A=3,B>=21] 


#### Cost of chains of eval_foo_bb0_in(B):
* Chain [14]: 1*s(2)+1*s(3)+0
  Such that:s(2) =< 100
s(3) =< 16/3

  with precondition: [] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [15]: 1*s(4)+1*s(5)+0
  Such that:s(4) =< 100
s(5) =< 16/3

  with precondition: [] 


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [15] with precondition: [] 
    - Upper bound: 316/3 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_i,V_j,B): 316/3 
Asymptotic class: constant 
* Total analysis performed in 60 ms.