0.04/0.21	MAYBE
0.04/0.21	
0.04/0.21	Preprocessing Cost Relations
0.04/0.21	=====================================
0.04/0.21	
0.04/0.21	#### Computed strongly connected components 
0.04/0.21	0. recursive  : [f2/3]
0.04/0.21	1. non_recursive  : [exit_location/1]
0.04/0.21	2. non_recursive  : [f2_loop_cont/2]
0.04/0.21	3. non_recursive  : [f0/3]
0.04/0.21	
0.04/0.21	#### Obtained direct recursion through partial evaluation 
0.04/0.21	0. SCC is partially evaluated into f2/3
0.04/0.21	1. SCC is completely evaluated into other SCCs
0.04/0.21	2. SCC is completely evaluated into other SCCs
0.04/0.21	3. SCC is partially evaluated into f0/3
0.04/0.21	
0.04/0.21	Control-Flow Refinement of Cost Relations
0.04/0.21	=====================================
0.04/0.21	
0.04/0.21	### Specialization of cost equations f2/3 
0.04/0.21	* CE 9 is refined into CE [10] 
0.04/0.21	* CE 3 is refined into CE [11] 
0.04/0.21	* CE 5 is discarded (unfeasible) 
0.04/0.21	* CE 6 is refined into CE [12] 
0.04/0.21	* CE 8 is discarded (unfeasible) 
0.04/0.21	* CE 7 is discarded (unfeasible) 
0.04/0.21	* CE 4 is refined into CE [13] 
0.04/0.21	
0.04/0.21	
0.04/0.21	### Cost equations --> "Loop" of f2/3 
0.04/0.21	* CEs [11] --> Loop 9 
0.04/0.21	* CEs [12] --> Loop 10 
0.04/0.21	* CEs [13] --> Loop 11 
0.04/0.21	* CEs [10] --> Loop 12 
0.04/0.21	
0.04/0.21	### Ranking functions of CR f2(A,B,E) 
0.04/0.21	
0.04/0.21	#### Partial ranking functions of CR f2(A,B,E) 
0.04/0.21	* Partial RF of phase [9,10,11]:
0.04/0.21	  - RF of loop [9:1]:
0.04/0.21	    A-9 depends on loops [10:1] 
0.04/0.21	  - RF of loop [11:1]:
0.04/0.21	    A-5 depends on loops [10:1] 
0.04/0.21	
0.04/0.21	
0.04/0.21	### Specialization of cost equations f0/3 
0.04/0.21	* CE 1 is refined into CE [14,15,16] 
0.04/0.21	* CE 2 is refined into CE [17,18,19] 
0.04/0.21	
0.04/0.21	
0.04/0.21	### Cost equations --> "Loop" of f0/3 
0.04/0.21	* CEs [16,19] --> Loop 13 
0.04/0.21	* CEs [14,15,17,18] --> Loop 14 
0.04/0.21	
0.04/0.21	### Ranking functions of CR f0(A,B,E) 
0.04/0.21	
0.04/0.21	#### Partial ranking functions of CR f0(A,B,E) 
0.04/0.21	
0.04/0.21	
0.04/0.21	Computing Bounds
0.04/0.21	=====================================
0.04/0.21	
0.04/0.21	#### Cost of chains of f2(A,B,E):
0.04/0.21	* Chain [[9,10,11]]...: 3*it(9)+0
0.04/0.21	  with precondition: [2*A>=3*B+3,A>=2*B,2*B+1>=A,E=2] 
0.04/0.21	
0.04/0.21	* Chain [[9,10,11],12]: 3*it(9)+0
0.04/0.21	  with precondition: [E=2,2*A>=3*B+3,A>=2*B,2*B+1>=A] 
0.04/0.21	
0.04/0.21	* Chain [12]: 0
0.04/0.21	  with precondition: [E=2,A>=3] 
0.04/0.21	
0.04/0.21	
0.04/0.21	#### Cost of chains of f0(A,B,E):
0.04/0.21	* Chain [14]: 1*aux(24)+0
0.04/0.21	  with precondition: [] 
0.04/0.21	
0.04/0.21	* Chain [13]...: 1*aux(25)+0
0.04/0.21	  with precondition: [] 
0.04/0.21	
0.04/0.21	
0.04/0.21	Closed-form bounds of f0(A,B,E): 
0.04/0.21	-------------------------------------
0.04/0.21	* Chain [14] with precondition: [] 
0.04/0.21	    - Upper bound: inf 
0.04/0.21	    - Complexity: infinity 
0.04/0.21	* Chain [13]... with precondition: [] 
0.04/0.21	    - Upper bound: inf 
0.04/0.21	    - Complexity: infinity 
0.04/0.21	
0.04/0.21	### Maximum cost of f0(A,B,E): inf 
0.04/0.21	Asymptotic class: infinity 
0.04/0.21	* Total analysis performed in 138 ms.
0.04/0.21	
0.04/0.31	EOF