/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  : [f2/6]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f300/4]
3. non_recursive  : [f2_loop_cont/5]
4. non_recursive  : [f3/4]

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

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

### Specialization of cost equations f2/6 
* CE 9 is refined into CE [12] 
* CE 7 is refined into CE [13] 
* CE 6 is refined into CE [14] 
* CE 8 is refined into CE [15] 
* CE 4 is refined into CE [16] 
* CE 5 is refined into CE [17] 
* CE 3 is refined into CE [18] 
* CE 2 is refined into CE [19] 


### Cost equations --> "Loop" of f2/6 
* CEs [16] --> Loop 12 
* CEs [17] --> Loop 13 
* CEs [18] --> Loop 14 
* CEs [19] --> Loop 15 
* CEs [12] --> Loop 16 
* CEs [13] --> Loop 17 
* CEs [14] --> Loop 18 
* CEs [15] --> Loop 19 

### Ranking functions of CR f2(A,B,C,F,G,H) 

#### Partial ranking functions of CR f2(A,B,C,F,G,H) 


### Specialization of cost equations f2_loop_cont/5 
* CE 11 is refined into CE [20] 
* CE 10 is refined into CE [21] 


### Cost equations --> "Loop" of f2_loop_cont/5 
* CEs [20] --> Loop 20 
* CEs [21] --> Loop 21 

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

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


### Specialization of cost equations f3/4 
* CE 1 is refined into CE [22,23,24,25,26,27,28] 


### Cost equations --> "Loop" of f3/4 
* CEs [27,28] --> Loop 22 
* CEs [25] --> Loop 23 
* CEs [24] --> Loop 24 
* CEs [22] --> Loop 25 
* CEs [23,26] --> Loop 26 

### Ranking functions of CR f3(A,B,C,F) 

#### Partial ranking functions of CR f3(A,B,C,F) 


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

#### Cost of chains of f2(A,B,C,F,G,H):
* Chain [[12,13,14,15]]...: 4*it(12)+0
  with precondition: [] 

* Chain [[12,13,14,15],19]: 4*it(12)+0
  with precondition: [F=2,G=0] 

* Chain [[12,13,14,15],18]: 4*it(12)+0
  with precondition: [F=2,G=0] 

* Chain [[12,13,14,15],17]: 4*it(12)+0
  with precondition: [F=2,G=0] 

* Chain [[12,13,14,15],16]: 4*it(12)+0
  with precondition: [F=3] 

* Chain [19]: 0
  with precondition: [A=0,F=2,G=0] 

* Chain [18]: 0
  with precondition: [F=2,G=0,0>=A+1] 

* Chain [17]: 0
  with precondition: [F=2,G=0,A>=1] 

* Chain [16]: 0
  with precondition: [F=3] 


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

* Chain [20]: 0
  with precondition: [A=3] 


#### Cost of chains of f3(A,B,C,F):
* Chain [26]: 1*aux(3)+0
  with precondition: [] 

* Chain [25]: 0
  with precondition: [A=0] 

* Chain [24]: 0
  with precondition: [0>=A+1] 

* Chain [23]: 0
  with precondition: [A>=1] 

* Chain [22]...: 1*aux(4)+0
  with precondition: [] 


Closed-form bounds of f3(A,B,C,F): 
-------------------------------------
* Chain [26] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [25] with precondition: [A=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [24] with precondition: [0>=A+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [A>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f3(A,B,C,F): inf 
Asymptotic class: infinity 
* Total analysis performed in 139 ms.