/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_catmouse_bb1_in/4,eval_catmouse_bb2_in/4]
1. non_recursive  : [eval_catmouse_stop/1]
2. non_recursive  : [eval_catmouse_bb3_in/1]
3. non_recursive  : [eval_catmouse_bb1_in_loop_cont/2]
4. non_recursive  : [eval_catmouse_bb0_in/3]
5. non_recursive  : [eval_catmouse_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_catmouse_bb1_in/4
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_catmouse_bb0_in/3
5. SCC is partially evaluated into eval_catmouse_start/3

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

### Specialization of cost equations eval_catmouse_bb1_in/4 
* 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_catmouse_bb1_in/4 
* CEs [7] --> Loop 6 
* CEs [8] --> Loop 7 
* CEs [6] --> Loop 8 

### Ranking functions of CR eval_catmouse_bb1_in(V_m,V_n,V_x_0,B) 

#### Partial ranking functions of CR eval_catmouse_bb1_in(V_m,V_n,V_x_0,B) 
* Partial RF of phase [6,7]:
  - RF of loop [6:1]:
    -V_m+V_x_0 depends on loops [7:1] 
  - RF of loop [7:1]:
    V_m-V_x_0+1 depends on loops [6:1] 
    V_n-V_x_0+1 depends on loops [6:1] 


### Specialization of cost equations eval_catmouse_bb0_in/3 
* CE 2 is refined into CE [9,10,11] 


### Cost equations --> "Loop" of eval_catmouse_bb0_in/3 
* CEs [11] --> Loop 9 
* CEs [9] --> Loop 10 
* CEs [10] --> Loop 11 

### Ranking functions of CR eval_catmouse_bb0_in(V_m,V_n,B) 

#### Partial ranking functions of CR eval_catmouse_bb0_in(V_m,V_n,B) 


### Specialization of cost equations eval_catmouse_start/3 
* CE 1 is refined into CE [12,13,14] 


### Cost equations --> "Loop" of eval_catmouse_start/3 
* CEs [14] --> Loop 12 
* CEs [13] --> Loop 13 
* CEs [12] --> Loop 14 

### Ranking functions of CR eval_catmouse_start(V_m,V_n,B) 

#### Partial ranking functions of CR eval_catmouse_start(V_m,V_n,B) 


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

#### Cost of chains of eval_catmouse_bb1_in(V_m,V_n,V_x_0,B):
* Chain [[6,7]]...: 2*it(6)+0
  with precondition: [V_n>=V_x_0,B=2] 

* Chain [[6,7],8]: 2*it(6)+0
  with precondition: [B=2,V_m>=V_n,V_n>=V_x_0] 

* Chain [8]: 0
  with precondition: [B=2,V_x_0>=V_n+1] 


#### Cost of chains of eval_catmouse_bb0_in(V_m,V_n,B):
* Chain [11]: 0
  with precondition: [0>=V_n+1] 

* Chain [10]: 2*s(1)+0
  with precondition: [V_n>=0,V_m>=V_n] 

* Chain [9]...: 2*s(2)+0
  with precondition: [V_n>=0] 


#### Cost of chains of eval_catmouse_start(V_m,V_n,B):
* Chain [14]: 0
  with precondition: [0>=V_n+1] 

* Chain [13]: 2*s(3)+0
  with precondition: [V_n>=0,V_m>=V_n] 

* Chain [12]...: 2*s(4)+0
  with precondition: [V_n>=0] 


Closed-form bounds of eval_catmouse_start(V_m,V_n,B): 
-------------------------------------
* Chain [14] with precondition: [0>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [13] with precondition: [V_n>=0,V_m>=V_n] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [12]... with precondition: [V_n>=0] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_catmouse_start(V_m,V_n,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 74 ms.