0.03/0.10	WORST_CASE(?,O(n^1))  
0.03/0.10	
0.03/0.10	Preprocessing Cost Relations
0.03/0.10	=====================================
0.03/0.10	
0.03/0.10	#### Computed strongly connected components 
0.03/0.10	0. recursive  : [zip3/4]
0.03/0.10	1. non_recursive  : [exit_location/1]
0.03/0.10	2. non_recursive  : [zip3_loop_cont/2]
0.03/0.10	3. non_recursive  : [start/4]
0.03/0.10	
0.03/0.10	#### Obtained direct recursion through partial evaluation 
0.03/0.10	0. SCC is partially evaluated into zip3/4
0.03/0.10	1. SCC is completely evaluated into other SCCs
0.03/0.10	2. SCC is completely evaluated into other SCCs
0.03/0.10	3. SCC is partially evaluated into start/4
0.03/0.10	
0.03/0.10	Control-Flow Refinement of Cost Relations
0.03/0.10	=====================================
0.03/0.10	
0.03/0.10	### Specialization of cost equations zip3/4 
0.03/0.10	* CE 3 is refined into CE [4] 
0.03/0.10	* CE 2 is refined into CE [5] 
0.03/0.10	
0.03/0.10	
0.03/0.10	### Cost equations --> "Loop" of zip3/4 
0.03/0.10	* CEs [5] --> Loop 4 
0.03/0.10	* CEs [4] --> Loop 5 
0.03/0.10	
0.03/0.10	### Ranking functions of CR zip3(A,B,C,D) 
0.03/0.10	* RF of phase [4]: [A,B,C]
0.03/0.10	
0.03/0.10	#### Partial ranking functions of CR zip3(A,B,C,D) 
0.03/0.10	* Partial RF of phase [4]:
0.03/0.10	  - RF of loop [4:1]:
0.03/0.10	    A
0.03/0.10	    B
0.03/0.10	    C
0.03/0.10	
0.03/0.10	
0.03/0.10	### Specialization of cost equations start/4 
0.03/0.10	* CE 1 is refined into CE [6,7] 
0.03/0.10	
0.03/0.10	
0.03/0.10	### Cost equations --> "Loop" of start/4 
0.03/0.10	* CEs [7] --> Loop 6 
0.03/0.10	* CEs [6] --> Loop 7 
0.03/0.10	
0.03/0.10	### Ranking functions of CR start(A,B,C,D) 
0.03/0.10	
0.03/0.10	#### Partial ranking functions of CR start(A,B,C,D) 
0.03/0.10	
0.03/0.10	
0.03/0.10	Computing Bounds
0.03/0.10	=====================================
0.03/0.10	
0.03/0.10	#### Cost of chains of zip3(A,B,C,D):
0.03/0.10	* Chain [[4],5]: 1*it(4)+0
0.03/0.10	  Such that:it(4) =< A
0.03/0.10	it(4) =< C
0.03/0.10	
0.03/0.10	  with precondition: [D=2,A>=1,B>=1,C>=1] 
0.03/0.10	
0.03/0.10	* Chain [5]: 0
0.03/0.10	  with precondition: [D=2] 
0.03/0.10	
0.03/0.10	
0.03/0.10	#### Cost of chains of start(A,B,C,D):
0.03/0.10	* Chain [7]: 0
0.03/0.10	  with precondition: [] 
0.03/0.10	
0.03/0.10	* Chain [6]: 1*s(1)+0
0.03/0.10	  Such that:s(1) =< A
0.03/0.10	s(1) =< C
0.03/0.10	
0.03/0.10	  with precondition: [A>=1,B>=1,C>=1] 
0.03/0.10	
0.03/0.10	
0.03/0.10	Closed-form bounds of start(A,B,C,D): 
0.03/0.10	-------------------------------------
0.03/0.10	* Chain [7] with precondition: [] 
0.03/0.10	    - Upper bound: 0 
0.03/0.10	    - Complexity: constant 
0.03/0.10	* Chain [6] with precondition: [A>=1,B>=1,C>=1] 
0.03/0.10	    - Upper bound: A 
0.03/0.10	    - Complexity: n 
0.03/0.10	
0.03/0.10	### Maximum cost of start(A,B,C,D): nat(A) 
0.03/0.10	Asymptotic class: n 
0.03/0.10	* Total analysis performed in 41 ms.
0.03/0.10	
0.03/0.10	EOF