/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 6 is refined into CE [9] 
* CE 5 is refined into CE [10] 
* CE 4 is refined into CE [11] 
* CE 3 is refined into CE [12] 


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

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

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


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


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

### 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 [18,19,20,21,22] 


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

### 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 [[10]]...: 1*it(10)+0
  with precondition: [V__0=0,B=2] 

* Chain [[9],[10]]...: 1*it(9)+1*it(10)+0
  Such that:it(9) =< -V__0

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

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

  with precondition: [B=2,5>=V__0,V__0>=1] 

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

* Chain [11]: 0
  with precondition: [B=2,V__0>=6] 


#### Cost of chains of eval_foo_bb0_in(V_i,B):
* Chain [17]: 0
  with precondition: [0>=V_i+6] 

* Chain [16]: 0
  with precondition: [V_i>=6] 

* Chain [15]...: 1*s(1)+0
  with precondition: [V_i=0] 

* Chain [14]...: 1*s(2)+1*s(3)+0
  Such that:s(2) =< V_i

  with precondition: [5>=V_i,V_i>=1] 

* Chain [13]...: 1*s(4)+1*s(5)+0
  Such that:s(4) =< -V_i

  with precondition: [0>=V_i+1,V_i+5>=0] 


#### Cost of chains of eval_foo_start(V_i,B):
* Chain [22]: 0
  with precondition: [0>=V_i+6] 

* Chain [21]: 0
  with precondition: [V_i>=6] 

* Chain [20]...: 1*s(6)+0
  with precondition: [V_i=0] 

* Chain [19]...: 1*s(7)+1*s(8)+0
  Such that:s(7) =< V_i

  with precondition: [5>=V_i,V_i>=1] 

* Chain [18]...: 1*s(9)+1*s(10)+0
  Such that:s(9) =< -V_i

  with precondition: [0>=V_i+1,V_i+5>=0] 


Closed-form bounds of eval_foo_start(V_i,B): 
-------------------------------------
* Chain [22] with precondition: [0>=V_i+6] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [V_i>=6] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [20]... with precondition: [V_i=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [19]... with precondition: [5>=V_i,V_i>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [18]... with precondition: [0>=V_i+1,V_i+5>=0] 
    - Upper bound: inf 
    - Complexity: infinity 

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