0.04/0.48	WORST_CASE(?,O(1))  
0.04/0.48	
0.04/0.48	Preprocessing Cost Relations
0.04/0.48	=====================================
0.04/0.48	
0.04/0.48	#### Computed strongly connected components 
0.04/0.48	0. recursive  : [lbl13/15,lbl53/15,lbl91/15]
0.04/0.48	1. non_recursive  : [exit_location/1]
0.04/0.48	2. non_recursive  : [stop/15]
0.04/0.48	3. non_recursive  : [lbl53_loop_cont/16]
0.04/0.48	4. non_recursive  : [start/15]
0.04/0.48	5. non_recursive  : [start0/15]
0.04/0.48	
0.04/0.48	#### Obtained direct recursion through partial evaluation 
0.04/0.48	0. SCC is partially evaluated into lbl53/15
0.04/0.48	1. SCC is completely evaluated into other SCCs
0.04/0.48	2. SCC is completely evaluated into other SCCs
0.04/0.48	3. SCC is partially evaluated into lbl53_loop_cont/16
0.04/0.48	4. SCC is partially evaluated into start/15
0.04/0.48	5. SCC is partially evaluated into start0/15
0.04/0.48	
0.04/0.48	Control-Flow Refinement of Cost Relations
0.04/0.48	=====================================
0.04/0.48	
0.04/0.48	### Specialization of cost equations lbl53/15 
0.04/0.48	* CE 10 is refined into CE [13] 
0.04/0.48	* CE 7 is refined into CE [14] 
0.04/0.48	* CE 6 is discarded (unfeasible) 
0.04/0.48	* CE 5 is discarded (unfeasible) 
0.04/0.48	* CE 9 is refined into CE [15] 
0.04/0.48	* CE 8 is refined into CE [16] 
0.04/0.48	
0.04/0.48	
0.04/0.48	### Cost equations --> "Loop" of lbl53/15 
0.04/0.48	* CEs [16] --> Loop 12 
0.04/0.48	* CEs [15] --> Loop 13 
0.04/0.48	* CEs [13] --> Loop 14 
0.04/0.48	* CEs [14] --> Loop 15 
0.04/0.48	
0.04/0.48	### Ranking functions of CR lbl53(A,B,D,F,H,J,L,N,P,Q,R,S,T,U,V) 
0.04/0.48	
0.04/0.48	#### Partial ranking functions of CR lbl53(A,B,D,F,H,J,L,N,P,Q,R,S,T,U,V) 
0.04/0.48	
0.04/0.48	
0.04/0.48	### Specialization of cost equations lbl53_loop_cont/16 
0.04/0.48	* CE 12 is refined into CE [17] 
0.04/0.48	* CE 11 is refined into CE [18] 
0.04/0.48	
0.04/0.48	
0.04/0.48	### Cost equations --> "Loop" of lbl53_loop_cont/16 
0.04/0.49	* CEs [17] --> Loop 16 
0.04/0.49	* CEs [18] --> Loop 17 
0.04/0.49	
0.04/0.49	### Ranking functions of CR lbl53_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) 
0.04/0.49	
0.04/0.49	#### Partial ranking functions of CR lbl53_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) 
0.04/0.49	
0.04/0.49	
0.04/0.49	### Specialization of cost equations start/15 
0.04/0.49	* CE 3 is refined into CE [19,20,21] 
0.04/0.49	* CE 4 is refined into CE [22,23,24] 
0.04/0.49	* CE 2 is refined into CE [25] 
0.04/0.49	
0.04/0.49	
0.04/0.49	### Cost equations --> "Loop" of start/15 
0.04/0.49	* CEs [20,23] --> Loop 18 
0.04/0.49	* CEs [21,24] --> Loop 19 
0.04/0.49	* CEs [25] --> Loop 20 
0.04/0.49	* CEs [19,22] --> Loop 21 
0.04/0.49	
0.04/0.49	### Ranking functions of CR start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P) 
0.04/0.49	
0.04/0.49	#### Partial ranking functions of CR start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P) 
0.04/0.49	
0.04/0.49	
0.04/0.49	### Specialization of cost equations start0/15 
0.04/0.49	* CE 1 is refined into CE [26,27,28,29] 
0.04/0.49	
0.04/0.49	
0.04/0.49	### Cost equations --> "Loop" of start0/15 
0.04/0.49	* CEs [29] --> Loop 22 
0.04/0.49	* CEs [28] --> Loop 23 
0.04/0.49	* CEs [27] --> Loop 24 
0.04/0.49	* CEs [26] --> Loop 25 
0.04/0.49	
0.04/0.49	### Ranking functions of CR start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P) 
0.04/0.49	
0.04/0.49	#### Partial ranking functions of CR start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P) 
0.04/0.49	
0.04/0.49	
0.04/0.49	Computing Bounds
0.04/0.49	=====================================
0.04/0.49	
0.04/0.49	#### Cost of chains of lbl53(A,B,D,F,H,J,L,N,P,Q,R,S,T,U,V):
0.04/0.49	* Chain [15]: 0
0.04/0.49	  with precondition: [A=2,D=1,J=2,L=0,N=2,P=2,Q=0,R=1,U=2,V=1,H=T,1>=H,H>=0] 
0.04/0.49	
0.04/0.49	* Chain [14]: 0
0.04/0.49	  with precondition: [L=0,P=3,N=A,D+1=J,2>=D,D>=1,H>=0,N>=D+1,D>=H] 
0.04/0.49	
0.04/0.49	* Chain [13,14]: 1
0.04/0.49	  with precondition: [D=1,J=2,L=0,P=3,A=N,1>=H,A>=3,H>=0] 
0.04/0.49	
0.04/0.49	* Chain [12,14]: 1
0.04/0.49	  with precondition: [D=1,J=2,L=0,P=3,A=N,1>=H,A>=3,H>=0] 
0.04/0.49	
0.04/0.49	
0.04/0.49	#### Cost of chains of lbl53_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P):
0.04/0.49	* Chain [17]: 0
0.04/0.49	  with precondition: [A=2,O=B,O>=2] 
0.04/0.49	
0.04/0.49	* Chain [16]: 0
0.04/0.49	  with precondition: [A=3,O=B,O>=2] 
0.04/0.49	
0.04/0.49	
0.04/0.49	#### Cost of chains of start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P):
0.04/0.49	* Chain [21]: 0
0.04/0.49	  with precondition: [A=2,N=2,C=B,E=D,G=F,I=H,K=J,M=L] 
0.04/0.49	
0.04/0.49	* Chain [20]: 0
0.04/0.49	  with precondition: [N=A,C=B,E=D,G=F,I=H,K=J,M=L,1>=N] 
0.04/0.49	
0.04/0.49	* Chain [19]: 0
0.04/0.49	  with precondition: [N=A,C=B,E=D,G=F,I=H,K=J,M=L,N>=2] 
0.04/0.49	
0.04/0.49	* Chain [18]: 1
0.04/0.49	  with precondition: [N=A,C=B,E=D,G=F,I=H,K=J,M=L,N>=3] 
0.04/0.49	
0.04/0.49	
0.04/0.49	#### Cost of chains of start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P):
0.04/0.49	* Chain [25]: 0
0.04/0.49	  with precondition: [A=2] 
0.04/0.49	
0.04/0.49	* Chain [24]: 0
0.04/0.49	  with precondition: [1>=A] 
0.04/0.49	
0.04/0.49	* Chain [23]: 0
0.04/0.49	  with precondition: [A>=2] 
0.04/0.49	
0.04/0.49	* Chain [22]: 1
0.04/0.49	  with precondition: [A>=3] 
0.04/0.49	
0.04/0.49	
0.04/0.49	Closed-form bounds of start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P): 
0.04/0.49	-------------------------------------
0.04/0.49	* Chain [25] with precondition: [A=2] 
0.04/0.49	    - Upper bound: 0 
0.04/0.49	    - Complexity: constant 
0.04/0.49	* Chain [24] with precondition: [1>=A] 
0.04/0.49	    - Upper bound: 0 
0.04/0.49	    - Complexity: constant 
0.04/0.49	* Chain [23] with precondition: [A>=2] 
0.04/0.49	    - Upper bound: 0 
0.04/0.49	    - Complexity: constant 
0.04/0.49	* Chain [22] with precondition: [A>=3] 
0.04/0.49	    - Upper bound: 1 
0.04/0.49	    - Complexity: constant 
0.04/0.49	
0.04/0.49	### Maximum cost of start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P): 1 
0.04/0.49	Asymptotic class: constant 
0.04/0.49	* Total analysis performed in 386 ms.
0.04/0.49	
0.04/0.59	EOF