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