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