/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/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/3]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb5_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/1]
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/1
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 5 is refined into CE [6] 
* CE 3 is refined into CE [7] 
* CE 4 is refined into CE [8] 


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

### 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 [6,7]:
  - RF of loop [6:1]:
    V__0-48 depends on loops [7:1] 
    -V__01+52 depends on loops [7:1] 
  - RF of loop [7:1]:
    -V__0+49 depends on loops [6:1] 
    V__01-51 depends on loops [6:1] 

Warning: no base case found for predicate

### Specialization of cost equations eval_foo_bb0_in/1 
* CE 2 is refined into CE [9] 


### Cost equations --> "Loop" of eval_foo_bb0_in/1 
* CEs [9] --> Loop 9 

### Ranking functions of CR eval_foo_bb0_in(B) 

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

Warning: no base case found for predicate

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


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

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


#### Cost of chains of eval_foo_bb0_in(B):
* Chain [9]...: 2*s(1)+0
  with precondition: [] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [10]...: 2*s(2)+0
  with precondition: [] 


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [10]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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