/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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/1]
5. non_recursive  : [eval_foo_start/4]

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

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

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


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

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

#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 

Warning: no base case found for predicate

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


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

### 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/4 
* CE 1 is refined into CE [7] 


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

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

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

Warning: no base case found for predicate

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

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


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


#### Cost of chains of eval_foo_start(V_a,V_b,V_i,B):
* Chain [7]...: 1*s(2)+0
  with precondition: [] 


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

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