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


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


MAYBE

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

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

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

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

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


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

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

#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    V__0-10
* Partial RF of phase [9,11]:
  - RF of loop [9:1]:
    V__0-25 depends on loops [11:1] 
  - RF of loop [11:1]:
    -V__0/4+13/2 depends on loops [9:1] 


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [13,14,15,16] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [16] --> Loop 13 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [13] --> Loop 16 

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

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


### Specialization of cost equations eval_foo_start/2 
* CE 1 is refined into CE [17,18,19,20] 


### Cost equations --> "Loop" of eval_foo_start/2 
* CEs [20] --> Loop 17 
* CEs [19] --> Loop 18 
* CEs [18] --> Loop 19 
* CEs [17] --> Loop 20 

### Ranking functions of CR eval_foo_start(V_i,B) 

#### Partial ranking functions of CR eval_foo_start(V_i,B) 


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

#### Cost of chains of eval_foo_bb1_in(V__0,B):
* Chain [[9,11]]...: 2*it(9)+0
  with precondition: [30>=V__0,V__0>=25,B=2] 

* Chain [[8],12]: 1*it(8)+0
  Such that:it(8) =< V__0

  with precondition: [B=2,24>=V__0,V__0>=11] 

* Chain [12]: 0
  with precondition: [B=2,10>=V__0] 

* Chain [10,[8],12]: 1*it(8)+1
  Such that:it(8) =< 20

  with precondition: [B=2,V__0>=31] 


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

  with precondition: [24>=V_i,V_i>=11] 

* Chain [15]: 0
  with precondition: [10>=V_i] 

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

  with precondition: [V_i>=31] 

* Chain [13]...: 2*s(3)+0
  with precondition: [30>=V_i,V_i>=25] 


#### Cost of chains of eval_foo_start(V_i,B):
* Chain [20]: 1*s(4)+0
  Such that:s(4) =< V_i

  with precondition: [24>=V_i,V_i>=11] 

* Chain [19]: 0
  with precondition: [10>=V_i] 

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

  with precondition: [V_i>=31] 

* Chain [17]...: 2*s(6)+0
  with precondition: [30>=V_i,V_i>=25] 


Closed-form bounds of eval_foo_start(V_i,B): 
-------------------------------------
* Chain [20] with precondition: [24>=V_i,V_i>=11] 
    - Upper bound: V_i 
    - Complexity: n 
* Chain [19] with precondition: [10>=V_i] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [18] with precondition: [V_i>=31] 
    - Upper bound: 21 
    - Complexity: constant 
* Chain [17]... with precondition: [30>=V_i,V_i>=25] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 84 ms.