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