/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  : [f18/7]
1. recursive  : [f15/7,f18_loop_cont/8]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f28/4]
4. non_recursive  : [f15_loop_cont/5]
5. non_recursive  : [f0/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f18/7
1. SCC is partially evaluated into f15/7
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f15_loop_cont/5
5. SCC is partially evaluated into f0/4

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

### Specialization of cost equations f18/7 
* CE 10 is refined into CE [11] 
* CE 9 is refined into CE [12] 
* CE 8 is refined into CE [13] 


### Cost equations --> "Loop" of f18/7 
* CEs [13] --> Loop 11 
* CEs [11] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR f18(A,B,C,G,H,I,J) 

#### Partial ranking functions of CR f18(A,B,C,G,H,I,J) 


### Specialization of cost equations f15/7 
* CE 4 is refined into CE [14] 
* CE 2 is refined into CE [15,16] 
* CE 5 is refined into CE [17] 
* CE 3 is refined into CE [18,19,20] 


### Cost equations --> "Loop" of f15/7 
* CEs [20] --> Loop 14 
* CEs [19] --> Loop 15 
* CEs [18] --> Loop 16 
* CEs [14] --> Loop 17 
* CEs [15] --> Loop 18 
* CEs [17] --> Loop 19 
* CEs [16] --> Loop 20 

### Ranking functions of CR f15(A,B,C,G,H,I,J) 

#### Partial ranking functions of CR f15(A,B,C,G,H,I,J) 
* Partial RF of phase [14,15,16]:
  - RF of loop [15:1,16:1]:
    -A+11 depends on loops [14:1] 


### Specialization of cost equations f15_loop_cont/5 
* CE 6 is refined into CE [21] 
* CE 7 is refined into CE [22] 


### Cost equations --> "Loop" of f15_loop_cont/5 
* CEs [21] --> Loop 21 
* CEs [22] --> Loop 22 

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

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


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


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

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

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


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

#### Cost of chains of f18(A,B,C,G,H,I,J):
* Chain [[11]]...: 1*it(11)+0
  with precondition: [10>=A,A>=B,G>=2,3>=G] 

* Chain [[11],13]: 1*it(11)+0
  with precondition: [G=2,A+1=H,10>=A,A>=B,B>=I+1] 

* Chain [[11],12]: 1*it(11)+0
  with precondition: [G=3,10>=A,A>=B] 

* Chain [13]: 0
  with precondition: [G=2,J=C,A+1=H,B=I,10>=A,A>=B] 

* Chain [12]: 0
  with precondition: [G=3,10>=A,A>=B] 


#### Cost of chains of f15(A,B,C,G,H,I,J):
* Chain [[14,15,16]]...: 5*it(14)+0
  with precondition: [10>=A] 

* Chain [[14,15,16],20]...: 6*it(14)+0
  with precondition: [G=3,10>=A] 

* Chain [[14,15,16],19]: 5*it(14)+0
  with precondition: [G=3,10>=A] 

* Chain [[14,15,16],18]: 6*it(14)+0
  with precondition: [G=3,10>=A] 

* Chain [[14,15,16],17]: 5*it(14)+0
  with precondition: [G=4,10>=A,H>=11] 

* Chain [20]...: 1*s(8)+0
  with precondition: [G=3,10>=A] 

* Chain [19]: 0
  with precondition: [G=3] 

* Chain [18]: 1*s(9)+0
  with precondition: [G=3,10>=A] 


#### Cost of chains of f15_loop_cont(A,B,C,D,E):
* Chain [22]: 0
  with precondition: [A=3] 

* Chain [21]: 0
  with precondition: [A=4] 


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

* Chain [23]...: 1*aux(5)+0
  with precondition: [] 


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

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