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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f4/9,f5/9]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f3/6]
3. non_recursive  : [f4_loop_cont/7]
4. non_recursive  : [f30/6]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f4/9
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f4_loop_cont/7
4. SCC is partially evaluated into f30/6

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

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


### Cost equations --> "Loop" of f4/9 
* CEs [9] --> Loop 8 
* CEs [8] --> Loop 9 

### Ranking functions of CR f4(A,B,D,E,G,H,I,J,K) 

#### Partial ranking functions of CR f4(A,B,D,E,G,H,I,J,K) 


### Specialization of cost equations f4_loop_cont/7 
* CE 7 is refined into CE [10] 
* CE 6 is refined into CE [11] 


### Cost equations --> "Loop" of f4_loop_cont/7 
* CEs [10] --> Loop 10 
* CEs [11] --> Loop 11 

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

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


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


### Cost equations --> "Loop" of f30/6 
* CEs [13,14] --> Loop 12 
* CEs [12] --> Loop 13 

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

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


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

#### Cost of chains of f4(A,B,D,E,G,H,I,J,K):
* Chain [[8]]...: 1*it(8)+0
  with precondition: [A>=2] 

* Chain [[8],9]: 1*it(8)+0
  with precondition: [G=2,A>=2] 

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


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

* Chain [10]: 0
  with precondition: [A=3,D=2] 


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

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


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

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