0.03/0.11	MAYBE
0.03/0.11	
0.03/0.11	Preprocessing Cost Relations
0.03/0.11	=====================================
0.03/0.11	
0.03/0.11	#### Computed strongly connected components 
0.03/0.11	0. recursive  : [f1/3]
0.03/0.11	1. non_recursive  : [exit_location/1]
0.03/0.11	2. non_recursive  : [f1_loop_cont/2]
0.03/0.11	3. non_recursive  : [f0/3]
0.03/0.11	
0.03/0.11	#### Obtained direct recursion through partial evaluation 
0.03/0.11	0. SCC is partially evaluated into f1/3
0.03/0.11	1. SCC is completely evaluated into other SCCs
0.03/0.11	2. SCC is completely evaluated into other SCCs
0.03/0.11	3. SCC is partially evaluated into f0/3
0.03/0.11	
0.03/0.11	Control-Flow Refinement of Cost Relations
0.03/0.11	=====================================
0.03/0.11	
0.03/0.11	### Specialization of cost equations f1/3 
0.03/0.11	* CE 4 is refined into CE [5] 
0.03/0.11	* CE 2 is refined into CE [6] 
0.03/0.11	* CE 3 is refined into CE [7] 
0.03/0.11	
0.03/0.11	
0.03/0.11	### Cost equations --> "Loop" of f1/3 
0.03/0.11	* CEs [6] --> Loop 5 
0.03/0.11	* CEs [7] --> Loop 6 
0.03/0.11	* CEs [5] --> Loop 7 
0.03/0.11	
0.03/0.11	### Ranking functions of CR f1(A,B,D) 
0.03/0.11	
0.03/0.11	#### Partial ranking functions of CR f1(A,B,D) 
0.03/0.11	* Partial RF of phase [5,6]:
0.03/0.11	  - RF of loop [5:1]:
0.03/0.11	    A/10-10 depends on loops [6:1] 
0.03/0.11	    B depends on loops [6:1] 
0.03/0.11	  - RF of loop [6:1]:
0.03/0.11	    -A/11+101/11 depends on loops [5:1] 
0.03/0.11	
0.03/0.11	
0.03/0.11	### Specialization of cost equations f0/3 
0.03/0.11	* CE 1 is refined into CE [8,9,10] 
0.03/0.11	
0.03/0.11	
0.03/0.11	### Cost equations --> "Loop" of f0/3 
0.03/0.11	* CEs [10] --> Loop 8 
0.03/0.11	* CEs [8,9] --> Loop 9 
0.03/0.11	
0.03/0.11	### Ranking functions of CR f0(A,B,D) 
0.03/0.11	
0.03/0.11	#### Partial ranking functions of CR f0(A,B,D) 
0.03/0.11	
0.03/0.11	
0.03/0.11	Computing Bounds
0.03/0.11	=====================================
0.03/0.11	
0.03/0.11	#### Cost of chains of f1(A,B,D):
0.03/0.11	* Chain [[5,6]]...: 2*it(5)+0
0.03/0.11	  with precondition: [B>=1,D=2] 
0.03/0.11	
0.03/0.11	* Chain [[5,6],7]: 2*it(5)+0
0.03/0.11	  with precondition: [D=2,B>=1] 
0.03/0.11	
0.03/0.11	* Chain [7]: 0
0.03/0.11	  with precondition: [D=2,B>=0] 
0.03/0.11	
0.03/0.11	
0.03/0.11	#### Cost of chains of f0(A,B,D):
0.03/0.11	* Chain [9]: 1*aux(7)+0
0.03/0.11	  with precondition: [] 
0.03/0.11	
0.03/0.11	* Chain [8]...: 2*s(2)+0
0.03/0.11	  with precondition: [] 
0.03/0.11	
0.03/0.11	
0.03/0.11	Closed-form bounds of f0(A,B,D): 
0.03/0.11	-------------------------------------
0.03/0.11	* Chain [9] with precondition: [] 
0.03/0.11	    - Upper bound: inf 
0.03/0.11	    - Complexity: infinity 
0.03/0.11	* Chain [8]... with precondition: [] 
0.03/0.11	    - Upper bound: inf 
0.03/0.11	    - Complexity: infinity 
0.03/0.11	
0.03/0.11	### Maximum cost of f0(A,B,D): inf 
0.03/0.11	Asymptotic class: infinity 
0.03/0.11	* Total analysis performed in 52 ms.
0.03/0.11	
0.03/0.21	EOF