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