WARNING: Excluded non-linear constraints:[G=A+B*B*C,H=B-2*(C*C),A+B*B>=0+1]
WARNING: Excluded non-linear constraints:[D=B*B]

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

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

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

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

### Specialization of cost equations l1/6 
* 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/6 
* CEs [11] --> Loop 9 
* CEs [9] --> Loop 10 
* CEs [10] --> Loop 11 

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

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


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


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

### Ranking functions of CR l2(B,D) 
* RF of phase [12]: [B]

#### Partial ranking functions of CR l2(B,D) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    B


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


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

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

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


### Specialization of cost equations l0/4 
* CE 1 is refined into CE [17,18,19,20,21,22,23,24] 


### Cost equations --> "Loop" of l0/4 
* CEs [22,23,24] --> Loop 17 
* CEs [17,20,21] --> Loop 18 
* CEs [18,19] --> Loop 19 

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

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


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

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

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

* Chain [[9],10]: 1*it(9)+0
  with precondition: [D=3,0>=C+1,0>=E] 

* Chain [11]: 0
  with precondition: [D=2,0>=C+1] 

* Chain [10]: 0
  with precondition: [D=3,A=E,0>=A,0>=C+1] 


#### Cost of chains of l2(B,D):
* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< B

  with precondition: [D=2,B>=1] 

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


#### Cost of chains of l1_loop_cont(A,B,C,D,E):
* Chain [16]: 0
  with precondition: [A=2,0>=D+1] 

* Chain [15]: 0
  with precondition: [A=3,0>=D+1] 

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

  with precondition: [A=3,0>=D+1,C>=1] 


#### Cost of chains of l0(A,B,C,D):
* Chain [19]: 1*aux(2)+0
  with precondition: [0>=A,0>=C+1] 

* Chain [18]: 1*aux(3)+0
  with precondition: [0>=C+1] 

* Chain [17]...: 1*aux(4)+0
  with precondition: [0>=C+1] 


Closed-form bounds of l0(A,B,C,D): 
-------------------------------------
* Chain [19] with precondition: [0>=A,0>=C+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [18] with precondition: [0>=C+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [17]... with precondition: [0>=C+1] 
    - Upper bound: inf 
    - Complexity: infinity 

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

