/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  : [f0/6]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f0_loop_cont/2]
3. non_recursive  : [f1/7]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f0/6
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f1/7

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

### Specialization of cost equations f0/6 
* CE 7 is refined into CE [8] 
* CE 2 is refined into CE [9] 
* CE 3 is refined into CE [10] 
* CE 6 is refined into CE [11] 
* CE 4 is refined into CE [12] 
* CE 5 is refined into CE [13] 


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

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

#### Partial ranking functions of CR f0(A,B,C,D,E,L) 
* Partial RF of phase [8,9,10,11,12]:
  - RF of loop [8:1]:
    -A/2 depends on loops [9:1,10:1] 
    B/2+C/2+D/2+E/2-1/2 depends on loops [9:1,10:1] 
  - RF of loop [9:1]:
    A/2+C/2+D/2+E/2-1/2 depends on loops [8:1,11:1] 
    -B/2 depends on loops [8:1,11:1] 
  - RF of loop [10:1]:
    A/2+B/2+D/2+E/2-1/2 depends on loops [8:1,12:1] 
    -C/2 depends on loops [8:1,12:1] 
  - RF of loop [11:1]:
    A/2+B/2+C/2+E/2-1/2 depends on loops [9:1,12:1] 
    -D/2 depends on loops [9:1,12:1] 
  - RF of loop [12:1]:
    A/2+B/2+C/2+D/2-1/2 depends on loops [10:1,11:1] 
    -E/2 depends on loops [10:1,11:1] 


### Specialization of cost equations f1/7 
* CE 1 is refined into CE [14,15] 


### Cost equations --> "Loop" of f1/7 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 

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

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


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

#### Cost of chains of f0(A,B,C,D,E,L):
* Chain [[8,9,10,11,12]]...: 5*it(8)+0
  with precondition: [A+B+C+D+E>=1,L=2] 

* Chain [[8,9,10,11,12],13]: 5*it(8)+0
  with precondition: [L=2,A+B+C+D+E>=1] 

* Chain [13]: 0
  with precondition: [L=2,A+B+C+D+E>=1] 


#### Cost of chains of f1(A,B,C,D,E,F,L):
* Chain [15]: 1*s(2)+0
  with precondition: [] 

* Chain [14]...: 5*s(3)+0
  with precondition: [] 


Closed-form bounds of f1(A,B,C,D,E,F,L): 
-------------------------------------
* Chain [15] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [14]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f1(A,B,C,D,E,F,L): inf 
Asymptotic class: infinity 
* Total analysis performed in 2057 ms.