/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_1/4,eval_foo_2/5,eval_foo_4/4,eval_foo_5/5,eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/3,eval_foo_bb5_in/3]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo__critedge_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/3]
5. non_recursive  : [eval_foo_start/3]

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

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

### Specialization of cost equations eval_foo_bb1_in/3 
* CE 6 is refined into CE [8] 
* CE 5 is refined into CE [9] 
* CE 7 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/3 
* CEs [11] --> Loop 8 
* CEs [12] --> Loop 9 
* CEs [8] --> Loop 10 
* CEs [9] --> Loop 11 
* CEs [10] --> Loop 12 

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 

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


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


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

### Ranking functions of CR eval_foo_bb0_in(V_p,V_q,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_p,V_q,B) 


### Specialization of cost equations eval_foo_start/3 
* CE 1 is refined into CE [18,19,20,21,22] 


### Cost equations --> "Loop" of eval_foo_start/3 
* 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_p,V_q,B) 

#### Partial ranking functions of CR eval_foo_start(V_p,V_q,B) 


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

#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
* Chain [[8,9]]...: 2*it(8)+0
  with precondition: [V__0+V__01>=3,V__0>=1,V__01>=1,B=2] 

* Chain [[8,9],12]: 2*it(8)+0
  with precondition: [B=2,V__01>=1,V__0>=1,V__0+V__01>=3] 

* Chain [[8,9],11]: 2*it(8)+0
  with precondition: [B=2,V__01>=1,V__0>=1,V__0+V__01>=3] 

* Chain [[8,9],10]: 2*it(8)+0
  with precondition: [B=2,V__01>=1,V__0>=1,V__0+V__01>=3] 

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

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

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


#### Cost of chains of eval_foo_bb0_in(V_p,V_q,B):
* Chain [17]: 0
  with precondition: [V_q=V_p] 

* Chain [16]: 0
  with precondition: [0>=V_p] 

* Chain [15]: 0
  with precondition: [0>=V_q] 

* Chain [14]: 1*s(4)+0
  with precondition: [V_p>=1,V_q>=1,V_p+V_q>=3] 

* Chain [13]...: 2*s(5)+0
  with precondition: [V_p>=1,V_q>=1,V_p+V_q>=3] 


#### Cost of chains of eval_foo_start(V_p,V_q,B):
* Chain [22]: 0
  with precondition: [V_q=V_p] 

* Chain [21]: 0
  with precondition: [0>=V_p] 

* Chain [20]: 0
  with precondition: [0>=V_q] 

* Chain [19]: 1*s(6)+0
  with precondition: [V_p>=1,V_q>=1,V_p+V_q>=3] 

* Chain [18]...: 2*s(7)+0
  with precondition: [V_p>=1,V_q>=1,V_p+V_q>=3] 


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

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