/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_random1d_0/3,eval_random1d_1/4,eval_random1d_bb1_in/3,eval_random1d_bb2_in/3]
1. non_recursive  : [eval_random1d_stop/1]
2. non_recursive  : [eval_random1d_bb3_in/1]
3. non_recursive  : [eval_random1d_bb1_in_loop_cont/2]
4. non_recursive  : [eval_random1d_bb0_in/2]
5. non_recursive  : [eval_random1d_start/2]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_random1d_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_random1d_bb0_in/2
5. SCC is partially evaluated into eval_random1d_start/2

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

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


### Cost equations --> "Loop" of eval_random1d_bb1_in/3 
* CEs [7] --> Loop 6 
* CEs [6] --> Loop 7 

### Ranking functions of CR eval_random1d_bb1_in(V_max,V_x_0,B) 
* RF of phase [6]: [V_max-V_x_0+1]

#### Partial ranking functions of CR eval_random1d_bb1_in(V_max,V_x_0,B) 
* Partial RF of phase [6]:
  - RF of loop [6:1]:
    V_max-V_x_0+1


### Specialization of cost equations eval_random1d_bb0_in/2 
* CE 3 is refined into CE [8] 
* CE 2 is refined into CE [9] 


### Cost equations --> "Loop" of eval_random1d_bb0_in/2 
* CEs [8] --> Loop 8 
* CEs [9] --> Loop 9 

### Ranking functions of CR eval_random1d_bb0_in(V_max,B) 

#### Partial ranking functions of CR eval_random1d_bb0_in(V_max,B) 


### Specialization of cost equations eval_random1d_start/2 
* CE 1 is refined into CE [10,11] 


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

### Ranking functions of CR eval_random1d_start(V_max,B) 

#### Partial ranking functions of CR eval_random1d_start(V_max,B) 


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

#### Cost of chains of eval_random1d_bb1_in(V_max,V_x_0,B):
* Chain [[6],7]: 1*it(6)+0
  Such that:it(6) =< V_max-V_x_0+1

  with precondition: [B=2,V_x_0>=1,V_max>=V_x_0] 


#### Cost of chains of eval_random1d_bb0_in(V_max,B):
* Chain [9]: 0
  with precondition: [0>=V_max] 

* Chain [8]: 1*s(1)+0
  Such that:s(1) =< V_max

  with precondition: [V_max>=1] 


#### Cost of chains of eval_random1d_start(V_max,B):
* Chain [11]: 0
  with precondition: [0>=V_max] 

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

  with precondition: [V_max>=1] 


Closed-form bounds of eval_random1d_start(V_max,B): 
-------------------------------------
* Chain [11] with precondition: [0>=V_max] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [10] with precondition: [V_max>=1] 
    - Upper bound: V_max 
    - Complexity: n 

### Maximum cost of eval_random1d_start(V_max,B): nat(V_max) 
Asymptotic class: n 
* Total analysis performed in 47 ms.