0.70/0.76	MAYBE
0.70/0.76	
0.70/0.76	Preprocessing Cost Relations
0.70/0.76	=====================================
0.70/0.76	
0.70/0.76	#### Computed strongly connected components 
0.70/0.76	0. recursive  : [f10/12,f21/12]
0.70/0.76	1. non_recursive  : [exit_location/1]
0.70/0.76	2. non_recursive  : [f31/8]
0.70/0.76	3. non_recursive  : [f10_loop_cont/9]
0.70/0.76	4. non_recursive  : [f0/8]
0.70/0.76	
0.70/0.76	#### Obtained direct recursion through partial evaluation 
0.70/0.76	0. SCC is partially evaluated into f10/12
0.70/0.76	1. SCC is completely evaluated into other SCCs
0.70/0.76	2. SCC is completely evaluated into other SCCs
0.70/0.76	3. SCC is partially evaluated into f10_loop_cont/9
0.70/0.76	4. SCC is partially evaluated into f0/8
0.70/0.76	
0.70/0.76	Control-Flow Refinement of Cost Relations
0.70/0.76	=====================================
0.70/0.76	
0.70/0.76	### Specialization of cost equations f10/12 
0.70/0.76	* CE 9 is refined into CE [12] 
0.70/0.76	* CE 8 is refined into CE [13] 
0.70/0.76	* CE 7 is refined into CE [14] 
0.70/0.76	* CE 2 is refined into CE [15] 
0.70/0.76	* CE 3 is refined into CE [16] 
0.70/0.76	* CE 6 is refined into CE [17] 
0.70/0.76	* CE 4 is refined into CE [18] 
0.70/0.76	* CE 5 is refined into CE [19] 
0.70/0.76	
0.70/0.76	
0.70/0.76	### Cost equations --> "Loop" of f10/12 
0.70/0.76	* CEs [15] --> Loop 12 
0.70/0.76	* CEs [18] --> Loop 13 
0.70/0.76	* CEs [16] --> Loop 14 
0.70/0.76	* CEs [19] --> Loop 15 
0.70/0.76	* CEs [17] --> Loop 16 
0.70/0.76	* CEs [12] --> Loop 17 
0.70/0.76	* CEs [13] --> Loop 18 
0.70/0.76	* CEs [14] --> Loop 19 
0.70/0.76	
0.70/0.76	### Ranking functions of CR f10(A,B,C,E,F,G,J,K,L,M,N,O) 
0.70/0.76	
0.70/0.76	#### Partial ranking functions of CR f10(A,B,C,E,F,G,J,K,L,M,N,O) 
0.70/0.76	* Partial RF of phase [12,13,14,15,16]:
0.70/0.76	  - RF of loop [12:1,13:1]:
0.70/0.76	    C depends on loops [14:1,15:1] 
0.70/0.76	  - RF of loop [12:1,14:1]:
0.70/0.76	    -F+3 depends on loops [13:1,15:1,16:1] 
0.70/0.76	  - RF of loop [13:1,15:1,16:1]:
0.70/0.76	    F depends on loops [12:1,14:1] 
0.70/0.76	  - RF of loop [14:1,15:1]:
0.70/0.76	    -B/2+1/2 depends on loops [16:1] 
0.70/0.76	  - RF of loop [16:1]:
0.70/0.76	    B depends on loops [14:1,15:1] 
0.70/0.76	
0.70/0.76	
0.70/0.76	### Specialization of cost equations f10_loop_cont/9 
0.70/0.76	* CE 11 is refined into CE [20] 
0.70/0.76	* CE 10 is refined into CE [21] 
0.70/0.76	
0.70/0.76	
0.70/0.76	### Cost equations --> "Loop" of f10_loop_cont/9 
0.70/0.76	* CEs [20] --> Loop 20 
0.70/0.76	* CEs [21] --> Loop 21 
0.70/0.76	
0.70/0.76	### Ranking functions of CR f10_loop_cont(A,B,C,D,E,F,G,H,I) 
0.70/0.76	
0.70/0.76	#### Partial ranking functions of CR f10_loop_cont(A,B,C,D,E,F,G,H,I) 
0.70/0.76	
0.70/0.76	
0.70/0.76	### Specialization of cost equations f0/8 
0.70/0.76	* CE 1 is refined into CE [22,23,24,25,26,27] 
0.70/0.76	
0.70/0.76	
0.70/0.76	### Cost equations --> "Loop" of f0/8 
0.70/0.76	* CEs [26,27] --> Loop 22 
0.70/0.76	* CEs [22,23,24,25] --> Loop 23 
0.70/0.76	
0.70/0.76	### Ranking functions of CR f0(A,B,C,D,E,F,G,J) 
0.70/0.76	
0.70/0.76	#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,J) 
0.70/0.76	
0.70/0.76	
0.70/0.76	Computing Bounds
0.70/0.76	=====================================
0.70/0.76	
0.70/0.76	#### Cost of chains of f10(A,B,C,E,F,G,J,K,L,M,N,O):
0.70/0.76	* Chain [[12,13,14,15,16]]...: 5*it(12)+0
0.70/0.76	  with precondition: [F>=1,C>=0,2>=F,A>=B,A>=1,E=2] 
0.70/0.76	
0.70/0.76	* Chain [[12,13,14,15,16],19]: 5*it(12)+0
0.70/0.76	  with precondition: [E=2,J=2,N=0,O=0,2>=F,A>=1,C>=0,F>=1,M>=0,K>=A,A>=B,K>=L,C+2*K>=A+L+1,C+4*K>=2*A+2*L+F] 
0.70/0.76	
0.70/0.76	* Chain [[12,13,14,15,16],18]: 5*it(12)+0
0.70/0.76	  with precondition: [E=2,J=2,N=3,O=1,2>=F,A>=1,C>=0,F>=1,M>=0,K>=A,A>=B,K>=L,C+K>=A+1,C+F+2*K>=2*A+3] 
0.70/0.76	
0.70/0.76	* Chain [[12,13,14,15,16],17]: 5*it(12)+0
0.70/0.76	  with precondition: [E=2,J=3,2>=F,A>=1,C>=0,F>=1,A>=B] 
0.70/0.76	
0.70/0.76	* Chain [17]: 0
0.70/0.76	  with precondition: [E=2,J=3,A>=1,C>=0,F>=0,A>=B] 
0.70/0.76	
0.70/0.76	
0.70/0.76	#### Cost of chains of f10_loop_cont(A,B,C,D,E,F,G,H,I):
0.70/0.76	* Chain [21]: 0
0.70/0.76	  with precondition: [A=2,E=0,F=2] 
0.70/0.76	
0.70/0.76	* Chain [20]: 0
0.70/0.76	  with precondition: [A=3,E=0,F=2] 
0.70/0.76	
0.70/0.76	
0.70/0.76	#### Cost of chains of f0(A,B,C,D,E,F,G,J):
0.70/0.76	* Chain [23]: 1*aux(37)+0
0.70/0.76	  with precondition: [] 
0.70/0.76	
0.70/0.76	* Chain [22]...: 1*aux(38)+0
0.70/0.76	  with precondition: [] 
0.70/0.76	
0.70/0.76	
0.70/0.76	Closed-form bounds of f0(A,B,C,D,E,F,G,J): 
0.70/0.76	-------------------------------------
0.70/0.76	* Chain [23] with precondition: [] 
0.70/0.76	    - Upper bound: inf 
0.70/0.76	    - Complexity: infinity 
0.70/0.76	* Chain [22]... with precondition: [] 
0.70/0.76	    - Upper bound: inf 
0.70/0.76	    - Complexity: infinity 
0.70/0.76	
0.70/0.76	### Maximum cost of f0(A,B,C,D,E,F,G,J): inf 
0.70/0.76	Asymptotic class: infinity 
0.70/0.76	* Total analysis performed in 659 ms.
0.70/0.76	
0.76/0.86	EOF