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