/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f14/3]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f22/5]
3. non_recursive  : [f14_loop_cont/6]
4. non_recursive  : [f0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f14/3
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f14_loop_cont/6
4. SCC is partially evaluated into f0/5

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

### Specialization of cost equations f14/3 
* CE 6 is refined into CE [9] 
* CE 5 is refined into CE [10] 
* CE 4 is refined into CE [11] 


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

### Ranking functions of CR f14(C,G,H) 

#### Partial ranking functions of CR f14(C,G,H) 


### Specialization of cost equations f14_loop_cont/6 
* CE 8 is refined into CE [12] 
* CE 7 is refined into CE [13] 


### Cost equations --> "Loop" of f14_loop_cont/6 
* CEs [12] --> Loop 10 
* CEs [13] --> Loop 11 

### Ranking functions of CR f14_loop_cont(A,B,C,D,E,F) 

#### Partial ranking functions of CR f14_loop_cont(A,B,C,D,E,F) 


### Specialization of cost equations f0/5 
* CE 1 is refined into CE [14,15,16,17,18] 
* CE 2 is refined into CE [19,20,21,22,23] 
* CE 3 is refined into CE [24,25,26,27,28] 


### Cost equations --> "Loop" of f0/5 
* CEs [17,18,22,23,27,28] --> Loop 12 
* CEs [14,15,16,19,20,21,24,25,26] --> Loop 13 

### Ranking functions of CR f0(A,B,C,D,G) 

#### Partial ranking functions of CR f0(A,B,C,D,G) 


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

#### Cost of chains of f14(C,G,H):
* Chain [[7]]...: 1*it(7)+0
  with precondition: [C>=0] 

* Chain [[7],9]: 1*it(7)+0
  with precondition: [G=2,C>=0,H>=C+1] 

* Chain [[7],8]: 1*it(7)+0
  with precondition: [G=3,C>=0] 

* Chain [9]: 0
  with precondition: [G=2,C=H,C>=0] 

* Chain [8]: 0
  with precondition: [G=3,C>=0] 


#### Cost of chains of f14_loop_cont(A,B,C,D,E,F):
* Chain [11]: 0
  with precondition: [A=2,C=B] 

* Chain [10]: 0
  with precondition: [A=3,C=B] 


#### Cost of chains of f0(A,B,C,D,G):
* Chain [13]: 1*aux(2)+0
  with precondition: [] 

* Chain [12]...: 1*aux(3)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,G): 
-------------------------------------
* Chain [13] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [12]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,D,G): inf 
Asymptotic class: infinity 
* Total analysis performed in 85 ms.