/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(1))  

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [f15/6,f16/6]
1. non_recursive  : [exit_location/1]
2. recursive  : [f23/4]
3. non_recursive  : [f7/6]
4. non_recursive  : [f23_loop_cont/7]
5. non_recursive  : [f15_loop_cont/7]
6. non_recursive  : [f0/6]

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

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

### Specialization of cost equations f15/6 
* CE 4 is refined into CE [16] 
* CE 3 is discarded (unfeasible) 
* CE 7 is refined into CE [17] 
* CE 8 is refined into CE [18] 
* CE 6 is refined into CE [19] 
* CE 5 is discarded (unfeasible) 


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

### Ranking functions of CR f15(A,B,E,H,I,J) 
* RF of phase [15]: [A-B,-B+100]

#### Partial ranking functions of CR f15(A,B,E,H,I,J) 
* Partial RF of phase [15]:
  - RF of loop [15:1]:
    A-B
    -B+100


### Specialization of cost equations f23/4 
* CE 13 is refined into CE [20] 
* CE 12 is refined into CE [21] 
* CE 11 is refined into CE [22] 


### Cost equations --> "Loop" of f23/4 
* CEs [22] --> Loop 19 
* CEs [20] --> Loop 20 
* CEs [21] --> Loop 21 

### Ranking functions of CR f23(B,E,H,I) 
* RF of phase [19]: [B-E]

#### Partial ranking functions of CR f23(B,E,H,I) 
* Partial RF of phase [19]:
  - RF of loop [19:1]:
    B-E


### Specialization of cost equations f23_loop_cont/7 
* CE 15 is refined into CE [23] 
* CE 14 is refined into CE [24] 


### Cost equations --> "Loop" of f23_loop_cont/7 
* CEs [23] --> Loop 22 
* CEs [24] --> Loop 23 

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

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


### Specialization of cost equations f15_loop_cont/7 
* CE 10 is refined into CE [25,26,27,28] 
* CE 9 is refined into CE [29] 


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

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

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


### Specialization of cost equations f0/6 
* CE 1 is refined into CE [30] 
* CE 2 is refined into CE [31,32,33,34,35,36,37,38,39,40] 


### Cost equations --> "Loop" of f0/6 
* CEs [30,31,32,33,34,35,36,37,38,39,40] --> Loop 28 

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

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


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

#### Cost of chains of f15(A,B,E,H,I,J):
* Chain [[15],18]: 1*it(15)+0
  Such that:it(15) =< A-B

  with precondition: [H=3,100>=A,B>=0,A>=B+1] 

* Chain [[15],17]: 1*it(15)+0
  Such that:it(15) =< -B+I+1

  with precondition: [H=4,J=0,A=I+1,100>=A,B>=0,A>=B+1] 

* Chain [[15],16]: 1*it(15)+0
  Such that:it(15) =< -B+I+1

  with precondition: [H=4,J=0,100>=A,B>=0,I>=B,A>=I+2] 

* Chain [18]: 0
  with precondition: [H=3,100>=A,A>=1,B>=0] 

* Chain [16]: 0
  with precondition: [H=4,J=0,B=I+1,100>=A,B>=0,A>=B+1] 


#### Cost of chains of f23(B,E,H,I):
* Chain [[19],21]: 1*it(19)+0
  Such that:it(19) =< B-E

  with precondition: [H=2,B=I,B>=E+1] 

* Chain [[19],20]: 1*it(19)+0
  Such that:it(19) =< B-E

  with precondition: [H=3,B>=E+1] 

* Chain [21]: 0
  with precondition: [H=2,E=I,E>=B] 

* Chain [20]: 0
  with precondition: [H=3] 


#### Cost of chains of f23_loop_cont(A,B,C,D,E,F,G):
* Chain [23]: 0
  with precondition: [A=2,D=B,100>=D,D>=1] 

* Chain [22]: 0
  with precondition: [A=3,D=B,100>=D,D>=1] 


#### Cost of chains of f15_loop_cont(A,B,C,D,E,F,G):
* Chain [27]: 0
  with precondition: [A=3,D=B,100>=D,D>=1] 

* Chain [26]: 0
  with precondition: [A=4,D=B,100>=D,D>=1] 

* Chain [25]: 0
  with precondition: [A=4,D=B,100>=D,D>=1,F>=C] 

* Chain [24]: 2*s(1)+0
  Such that:aux(1) =< C-F
s(1) =< aux(1)

  with precondition: [A=4,D=B,100>=D,D>=1,C>=F+1] 


#### Cost of chains of f0(A,B,C,D,E,H):
* Chain [28]: 894
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,H): 
-------------------------------------
* Chain [28] with precondition: [] 
    - Upper bound: 894 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,H): 894 
Asymptotic class: constant 
* Total analysis performed in 231 ms.