/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. non_recursive  : [f32/15]
1. non_recursive  : [f26/15]
2. non_recursive  : [f23/15]
3. non_recursive  : [f36/15]
4. non_recursive  : [f11/15]
5. non_recursive  : [f0/15]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f23/15
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f11/15
5. SCC is partially evaluated into f0/15

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

### Specialization of cost equations f23/15 
* CE 8 is discarded (unfeasible) 
* CE 7 is refined into CE [10] 
* CE 9 is refined into CE [11] 


### Cost equations --> "Loop" of f23/15 
* CEs [11] --> Loop 8 
* CEs [10] --> Loop 9 

### Ranking functions of CR f23(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 

#### Partial ranking functions of CR f23(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 


### Specialization of cost equations f11/15 
* CE 6 is discarded (unfeasible) 
* CE 5 is refined into CE [12] 
* CE 3 is refined into CE [13] 
* CE 4 is refined into CE [14] 


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

### Ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 

#### Partial ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 


### Specialization of cost equations f0/15 
* CE 1 is refined into CE [15] 
* CE 2 is refined into CE [16] 


### Cost equations --> "Loop" of f0/15 
* CEs [15,16] --> Loop 12 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 


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

#### Cost of chains of f23(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q):
* Chain [9]: 0
  with precondition: [A=100,C=1,D=1,E=1,F=100,H=0] 

* Chain [8]: 0
  with precondition: [A=100,C=1,D=1,E=1,F=100,H=1] 


#### Cost of chains of f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q):
* Chain [11]: 0
  with precondition: [A=100,C=0] 

* Chain [10]: 0
  with precondition: [A=100,C=1] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q):
* Chain [12]: 0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 
-------------------------------------
* Chain [12] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 0 
Asymptotic class: constant 
* Total analysis performed in 126 ms.