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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/4,eval_foo_bb2_in/4]
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/4]
5. non_recursive  : [eval_foo_start/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb1_in/4
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/4
5. SCC is partially evaluated into eval_foo_start/5

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

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


### Cost equations --> "Loop" of eval_foo_bb1_in/4 
* CEs [7] --> Loop 6 
* CEs [8] --> Loop 7 
* CEs [6] --> Loop 8 

### Ranking functions of CR eval_foo_bb1_in(V_y,V__02,V__01,B) 

#### Partial ranking functions of CR eval_foo_bb1_in(V_y,V__02,V__01,B) 
* Partial RF of phase [6,7]:
  - RF of loop [6:1]:
    V__02-V__01 depends on loops [7:1] 
    V_y-V__01
  - RF of loop [7:1]:
    -V__02+V__01+1 depends on loops [6:1] 
    V_y-V__02


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


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

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

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


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


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

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

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


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

#### Cost of chains of eval_foo_bb1_in(V_y,V__02,V__01,B):
* Chain [[6,7],8]: 1*it(6)+1*it(7)+0
  Such that:it(7) =< V_y-V__02
it(6) =< V_y-V__01

  with precondition: [B=2,V_y>=V__01+1] 

* Chain [8]: 0
  with precondition: [B=2,V__01>=V_y] 


#### Cost of chains of eval_foo_bb0_in(V_x,V_y,V_z,B):
* Chain [10]: 1*s(1)+1*s(2)+0
  Such that:s(2) =< -V_x+V_y
s(1) =< V_y-V_z

  with precondition: [V_y>=V_x+1] 

* Chain [9]: 0
  with precondition: [V_x>=V_y] 


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

  with precondition: [V_y>=V_x+1] 

* Chain [11]: 0
  with precondition: [V_x>=V_y] 


Closed-form bounds of eval_foo_start(V_c,V_x,V_y,V_z,B): 
-------------------------------------
* Chain [12] with precondition: [V_y>=V_x+1] 
    - Upper bound: -V_x+V_y+nat(V_y-V_z) 
    - Complexity: n 
* Chain [11] with precondition: [V_x>=V_y] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_c,V_x,V_y,V_z,B): nat(V_y-V_z)+nat(-V_x+V_y) 
Asymptotic class: n 
* Total analysis performed in 77 ms.