YES(?, 36*b + 16)

Initial complexity problem:
1:	T:
		(1, 1)    evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
		(?, 1)    evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(?, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(?, 1)    evalfbb5in(a, b, c, d) -> evalfreturnin(a, b, c, d) [ 1 >= b ]
		(?, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)
		(?, 1)    evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
		(?, 1)    evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
		(?, 1)    evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
		(?, 1)    evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
		(?, 1)    evalfreturnin(a, b, c, d) -> evalfstop(a, b, c, d)
	start location:	evalfstart
	leaf cost:	0

Repeatedly removing leaves of the complexity graph in problem 1 produces the following problem:
2:	T:
		(1, 1)    evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
		(?, 1)    evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(?, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(?, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)
		(?, 1)    evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
		(?, 1)    evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
		(?, 1)    evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
		(?, 1)    evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	start location:	evalfstart
	leaf cost:	2

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(1, 1)    evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
		(1, 1)    evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(?, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(?, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)
		(?, 1)    evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
		(?, 1)    evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
		(?, 1)    evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
		(?, 1)    evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
		(?, 1)    evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	start location:	evalfstart
	leaf cost:	2

A polynomial rank function with
	Pol(evalfstart) = 2*V_2 - 1
	Pol(evalfentryin) = 2*V_2 - 1
	Pol(evalfbb5in) = 2*V_2 - 1
	Pol(evalfbbin) = 2*V_2 - 2
	Pol(evalfbb2in) = 2*V_3 - 1
	Pol(evalfbb4in) = 2*V_3 - 2
	Pol(evalfbb3in) = 2*V_3 - 1
	Pol(evalfbb1in) = 2*V_3 - 1
orients all transitions weakly and the transition
	evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
strictly and produces the following problem:
4:	T:
		(1, 1)          evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
		(1, 1)          evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(2*b + 1, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(?, 1)          evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)
		(?, 1)          evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
		(?, 1)          evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
		(?, 1)          evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
		(?, 1)          evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	start location:	evalfstart
	leaf cost:	2

Repeatedly propagating knowledge in problem 4 produces the following problem:
5:	T:
		(1, 1)          evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
		(1, 1)          evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(2*b + 1, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(2*b + 1, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)
		(?, 1)          evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
		(?, 1)          evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
		(?, 1)          evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
		(?, 1)          evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	start location:	evalfstart
	leaf cost:	2

A polynomial rank function with
	Pol(evalfbb4in) = 1
	Pol(evalfbb5in) = 0
	Pol(evalfbb3in) = 2
	Pol(evalfbb1in) = 2
	Pol(evalfbb2in) = 2
and size complexities
	S("evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)", 0-0) = ?
	S("evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)", 0-1) = ?
	S("evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)", 0-2) = ?
	S("evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)", 0-3) = ?
	S("evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)", 0-0) = ?
	S("evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)", 0-1) = ?
	S("evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)", 0-2) = ?
	S("evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)", 0-3) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)", 0-0) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)", 0-1) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)", 0-2) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)", 0-3) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]", 0-0) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]", 0-1) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]", 0-2) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]", 0-3) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]", 0-0) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]", 0-1) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]", 0-2) = ?
	S("evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]", 0-3) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]", 0-0) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]", 0-1) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]", 0-2) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]", 0-3) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]", 0-0) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]", 0-1) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]", 0-2) = ?
	S("evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]", 0-3) = ?
	S("evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)", 0-0) = ?
	S("evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)", 0-1) = ?
	S("evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)", 0-2) = ?
	S("evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)", 0-3) = ?
	S("evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]", 0-0) = ?
	S("evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]", 0-1) = ?
	S("evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]", 0-2) = ?
	S("evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]", 0-3) = ?
	S("evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)", 0-0) = b
	S("evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)", 0-1) = b
	S("evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)", 0-2) = c
	S("evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)", 0-3) = d
	S("evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)", 0-0) = a
	S("evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)", 0-1) = b
	S("evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)", 0-2) = c
	S("evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)", 0-3) = d
orients the transitions
	evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
	evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
	evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
	evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
	evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
	evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
weakly and the transitions
	evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
	evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
strictly and produces the following problem:
6:	T:
		(1, 1)          evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
		(1, 1)          evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(2*b + 1, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(2*b + 1, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1)
		(4*b + 2, 1)    evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ c >= d + 1 ]
		(?, 1)          evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ d >= c ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ 0 >= e + 1 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ e >= 1 ]
		(4*b + 2, 1)    evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d)
		(?, 1)          evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1)
		(4*b + 2, 1)    evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d)
	start location:	evalfstart
	leaf cost:	2

