/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  : [f2/10]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f300/11]
3. non_recursive  : [f2_loop_cont/12]
4. non_recursive  : [f1/11]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f2/10
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/12
4. SCC is partially evaluated into f1/11

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

### Specialization of cost equations f2/10 
* CE 4 is refined into CE [7] 
* CE 2 is refined into CE [8] 
* CE 3 is refined into CE [9] 


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

### Ranking functions of CR f2(A,B,C,D,E,N,O,P,Q,R) 

#### Partial ranking functions of CR f2(A,B,C,D,E,N,O,P,Q,R) 


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


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

### Ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 

#### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 


### Specialization of cost equations f1/11 
* CE 1 is refined into CE [12,13,14,15,16] 


### Cost equations --> "Loop" of f1/11 
* CEs [15,16] --> Loop 12 
* CEs [14] --> Loop 13 
* CEs [12] --> Loop 14 
* CEs [13] --> Loop 15 

### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,N) 

#### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,N) 


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

#### Cost of chains of f2(A,B,C,D,E,N,O,P,Q,R):
* Chain [[7]]...: 1*it(7)+0
  with precondition: [A>=1] 

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

* Chain [9]: 0
  with precondition: [N=2,R=E,0>=A] 

* Chain [8]: 0
  with precondition: [N=3] 


#### Cost of chains of f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L):
* Chain [11]: 0
  with precondition: [A=2,K=G,J=I] 

* Chain [10]: 0
  with precondition: [A=3,K=G,J=I] 


#### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,N):
* Chain [15]: 0
  with precondition: [] 

* Chain [14]: 0
  with precondition: [0>=A] 

* Chain [13]: 1*s(1)+0
  with precondition: [A>=1] 

* Chain [12]...: 1*aux(1)+0
  with precondition: [A>=1] 


Closed-form bounds of f1(A,B,C,D,E,F,G,H,I,J,N): 
-------------------------------------
* Chain [15] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [14] with precondition: [0>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [13] with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [12]... with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f1(A,B,C,D,E,F,G,H,I,J,N): inf 
Asymptotic class: infinity 
* Total analysis performed in 82 ms.