/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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/2]
5. non_recursive  : [eval_foo_start/4]

#### 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/2
5. SCC is partially evaluated into eval_foo_start/4

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

### Specialization of cost equations eval_foo_bb1_in/3 
* CE 6 is refined into CE [7] 
* CE 3 is refined into CE [8] 
* CE 4 is refined into CE [9] 
* CE 5 is refined into CE [10] 


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

### Ranking functions of CR eval_foo_bb1_in(V_z,V__0,B) 
* RF of phase [7]: [-V__0/2+20]
* RF of phase [8]: [-V__0/2+20]
* RF of phase [9]: [-V__0+40]

#### Partial ranking functions of CR eval_foo_bb1_in(V_z,V__0,B) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    -V__0/2+20
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    -V__0/2+20
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    -V__0+40


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


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

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

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


### Specialization of cost equations eval_foo_start/4 
* CE 1 is refined into CE [14,15,16] 


### Cost equations --> "Loop" of eval_foo_start/4 
* CEs [16] --> Loop 14 
* CEs [15] --> Loop 15 
* CEs [14] --> Loop 16 

### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) 

#### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) 


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

#### Cost of chains of eval_foo_bb1_in(V_z,V__0,B):
* Chain [[9],10]: 1*it(9)+0
  Such that:it(9) =< -V__0+40

  with precondition: [V_z=0,B=2,39>=V__0,V__0>=0] 

* Chain [[8],10]: 1*it(8)+0
  Such that:it(8) =< -V__0/2+20

  with precondition: [B=2,0>=V_z+1,39>=V__0,V__0>=0] 

* Chain [[7],10]: 1*it(7)+0
  Such that:it(7) =< -V__0/2+20

  with precondition: [B=2,39>=V__0,V_z>=1,V__0>=0] 


#### Cost of chains of eval_foo_bb0_in(V_z,B):
* Chain [13]: 1*s(1)+0
  Such that:s(1) =< 40

  with precondition: [V_z=0] 

* Chain [12]: 1*s(2)+0
  Such that:s(2) =< 20

  with precondition: [0>=V_z+1] 

* Chain [11]: 1*s(3)+0
  Such that:s(3) =< 20

  with precondition: [V_z>=1] 


#### Cost of chains of eval_foo_start(V_x,V_y,V_z,B):
* Chain [16]: 1*s(4)+0
  Such that:s(4) =< 40

  with precondition: [V_z=0] 

* Chain [15]: 1*s(5)+0
  Such that:s(5) =< 20

  with precondition: [0>=V_z+1] 

* Chain [14]: 1*s(6)+0
  Such that:s(6) =< 20

  with precondition: [V_z>=1] 


Closed-form bounds of eval_foo_start(V_x,V_y,V_z,B): 
-------------------------------------
* Chain [16] with precondition: [V_z=0] 
    - Upper bound: 40 
    - Complexity: constant 
* Chain [15] with precondition: [0>=V_z+1] 
    - Upper bound: 20 
    - Complexity: constant 
* Chain [14] with precondition: [V_z>=1] 
    - Upper bound: 20 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_x,V_y,V_z,B): 40 
Asymptotic class: constant 
* Total analysis performed in 93 ms.