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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [f1/40]
1. non_recursive  : [exit_location/1]
2. recursive  : [f10/29]
3. non_recursive  : [f4/25]
4. non_recursive  : [f10_loop_cont/26]
5. non_recursive  : [f1_loop_cont/26]
6. non_recursive  : [f3/25]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/40
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f10/29
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f10_loop_cont/26
5. SCC is partially evaluated into f1_loop_cont/26
6. SCC is partially evaluated into f3/25

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

### Specialization of cost equations f1/40 
* CE 4 is refined into CE [14] 
* CE 5 is refined into CE [15] 
* CE 6 is refined into CE [16] 
* CE 3 is refined into CE [17] 


### Cost equations --> "Loop" of f1/40 
* CEs [17] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [15] --> Loop 16 
* CEs [16] --> Loop 17 

### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2) 
* RF of phase [14]: [A-B]

#### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2) 
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    A-B


### Specialization of cost equations f10/29 
* CE 11 is refined into CE [18] 
* CE 10 is refined into CE [19] 
* CE 9 is refined into CE [20] 


### Cost equations --> "Loop" of f10/29 
* CEs [20] --> Loop 18 
* CEs [18] --> Loop 19 
* CEs [19] --> Loop 20 

### Ranking functions of CR f10(A,B,C,I,K,N,P,Q,R,S,T,U,V,W,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1) 
* RF of phase [18]: [U+1]

#### Partial ranking functions of CR f10(A,B,C,I,K,N,P,Q,R,S,T,U,V,W,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1) 
* Partial RF of phase [18]:
  - RF of loop [18:1]:
    U+1


### Specialization of cost equations f10_loop_cont/26 
* CE 13 is refined into CE [21] 
* CE 12 is refined into CE [22] 


### Cost equations --> "Loop" of f10_loop_cont/26 
* CEs [21] --> Loop 21 
* CEs [22] --> Loop 22 

### Ranking functions of CR f10_loop_cont(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) 

#### Partial ranking functions of CR f10_loop_cont(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) 


### Specialization of cost equations f1_loop_cont/26 
* CE 8 is refined into CE [23,24,25,26] 
* CE 7 is refined into CE [27] 


### Cost equations --> "Loop" of f1_loop_cont/26 
* CEs [26] --> Loop 23 
* CEs [25] --> Loop 24 
* CEs [24] --> Loop 25 
* CEs [23] --> Loop 26 
* CEs [27] --> Loop 27 

### Ranking functions of CR f1_loop_cont(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) 

#### Partial ranking functions of CR f1_loop_cont(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) 


### Specialization of cost equations f3/25 
* CE 2 is refined into CE [28,29,30,31,32,33,34,35,36,37] 
* CE 1 is refined into CE [38] 


### Cost equations --> "Loop" of f3/25 
* CEs [34,36] --> Loop 28 
* CEs [29,35,37] --> Loop 29 
* CEs [28] --> Loop 30 
* CEs [38] --> Loop 31 
* CEs [30,32] --> Loop 32 
* CEs [31,33] --> Loop 33 

### Ranking functions of CR f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,I1) 

#### Partial ranking functions of CR f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,I1) 


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

#### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2):
* Chain [[14],17]: 1*it(14)+0
  Such that:it(14) =< A-B

  with precondition: [I1=3,C=K,B>=2,A>=B+1] 

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

  with precondition: [I1=4,X1=0,Z1=0,C=K,L1=T1,A=V1+1,L1=W1,L1=Y1,L1=A2,L1=B2,0>=L1+1,B>=2,J1>=2,A>=B+1] 

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

  with precondition: [I1=4,X1=0,Z1=0,C=K,L1=T1,A=V1+1,L1=W1,L1=Y1,L1=A2,L1=B2,B>=2,J1>=2,L1>=1,A>=B+1] 

* Chain [17]: 0
  with precondition: [I1=3,K=C,B>=2,A>=B] 

* Chain [16]: 0
  with precondition: [I1=4,X1=0,Z1=0,B=A,K=C,M1=D,N1=E,O1=F,P1=G,Q1=H,R1=I,S1=J,U1=L,V1=M,K=L1,K=T1,K=W1,K=Y1,K=A2,K=B2,0>=K+1,B>=2,J1>=2] 

* Chain [15]: 0
  with precondition: [I1=4,X1=0,Z1=0,B=A,K=C,M1=D,N1=E,O1=F,P1=G,Q1=H,R1=I,S1=J,U1=L,V1=M,K=L1,K=T1,K=W1,K=Y1,K=A2,K=B2,B>=2,K>=1,J1>=2] 


#### Cost of chains of f10(A,B,C,I,K,N,P,Q,R,S,T,U,V,W,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1):
* Chain [[18],20]: 1*it(18)+0
  Such that:it(18) =< U-U1

  with precondition: [N=0,P=0,I1=2,L1=N1,U1=W1,J1>=2,K1>=2,U1>=0,U>=U1+1] 

* Chain [[18],19]: 1*it(18)+0
  Such that:it(18) =< U+1

  with precondition: [P=0,I1=3,U>=0] 

* Chain [20]: 0
  with precondition: [I1=2,K1=B,L1=C,N1=K,P=N,V1=V,W1=W,U=U1,U>=0,J1>=2] 

* Chain [19]: 0
  with precondition: [I1=3] 


#### Cost of chains of f10_loop_cont(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):
* Chain [22]: 0
  with precondition: [A=2] 

* Chain [21]: 0
  with precondition: [A=3] 


#### Cost of chains of f1_loop_cont(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):
* Chain [27]: 0
  with precondition: [A=3,V=P] 

* Chain [26]: 1*s(1)+0
  Such that:s(1) =< V

  with precondition: [A=4,O=0,Q=0,V=P,V>=1] 

* Chain [25]: 1*s(2)+0
  Such that:s(2) =< P+1

  with precondition: [A=4,Q=0,V=P,V>=0] 

* Chain [24]: 0
  with precondition: [A=4,Q=O,V=P,V>=0] 

* Chain [23]: 0
  with precondition: [A=4,V=P] 


#### Cost of chains of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,I1):
* Chain [33]: 0
  with precondition: [A=2] 

* Chain [32]: 2*s(3)+0
  Such that:aux(1) =< U+1
s(3) =< aux(1)

  with precondition: [A=2,U>=0] 

* Chain [31]: 0
  with precondition: [0>=A] 

* Chain [30]: 0
  with precondition: [A>=2] 

* Chain [29]: 3*s(5)+0
  Such that:aux(2) =< A
s(5) =< aux(2)

  with precondition: [A>=3] 

* Chain [28]: 2*s(8)+2*s(9)+0
  Such that:aux(3) =< A
aux(4) =< U+1
s(8) =< aux(3)
s(9) =< aux(4)

  with precondition: [A>=3,U>=0] 


Closed-form bounds of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,I1): 
-------------------------------------
* Chain [33] with precondition: [A=2] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [32] with precondition: [A=2,U>=0] 
    - Upper bound: 2*U+2 
    - Complexity: n 
* Chain [31] with precondition: [0>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [30] with precondition: [A>=2] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [29] with precondition: [A>=3] 
    - Upper bound: 3*A 
    - Complexity: n 
* Chain [28] with precondition: [A>=3,U>=0] 
    - Upper bound: 2*A+2*U+2 
    - Complexity: n 

### Maximum cost of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,I1): max([nat(U+1)*2,nat(A)*2+max([nat(A),nat(U+1)*2])]) 
Asymptotic class: n 
* Total analysis performed in 896 ms.