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