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


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


MAYBE
Warning: Ignored call to eval_foo_bb1_in_loop_cont/2 in equation eval_foo_bb0_in/3 

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3]
1. non_recursive  : [eval_foo_bb0_in/3]
2. 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 partially evaluated into eval_foo_start/3

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

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


### Cost equations --> "Loop" of eval_foo_bb1_in/3 
* CEs [4] --> Loop 4 
* CEs [5] --> Loop 5 

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* RF of phase [5]: [-V__01/4+V__0/4]

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [5]:
  - RF of loop [5:1]:
    -V__01/4+V__0/4

Warning: no base case found for predicate

### Specialization of cost equations eval_foo_start/3 
* CE 1 is refined into CE [6,7] 


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

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

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

Warning: no base case found for predicate

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

#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
* Chain [[5],[4]]...: 1*it(4)+1*it(5)+0
  Such that:it(5) =< -V__01/4+V__0/4

  with precondition: [V__0>=V__01+1] 

* Chain [[4]]...: 1*it(4)+0
  with precondition: [V__01>=V__0] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [7]...: 1*s(1)+1*s(2)+0
  Such that:s(1) =< -V_i/4+V_j/4

  with precondition: [V_j>=V_i+1] 

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


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [7]... with precondition: [V_j>=V_i+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [6]... with precondition: [V_i>=V_j] 
    - Upper bound: inf 
    - Complexity: infinity 

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