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

#### Computed strongly connected components 
0. non_recursive  : [f1/12]
1. recursive  : [f2/7]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f2_loop_cont/2]
4. non_recursive  : [f300/12]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f2/7
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f300/12

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

### Specialization of cost equations f2/7 
* CE 5 is refined into CE [6] 
* CE 4 is refined into CE [7] 


### Cost equations --> "Loop" of f2/7 
* CEs [7] --> Loop 6 
* CEs [6] --> Loop 7 

### Ranking functions of CR f2(A,B,C,D,E,F,T) 

#### Partial ranking functions of CR f2(A,B,C,D,E,F,T) 


### Specialization of cost equations f300/12 
* CE 3 is refined into CE [8,9,10] 
* CE 1 is refined into CE [11] 
* CE 2 is refined into CE [12] 


### Cost equations --> "Loop" of f300/12 
* CEs [8,9] --> Loop 8 
* CEs [11] --> Loop 9 
* CEs [12] --> Loop 10 
* CEs [10] --> Loop 11 

### Ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J,K,T) 

#### Partial ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J,K,T) 


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

#### Cost of chains of f2(A,B,C,D,E,F,T):
* Chain [[6]]...: 1*it(6)+0
  with precondition: [B=C,A>=1,T=2] 

* Chain [[6],7]: 1*it(6)+0
  with precondition: [T=2,B=C,A>=1] 

* Chain [7]: 0
  with precondition: [T=2,C=B,A>=1] 


#### Cost of chains of f300(A,B,C,D,E,F,G,H,I,J,K,T):
* Chain [11]...: 1*s(1)+0
  with precondition: [A>=1,G>=1] 

* Chain [10]: 0
  with precondition: [0>=A,G>=1] 

* Chain [9]: 0
  with precondition: [0>=G] 

* Chain [8]: 1*aux(1)+0
  with precondition: [A>=1,G>=1] 


Closed-form bounds of f300(A,B,C,D,E,F,G,H,I,J,K,T): 
-------------------------------------
* Chain [11]... with precondition: [A>=1,G>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [10] with precondition: [0>=A,G>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [9] with precondition: [0>=G] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [8] with precondition: [A>=1,G>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f300(A,B,C,D,E,F,G,H,I,J,K,T): inf 
Asymptotic class: infinity 
* Total analysis performed in 24 ms.

