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

#### Computed strongly connected components 
0. recursive  : [l1/7]
1. non_recursive  : [exit_location/1]
2. recursive  : [l2/3]
3. non_recursive  : [l2_loop_cont/2]
4. non_recursive  : [l1_loop_cont/7]
5. non_recursive  : [l0/6]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into l1/7
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into l2/3
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into l1_loop_cont/7
5. SCC is partially evaluated into l0/6

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

### Specialization of cost equations l1/7 
* CE 3 is refined into CE [9] 
* CE 4 is refined into CE [10] 
* CE 2 is refined into CE [11] 


### Cost equations --> "Loop" of l1/7 
* CEs [11] --> Loop 9 
* CEs [9] --> Loop 10 
* CEs [10] --> Loop 11 

### Ranking functions of CR l1(A,B,C,F,G,H,I) 

#### Partial ranking functions of CR l1(A,B,C,F,G,H,I) 


### Specialization of cost equations l2/3 
* CE 8 is refined into CE [12] 
* CE 7 is refined into CE [13] 


### Cost equations --> "Loop" of l2/3 
* CEs [13] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR l2(D,E,F) 

#### Partial ranking functions of CR l2(D,E,F) 


### Specialization of cost equations l1_loop_cont/7 
* CE 6 is refined into CE [14,15,16] 
* CE 5 is refined into CE [17] 


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

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

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


### Specialization of cost equations l0/6 
* CE 1 is refined into CE [18,19,20,21,22,23,24,25,26,27,28,29] 


### Cost equations --> "Loop" of l0/6 
* CEs [25,28,29] --> Loop 18 
* CEs [26,27] --> Loop 19 
* CEs [22] --> Loop 20 
* CEs [24] --> Loop 21 
* CEs [19,23] --> Loop 22 
* CEs [21] --> Loop 23 
* CEs [20] --> Loop 24 
* CEs [18] --> Loop 25 

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

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


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

#### Cost of chains of l1(A,B,C,F,G,H,I):
* Chain [[9]]...: 1*it(9)+0
  with precondition: [A>=1] 

* Chain [[9],11]: 1*it(9)+0
  with precondition: [F=2,A>=1] 

* Chain [[9],10]: 1*it(9)+0
  with precondition: [F=3,0>=G,A>=1,C>=I+1,G+I>=H] 

* Chain [11]: 0
  with precondition: [F=2] 

* Chain [10]: 0
  with precondition: [F=3,H=B,I=C,A=G,0>=A] 


#### Cost of chains of l2(D,E,F):
* Chain [[12]]...: 1*it(12)+0
  with precondition: [D>=1,F=2] 

* Chain [[12],13]: 1*it(12)+0
  with precondition: [F=2,D>=1] 

* Chain [13]: 0
  with precondition: [F=2] 


#### Cost of chains of l1_loop_cont(A,B,C,D,E,F,G):
* Chain [17]...: 1*s(1)+0
  with precondition: [A=3,E>=1] 

* Chain [16]: 0
  with precondition: [A=2] 

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

* Chain [14]: 1*s(2)+0
  with precondition: [A=3,E>=1] 


#### Cost of chains of l0(A,B,C,D,E,F):
* Chain [25]: 0
  with precondition: [] 

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

* Chain [23]: 1*s(3)+0
  with precondition: [0>=A,D>=1] 

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

* Chain [21]: 2*s(6)+0
  with precondition: [A>=1,D>=1] 

* Chain [20]...: 1*s(8)+0
  with precondition: [0>=A,D>=1] 

* Chain [19]...: 1*aux(2)+0
  with precondition: [A>=1] 

* Chain [18]...: 1*aux(3)+0
  with precondition: [A>=1,D>=1] 


Closed-form bounds of l0(A,B,C,D,E,F): 
-------------------------------------
* Chain [25] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [24] with precondition: [0>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [0>=A,D>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [22] with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [21] with precondition: [A>=1,D>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20]... with precondition: [0>=A,D>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [19]... with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [18]... with precondition: [A>=1,D>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of l0(A,B,C,D,E,F): inf 
Asymptotic class: infinity 
* Total analysis performed in 59 ms.

