6.56/6.58	WORST_CASE(?,O(n^1))  
6.56/6.58	
6.56/6.58	Preprocessing Cost Relations
6.56/6.58	=====================================
6.56/6.58	
6.56/6.58	#### Computed strongly connected components 
6.56/6.58	0. recursive  : [evalbinsearchStepSize2bb10in/18,evalbinsearchStepSize2bb12in/18,evalbinsearchStepSize2bb13in/18,evalbinsearchStepSize2bb1in/18,evalbinsearchStepSize2bb2in/18,evalbinsearchStepSize2bb3in/18,evalbinsearchStepSize2bb4in/18,evalbinsearchStepSize2bb6in/18,evalbinsearchStepSize2bb7in/18,evalbinsearchStepSize2bb9in/18,evalbinsearchStepSize2bbin/18]
6.56/6.58	1. non_recursive  : [evalbinsearchStepSize2stop/10]
6.56/6.58	2. non_recursive  : [evalbinsearchStepSize2returnin/10]
6.56/6.58	3. non_recursive  : [exit_location/1]
6.56/6.58	4. non_recursive  : [evalbinsearchStepSize2bbin_loop_cont/11]
6.56/6.58	5. non_recursive  : [evalbinsearchStepSize2entryin/10]
6.56/6.58	6. non_recursive  : [evalbinsearchStepSize2start/10]
6.56/6.58	
6.56/6.58	#### Obtained direct recursion through partial evaluation 
6.56/6.58	0. SCC is partially evaluated into evalbinsearchStepSize2bbin/18
6.56/6.58	1. SCC is completely evaluated into other SCCs
6.56/6.58	2. SCC is completely evaluated into other SCCs
6.56/6.58	3. SCC is completely evaluated into other SCCs
6.56/6.58	4. SCC is partially evaluated into evalbinsearchStepSize2bbin_loop_cont/11
6.56/6.58	5. SCC is partially evaluated into evalbinsearchStepSize2entryin/10
6.56/6.58	6. SCC is partially evaluated into evalbinsearchStepSize2start/10
6.56/6.58	
6.56/6.58	Control-Flow Refinement of Cost Relations
6.56/6.58	=====================================
6.56/6.58	
6.56/6.58	### Specialization of cost equations evalbinsearchStepSize2bbin/18 
6.56/6.58	* CE 64 is refined into CE [67] 
6.56/6.58	* CE 8 is refined into CE [68] 
6.56/6.58	* CE 34 is refined into CE [69] 
6.56/6.58	* CE 4 is discarded (unfeasible) 
6.56/6.58	* CE 30 is discarded (unfeasible) 
6.56/6.58	* CE 10 is discarded (unfeasible) 
6.56/6.58	* CE 36 is discarded (unfeasible) 
6.56/6.58	* CE 6 is discarded (unfeasible) 
6.56/6.58	* CE 32 is discarded (unfeasible) 
6.56/6.58	* CE 57 is refined into CE [70] 
6.56/6.58	* CE 55 is discarded (unfeasible) 
6.56/6.58	* CE 58 is discarded (unfeasible) 
6.56/6.58	* CE 56 is discarded (unfeasible) 
6.56/6.58	* CE 63 is refined into CE [71] 
6.56/6.58	* CE 59 is discarded (unfeasible) 
6.56/6.58	* CE 60 is discarded (unfeasible) 
6.56/6.58	* CE 12 is discarded (unfeasible) 
6.56/6.58	* CE 38 is discarded (unfeasible) 
6.56/6.58	* CE 14 is discarded (unfeasible) 
6.56/6.58	* CE 40 is discarded (unfeasible) 
6.56/6.58	* CE 61 is refined into CE [72] 
6.56/6.58	* CE 62 is discarded (unfeasible) 
6.56/6.58	* CE 45 is discarded (unfeasible) 
6.56/6.58	* CE 19 is refined into CE [73] 
6.56/6.58	* CE 53 is discarded (unfeasible) 
6.56/6.58	* CE 27 is discarded (unfeasible) 
6.56/6.58	* CE 20 is refined into CE [74] 
6.56/6.58	* CE 28 is discarded (unfeasible) 
6.56/6.58	* CE 46 is refined into CE [75] 
6.56/6.58	* CE 54 is discarded (unfeasible) 
6.56/6.58	* CE 41 is refined into CE [76] 
6.56/6.58	* CE 48 is discarded (unfeasible) 
6.56/6.58	* CE 47 is discarded (unfeasible) 
6.56/6.58	* CE 15 is refined into CE [77] 
6.56/6.58	* CE 22 is discarded (unfeasible) 
6.56/6.58	* CE 21 is discarded (unfeasible) 
6.56/6.58	* CE 7 is refined into CE [78] 
6.56/6.58	* CE 3 is discarded (unfeasible) 
6.56/6.58	* CE 9 is discarded (unfeasible) 
6.56/6.58	* CE 5 is discarded (unfeasible) 
6.56/6.58	* CE 33 is refined into CE [79] 
6.56/6.58	* CE 29 is discarded (unfeasible) 
6.56/6.58	* CE 35 is discarded (unfeasible) 
6.56/6.58	* CE 31 is discarded (unfeasible) 
6.56/6.58	* CE 11 is discarded (unfeasible) 
6.56/6.58	* CE 13 is discarded (unfeasible) 
6.56/6.58	* CE 37 is discarded (unfeasible) 
6.56/6.58	* CE 39 is discarded (unfeasible) 
6.56/6.58	* CE 17 is refined into CE [80] 
6.56/6.58	* CE 25 is discarded (unfeasible) 
6.56/6.58	* CE 18 is refined into CE [81] 
6.56/6.58	* CE 26 is discarded (unfeasible) 
6.56/6.58	* CE 43 is discarded (unfeasible) 
6.56/6.58	* CE 51 is discarded (unfeasible) 
6.56/6.58	* CE 44 is refined into CE [82] 
6.56/6.58	* CE 52 is discarded (unfeasible) 
6.56/6.58	* CE 42 is refined into CE [83] 
6.56/6.58	* CE 50 is discarded (unfeasible) 
6.56/6.58	* CE 49 is discarded (unfeasible) 
6.56/6.58	* CE 16 is refined into CE [84] 
6.56/6.58	* CE 24 is discarded (unfeasible) 
6.56/6.58	* CE 23 is discarded (unfeasible) 
6.56/6.58	
6.56/6.58	
6.56/6.58	### Cost equations --> "Loop" of evalbinsearchStepSize2bbin/18 
6.56/6.58	* CEs [78] --> Loop 67 
6.56/6.58	* CEs [79] --> Loop 68 
6.56/6.58	* CEs [82] --> Loop 69 
6.56/6.58	* CEs [80] --> Loop 70 
6.56/6.58	* CEs [83] --> Loop 71 
6.56/6.58	* CEs [84] --> Loop 72 
6.56/6.58	* CEs [81] --> Loop 73 
6.56/6.58	* CEs [67] --> Loop 74 
6.56/6.58	* CEs [69] --> Loop 75 
6.56/6.58	* CEs [70] --> Loop 76 
6.56/6.58	* CEs [71] --> Loop 77 
6.56/6.58	* CEs [72] --> Loop 78 
6.56/6.58	* CEs [75] --> Loop 79 
6.56/6.58	* CEs [68] --> Loop 80 
6.56/6.58	* CEs [76] --> Loop 81 
6.56/6.58	* CEs [73] --> Loop 82 
6.56/6.58	* CEs [77] --> Loop 83 
6.56/6.58	* CEs [74] --> Loop 84 
6.56/6.58	
6.56/6.58	### Ranking functions of CR evalbinsearchStepSize2bbin(A,B,C,D,E,F,G,H,I,K,L,M,N,O,P,Q,R,S) 
6.56/6.58	* RF of phase [69]: [D/4-3/4]
6.56/6.58	* RF of phase [70]: [-D/4+63]
6.56/6.58	
6.56/6.58	#### Partial ranking functions of CR evalbinsearchStepSize2bbin(A,B,C,D,E,F,G,H,I,K,L,M,N,O,P,Q,R,S) 
6.56/6.58	* Partial RF of phase [69]:
6.56/6.58	  - RF of loop [69:1]:
6.56/6.58	    D/4-3/4
6.56/6.58	* Partial RF of phase [70]:
6.56/6.58	  - RF of loop [70:1]:
6.56/6.58	    -D/4+63
6.56/6.58	
6.56/6.58	
6.56/6.58	### Specialization of cost equations evalbinsearchStepSize2bbin_loop_cont/11 
6.56/6.58	* CE 66 is refined into CE [85] 
6.56/6.58	* CE 65 is refined into CE [86] 
6.56/6.58	
6.56/6.58	
6.56/6.58	### Cost equations --> "Loop" of evalbinsearchStepSize2bbin_loop_cont/11 
6.56/6.58	* CEs [85] --> Loop 85 
6.56/6.58	* CEs [86] --> Loop 86 
6.56/6.58	
6.56/6.58	### Ranking functions of CR evalbinsearchStepSize2bbin_loop_cont(A,B,C,D,E,F,G,H,I,J,K) 
6.56/6.58	
6.56/6.58	#### Partial ranking functions of CR evalbinsearchStepSize2bbin_loop_cont(A,B,C,D,E,F,G,H,I,J,K) 
6.56/6.58	
6.56/6.58	
6.56/6.58	### Specialization of cost equations evalbinsearchStepSize2entryin/10 
6.56/6.58	* CE 2 is refined into CE [87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117] 
6.56/6.58	
6.56/6.58	
6.56/6.58	### Cost equations --> "Loop" of evalbinsearchStepSize2entryin/10 
6.56/6.58	* CEs [109] --> Loop 87 
6.56/6.58	* CEs [112] --> Loop 88 
6.56/6.58	* CEs [88] --> Loop 89 
6.56/6.58	* CEs [107,108,110,111,113,116] --> Loop 90 
6.56/6.58	* CEs [99] --> Loop 91 
6.56/6.58	* CEs [91] --> Loop 92 
6.56/6.58	* CEs [98] --> Loop 93 
6.56/6.58	* CEs [114] --> Loop 94 
6.56/6.58	* CEs [90,93,96,97,101,106] --> Loop 95 
6.56/6.58	* CEs [105] --> Loop 96 
6.56/6.58	* CEs [104] --> Loop 97 
6.56/6.58	* CEs [94] --> Loop 98 
6.56/6.58	* CEs [89] --> Loop 99 
6.56/6.58	* CEs [92,100,103] --> Loop 100 
6.56/6.58	* CEs [95,102] --> Loop 101 
6.56/6.58	* CEs [87] --> Loop 102 
6.56/6.58	* CEs [115,117] --> Loop 103 
6.56/6.58	
6.56/6.58	### Ranking functions of CR evalbinsearchStepSize2entryin(A,B,C,D,E,F,G,H,I,K) 
6.56/6.58	
6.56/6.58	#### Partial ranking functions of CR evalbinsearchStepSize2entryin(A,B,C,D,E,F,G,H,I,K) 
6.56/6.58	
6.56/6.58	
6.56/6.58	### Specialization of cost equations evalbinsearchStepSize2start/10 
6.56/6.58	* CE 1 is refined into CE [118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134] 
6.56/6.58	
6.56/6.58	
6.56/6.58	### Cost equations --> "Loop" of evalbinsearchStepSize2start/10 
6.56/6.58	* CEs [134] --> Loop 104 
6.56/6.58	* CEs [133] --> Loop 105 
6.56/6.58	* CEs [132] --> Loop 106 
6.56/6.58	* CEs [131] --> Loop 107 
6.56/6.58	* CEs [130] --> Loop 108 
6.56/6.58	* CEs [129] --> Loop 109 
6.56/6.58	* CEs [128] --> Loop 110 
6.56/6.58	* CEs [127] --> Loop 111 
6.56/6.58	* CEs [126] --> Loop 112 
6.56/6.58	* CEs [125] --> Loop 113 
6.56/6.58	* CEs [124] --> Loop 114 
6.56/6.58	* CEs [123] --> Loop 115 
6.56/6.58	* CEs [122] --> Loop 116 
6.56/6.58	* CEs [121] --> Loop 117 
6.56/6.58	* CEs [120] --> Loop 118 
6.56/6.58	* CEs [119] --> Loop 119 
6.56/6.58	* CEs [118] --> Loop 120 
6.56/6.58	
6.56/6.58	### Ranking functions of CR evalbinsearchStepSize2start(A,B,C,D,E,F,G,H,I,K) 
6.56/6.58	
6.56/6.58	#### Partial ranking functions of CR evalbinsearchStepSize2start(A,B,C,D,E,F,G,H,I,K) 
6.56/6.58	
6.56/6.58	
6.56/6.58	Computing Bounds
6.56/6.58	=====================================
6.56/6.58	
6.56/6.58	#### Cost of chains of evalbinsearchStepSize2bbin(A,B,C,D,E,F,G,H,I,K,L,M,N,O,P,Q,R,S):
6.56/6.58	* Chain [[69],83]: 1*it(69)+0
6.56/6.58	  Such that:it(69) =< D/4-O/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=1,M=0,N=4,Q=4,R=1,1>=A,2>=S,A>=0,2*S>=3,P>=G+1,D>=O+4,O+S>=256] 
6.56/6.58	
6.56/6.58	* Chain [[69],79]: 1*it(69)+0
6.56/6.58	  Such that:it(69) =< D/4-O/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=1,M=0,N=4,Q=4,R=0,S=4,1>=A,3>=O,A>=0,O>=0,D>=O+4,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [[69],78]: 1*it(69)+0
6.56/6.58	  Such that:it(69) =< D/4-O/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=1,M=0,N=4,Q=4,R=0,S=4,G=P,1>=A,A>=0,O>=0,D>=O+4] 
6.56/6.58	
6.56/6.58	* Chain [[69],74]: 1*it(69)+0
6.56/6.58	  Such that:it(69) =< D/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=3,1>=A,A>=0,D>=4] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,80]: 1*it(69)+1
6.56/6.58	  Such that:it(69) =< D/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=2,M=1,N=2,O=255,Q=1,R=1,S=1,1>=A,A>=0,D>=257,P>=G+1] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,76]: 1*it(69)+1
6.56/6.58	  Such that:it(69) =< D/4-O/4+1/2
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=2,M=1,N=2,R=1,S=2,G=P,1>=A,255>=O,1>=Q,A>=0,O>=2,2*Q>=1,D>=O+2] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,74]: 1*it(69)+1
6.56/6.58	  Such that:it(69) =< D/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=3,1>=A,A>=0,D>=4] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,68,77]: 1*it(69)+2
6.56/6.58	  Such that:it(69) =< D/4-O/4+1/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=1,M=1,N=1,Q=1,R=1,S=1,1>=A,254>=O,A>=0,O>=1,D>=O+3,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,68,74]: 1*it(69)+2
6.56/6.58	  Such that:it(69) =< D/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=3,1>=A,A>=0,D>=4] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,67,77]: 1*it(69)+2
6.56/6.58	  Such that:it(69) =< D/4-O/4+3/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=2,L=2,M=1,N=1,Q=1,R=1,S=1,1>=A,255>=O,A>=0,O>=3,P>=G+1,D>=O+1] 
6.56/6.58	
6.56/6.58	* Chain [[69],72,67,74]: 1*it(69)+2
6.56/6.58	  Such that:it(69) =< D/4
6.56/6.58	
6.56/6.58	  with precondition: [B=0,C=4,K=3,1>=A,A>=0,D>=4] 
6.56/6.58	
6.56/6.58	* Chain [84]: 0
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=0,M=0,N=4,Q=4,R=0,S=4,D=O,D>=252,P>=G+1] 
6.56/6.58	
6.56/6.58	* Chain [79]: 0
6.56/6.58	  with precondition: [B=0,C=4,K=2,M=0,N=4,Q=4,R=0,S=4,A=L,D=O,1>=A,3>=D,A>=0,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [78]: 0
6.56/6.58	  with precondition: [B=0,C=4,K=2,M=0,N=4,Q=4,O=D,P=G,R=H,S=I,A=L,2>=A,A>=0] 
6.56/6.58	
6.56/6.58	* Chain [74]: 0
6.56/6.58	  with precondition: [K=3,2>=A,1>=B,4>=2*B+C,A>=B,2*C+7*B>=8] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],82]: 1*it(70)+1
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=0,N=4,Q=4,R=0,S=4,255>=O,O>=252,O>=D+8,P>=G+1] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],81]: 1*it(70)+1
6.56/6.58	  Such that:it(70) =< -D/4+O/4
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=0,N=4,Q=4,R=1,2>=S,2*S>=3,O>=D+8,S>=O+1,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],78]: 1*it(70)+1
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	it(70) =< -D/4+O/4
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=0,N=4,Q=4,R=0,S=4,G=P,255>=O,O>=D+8] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],74]: 1*it(70)+1
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,247>=D] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,76]: 1*it(70)+2
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	it(70) =< -D/4+O/4
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=1,M=1,N=2,R=1,S=2,G=P,253>=O,1>=Q,O>=0,2*Q>=1,O>=D+6] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,75]: 1*it(70)+2
6.56/6.58	  Such that:it(70) =< -D/4
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=1,M=1,N=2,O=0,Q=1,R=1,S=1,0>=D+6,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,74]: 1*it(70)+2
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,247>=D] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,68,77]: 1*it(70)+3
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	it(70) =< -D/4+O/4
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=1,M=1,N=1,Q=1,R=1,S=1,252>=O,O>=0,O>=D+5,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,68,74]: 1*it(70)+3
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,247>=D] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,67,77]: 1*it(70)+3
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	it(70) =< -D/4+O/4
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=1,N=1,Q=1,R=1,S=1,254>=O,O>=1,O>=D+7,P>=G+1] 
6.56/6.58	
6.56/6.58	* Chain [73,[70],71,67,74]: 1*it(70)+3
6.56/6.58	  Such that:it(70) =< -D/4+62
6.56/6.58	
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,247>=D] 
6.56/6.58	
6.56/6.58	* Chain [73,82]: 1
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=0,N=4,Q=4,R=0,S=4,O=D+4,255>=O,O>=252,P>=G+1] 
6.56/6.58	
6.56/6.58	* Chain [73,81]: 1
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=0,N=4,Q=4,R=1,O=D+4,2>=S,2*S>=3,S>=O+1,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [73,78]: 1
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=0,N=4,Q=4,R=0,S=4,D+4=O,G=P,251>=D] 
6.56/6.58	
6.56/6.58	* Chain [73,74]: 1
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,251>=D] 
6.56/6.58	
6.56/6.58	* Chain [73,71,76]: 2
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=1,M=1,N=2,R=1,S=2,O=D+2,G=P,253>=O,1>=Q,O>=0,2*Q>=1] 
6.56/6.58	
6.56/6.58	* Chain [73,71,75]: 2
6.56/6.58	  with precondition: [A=0,B=0,C=4,D+2=0,K=2,L=1,M=1,N=2,O=0,Q=1,R=1,S=1,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [73,71,74]: 2
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,251>=D,2*D+5>=0] 
6.56/6.58	
6.56/6.58	* Chain [73,71,68,77]: 3
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=1,M=1,N=1,Q=1,R=1,S=1,O=D+1,252>=O,O>=0,G>=P+1] 
6.56/6.58	
6.56/6.58	* Chain [73,71,68,74]: 3
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,251>=D,2*D+3>=0] 
6.56/6.58	
6.56/6.58	* Chain [73,71,67,77]: 3
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=2,L=2,M=1,N=1,Q=1,R=1,S=1,O=D+3,254>=O,O>=1,P>=G+1] 
6.56/6.58	
6.56/6.58	* Chain [73,71,67,74]: 3
6.56/6.58	  with precondition: [A=0,B=0,C=4,K=3,251>=D,D+2>=0] 
6.56/6.58	
6.56/6.58	
6.56/6.58	#### Cost of chains of evalbinsearchStepSize2bbin_loop_cont(A,B,C,D,E,F,G,H,I,J,K):
6.56/6.58	* Chain [86]: 0
6.56/6.58	  with precondition: [A=2] 
6.56/6.58	
6.56/6.58	* Chain [85]: 0
6.56/6.58	  with precondition: [A=3] 
6.56/6.58	
6.56/6.58	
6.56/6.58	#### Cost of chains of evalbinsearchStepSize2entryin(A,B,C,D,E,F,G,H,I,K):
6.56/6.58	* Chain [103]: 0
6.56/6.58	  with precondition: [] 
6.56/6.58	
6.56/6.58	* Chain [102]: 2
6.56/6.58	  with precondition: [A+2=0] 
6.56/6.58	
6.56/6.58	* Chain [101]: 1
6.56/6.58	  with precondition: [251>=A] 
6.56/6.58	
6.56/6.58	* Chain [100]: 3
6.56/6.58	  with precondition: [251>=A,A+2>=0] 
6.56/6.58	
6.56/6.58	* Chain [99]: 3
6.56/6.58	  with precondition: [251>=A,A+1>=0] 
6.56/6.58	
6.56/6.58	* Chain [98]: 1
6.56/6.58	  with precondition: [251>=A,A>=248] 
6.56/6.58	
6.56/6.58	* Chain [97]: 2
6.56/6.58	  with precondition: [251>=A,2*A+5>=0] 
6.56/6.58	
6.56/6.58	* Chain [96]: 3
6.56/6.58	  with precondition: [251>=A,2*A+3>=0] 
6.56/6.58	
6.56/6.58	* Chain [95]: 9*s(9)+3
6.56/6.58	  Such that:aux(3) =< -A/4+62
6.56/6.58	s(9) =< aux(3)
6.56/6.58	
6.56/6.58	  with precondition: [247>=A] 
6.56/6.58	
6.56/6.58	* Chain [94]: 0
6.56/6.58	  with precondition: [3>=A] 
6.56/6.58	
6.56/6.58	* Chain [93]: 1
6.56/6.58	  with precondition: [0>=A+3] 
6.56/6.58	
6.56/6.58	* Chain [92]: 1*s(16)+2
6.56/6.58	  Such that:s(16) =< -A/4
6.56/6.58	
6.56/6.58	  with precondition: [0>=A+6] 
6.56/6.58	
6.56/6.58	* Chain [91]: 1*s(17)+1
6.56/6.58	  Such that:s(17) =< -A/4+1/4
6.56/6.58	
6.56/6.58	  with precondition: [0>=A+7] 
6.56/6.58	
6.56/6.58	* Chain [90]: 9*s(18)+2
6.56/6.58	  Such that:aux(4) =< A/4
6.56/6.58	s(18) =< aux(4)
6.56/6.58	
6.56/6.58	  with precondition: [A>=4] 
6.56/6.58	
6.56/6.58	* Chain [89]: 0
6.56/6.58	  with precondition: [A>=252] 
6.56/6.58	
6.56/6.58	* Chain [88]: 1*s(25)+1
6.56/6.58	  Such that:s(25) =< A/4
6.56/6.58	
6.56/6.58	  with precondition: [A>=257] 
6.56/6.58	
6.56/6.58	* Chain [87]: 1*s(26)+0
6.56/6.58	  Such that:s(26) =< A/4
6.56/6.58	
6.56/6.58	  with precondition: [A>=258] 
6.56/6.58	
6.56/6.58	
6.56/6.58	#### Cost of chains of evalbinsearchStepSize2start(A,B,C,D,E,F,G,H,I,K):
6.56/6.58	* Chain [120]: 0
6.56/6.58	  with precondition: [] 
6.56/6.58	
6.56/6.58	* Chain [119]: 2
6.56/6.58	  with precondition: [A+2=0] 
6.56/6.58	
6.56/6.58	* Chain [118]: 1
6.56/6.58	  with precondition: [251>=A] 
6.56/6.58	
6.56/6.58	* Chain [117]: 3
6.56/6.58	  with precondition: [251>=A,A+2>=0] 
6.56/6.58	
6.56/6.58	* Chain [116]: 3
6.56/6.58	  with precondition: [251>=A,A+1>=0] 
6.56/6.58	
6.56/6.58	* Chain [115]: 1
6.56/6.58	  with precondition: [251>=A,A>=248] 
6.56/6.58	
6.56/6.58	* Chain [114]: 2
6.56/6.58	  with precondition: [251>=A,2*A+5>=0] 
6.56/6.58	
6.56/6.58	* Chain [113]: 3
6.56/6.58	  with precondition: [251>=A,2*A+3>=0] 
6.56/6.58	
6.56/6.58	* Chain [112]: 9*s(28)+3
6.56/6.58	  Such that:s(27) =< -A/4+62
6.56/6.58	s(28) =< s(27)
6.56/6.58	
6.56/6.58	  with precondition: [247>=A] 
6.56/6.58	
6.56/6.58	* Chain [111]: 0
6.56/6.58	  with precondition: [3>=A] 
6.56/6.58	
6.56/6.58	* Chain [110]: 1
6.56/6.58	  with precondition: [0>=A+3] 
6.56/6.58	
6.56/6.58	* Chain [109]: 1*s(29)+2
6.56/6.58	  Such that:s(29) =< -A/4
6.56/6.58	
6.56/6.58	  with precondition: [0>=A+6] 
6.56/6.58	
6.56/6.58	* Chain [108]: 1*s(30)+1
6.56/6.58	  Such that:s(30) =< -A/4+1/4
6.56/6.58	
6.56/6.58	  with precondition: [0>=A+7] 
6.56/6.58	
6.56/6.58	* Chain [107]: 9*s(32)+2
6.56/6.58	  Such that:s(31) =< A/4
6.56/6.58	s(32) =< s(31)
6.56/6.58	
6.56/6.58	  with precondition: [A>=4] 
6.56/6.58	
6.56/6.58	* Chain [106]: 0
6.56/6.58	  with precondition: [A>=252] 
6.56/6.58	
6.56/6.58	* Chain [105]: 1*s(33)+1
6.56/6.58	  Such that:s(33) =< A/4
6.56/6.58	
6.56/6.58	  with precondition: [A>=257] 
6.56/6.58	
6.56/6.58	* Chain [104]: 1*s(34)+0
6.56/6.58	  Such that:s(34) =< A/4
6.56/6.58	
6.56/6.58	  with precondition: [A>=258] 
6.56/6.58	
6.56/6.58	
6.56/6.58	Closed-form bounds of evalbinsearchStepSize2start(A,B,C,D,E,F,G,H,I,K): 
6.56/6.58	-------------------------------------
6.56/6.58	* Chain [120] with precondition: [] 
6.56/6.58	    - Upper bound: 0 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [119] with precondition: [A+2=0] 
6.56/6.58	    - Upper bound: 2 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [118] with precondition: [251>=A] 
6.56/6.58	    - Upper bound: 1 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [117] with precondition: [251>=A,A+2>=0] 
6.56/6.58	    - Upper bound: 3 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [116] with precondition: [251>=A,A+1>=0] 
6.56/6.58	    - Upper bound: 3 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [115] with precondition: [251>=A,A>=248] 
6.56/6.58	    - Upper bound: 1 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [114] with precondition: [251>=A,2*A+5>=0] 
6.56/6.58	    - Upper bound: 2 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [113] with precondition: [251>=A,2*A+3>=0] 
6.56/6.58	    - Upper bound: 3 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [112] with precondition: [247>=A] 
6.56/6.58	    - Upper bound: -9/4*A+561 
6.56/6.58	    - Complexity: n 
6.56/6.58	* Chain [111] with precondition: [3>=A] 
6.56/6.58	    - Upper bound: 0 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [110] with precondition: [0>=A+3] 
6.56/6.58	    - Upper bound: 1 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [109] with precondition: [0>=A+6] 
6.56/6.58	    - Upper bound: -A/4+2 
6.56/6.58	    - Complexity: n 
6.56/6.58	* Chain [108] with precondition: [0>=A+7] 
6.56/6.58	    - Upper bound: -A/4+5/4 
6.56/6.58	    - Complexity: n 
6.56/6.58	* Chain [107] with precondition: [A>=4] 
6.56/6.58	    - Upper bound: 9/4*A+2 
6.56/6.58	    - Complexity: n 
6.56/6.58	* Chain [106] with precondition: [A>=252] 
6.56/6.58	    - Upper bound: 0 
6.56/6.58	    - Complexity: constant 
6.56/6.58	* Chain [105] with precondition: [A>=257] 
6.56/6.58	    - Upper bound: A/4+1 
6.56/6.58	    - Complexity: n 
6.56/6.58	* Chain [104] with precondition: [A>=258] 
6.56/6.58	    - Upper bound: A/4 
6.56/6.58	    - Complexity: n 
6.56/6.58	
6.56/6.58	### Maximum cost of evalbinsearchStepSize2start(A,B,C,D,E,F,G,H,I,K): max([max([3,nat(-A/4+1/4)+1,nat(-A/4)+2,nat(-A/4+62)*9+3]),nat(A/4)+max([1,nat(A/4)*8+2])]) 
6.56/6.58	Asymptotic class: n 
6.56/6.58	* Total analysis performed in 6333 ms.
6.56/6.58	
6.59/6.68	EOF