/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  : [f20/3]
1. recursive  : [f12/3,f20_loop_cont/4,f9/3]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f9_loop_cont/2]
4. non_recursive  : [f0/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f20/3
1. SCC is partially evaluated into f9/3
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f0/3

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

### Specialization of cost equations f20/3 
* CE 11 is refined into CE [12] 
* CE 10 is refined into CE [13] 
* CE 9 is refined into CE [14] 


### Cost equations --> "Loop" of f20/3 
* CEs [14] --> Loop 12 
* CEs [12] --> Loop 13 
* CEs [13] --> Loop 14 

### Ranking functions of CR f20(A,D,E) 
* RF of phase [12]: [A-2]

#### Partial ranking functions of CR f20(A,D,E) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    A-2


### Specialization of cost equations f9/3 
* CE 4 is refined into CE [15,16] 
* CE 5 is refined into CE [17,18] 
* CE 8 is refined into CE [19] 
* CE 6 is refined into CE [20] 
* CE 2 is refined into CE [21] 
* CE 3 is refined into CE [22] 
* CE 7 is refined into CE [23,24] 


### Cost equations --> "Loop" of f9/3 
* CEs [21] --> Loop 15 
* CEs [22] --> Loop 16 
* CEs [24] --> Loop 17 
* CEs [20] --> Loop 18 
* CEs [23] --> Loop 19 
* CEs [15,16] --> Loop 20 
* CEs [18] --> Loop 21 
* CEs [17] --> Loop 22 
* CEs [19] --> Loop 23 

### Ranking functions of CR f9(A,B,D) 

#### Partial ranking functions of CR f9(A,B,D) 
* Partial RF of phase [15,16,17,18,19]:
  - RF of loop [15:1,16:1]:
    -A+6 depends on loops [18:1,19:1] 
  - RF of loop [18:1]:
    A/2-5/2 depends on loops [15:1,16:1] 
  - RF of loop [19:1]:
    A-2 depends on loops [15:1,16:1] 


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


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

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

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


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

#### Cost of chains of f20(A,D,E):
* Chain [[12],14]: 1*it(12)+0
  Such that:it(12) =< A

  with precondition: [D=2,E=2,A>=3] 

* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< A

  with precondition: [D=3,A>=3] 

* Chain [14]: 0
  with precondition: [D=2,A=E,2>=A] 

* Chain [13]: 0
  with precondition: [D=3] 


#### Cost of chains of f9(A,B,D):
* Chain [[15,16,17,18,19]]...: 7*it(15)+0
  with precondition: [D=3] 

* Chain [[15,16,17,18,19],23]: 7*it(15)+0
  with precondition: [D=3] 

* Chain [[15,16,17,18,19],22]: 7*it(15)+0
  with precondition: [D=3] 

* Chain [[15,16,17,18,19],21]: 7*it(15)+1*s(7)+0
  Such that:s(7) =< 5

  with precondition: [D=3] 

* Chain [[15,16,17,18,19],20]: 7*it(15)+1*s(8)+0
  Such that:s(8) =< 6

  with precondition: [D=3] 

* Chain [23]: 0
  with precondition: [D=3] 

* Chain [22]: 0
  with precondition: [D=3,5>=A] 

* Chain [21]: 1*s(7)+0
  Such that:s(7) =< A

  with precondition: [D=3,5>=A,A>=3] 

* Chain [20]: 1*s(8)+0
  Such that:s(8) =< A

  with precondition: [D=3,A>=6] 


#### Cost of chains of f0(A,B,D):
* Chain [25]: 1*aux(17)+0
  with precondition: [] 

* Chain [24]...: 7*s(18)+0
  with precondition: [] 


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

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