Applied AI with 'oct' on problem 6 to obtain the following invariants:
  For symbol evalfbb1in: X_4 - 1 >= 0 /\ X_3 + X_4 - 2 >= 0 /\ -X_3 + X_4 >= 0 /\ X_2 + X_4 - 3 >= 0 /\ -X_2 + X_4 + 1 >= 0 /\ X_2 - X_3 - 1 >= 0 /\ X_3 - 1 >= 0 /\ X_2 + X_3 - 3 >= 0 /\ -X_2 + X_3 + 1 >= 0 /\ X_2 - 2 >= 0
  For symbol evalfbb2in: X_2 - X_3 - 1 >= 0 /\ X_3 - 1 >= 0 /\ X_2 + X_3 - 3 >= 0 /\ -X_2 + X_3 + 1 >= 0 /\ X_2 - 2 >= 0
  For symbol evalfbb3in: X_4 - 1 >= 0 /\ X_3 + X_4 - 2 >= 0 /\ -X_3 + X_4 >= 0 /\ X_2 + X_4 - 3 >= 0 /\ -X_2 + X_4 + 1 >= 0 /\ X_2 - X_3 - 1 >= 0 /\ X_3 - 1 >= 0 /\ X_2 + X_3 - 3 >= 0 /\ -X_2 + X_3 + 1 >= 0 /\ X_2 - 2 >= 0
  For symbol evalfbb4in: X_2 - X_3 - 1 >= 0 /\ X_3 - 1 >= 0 /\ X_2 + X_3 - 3 >= 0 /\ -X_2 + X_3 + 1 >= 0 /\ X_2 - 2 >= 0
  For symbol evalfbbin: X_2 - 2 >= 0


This yielded the following problem:
7:	T:
		(4*b + 2, 1)    evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
		(?, 1)          evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
		(4*b + 2, 1)    evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ e >= 1 ]
		(?, 1)          evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ 0 >= e + 1 ]
		(?, 1)          evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ d >= c ]
		(4*b + 2, 1)    evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ c >= d + 1 ]
		(2*b + 1, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1) [ b - 2 >= 0 ]
		(2*b + 1, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(1, 1)          evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(1, 1)          evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
	start location:	evalfstart
	leaf cost:	2

A polynomial rank function with
	Pol(evalfbb4in) = 2*V_2 - 3*V_3 + 3*V_4 - 2
	Pol(evalfbb5in) = 3*V_1 + 2*V_2 - 1
	Pol(evalfbb1in) = 2*V_2 - 3*V_3 + 3*V_4 - 3
	Pol(evalfbb2in) = 2*V_2 - 3*V_3 + 3*V_4 - 1
	Pol(evalfbb3in) = 2*V_2 - 3*V_3 + 3*V_4 - 2
	Pol(evalfbbin) = 3*V_1 + 2*V_2 - 1
	Pol(evalfentryin) = 5*V_2 - 1
	Pol(evalfstart) = 5*V_2 - 1
orients all transitions weakly and the transitions
	evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ e >= 1 ]
	evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ 0 >= e + 1 ]
	evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ d >= c ]
	evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
strictly and produces the following problem:
8:	T:
		(4*b + 2, 1)    evalfbb4in(a, b, c, d) -> evalfbb5in(d - c + 1, c - 1, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
		(5*b + 1, 1)    evalfbb1in(a, b, c, d) -> evalfbb2in(a, b, c, d - 1) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
		(4*b + 2, 1)    evalfbb3in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 ]
		(5*b + 1, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ e >= 1 ]
		(5*b + 1, 1)    evalfbb3in(a, b, c, d) -> evalfbb1in(a, b, c, d) [ d - 1 >= 0 /\ c + d - 2 >= 0 /\ -c + d >= 0 /\ b + d - 3 >= 0 /\ -b + d + 1 >= 0 /\ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ 0 >= e + 1 ]
		(5*b + 1, 1)    evalfbb2in(a, b, c, d) -> evalfbb3in(a, b, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ d >= c ]
		(4*b + 2, 1)    evalfbb2in(a, b, c, d) -> evalfbb4in(a, b, c, d) [ b - c - 1 >= 0 /\ c - 1 >= 0 /\ b + c - 3 >= 0 /\ -b + c + 1 >= 0 /\ b - 2 >= 0 /\ c >= d + 1 ]
		(2*b + 1, 1)    evalfbbin(a, b, c, d) -> evalfbb2in(a, b, b - 1, a + b - 1) [ b - 2 >= 0 ]
		(2*b + 1, 1)    evalfbb5in(a, b, c, d) -> evalfbbin(a, b, c, d) [ b >= 2 ]
		(1, 1)          evalfentryin(a, b, c, d) -> evalfbb5in(b, b, c, d)
		(1, 1)          evalfstart(a, b, c, d) -> evalfentryin(a, b, c, d)
	start location:	evalfstart
	leaf cost:	2

Complexity upper bound 36*b + 16

Time: 0.953 sec (SMT: 0.896 sec)