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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f5/12]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f10/7]
3. non_recursive  : [f11/7]
4. non_recursive  : [f5_loop_cont/8]
5. non_recursive  : [f12/7]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f5/12
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f5_loop_cont/8
5. SCC is partially evaluated into f12/7

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

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


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

### Ranking functions of CR f5(A,B,C,D,E,F,I,J,K,L,M,N) 
* RF of phase [10]: [-B+4]

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


### Specialization of cost equations f5_loop_cont/8 
* CE 9 is refined into CE [15] 
* CE 8 is refined into CE [16] 
* CE 7 is refined into CE [17] 


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

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

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


### Specialization of cost equations f12/7 
* CE 1 is refined into CE [18,19,20,21,22] 


### Cost equations --> "Loop" of f12/7 
* CEs [18,19,20,21,22] --> Loop 18 

### Ranking functions of CR f12(A,B,C,D,E,F,I) 

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


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

#### Cost of chains of f5(A,B,C,D,E,F,I,J,K,L,M,N):
* Chain [[10],14]: 1*it(10)+0
  Such that:it(10) =< -B+4

  with precondition: [A=4,C=0,I=2,J=4,K=0,L=0,M=0,N=0,3>=B,B>=0] 

* Chain [[10],13]: 1*it(10)+0
  Such that:it(10) =< -B+J

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

* Chain [[10],12]: 1*it(10)+0
  Such that:it(10) =< -B+J

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

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

  with precondition: [A=4,C=0,I=4,3>=B,B>=0] 

* Chain [11]: 0
  with precondition: [A=4,I=4,B>=0] 


#### Cost of chains of f5_loop_cont(A,B,C,D,E,F,G,H):
* Chain [17]: 0
  with precondition: [A=2,B=4] 

* Chain [16]: 0
  with precondition: [A=3,B=4] 

* Chain [15]: 0
  with precondition: [A=4,B=4] 


#### Cost of chains of f12(A,B,C,D,E,F,I):
* Chain [18]: 16
  with precondition: [] 


Closed-form bounds of f12(A,B,C,D,E,F,I): 
-------------------------------------
* Chain [18] with precondition: [] 
    - Upper bound: 16 
    - Complexity: constant 

### Maximum cost of f12(A,B,C,D,E,F,I): 16 
Asymptotic class: constant 
* Total analysis performed in 175 ms.