/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  : [f3/7]
1. non_recursive  : [exit_location/1]
2. recursive  : [f6/3]
3. non_recursive  : [f6_loop_cont/2]
4. non_recursive  : [f3_loop_cont/7]
5. non_recursive  : [f0/6]

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

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

### Specialization of cost equations f3/7 
* CE 4 is refined into CE [11] 
* CE 5 is refined into CE [12] 
* CE 3 is refined into CE [13] 
* CE 2 is refined into CE [14] 


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

### Ranking functions of CR f3(C,D,E,G,H,I,J) 
* RF of phase [11,12]: [C]

#### Partial ranking functions of CR f3(C,D,E,G,H,I,J) 
* Partial RF of phase [11,12]:
  - RF of loop [11:1]:
    C/2
  - RF of loop [12:1]:
    C


### Specialization of cost equations f6/3 
* CE 10 is refined into CE [15] 
* CE 8 is refined into CE [16] 
* CE 9 is refined into CE [17] 


### Cost equations --> "Loop" of f6/3 
* CEs [16] --> Loop 15 
* CEs [17] --> Loop 16 
* CEs [15] --> Loop 17 

### Ranking functions of CR f6(A,E,G) 

#### Partial ranking functions of CR f6(A,E,G) 


### Specialization of cost equations f3_loop_cont/7 
* CE 7 is refined into CE [18,19] 
* CE 6 is refined into CE [20] 


### Cost equations --> "Loop" of f3_loop_cont/7 
* CEs [18] --> Loop 18 
* CEs [20] --> Loop 19 
* CEs [19] --> Loop 20 

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

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


### Specialization of cost equations f0/6 
* CE 1 is refined into CE [21,22,23,24,25,26] 


### Cost equations --> "Loop" of f0/6 
* CEs [26] --> Loop 21 
* CEs [24] --> Loop 22 
* CEs [22,25] --> Loop 23 
* CEs [23] --> Loop 24 
* CEs [21] --> Loop 25 

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

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


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

#### Cost of chains of f3(C,D,E,G,H,I,J):
* Chain [[11,12],14]: 1*it(11)+1*it(12)+0
  Such that:aux(1) =< C
aux(2) =< C+1
it(11) =< C/2
it(11) =< aux(1)
it(12) =< aux(1)
it(11) =< aux(2)
it(12) =< aux(2)

  with precondition: [G=2,C>=1] 

* Chain [[11,12],13]: 1*it(11)+1*it(12)+0
  Such that:aux(1) =< C
aux(2) =< C-H
it(11) =< C/2
it(11) =< aux(1)
it(12) =< aux(1)
it(11) =< aux(2)
it(12) =< aux(2)

  with precondition: [G=3,0>=H,C>=1,H+1>=0] 

* Chain [14]: 0
  with precondition: [G=2] 

* Chain [13]: 0
  with precondition: [G=3,I=D,C=H,0>=C] 


#### Cost of chains of f6(A,E,G):
* Chain [[15,16]]...: 2*it(15)+0
  with precondition: [A>=0,1>=A,G=2] 

* Chain [[15,16],17]: 2*it(15)+0
  with precondition: [G=2,1>=A,A>=0] 

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


#### Cost of chains of f3_loop_cont(A,B,C,D,E,F,G):
* Chain [20]...: 2*s(2)+0
  with precondition: [A=3,B=0,C=0] 

* Chain [19]: 0
  with precondition: [A=2,B=0,C=0] 

* Chain [18]: 1*s(3)+0
  with precondition: [A=3,B=0,C=0] 


#### Cost of chains of f0(A,B,C,D,E,G):
* Chain [25]: 0
  with precondition: [] 

* Chain [24]: 1*s(4)+0
  with precondition: [0>=C] 

* Chain [23]: 2*s(7)+2*s(8)+1*s(13)+0
  Such that:aux(4) =< C
aux(5) =< C+1
aux(6) =< C/2
s(7) =< aux(6)
s(7) =< aux(4)
s(8) =< aux(4)
s(7) =< aux(5)
s(8) =< aux(5)

  with precondition: [C>=1] 

* Chain [22]...: 2*s(14)+0
  with precondition: [0>=C] 

* Chain [21]...: 1*s(17)+1*s(18)+2*s(19)+0
  Such that:s(15) =< C
s(16) =< C+1
s(17) =< C/2
s(17) =< s(15)
s(18) =< s(15)
s(17) =< s(16)
s(18) =< s(16)

  with precondition: [C>=1] 


Closed-form bounds of f0(A,B,C,D,E,G): 
-------------------------------------
* Chain [25] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [24] with precondition: [0>=C] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [23] with precondition: [C>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [22]... with precondition: [0>=C] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [21]... with precondition: [C>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

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