0.03/0.14	MAYBE
0.03/0.14	
0.03/0.14	Preprocessing Cost Relations
0.03/0.14	=====================================
0.03/0.14	
0.03/0.14	#### Computed strongly connected components 
0.03/0.14	0. recursive  : [f5/7]
0.03/0.14	1. non_recursive  : [exit_location/1]
0.03/0.14	2. non_recursive  : [f16/4]
0.03/0.14	3. non_recursive  : [f5_loop_cont/5]
0.03/0.14	4. non_recursive  : [f0/4]
0.03/0.14	
0.03/0.14	#### Obtained direct recursion through partial evaluation 
0.03/0.14	0. SCC is partially evaluated into f5/7
0.03/0.14	1. SCC is completely evaluated into other SCCs
0.03/0.14	2. SCC is completely evaluated into other SCCs
0.03/0.14	3. SCC is partially evaluated into f5_loop_cont/5
0.03/0.14	4. SCC is partially evaluated into f0/4
0.03/0.14	
0.03/0.14	Control-Flow Refinement of Cost Relations
0.03/0.14	=====================================
0.03/0.14	
0.03/0.14	### Specialization of cost equations f5/7 
0.03/0.14	* CE 4 is refined into CE [7] 
0.03/0.14	* CE 3 is refined into CE [8] 
0.03/0.14	* CE 2 is refined into CE [9] 
0.03/0.14	
0.03/0.14	
0.03/0.14	### Cost equations --> "Loop" of f5/7 
0.03/0.14	* CEs [9] --> Loop 7 
0.03/0.14	* CEs [7] --> Loop 8 
0.03/0.14	* CEs [8] --> Loop 9 
0.03/0.14	
0.03/0.14	### Ranking functions of CR f5(A,B,C,F,G,H,I) 
0.03/0.14	
0.03/0.14	#### Partial ranking functions of CR f5(A,B,C,F,G,H,I) 
0.03/0.14	
0.03/0.14	
0.03/0.14	### Specialization of cost equations f5_loop_cont/5 
0.03/0.14	* CE 6 is refined into CE [10] 
0.03/0.14	* CE 5 is refined into CE [11] 
0.03/0.14	
0.03/0.14	
0.03/0.14	### Cost equations --> "Loop" of f5_loop_cont/5 
0.03/0.14	* CEs [10] --> Loop 10 
0.03/0.14	* CEs [11] --> Loop 11 
0.03/0.14	
0.03/0.14	### Ranking functions of CR f5_loop_cont(A,B,C,D,E) 
0.03/0.14	
0.03/0.14	#### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E) 
0.03/0.14	
0.03/0.14	
0.03/0.14	### Specialization of cost equations f0/4 
0.03/0.14	* CE 1 is refined into CE [12,13,14,15,16,17] 
0.03/0.14	
0.03/0.14	
0.03/0.14	### Cost equations --> "Loop" of f0/4 
0.03/0.14	* CEs [16,17] --> Loop 12 
0.03/0.14	* CEs [12,13,14,15] --> Loop 13 
0.03/0.14	
0.03/0.14	### Ranking functions of CR f0(A,B,C,F) 
0.03/0.14	
0.03/0.14	#### Partial ranking functions of CR f0(A,B,C,F) 
0.03/0.14	
0.03/0.14	
0.03/0.14	Computing Bounds
0.03/0.14	=====================================
0.03/0.14	
0.03/0.14	#### Cost of chains of f5(A,B,C,F,G,H,I):
0.03/0.14	* Chain [[7]]...: 1*it(7)+0
0.03/0.14	  with precondition: [B>=0,2*A=B] 
0.03/0.14	
0.03/0.14	* Chain [[7],9]: 1*it(7)+0
0.03/0.14	  with precondition: [F=2,B=2*A,2*G=H,B>=0,2*G>=B+2] 
0.03/0.14	
0.03/0.14	* Chain [[7],8]: 1*it(7)+0
0.03/0.14	  with precondition: [F=3,B=2*A,B>=0] 
0.03/0.14	
0.03/0.14	* Chain [9]: 0
0.03/0.14	  with precondition: [F=2,2*A=B,I=C,A=G,2*A=H,A>=0] 
0.03/0.14	
0.03/0.14	* Chain [8]: 0
0.03/0.14	  with precondition: [F=3,2*A=B,A>=0] 
0.03/0.14	
0.03/0.14	
0.03/0.14	#### Cost of chains of f5_loop_cont(A,B,C,D,E):
0.03/0.14	* Chain [11]: 0
0.03/0.14	  with precondition: [A=2] 
0.03/0.14	
0.03/0.14	* Chain [10]: 0
0.03/0.14	  with precondition: [A=3] 
0.03/0.14	
0.03/0.14	
0.03/0.14	#### Cost of chains of f0(A,B,C,F):
0.03/0.14	* Chain [13]: 1*aux(1)+0
0.03/0.14	  with precondition: [] 
0.03/0.14	
0.03/0.14	* Chain [12]...: 1*aux(2)+0
0.03/0.14	  with precondition: [] 
0.03/0.14	
0.03/0.14	
0.03/0.14	Closed-form bounds of f0(A,B,C,F): 
0.03/0.14	-------------------------------------
0.03/0.14	* Chain [13] with precondition: [] 
0.03/0.14	    - Upper bound: inf 
0.03/0.14	    - Complexity: infinity 
0.03/0.14	* Chain [12]... with precondition: [] 
0.03/0.14	    - Upper bound: inf 
0.03/0.14	    - Complexity: infinity 
0.03/0.14	
0.03/0.14	### Maximum cost of f0(A,B,C,F): inf 
0.03/0.14	Asymptotic class: infinity 
0.03/0.14	* Total analysis performed in 79 ms.
0.03/0.14	
0.03/0.24	EOF