0.03/0.13	WORST_CASE(?,O(n^1))  
0.03/0.13	
0.03/0.13	Preprocessing Cost Relations
0.03/0.13	=====================================
0.03/0.13	
0.03/0.13	#### Computed strongly connected components 
0.03/0.13	0. recursive  : [evalrandom1dbb1in/4,evalrandom1dbb5in/4]
0.03/0.13	1. non_recursive  : [evalrandom1dstop/3]
0.03/0.13	2. non_recursive  : [evalrandom1dreturnin/3]
0.03/0.13	3. non_recursive  : [exit_location/1]
0.03/0.13	4. non_recursive  : [evalrandom1dbb5in_loop_cont/4]
0.03/0.13	5. non_recursive  : [evalrandom1dentryin/3]
0.03/0.13	6. non_recursive  : [evalrandom1dstart/3]
0.03/0.13	
0.03/0.13	#### Obtained direct recursion through partial evaluation 
0.03/0.13	0. SCC is partially evaluated into evalrandom1dbb5in/4
0.03/0.13	1. SCC is completely evaluated into other SCCs
0.03/0.13	2. SCC is completely evaluated into other SCCs
0.03/0.13	3. SCC is completely evaluated into other SCCs
0.03/0.13	4. SCC is partially evaluated into evalrandom1dbb5in_loop_cont/4
0.03/0.13	5. SCC is partially evaluated into evalrandom1dentryin/3
0.03/0.13	6. SCC is partially evaluated into evalrandom1dstart/3
0.03/0.13	
0.03/0.13	Control-Flow Refinement of Cost Relations
0.03/0.13	=====================================
0.03/0.13	
0.03/0.13	### Specialization of cost equations evalrandom1dbb5in/4 
0.03/0.13	* CE 6 is refined into CE [9] 
0.03/0.13	* CE 5 is refined into CE [10] 
0.03/0.13	* CE 4 is refined into CE [11] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of evalrandom1dbb5in/4 
0.03/0.13	* CEs [11] --> Loop 9 
0.03/0.13	* CEs [9] --> Loop 10 
0.03/0.13	* CEs [10] --> Loop 11 
0.03/0.13	
0.03/0.13	### Ranking functions of CR evalrandom1dbb5in(A,B,D,E) 
0.03/0.13	* RF of phase [9]: [A-B+1]
0.03/0.13	
0.03/0.13	#### Partial ranking functions of CR evalrandom1dbb5in(A,B,D,E) 
0.03/0.13	* Partial RF of phase [9]:
0.03/0.13	  - RF of loop [9:1]:
0.03/0.13	    A-B+1
0.03/0.13	
0.03/0.13	
0.03/0.13	### Specialization of cost equations evalrandom1dbb5in_loop_cont/4 
0.03/0.13	* CE 8 is refined into CE [12] 
0.03/0.13	* CE 7 is refined into CE [13] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of evalrandom1dbb5in_loop_cont/4 
0.03/0.13	* CEs [12] --> Loop 12 
0.03/0.13	* CEs [13] --> Loop 13 
0.03/0.13	
0.03/0.13	### Ranking functions of CR evalrandom1dbb5in_loop_cont(A,B,C,D) 
0.03/0.13	
0.03/0.13	#### Partial ranking functions of CR evalrandom1dbb5in_loop_cont(A,B,C,D) 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Specialization of cost equations evalrandom1dentryin/3 
0.03/0.13	* CE 3 is refined into CE [14,15,16] 
0.03/0.13	* CE 2 is refined into CE [17] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of evalrandom1dentryin/3 
0.03/0.13	* CEs [14,15,16] --> Loop 14 
0.03/0.13	* CEs [17] --> Loop 15 
0.03/0.13	
0.03/0.13	### Ranking functions of CR evalrandom1dentryin(A,B,D) 
0.03/0.13	
0.03/0.13	#### Partial ranking functions of CR evalrandom1dentryin(A,B,D) 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Specialization of cost equations evalrandom1dstart/3 
0.03/0.13	* CE 1 is refined into CE [18,19] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of evalrandom1dstart/3 
0.03/0.13	* CEs [19] --> Loop 16 
0.03/0.13	* CEs [18] --> Loop 17 
0.03/0.14	
0.03/0.14	### Ranking functions of CR evalrandom1dstart(A,B,D) 
0.03/0.14	
0.03/0.14	#### Partial ranking functions of CR evalrandom1dstart(A,B,D) 
0.03/0.14	
0.03/0.14	
0.03/0.14	Computing Bounds
0.03/0.14	=====================================
0.03/0.14	
0.03/0.14	#### Cost of chains of evalrandom1dbb5in(A,B,D,E):
0.03/0.14	* Chain [[9],11]: 1*it(9)+0
0.03/0.14	  Such that:it(9) =< -B+E
0.03/0.14	
0.03/0.14	  with precondition: [D=2,A+1=E,B>=1,A>=B] 
0.03/0.14	
0.03/0.14	* Chain [[9],10]: 1*it(9)+0
0.03/0.14	  Such that:it(9) =< A-B+1
0.03/0.14	
0.03/0.14	  with precondition: [D=3,B>=1,A>=B] 
0.03/0.14	
0.03/0.14	* Chain [10]: 0
0.03/0.14	  with precondition: [D=3,A>=1,B>=1] 
0.03/0.14	
0.03/0.14	
0.03/0.14	#### Cost of chains of evalrandom1dbb5in_loop_cont(A,B,C,D):
0.03/0.14	* Chain [13]: 0
0.03/0.14	  with precondition: [A=2,B>=1] 
0.03/0.14	
0.03/0.14	* Chain [12]: 0
0.03/0.14	  with precondition: [A=3,B>=1] 
0.03/0.14	
0.03/0.14	
0.03/0.14	#### Cost of chains of evalrandom1dentryin(A,B,D):
0.03/0.14	* Chain [15]: 0
0.03/0.14	  with precondition: [0>=A] 
0.03/0.14	
0.03/0.14	* Chain [14]: 2*s(1)+0
0.03/0.14	  Such that:aux(1) =< A
0.03/0.14	s(1) =< aux(1)
0.03/0.14	
0.03/0.14	  with precondition: [A>=1] 
0.03/0.14	
0.03/0.14	
0.03/0.14	#### Cost of chains of evalrandom1dstart(A,B,D):
0.03/0.14	* Chain [17]: 0
0.03/0.14	  with precondition: [0>=A] 
0.03/0.14	
0.03/0.14	* Chain [16]: 2*s(4)+0
0.03/0.14	  Such that:s(3) =< A
0.03/0.14	s(4) =< s(3)
0.03/0.14	
0.03/0.14	  with precondition: [A>=1] 
0.03/0.14	
0.03/0.14	
0.03/0.14	Closed-form bounds of evalrandom1dstart(A,B,D): 
0.03/0.14	-------------------------------------
0.03/0.14	* Chain [17] with precondition: [0>=A] 
0.03/0.14	    - Upper bound: 0 
0.03/0.14	    - Complexity: constant 
0.03/0.14	* Chain [16] with precondition: [A>=1] 
0.03/0.14	    - Upper bound: 2*A 
0.03/0.14	    - Complexity: n 
0.03/0.14	
0.03/0.14	### Maximum cost of evalrandom1dstart(A,B,D): nat(A)*2 
0.03/0.14	Asymptotic class: n 
0.03/0.14	* Total analysis performed in 76 ms.
0.03/0.14	
0.03/0.24	EOF