/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  : [f7/37]
1. non_recursive  : [f6/37]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f6/37

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

### Specialization of cost equations f6/37 
* CE 1 is refined into CE [2] 


### Cost equations --> "Loop" of f6/37 
* CEs [2] --> Loop 2 

### Ranking functions of CR f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1) 

#### Partial ranking functions of CR f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1) 


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

#### Cost of chains of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1):
* Chain [2]: 0
  with precondition: [B=0,E=100,Q=0,Z=0,X=A] 


Closed-form bounds of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1): 
-------------------------------------
* Chain [2] with precondition: [B=0,E=100,Q=0,Z=0,X=A] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1): 0 
Asymptotic class: constant 
* Total analysis performed in 24 ms.