3.12/3.14	MAYBE
3.12/3.14	WARNING: Excluded non-linear constraints:[O>=C*P,C*P+P>=O+1,O>=C*Q,C*Q+Q>=O+1]
3.12/3.14	WARNING: Excluded non-linear constraints:[O>=C*P,C*P+P>=O+1,O>=C*Q,C*Q+Q>=O+1]
3.12/3.14	
3.12/3.14	Preprocessing Cost Relations
3.12/3.14	=====================================
3.12/3.14	
3.12/3.14	#### Computed strongly connected components 
3.12/3.14	0. recursive  : [f8/13]
3.12/3.14	1. recursive  : [f19/6]
3.12/3.14	2. recursive  : [f27/6]
3.12/3.14	3. recursive  : [f43/4]
3.12/3.14	4. recursive  : [f49/6]
3.12/3.14	5. recursive  : [f36/11,f43_loop_cont/12,f49_loop_cont/12]
3.12/3.14	6. recursive  : [f19_loop_cont/17,f2/16,f27_loop_cont/17,f34/16,f36_loop_cont/17,f8_loop_cont/17]
3.12/3.14	7. non_recursive  : [exit_location/1]
3.12/3.14	8. non_recursive  : [f1/9]
3.12/3.14	9. non_recursive  : [f2_loop_cont/10]
3.12/3.14	10. non_recursive  : [start/9]
3.12/3.14	
3.12/3.14	#### Obtained direct recursion through partial evaluation 
3.12/3.14	0. SCC is partially evaluated into f8/13
3.12/3.14	1. SCC is partially evaluated into f19/6
3.12/3.14	2. SCC is partially evaluated into f27/6
3.12/3.14	3. SCC is partially evaluated into f43/4
3.12/3.14	4. SCC is partially evaluated into f49/6
3.12/3.14	5. SCC is partially evaluated into f36/11
3.12/3.14	6. SCC is partially evaluated into f2/16
3.12/3.14	7. SCC is completely evaluated into other SCCs
3.12/3.14	8. SCC is completely evaluated into other SCCs
3.12/3.14	9. SCC is partially evaluated into f2_loop_cont/10
3.12/3.14	10. SCC is partially evaluated into start/9
3.12/3.14	
3.12/3.14	Control-Flow Refinement of Cost Relations
3.12/3.14	=====================================
3.12/3.14	
3.12/3.14	### Specialization of cost equations f8/13 
3.12/3.14	* CE 22 is refined into CE [43] 
3.12/3.14	* CE 23 is refined into CE [44] 
3.12/3.14	* CE 21 is refined into CE [45] 
3.12/3.14	* CE 24 is refined into CE [46] 
3.12/3.14	* CE 20 is refined into CE [47] 
3.12/3.14	* CE 19 is refined into CE [48] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f8/13 
3.12/3.14	* CEs [47] --> Loop 34 
3.12/3.14	* CEs [48] --> Loop 35 
3.12/3.14	* CEs [44] --> Loop 36 
3.12/3.14	* CEs [43] --> Loop 37 
3.12/3.14	* CEs [45] --> Loop 38 
3.12/3.14	* CEs [46] --> Loop 39 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f8(A,B,C,D,E,F,G,M,N,O,P,Q,R) 
3.12/3.14	* RF of phase [34,35]: [A-E+1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f8(A,B,C,D,E,F,G,M,N,O,P,Q,R) 
3.12/3.14	* Partial RF of phase [34,35]:
3.12/3.14	  - RF of loop [34:1,35:1]:
3.12/3.14	    A-E+1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f19/6 
3.12/3.14	* CE 26 is refined into CE [49] 
3.12/3.14	* CE 27 is refined into CE [50] 
3.12/3.14	* CE 25 is refined into CE [51] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f19/6 
3.12/3.14	* CEs [51] --> Loop 40 
3.12/3.14	* CEs [49] --> Loop 41 
3.12/3.14	* CEs [50] --> Loop 42 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f19(A,E,H,M,N,O) 
3.12/3.14	* RF of phase [40]: [A-E+1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f19(A,E,H,M,N,O) 
3.12/3.14	* Partial RF of phase [40]:
3.12/3.14	  - RF of loop [40:1]:
3.12/3.14	    A-E+1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f27/6 
3.12/3.14	* CE 29 is refined into CE [52] 
3.12/3.14	* CE 30 is refined into CE [53] 
3.12/3.14	* CE 28 is refined into CE [54] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f27/6 
3.12/3.14	* CEs [54] --> Loop 43 
3.12/3.14	* CEs [52] --> Loop 44 
3.12/3.14	* CEs [53] --> Loop 45 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f27(A,E,H,M,N,O) 
3.12/3.14	* RF of phase [43]: [A-E+1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f27(A,E,H,M,N,O) 
3.12/3.14	* Partial RF of phase [43]:
3.12/3.14	  - RF of loop [43:1]:
3.12/3.14	    A-E+1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f43/4 
3.12/3.14	* CE 38 is refined into CE [55] 
3.12/3.14	* CE 39 is refined into CE [56] 
3.12/3.14	* CE 37 is refined into CE [57] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f43/4 
3.12/3.14	* CEs [57] --> Loop 46 
3.12/3.14	* CEs [55] --> Loop 47 
3.12/3.14	* CEs [56] --> Loop 48 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f43(A,E,M,N) 
3.12/3.14	* RF of phase [46]: [A-E+1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f43(A,E,M,N) 
3.12/3.14	* Partial RF of phase [46]:
3.12/3.14	  - RF of loop [46:1]:
3.12/3.14	    A-E+1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f49/6 
3.12/3.14	* CE 42 is refined into CE [58] 
3.12/3.14	* CE 41 is refined into CE [59] 
3.12/3.14	* CE 40 is refined into CE [60] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f49/6 
3.12/3.14	* CEs [60] --> Loop 49 
3.12/3.14	* CEs [58] --> Loop 50 
3.12/3.14	* CEs [59] --> Loop 51 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f49(A,D,E,M,N,O) 
3.12/3.14	* RF of phase [49]: [A-E+1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f49(A,D,E,M,N,O) 
3.12/3.14	* Partial RF of phase [49]:
3.12/3.14	  - RF of loop [49:1]:
3.12/3.14	    A-E+1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f36/11 
3.12/3.14	* CE 35 is refined into CE [61] 
3.12/3.14	* CE 31 is refined into CE [62,63] 
3.12/3.14	* CE 33 is refined into CE [64,65] 
3.12/3.14	* CE 36 is refined into CE [66] 
3.12/3.14	* CE 32 is refined into CE [67,68] 
3.12/3.14	* CE 34 is refined into CE [69] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f36/11 
3.12/3.14	* CEs [68] --> Loop 52 
3.12/3.14	* CEs [67] --> Loop 53 
3.12/3.14	* CEs [69] --> Loop 54 
3.12/3.14	* CEs [61] --> Loop 55 
3.12/3.14	* CEs [63,64] --> Loop 56 
3.12/3.14	* CEs [62] --> Loop 57 
3.12/3.14	* CEs [66] --> Loop 58 
3.12/3.14	* CEs [65] --> Loop 59 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f36(A,B,C,D,E,H,M,N,O,P,Q) 
3.12/3.14	* RF of phase [52,53,54]: [A-D+1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f36(A,B,C,D,E,H,M,N,O,P,Q) 
3.12/3.14	* Partial RF of phase [52,53,54]:
3.12/3.14	  - RF of loop [52:1]:
3.12/3.14	    -D+E depends on loops [53:1] 
3.12/3.14	  - RF of loop [52:1,53:1,54:1]:
3.12/3.14	    A-D+1
3.12/3.14	  - RF of loop [53:1]:
3.12/3.14	    A-E+1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f2/16 
3.12/3.14	* CE 2 is refined into CE [70] 
3.12/3.14	* CE 10 is refined into CE [71,72,73,74,75,76,77,78] 
3.12/3.14	* CE 11 is refined into CE [79,80,81,82] 
3.12/3.14	* CE 12 is refined into CE [83,84,85,86,87,88,89,90] 
3.12/3.14	* CE 13 is refined into CE [91,92,93,94] 
3.12/3.14	* CE 14 is refined into CE [95,96] 
3.12/3.14	* CE 15 is refined into CE [97,98] 
3.12/3.14	* CE 16 is refined into CE [99,100] 
3.12/3.14	* CE 3 is refined into CE [101] 
3.12/3.14	* CE 8 is refined into CE [102,103] 
3.12/3.14	* CE 9 is refined into CE [104] 
3.12/3.14	* CE 6 is refined into CE [105,106] 
3.12/3.14	* CE 7 is refined into CE [107] 
3.12/3.14	* CE 4 is refined into CE [108,109] 
3.12/3.14	* CE 5 is refined into CE [110,111] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f2/16 
3.12/3.14	* CEs [102,104] --> Loop 60 
3.12/3.14	* CEs [103] --> Loop 61 
3.12/3.14	* CEs [105,107] --> Loop 62 
3.12/3.14	* CEs [106] --> Loop 63 
3.12/3.14	* CEs [109] --> Loop 64 
3.12/3.14	* CEs [108] --> Loop 65 
3.12/3.14	* CEs [110] --> Loop 66 
3.12/3.14	* CEs [111] --> Loop 67 
3.12/3.14	* CEs [70] --> Loop 68 
3.12/3.14	* CEs [78,90] --> Loop 69 
3.12/3.14	* CEs [71,72,73,74,75,76,77,79,80,81,82,83,84,85,86,87,88,89,91,92,93,94,95,96,97,98,100] --> Loop 70 
3.12/3.14	* CEs [99] --> Loop 71 
3.12/3.14	* CEs [101] --> Loop 72 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f2(A,B,C,D,E,F,G,H,M,N,O,P,Q,R,S,T) 
3.12/3.14	* RF of phase [66]: [A-B,-B+E-1]
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f2(A,B,C,D,E,F,G,H,M,N,O,P,Q,R,S,T) 
3.12/3.14	* Partial RF of phase [66]:
3.12/3.14	  - RF of loop [66:1]:
3.12/3.14	    A-B
3.12/3.14	    -B+E-1
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations f2_loop_cont/10 
3.12/3.14	* CE 17 is refined into CE [112] 
3.12/3.14	* CE 18 is refined into CE [113] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of f2_loop_cont/10 
3.12/3.14	* CEs [112] --> Loop 73 
3.12/3.14	* CEs [113] --> Loop 74 
3.12/3.14	
3.12/3.14	### Ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J) 
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J) 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Specialization of cost equations start/9 
3.12/3.14	* CE 1 is refined into CE [114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133] 
3.12/3.14	
3.12/3.14	
3.12/3.14	### Cost equations --> "Loop" of start/9 
3.12/3.14	* CEs [120] --> Loop 75 
3.12/3.14	* CEs [119,124,125,127,128] --> Loop 76 
3.12/3.14	* CEs [118] --> Loop 77 
3.12/3.14	* CEs [117] --> Loop 78 
3.12/3.14	* CEs [116] --> Loop 79 
3.12/3.14	* CEs [115,126] --> Loop 80 
3.12/3.14	* CEs [133] --> Loop 81 
3.12/3.14	* CEs [121,122,123,129,130,131,132] --> Loop 82 
3.12/3.14	* CEs [114] --> Loop 83 
3.12/3.14	
3.12/3.14	### Ranking functions of CR start(A,B,C,D,E,F,G,H,M) 
3.12/3.14	
3.12/3.14	#### Partial ranking functions of CR start(A,B,C,D,E,F,G,H,M) 
3.12/3.14	
3.12/3.14	
3.12/3.14	Computing Bounds
3.12/3.14	=====================================
3.12/3.14	
3.12/3.14	#### Cost of chains of f8(A,B,C,D,E,F,G,M,N,O,P,Q,R):
3.12/3.14	* Chain [[34,35],39]: 2*it(34)+0
3.12/3.14	  Such that:aux(3) =< A-E+1
3.12/3.14	it(34) =< aux(3)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [[34,35],38]: 2*it(34)+0
3.12/3.14	  Such that:aux(4) =< A-E+1
3.12/3.14	it(34) =< aux(4)
3.12/3.14	
3.12/3.14	  with precondition: [M=5,B=O,A+1=P,A>=B+1,A>=D,A>=E,R>=Q] 
3.12/3.14	
3.12/3.14	* Chain [[34,35],37]: 2*it(34)+0
3.12/3.14	  Such that:aux(5) =< A-E+1
3.12/3.14	it(34) =< aux(5)
3.12/3.14	
3.12/3.14	  with precondition: [M=8,A+1=P,A>=B+1,A>=D,A>=E,B>=O+1,R>=Q] 
3.12/3.14	
3.12/3.14	* Chain [[34,35],36]: 2*it(34)+0
3.12/3.14	  Such that:aux(6) =< A-E+1
3.12/3.14	it(34) =< aux(6)
3.12/3.14	
3.12/3.14	  with precondition: [M=8,A+1=P,O>=B+1,A>=D,A>=E,A>=O] 
3.12/3.14	
3.12/3.14	* Chain [39]: 0
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D] 
3.12/3.14	
3.12/3.14	* Chain [38]: 0
3.12/3.14	  with precondition: [M=5,N=C,B=D,Q=F,R=G,B=O,E=P,E>=A+1,A>=B+1] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f19(A,E,H,M,N,O):
3.12/3.14	* Chain [[40],42]: 1*it(40)+0
3.12/3.14	  Such that:it(40) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [[40],41]: 1*it(40)+0
3.12/3.14	  Such that:it(40) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=6,A+1=N,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [42]: 0
3.12/3.14	  with precondition: [M=3] 
3.12/3.14	
3.12/3.14	* Chain [41]: 0
3.12/3.14	  with precondition: [M=6,O=H,E=N,E>=A+1] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f27(A,E,H,M,N,O):
3.12/3.14	* Chain [[43],45]: 1*it(43)+0
3.12/3.14	  Such that:it(43) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [[43],44]: 1*it(43)+0
3.12/3.14	  Such that:it(43) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=5,A+1=N,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [45]: 0
3.12/3.14	  with precondition: [M=3] 
3.12/3.14	
3.12/3.14	* Chain [44]: 0
3.12/3.14	  with precondition: [M=5,O=H,E=N,E>=A+1] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f43(A,E,M,N):
3.12/3.14	* Chain [[46],48]: 1*it(46)+0
3.12/3.14	  Such that:it(46) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [[46],47]: 1*it(46)+0
3.12/3.14	  Such that:it(46) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=4,A+1=N,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [48]: 0
3.12/3.14	  with precondition: [M=3] 
3.12/3.14	
3.12/3.14	* Chain [47]: 0
3.12/3.14	  with precondition: [M=4,E=N,E>=A+1] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f49(A,D,E,M,N,O):
3.12/3.14	* Chain [[49],51]: 1*it(49)+0
3.12/3.14	  Such that:it(49) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=2,D+1=N,A+1=O,A>=D,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [[49],50]: 1*it(49)+0
3.12/3.14	  Such that:it(49) =< A-E+1
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=D,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [51]: 0
3.12/3.14	  with precondition: [M=2,D+1=N,E=O,E>=A+1,A>=D] 
3.12/3.14	
3.12/3.14	* Chain [50]: 0
3.12/3.14	  with precondition: [M=3,A>=D] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f36(A,B,C,D,E,H,M,N,O,P,Q):
3.12/3.14	* Chain [[52,53,54],59]: 1*it(52)+1*it(53)+1*it(54)+1*s(3)+0
3.12/3.14	  Such that:aux(10) =< A-D+1
3.12/3.14	aux(12) =< A-E+1
3.12/3.14	aux(8) =< -D+E
3.12/3.14	aux(14) =< A-D
3.12/3.14	it(52) =< aux(10)
3.12/3.14	it(53) =< aux(10)
3.12/3.14	it(54) =< aux(10)
3.12/3.14	it(52) =< aux(14)
3.12/3.14	it(53) =< aux(14)
3.12/3.14	it(54) =< aux(14)
3.12/3.14	it(53) =< aux(12)
3.12/3.14	s(3) =< aux(12)
3.12/3.14	aux(7) =< it(53)*aux(14)
3.12/3.14	it(52) =< aux(7)+aux(8)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D+1] 
3.12/3.14	
3.12/3.14	* Chain [[52,53,54],58]: 1*it(52)+1*it(53)+1*it(54)+1*s(3)+0
3.12/3.14	  Such that:aux(9) =< A-D
3.12/3.14	aux(12) =< A-E+1
3.12/3.14	aux(8) =< -D+E
3.12/3.14	aux(15) =< A-D+1
3.12/3.14	it(52) =< aux(15)
3.12/3.14	it(53) =< aux(15)
3.12/3.14	it(54) =< aux(15)
3.12/3.14	it(53) =< aux(12)
3.12/3.14	s(3) =< aux(12)
3.12/3.14	aux(7) =< it(53)*aux(9)
3.12/3.14	it(52) =< aux(7)+aux(8)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D] 
3.12/3.14	
3.12/3.14	* Chain [[52,53,54],57]: 1*it(52)+1*it(53)+1*it(54)+1*s(3)+0
3.12/3.14	  Such that:aux(10) =< A-D+1
3.12/3.14	aux(12) =< A-E+1
3.12/3.14	aux(8) =< -D+E
3.12/3.14	aux(16) =< A-D
3.12/3.14	it(52) =< aux(10)
3.12/3.14	it(53) =< aux(10)
3.12/3.14	it(54) =< aux(10)
3.12/3.14	it(52) =< aux(16)
3.12/3.14	it(53) =< aux(16)
3.12/3.14	it(54) =< aux(16)
3.12/3.14	it(53) =< aux(12)
3.12/3.14	s(3) =< aux(12)
3.12/3.14	aux(7) =< it(53)*aux(16)
3.12/3.14	it(52) =< aux(7)+aux(8)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D+1] 
3.12/3.14	
3.12/3.14	* Chain [[52,53,54],56]: 1*it(52)+1*it(53)+1*it(54)+1*s(3)+2*s(4)+0
3.12/3.14	  Such that:aux(10) =< A-D+1
3.12/3.14	aux(13) =< A-E
3.12/3.14	aux(8) =< -D+E
3.12/3.14	aux(18) =< A-D
3.12/3.14	aux(19) =< A-E+1
3.12/3.14	aux(13) =< aux(19)
3.12/3.14	s(4) =< aux(19)
3.12/3.14	it(52) =< aux(10)
3.12/3.14	it(53) =< aux(10)
3.12/3.14	it(54) =< aux(10)
3.12/3.14	it(52) =< aux(18)
3.12/3.14	it(53) =< aux(18)
3.12/3.14	it(54) =< aux(18)
3.12/3.14	it(53) =< aux(19)
3.12/3.14	s(3) =< aux(19)
3.12/3.14	it(53) =< aux(13)
3.12/3.14	s(3) =< aux(13)
3.12/3.14	aux(7) =< it(53)*aux(18)
3.12/3.14	it(52) =< aux(7)+aux(8)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [[52,53,54],55]: 1*it(52)+1*it(53)+1*it(54)+1*s(3)+0
3.12/3.14	  Such that:aux(9) =< A-D
3.12/3.14	aux(12) =< A-E+1
3.12/3.14	aux(8) =< -D+E
3.12/3.14	aux(13) =< -E+P
3.12/3.14	aux(20) =< A-D+1
3.12/3.14	it(52) =< aux(20)
3.12/3.14	it(53) =< aux(20)
3.12/3.14	it(54) =< aux(20)
3.12/3.14	it(53) =< aux(12)
3.12/3.14	s(3) =< aux(12)
3.12/3.14	it(53) =< aux(13)
3.12/3.14	s(3) =< aux(13)
3.12/3.14	aux(7) =< it(53)*aux(9)
3.12/3.14	it(52) =< aux(7)+aux(8)
3.12/3.14	
3.12/3.14	  with precondition: [M=7,B+1=N,A+1=O,A>=B+1,A>=D,P>=E] 
3.12/3.14	
3.12/3.14	* Chain [59]: 0
3.12/3.14	  with precondition: [M=3,E>=A+1,A>=B+1,A>=D] 
3.12/3.14	
3.12/3.14	* Chain [58]: 0
3.12/3.14	  with precondition: [M=3,A>=B+1] 
3.12/3.14	
3.12/3.14	* Chain [57]: 0
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D] 
3.12/3.14	
3.12/3.14	* Chain [56]: 2*s(4)+0
3.12/3.14	  Such that:aux(17) =< A-E+1
3.12/3.14	s(4) =< aux(17)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=D,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [55]: 0
3.12/3.14	  with precondition: [M=7,P=E,Q=H,B+1=N,D=O,D>=A+1,A>=B+1] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f2(A,B,C,D,E,F,G,H,M,N,O,P,Q,R,S,T):
3.12/3.14	* Chain [[66],72]: 1*it(66)+0
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	
3.12/3.14	  with precondition: [M=3,E>=A+1,A>=B+1] 
3.12/3.14	
3.12/3.14	* Chain [[66],71]: 1*it(66)+0
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	
3.12/3.14	  with precondition: [M=3,E>=A+1,A>=B+2] 
3.12/3.14	
3.12/3.14	* Chain [[66],68]: 1*it(66)+0
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,E=Q,F=R,G=S,H=T,E>=A+1,A>=B+1] 
3.12/3.14	
3.12/3.14	* Chain [72]: 0
3.12/3.14	  with precondition: [M=3] 
3.12/3.14	
3.12/3.14	* Chain [71]: 0
3.12/3.14	  with precondition: [M=3,A>=B+1] 
3.12/3.14	
3.12/3.14	* Chain [70]: 54*s(34)+12*s(43)+4*s(69)+4*s(84)+8*s(95)+0
3.12/3.14	  Such that:aux(31) =< A-B
3.12/3.14	aux(32) =< A-B+1
3.12/3.14	aux(33) =< A-E+1
3.12/3.14	s(95) =< aux(32)
3.12/3.14	s(95) =< aux(31)
3.12/3.14	s(34) =< aux(33)
3.12/3.14	s(69) =< aux(31)
3.12/3.14	s(84) =< aux(32)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [69]: 4*s(178)+8*s(183)+0
3.12/3.14	  Such that:aux(36) =< A-B
3.12/3.14	aux(37) =< A-E+1
3.12/3.14	s(183) =< aux(36)
3.12/3.14	s(178) =< aux(37)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [68]: 0
3.12/3.14	  with precondition: [M=9,O=C,P=D,Q=E,R=F,S=G,T=H,B=N,B>=A] 
3.12/3.14	
3.12/3.14	* Chain [67,[66],72]: 1*it(66)+2*s(200)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(199) =< A-E+1
3.12/3.14	s(200) =< s(199)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [67,[66],71]: 1*it(66)+2*s(200)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(199) =< A-E+1
3.12/3.14	s(200) =< s(199)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [67,[66],68]: 1*it(66)+2*s(200)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(199) =< A-E+1
3.12/3.14	s(200) =< s(199)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,A+1=Q,H=T,A>=B+2,A>=E,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [67,72]: 2*s(200)+1
3.12/3.14	  Such that:s(199) =< A-E+1
3.12/3.14	s(200) =< s(199)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [67,71]: 2*s(200)+1
3.12/3.14	  Such that:s(199) =< A-E+1
3.12/3.14	s(200) =< s(199)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [67,68]: 2*s(200)+1
3.12/3.14	  Such that:s(199) =< A-E+1
3.12/3.14	s(200) =< s(199)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,B+1=A,B+1=N,B=P,B+2=Q,H=T,B+1>=E,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [65,[66],72]: 1*it(66)+2*s(202)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(201) =< A-E+1
3.12/3.14	s(202) =< s(201)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [65,[66],71]: 1*it(66)+2*s(202)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(201) =< A-E+1
3.12/3.14	s(202) =< s(201)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [65,[66],68]: 1*it(66)+2*s(202)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(201) =< A-E+1
3.12/3.14	s(202) =< s(201)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,A+1=Q,H=T,A>=B+2,A>=E,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [65,72]: 2*s(202)+1
3.12/3.14	  Such that:s(201) =< A-E+1
3.12/3.14	s(202) =< s(201)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [65,71]: 2*s(202)+1
3.12/3.14	  Such that:s(201) =< A-E+1
3.12/3.14	s(202) =< s(201)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [65,68]: 2*s(202)+1
3.12/3.14	  Such that:s(201) =< A-E+1
3.12/3.14	s(202) =< s(201)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,B+1=A,B+1=N,B+2=Q,H=T,B+1>=E,B>=P+1,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [64,[66],72]: 1*it(66)+2*s(204)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(203) =< A-E+1
3.12/3.14	s(204) =< s(203)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [64,[66],71]: 1*it(66)+2*s(204)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(203) =< A-E+1
3.12/3.14	s(204) =< s(203)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [64,[66],68]: 1*it(66)+2*s(204)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	s(203) =< A-E+1
3.12/3.14	s(204) =< s(203)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,A+1=Q,H=T,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [64,72]: 2*s(204)+1
3.12/3.14	  Such that:s(203) =< A-E+1
3.12/3.14	s(204) =< s(203)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [64,71]: 2*s(204)+1
3.12/3.14	  Such that:s(203) =< A-E+1
3.12/3.14	s(204) =< s(203)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [64,68]: 2*s(204)+1
3.12/3.14	  Such that:s(203) =< A-E+1
3.12/3.14	s(204) =< s(203)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=B+1,A=N,A=P,A+1=Q,H=T,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [63,[66],72]: 3*it(66)+2*s(206)+1
3.12/3.14	  Such that:s(205) =< A-E+1
3.12/3.14	aux(39) =< A-B
3.12/3.14	it(66) =< aux(39)
3.12/3.14	s(206) =< s(205)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [63,[66],71]: 3*it(66)+2*s(206)+1
3.12/3.14	  Such that:s(205) =< A-E+1
3.12/3.14	aux(40) =< A-B
3.12/3.14	it(66) =< aux(40)
3.12/3.14	s(206) =< s(205)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [63,[66],68]: 3*it(66)+2*s(206)+1
3.12/3.14	  Such that:s(205) =< A-E+1
3.12/3.14	aux(41) =< A-B
3.12/3.14	it(66) =< aux(41)
3.12/3.14	s(206) =< s(205)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,Q>=A+1,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [63,72]: 2*s(206)+2*s(212)+1
3.12/3.14	  Such that:aux(38) =< A-B
3.12/3.14	s(205) =< A-E+1
3.12/3.14	s(212) =< aux(38)
3.12/3.14	s(206) =< s(205)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [63,71]: 2*s(206)+2*s(212)+1
3.12/3.14	  Such that:aux(38) =< A-B
3.12/3.14	s(205) =< A-E+1
3.12/3.14	s(212) =< aux(38)
3.12/3.14	s(206) =< s(205)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [63,68]: 2*s(206)+2*s(212)+1
3.12/3.14	  Such that:aux(38) =< 1
3.12/3.14	s(205) =< A-E+1
3.12/3.14	s(212) =< aux(38)
3.12/3.14	s(206) =< s(205)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,A=B+1,A=N,A+1=P,0>=O+1,Q>=A+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [62,[66],72]: 1*it(66)+4*s(218)+2*s(224)+2*s(236)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	aux(42) =< A-B+1
3.12/3.14	aux(43) =< A-E+1
3.12/3.14	s(218) =< aux(43)
3.12/3.14	s(236) =< aux(42)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [62,[66],71]: 1*it(66)+4*s(218)+2*s(224)+2*s(236)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	aux(42) =< A-B+1
3.12/3.14	aux(43) =< A-E+1
3.12/3.14	s(218) =< aux(43)
3.12/3.14	s(236) =< aux(42)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [62,[66],68]: 1*it(66)+4*s(218)+2*s(224)+2*s(236)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	aux(42) =< A-B+1
3.12/3.14	aux(43) =< A-E+1
3.12/3.14	s(218) =< aux(43)
3.12/3.14	s(236) =< aux(42)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,Q>=A+1,A>=B+2,A>=E,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [62,72]: 4*s(218)+2*s(224)+2*s(236)+1
3.12/3.14	  Such that:aux(42) =< A-B+1
3.12/3.14	aux(43) =< A-E+1
3.12/3.14	s(218) =< aux(43)
3.12/3.14	s(236) =< aux(42)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [62,71]: 4*s(218)+2*s(224)+2*s(236)+1
3.12/3.14	  Such that:aux(42) =< A-B+1
3.12/3.14	aux(43) =< A-E+1
3.12/3.14	s(218) =< aux(43)
3.12/3.14	s(236) =< aux(42)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [62,68]: 4*s(218)+2*s(224)+2*s(236)+1
3.12/3.14	  Such that:aux(42) =< 2
3.12/3.14	aux(43) =< A-E+1
3.12/3.14	s(218) =< aux(43)
3.12/3.14	s(236) =< aux(42)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,A=B+1,A=N,A+1=P,0>=O+1,Q>=A+1,A>=E,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [61,[66],72]: 3*it(66)+2*s(242)+1
3.12/3.14	  Such that:s(241) =< A-E+1
3.12/3.14	aux(45) =< A-B
3.12/3.14	it(66) =< aux(45)
3.12/3.14	s(242) =< s(241)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [61,[66],71]: 3*it(66)+2*s(242)+1
3.12/3.14	  Such that:s(241) =< A-E+1
3.12/3.14	aux(46) =< A-B
3.12/3.14	it(66) =< aux(46)
3.12/3.14	s(242) =< s(241)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [61,[66],68]: 3*it(66)+2*s(242)+1
3.12/3.14	  Such that:s(241) =< A-E+1
3.12/3.14	aux(47) =< A-B
3.12/3.14	it(66) =< aux(47)
3.12/3.14	s(242) =< s(241)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,Q>=A+1,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [61,72]: 2*s(242)+2*s(248)+1
3.12/3.14	  Such that:aux(44) =< A-B
3.12/3.14	s(241) =< A-E+1
3.12/3.14	s(248) =< aux(44)
3.12/3.14	s(242) =< s(241)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [61,71]: 2*s(242)+2*s(248)+1
3.12/3.14	  Such that:aux(44) =< A-B
3.12/3.14	s(241) =< A-E+1
3.12/3.14	s(248) =< aux(44)
3.12/3.14	s(242) =< s(241)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [61,68]: 2*s(242)+2*s(248)+1
3.12/3.14	  Such that:aux(44) =< 1
3.12/3.14	s(241) =< A-E+1
3.12/3.14	s(248) =< aux(44)
3.12/3.14	s(242) =< s(241)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,A=B+1,A=N,A+1=P,O>=1,Q>=A+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [60,[66],72]: 1*it(66)+4*s(254)+2*s(260)+2*s(272)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	aux(48) =< A-B+1
3.12/3.14	aux(49) =< A-E+1
3.12/3.14	s(254) =< aux(49)
3.12/3.14	s(272) =< aux(48)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [60,[66],71]: 1*it(66)+4*s(254)+2*s(260)+2*s(272)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	aux(48) =< A-B+1
3.12/3.14	aux(49) =< A-E+1
3.12/3.14	s(254) =< aux(49)
3.12/3.14	s(272) =< aux(48)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [60,[66],68]: 1*it(66)+4*s(254)+2*s(260)+2*s(272)+1
3.12/3.14	  Such that:it(66) =< A-B
3.12/3.14	aux(48) =< A-B+1
3.12/3.14	aux(49) =< A-E+1
3.12/3.14	s(254) =< aux(49)
3.12/3.14	s(272) =< aux(48)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,O=0,A=N,A=P+1,Q>=A+1,A>=B+2,A>=E,S>=R] 
3.12/3.14	
3.12/3.14	* Chain [60,72]: 4*s(254)+2*s(260)+2*s(272)+1
3.12/3.14	  Such that:aux(48) =< A-B+1
3.12/3.14	aux(49) =< A-E+1
3.12/3.14	s(254) =< aux(49)
3.12/3.14	s(272) =< aux(48)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [60,71]: 4*s(254)+2*s(260)+2*s(272)+1
3.12/3.14	  Such that:aux(48) =< A-B+1
3.12/3.14	aux(49) =< A-E+1
3.12/3.14	s(254) =< aux(49)
3.12/3.14	s(272) =< aux(48)
3.12/3.14	
3.12/3.14	  with precondition: [M=3,A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [60,68]: 4*s(254)+2*s(260)+2*s(272)+1
3.12/3.14	  Such that:aux(48) =< 2
3.12/3.14	aux(49) =< A-E+1
3.12/3.14	s(254) =< aux(49)
3.12/3.14	s(272) =< aux(48)
3.12/3.14	
3.12/3.14	  with precondition: [M=9,A=B+1,A=N,A+1=P,O>=1,Q>=A+1,A>=E,S>=R] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of f2_loop_cont(A,B,C,D,E,F,G,H,I,J):
3.12/3.14	* Chain [74]: 0
3.12/3.14	  with precondition: [A=3] 
3.12/3.14	
3.12/3.14	* Chain [73]: 0
3.12/3.14	  with precondition: [A=9] 
3.12/3.14	
3.12/3.14	
3.12/3.14	#### Cost of chains of start(A,B,C,D,E,F,G,H,M):
3.12/3.14	* Chain [83]: 0
3.12/3.14	  with precondition: [] 
3.12/3.14	
3.12/3.14	* Chain [82]: 18*s(422)+4*s(429)+4*s(434)+4*s(435)+1
3.12/3.14	  Such that:aux(66) =< 1
3.12/3.14	aux(67) =< 2
3.12/3.14	aux(68) =< A-E+1
3.12/3.14	s(429) =< aux(66)
3.12/3.14	s(422) =< aux(68)
3.12/3.14	s(434) =< aux(67)
3.12/3.14	
3.12/3.14	  with precondition: [A=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [81]: 0
3.12/3.14	  with precondition: [B>=A] 
3.12/3.14	
3.12/3.14	* Chain [80]: 2*s(445)+0
3.12/3.14	  Such that:aux(69) =< A-B
3.12/3.14	s(445) =< aux(69)
3.12/3.14	
3.12/3.14	  with precondition: [E>=A+1,A>=B+1] 
3.12/3.14	
3.12/3.14	* Chain [79]: 1*s(447)+0
3.12/3.14	  Such that:s(447) =< A-B
3.12/3.14	
3.12/3.14	  with precondition: [E>=A+1,A>=B+2] 
3.12/3.14	
3.12/3.14	* Chain [78]: 0
3.12/3.14	  with precondition: [A>=B+1] 
3.12/3.14	
3.12/3.14	* Chain [77]: 8*s(451)+72*s(452)+8*s(453)+8*s(454)+16*s(455)+1
3.12/3.14	  Such that:s(448) =< A-B
3.12/3.14	s(449) =< A-B+1
3.12/3.14	s(450) =< A-E+1
3.12/3.14	s(451) =< s(448)
3.12/3.14	s(452) =< s(450)
3.12/3.14	s(453) =< s(449)
3.12/3.14	s(453) =< s(448)
3.12/3.14	s(454) =< s(449)
3.12/3.14	
3.12/3.14	  with precondition: [A>=B+1,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [76]: 34*s(459)+58*s(460)+12*s(461)+12*s(462)+1
3.12/3.14	  Such that:aux(70) =< A-B
3.12/3.14	aux(71) =< A-B+1
3.12/3.14	aux(72) =< A-E+1
3.12/3.14	s(459) =< aux(70)
3.12/3.14	s(460) =< aux(72)
3.12/3.14	s(461) =< aux(71)
3.12/3.14	
3.12/3.14	  with precondition: [A>=B+2,A>=E] 
3.12/3.14	
3.12/3.14	* Chain [75]: 11*s(484)+18*s(485)+4*s(486)+4*s(487)+1
3.12/3.14	  Such that:s(481) =< A-B
3.12/3.14	s(482) =< A-B+1
3.12/3.14	s(483) =< A-E+1
3.12/3.14	s(484) =< s(481)
3.12/3.14	s(485) =< s(483)
3.12/3.14	s(486) =< s(482)
3.12/3.14	
3.12/3.14	  with precondition: [A>=B+3,A>=E] 
3.12/3.14	
3.12/3.14	
3.12/3.14	Closed-form bounds of start(A,B,C,D,E,F,G,H,M): 
3.12/3.14	-------------------------------------
3.12/3.14	* Chain [83] with precondition: [] 
3.12/3.14	    - Upper bound: 0 
3.12/3.14	    - Complexity: constant 
3.12/3.14	* Chain [82] with precondition: [A=B+1,A>=E] 
3.12/3.14	    - Upper bound: inf 
3.12/3.14	    - Complexity: infinity 
3.12/3.14	* Chain [81] with precondition: [B>=A] 
3.12/3.14	    - Upper bound: 0 
3.12/3.14	    - Complexity: constant 
3.12/3.14	* Chain [80] with precondition: [E>=A+1,A>=B+1] 
3.12/3.14	    - Upper bound: 2*A-2*B 
3.12/3.14	    - Complexity: n 
3.12/3.14	* Chain [79] with precondition: [E>=A+1,A>=B+2] 
3.12/3.14	    - Upper bound: A-B 
3.12/3.14	    - Complexity: n 
3.12/3.14	* Chain [78] with precondition: [A>=B+1] 
3.12/3.14	    - Upper bound: 0 
3.12/3.14	    - Complexity: constant 
3.12/3.14	* Chain [77] with precondition: [A>=B+1,A>=E] 
3.12/3.14	    - Upper bound: inf 
3.12/3.14	    - Complexity: infinity 
3.12/3.14	* Chain [76] with precondition: [A>=B+2,A>=E] 
3.12/3.14	    - Upper bound: inf 
3.12/3.14	    - Complexity: infinity 
3.12/3.14	* Chain [75] with precondition: [A>=B+3,A>=E] 
3.12/3.14	    - Upper bound: inf 
3.12/3.14	    - Complexity: infinity 
3.12/3.14	
3.12/3.14	### Maximum cost of start(A,B,C,D,E,F,G,H,M): inf 
3.12/3.14	Asymptotic class: infinity 
3.12/3.14	* Total analysis performed in 2941 ms.
3.12/3.14	
3.14/3.24	EOF