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