/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  : [f14/9]
1. non_recursive  : [exit_location/1]
2. recursive  : [f24/1]
3. non_recursive  : [f24_loop_cont/2]
4. non_recursive  : [f14_loop_cont/9]
5. non_recursive  : [f0/8]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f14/9
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f24/1
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f14_loop_cont/9
5. SCC is partially evaluated into f0/8

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

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


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

### Ranking functions of CR f14(A,B,C,D,J,K,L,M,N) 
* RF of phase [10,11]: [A]

#### Partial ranking functions of CR f14(A,B,C,D,J,K,L,M,N) 
* Partial RF of phase [10,11]:
  - RF of loop [10:1,11:1]:
    A
  - RF of loop [11:1]:
    A-B
    A+C-1


### Specialization of cost equations f24/1 
* CE 9 is refined into CE [14] 
* CE 8 is refined into CE [15] 


### Cost equations --> "Loop" of f24/1 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 

### Ranking functions of CR f24(J) 

#### Partial ranking functions of CR f24(J) 


### Specialization of cost equations f14_loop_cont/9 
* CE 7 is refined into CE [16,17] 
* CE 6 is refined into CE [18] 


### Cost equations --> "Loop" of f14_loop_cont/9 
* CEs [16] --> Loop 16 
* CEs [18] --> Loop 17 
* CEs [17] --> Loop 18 

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

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


### Specialization of cost equations f0/8 
* CE 1 is refined into CE [19,20,21,22] 


### Cost equations --> "Loop" of f0/8 
* CEs [22] --> Loop 19 
* CEs [19,20,21] --> Loop 20 

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

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


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

#### Cost of chains of f14(A,B,C,D,J,K,L,M,N):
* Chain [[10,11],13]: 1*it(10)+1*it(11)+0
  Such that:it(11) =< A-B
it(11) =< A+C
aux(3) =< A
it(11) =< aux(3)
it(10) =< aux(3)

  with precondition: [J=2,A>=1,C>=0,B+C>=1] 

* Chain [[10,11],12]: 1*it(10)+1*it(11)+0
  Such that:it(11) =< A-B
it(11) =< A+C-M
aux(4) =< A
it(10) =< aux(4)
it(11) =< aux(4)

  with precondition: [J=3,K=0,B+C=L+M,A>=1,C>=0,B>=L,B+C>=1,A+L>=B,B+C>=L+1] 

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


#### Cost of chains of f24(J):
* Chain [[14]]...: 1*it(14)+0
  with precondition: [J=2] 

* Chain [[14],15]: 1*it(14)+0
  with precondition: [J=2] 

* Chain [15]: 0
  with precondition: [J=2] 


#### Cost of chains of f14_loop_cont(A,B,C,D,E,F,G,H,I):
* Chain [18]...: 1*s(2)+0
  with precondition: [A=3,2*H+1=G,F>=1,H>=0] 

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

* Chain [16]: 1*s(3)+0
  with precondition: [A=3,2*H+1=G,F>=1,H>=0] 


#### Cost of chains of f0(A,B,C,D,E,F,G,J):
* Chain [20]: 1*aux(6)+0
  with precondition: [] 

* Chain [19]...: 2*s(11)+1*s(14)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,J): 
-------------------------------------
* Chain [20] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [19]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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