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