0.03/0.92	WORST_CASE(?,O(1))  
0.03/0.92	
0.03/0.92	Preprocessing Cost Relations
0.03/0.92	=====================================
0.03/0.92	
0.03/0.92	#### Computed strongly connected components 
0.03/0.92	0. recursive  : [f4/3]
0.03/0.92	1. non_recursive  : [exit_location/1]
0.03/0.92	2. non_recursive  : [f12/2]
0.03/0.92	3. non_recursive  : [f4_loop_cont/3]
0.03/0.92	4. non_recursive  : [f0/2]
0.03/0.92	
0.03/0.92	#### Obtained direct recursion through partial evaluation 
0.03/0.92	0. SCC is partially evaluated into f4/3
0.03/0.92	1. SCC is completely evaluated into other SCCs
0.03/0.92	2. SCC is completely evaluated into other SCCs
0.03/0.92	3. SCC is partially evaluated into f4_loop_cont/3
0.03/0.92	4. SCC is partially evaluated into f0/2
0.03/0.92	
0.03/0.92	Control-Flow Refinement of Cost Relations
0.03/0.92	=====================================
0.03/0.92	
0.03/0.92	### Specialization of cost equations f4/3 
0.03/0.92	* CE 5 is refined into CE [8] 
0.03/0.92	* CE 4 is refined into CE [9] 
0.03/0.92	* CE 2 is refined into CE [10] 
0.03/0.92	* CE 3 is refined into CE [11] 
0.03/0.92	
0.03/0.92	
0.03/0.92	### Cost equations --> "Loop" of f4/3 
0.03/0.92	* CEs [10] --> Loop 8 
0.03/0.92	* CEs [11] --> Loop 9 
0.03/0.92	* CEs [8] --> Loop 10 
0.03/0.92	* CEs [9] --> Loop 11 
0.03/0.92	
0.03/0.92	### Ranking functions of CR f4(A,C,D) 
0.03/0.92	* RF of phase [8]: [-A+4]
0.03/0.92	
0.03/0.92	#### Partial ranking functions of CR f4(A,C,D) 
0.03/0.92	* Partial RF of phase [8]:
0.03/0.92	  - RF of loop [8:1]:
0.03/0.92	    -A+4
0.03/0.92	
0.03/0.92	
0.03/0.92	### Specialization of cost equations f4_loop_cont/3 
0.03/0.92	* CE 7 is refined into CE [12] 
0.03/0.92	* CE 6 is refined into CE [13] 
0.03/0.92	
0.03/0.92	
0.03/0.92	### Cost equations --> "Loop" of f4_loop_cont/3 
0.03/0.92	* CEs [12] --> Loop 12 
0.03/0.92	* CEs [13] --> Loop 13 
0.03/0.92	
0.03/0.92	### Ranking functions of CR f4_loop_cont(A,B,C) 
0.03/0.92	
0.03/0.92	#### Partial ranking functions of CR f4_loop_cont(A,B,C) 
0.03/0.92	
0.03/0.92	
0.03/0.92	### Specialization of cost equations f0/2 
0.03/0.92	* CE 1 is refined into CE [14,15,16,17,18,19] 
0.03/0.92	
0.03/0.92	
0.03/0.92	### Cost equations --> "Loop" of f0/2 
0.03/0.92	* CEs [14,15,16,17,18,19] --> Loop 14 
0.03/0.92	
0.03/0.92	### Ranking functions of CR f0(A,C) 
0.03/0.92	
0.03/0.92	#### Partial ranking functions of CR f0(A,C) 
0.03/0.92	
0.03/0.92	
0.03/0.92	Computing Bounds
0.03/0.92	=====================================
0.03/0.92	
0.03/0.92	#### Cost of chains of f4(A,C,D):
0.03/0.92	* Chain [[8],11]: 1*it(8)+0
0.03/0.92	  Such that:it(8) =< -A+4
0.03/0.92	
0.03/0.92	  with precondition: [C=2,D=4,3>=A,A>=1] 
0.03/0.92	
0.03/0.92	* Chain [[8],10]: 1*it(8)+0
0.03/0.92	  Such that:it(8) =< -A+4
0.03/0.92	
0.03/0.92	  with precondition: [C=3,3>=A,A>=1] 
0.03/0.92	
0.03/0.92	* Chain [11]: 0
0.03/0.92	  with precondition: [C=2,A=D,A>=4] 
0.03/0.92	
0.03/0.92	* Chain [10]: 0
0.03/0.92	  with precondition: [C=3] 
0.03/0.92	
0.03/0.92	* Chain [9,[8],11]: 1*it(8)+1
0.03/0.92	  Such that:it(8) =< 3
0.03/0.92	
0.03/0.92	  with precondition: [C=2,D=4,0>=A] 
0.03/0.92	
0.03/0.92	* Chain [9,[8],10]: 1*it(8)+1
0.03/0.92	  Such that:it(8) =< 3
0.03/0.92	
0.03/0.92	  with precondition: [C=3,0>=A] 
0.03/0.92	
0.03/0.92	* Chain [9,10]: 1
0.03/0.92	  with precondition: [C=3,0>=A] 
0.03/0.92	
0.03/0.92	
0.03/0.92	#### Cost of chains of f4_loop_cont(A,B,C):
0.03/0.92	* Chain [13]: 0
0.03/0.92	  with precondition: [A=2] 
0.03/0.92	
0.03/0.92	* Chain [12]: 0
0.03/0.92	  with precondition: [A=3] 
0.03/0.92	
0.03/0.92	
0.03/0.92	#### Cost of chains of f0(A,C):
0.03/0.92	* Chain [14]: 13
0.03/0.92	  with precondition: [] 
0.03/0.92	
0.03/0.92	
0.03/0.92	Closed-form bounds of f0(A,C): 
0.03/0.92	-------------------------------------
0.03/0.92	* Chain [14] with precondition: [] 
0.03/0.92	    - Upper bound: 13 
0.03/0.92	    - Complexity: constant 
0.03/0.92	
0.03/0.92	### Maximum cost of f0(A,C): 13 
0.03/0.92	Asymptotic class: constant 
0.03/0.92	* Total analysis performed in 67 ms.
0.03/0.92	
0.03/1.03	EOF