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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb2_in/3,eval_foo_bb3_in/3]
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/2]
6. non_recursive  : [eval_foo_start/3]

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

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

### Specialization of cost equations eval_foo_bb2_in/3 
* CE 6 is refined into CE [7] 
* CE 5 is refined into CE [8] 


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

### Ranking functions of CR eval_foo_bb2_in(V__01,B,C) 
* RF of phase [7]: [V__01-1]

#### Partial ranking functions of CR eval_foo_bb2_in(V__01,B,C) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    V__01-1


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


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

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

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


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [11,12] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [12] --> Loop 11 
* CEs [11] --> Loop 12 

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

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


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


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

### Ranking functions of CR eval_foo_start(V_x1,V_x2,B) 

#### Partial ranking functions of CR eval_foo_start(V_x1,V_x2,B) 


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

#### Cost of chains of eval_foo_bb2_in(V__01,B,C):
* Chain [[7],8]: 1*it(7)+0
  Such that:it(7) =< V__01

  with precondition: [B=2,C=1,1000>=V__01,V__01>=2] 


#### Cost of chains of eval_foo_bb1_in(V__0,B):
* Chain [[9],10]: 1*it(9)+1*s(3)+0
  Such that:aux(4) =< -V__0+11
it(9) =< aux(4)
s(3) =< aux(4)*1000

  with precondition: [B=3,10>=V__0] 

* Chain [10]: 0
  with precondition: [B=3,V__0>=11] 


#### Cost of chains of eval_foo_bb0_in(V_x1,B):
* Chain [12]: 1*s(5)+1*s(6)+0
  Such that:s(4) =< -V_x1+11
s(5) =< s(4)
s(6) =< s(4)*1000

  with precondition: [10>=V_x1] 

* Chain [11]: 0
  with precondition: [V_x1>=11] 


#### Cost of chains of eval_foo_start(V_x1,V_x2,B):
* Chain [14]: 1*s(8)+1*s(9)+0
  Such that:s(7) =< -V_x1+11
s(8) =< s(7)
s(9) =< s(7)*1000

  with precondition: [10>=V_x1] 

* Chain [13]: 0
  with precondition: [V_x1>=11] 


Closed-form bounds of eval_foo_start(V_x1,V_x2,B): 
-------------------------------------
* Chain [14] with precondition: [10>=V_x1] 
    - Upper bound: -1001*V_x1+11011 
    - Complexity: n 
* Chain [13] with precondition: [V_x1>=11] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_x1,V_x2,B): nat(-V_x1+11)*1001 
Asymptotic class: n 
* Total analysis performed in 63 ms.