YES(?, 216*b + 139)

Initial complexity problem:
1:	T:
		(1, 1)    evalrandom2dstart(a, b, c, d) -> evalrandom2dentryin(a, b, c, d)
		(?, 1)    evalrandom2dentryin(a, b, c, d) -> evalrandom2dbb10in(0, b, c, d)
		(?, 1)    evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
		(?, 1)    evalrandom2dbb10in(a, b, c, d) -> evalrandom2dreturnin(a, b, c, d) [ a >= b ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb2in(a, b, a + 1, e) [ e >= 0 /\ 3 >= e ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ e >= 4 ]
		(?, 1)    evalrandom2dbb2in(a, b, c, d) -> evalrandom2dNodeBlock9in(a, b, c, d)
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlockin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlock7in(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlockin(a, b, c, d) [ 0 >= d ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlock1in(a, b, c, d) [ d >= 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dbb3in(a, b, c, d) [ d = 0 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d + 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 1 ]
		(?, 1)    evalrandom2dbb3in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dbb5in(a, b, c, d) [ d = 1 ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dbb5in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock3in(a, b, c, d) [ 2 >= d ]
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock5in(a, b, c, d) [ d >= 3 ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dbb7in(a, b, c, d) [ d = 2 ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 3 ]
		(?, 1)    evalrandom2dbb7in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dbb9in(a, b, c, d) [ d = 3 ]
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 2 >= d ]
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 4 ]
		(?, 1)    evalrandom2dbb9in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dNewDefaultin(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dreturnin(a, b, c, d) -> evalrandom2dstop(a, b, c, d)
	start location:	evalrandom2dstart
	leaf cost:	0

Repeatedly removing leaves of the complexity graph in problem 1 produces the following problem:
2:	T:
		(1, 1)    evalrandom2dstart(a, b, c, d) -> evalrandom2dentryin(a, b, c, d)
		(?, 1)    evalrandom2dentryin(a, b, c, d) -> evalrandom2dbb10in(0, b, c, d)
		(?, 1)    evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb2in(a, b, a + 1, e) [ e >= 0 /\ 3 >= e ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ e >= 4 ]
		(?, 1)    evalrandom2dbb2in(a, b, c, d) -> evalrandom2dNodeBlock9in(a, b, c, d)
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlockin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlock7in(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlockin(a, b, c, d) [ 0 >= d ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlock1in(a, b, c, d) [ d >= 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dbb3in(a, b, c, d) [ d = 0 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d + 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 1 ]
		(?, 1)    evalrandom2dbb3in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dbb5in(a, b, c, d) [ d = 1 ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dbb5in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock3in(a, b, c, d) [ 2 >= d ]
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock5in(a, b, c, d) [ d >= 3 ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dbb7in(a, b, c, d) [ d = 2 ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 3 ]
		(?, 1)    evalrandom2dbb7in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dbb9in(a, b, c, d) [ d = 3 ]
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 2 >= d ]
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 4 ]
		(?, 1)    evalrandom2dbb9in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dNewDefaultin(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
	start location:	evalrandom2dstart
	leaf cost:	2

Testing for reachability in the complexity graph removes the following transitions from problem 2:
	evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 1 ]
	evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d ]
	evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 3 ]
	evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 2 >= d ]
We thus obtain the following problem:
3:	T:
		(?, 1)    evalrandom2dbb9in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dbb7in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dbb5in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dNewDefaultin(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dbb3in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 4 ]
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dbb9in(a, b, c, d) [ d = 3 ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dbb7in(a, b, c, d) [ d = 2 ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dbb5in(a, b, c, d) [ d = 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d + 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dbb3in(a, b, c, d) [ d = 0 ]
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock5in(a, b, c, d) [ d >= 3 ]
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock3in(a, b, c, d) [ 2 >= d ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlock1in(a, b, c, d) [ d >= 1 ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlockin(a, b, c, d) [ 0 >= d ]
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlock7in(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlockin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dbb2in(a, b, c, d) -> evalrandom2dNodeBlock9in(a, b, c, d)
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ e >= 4 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb2in(a, b, a + 1, e) [ e >= 0 /\ 3 >= e ]
		(?, 1)    evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
		(?, 1)    evalrandom2dentryin(a, b, c, d) -> evalrandom2dbb10in(0, b, c, d)
		(1, 1)    evalrandom2dstart(a, b, c, d) -> evalrandom2dentryin(a, b, c, d)
	start location:	evalrandom2dstart
	leaf cost:	2

Repeatedly propagating knowledge in problem 3 produces the following problem:
4:	T:
		(?, 1)    evalrandom2dbb9in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dbb7in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dbb5in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dNewDefaultin(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dbb3in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 4 ]
		(?, 1)    evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dbb9in(a, b, c, d) [ d = 3 ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dbb7in(a, b, c, d) [ d = 2 ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dbb5in(a, b, c, d) [ d = 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d + 1 ]
		(?, 1)    evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dbb3in(a, b, c, d) [ d = 0 ]
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock5in(a, b, c, d) [ d >= 3 ]
		(?, 1)    evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock3in(a, b, c, d) [ 2 >= d ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlock1in(a, b, c, d) [ d >= 1 ]
		(?, 1)    evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlockin(a, b, c, d) [ 0 >= d ]
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlock7in(a, b, c, d) [ d >= 2 ]
		(?, 1)    evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlockin(a, b, c, d) [ 1 >= d ]
		(?, 1)    evalrandom2dbb2in(a, b, c, d) -> evalrandom2dNodeBlock9in(a, b, c, d)
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ e >= 4 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ 0 >= e + 1 ]
		(?, 1)    evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb2in(a, b, a + 1, e) [ e >= 0 /\ 3 >= e ]
		(?, 1)    evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
		(1, 1)    evalrandom2dentryin(a, b, c, d) -> evalrandom2dbb10in(0, b, c, d)
		(1, 1)    evalrandom2dstart(a, b, c, d) -> evalrandom2dentryin(a, b, c, d)
	start location:	evalrandom2dstart
	leaf cost:	2

A polynomial rank function with
	Pol(evalrandom2dbb9in) = 8*V_2 - 8*V_3 - 4
	Pol(evalrandom2dbb10in) = -8*V_1 + 8*V_2 - 5
	Pol(evalrandom2dbb7in) = 8*V_2 - 8*V_3 - 4
	Pol(evalrandom2dbb5in) = 8*V_2 - 8*V_3 - 4
	Pol(evalrandom2dNewDefaultin) = 8*V_2 - 8*V_3 - 4
	Pol(evalrandom2dbb3in) = 8*V_2 - 8*V_3 - 4
	Pol(evalrandom2dLeafBlock5in) = 8*V_2 - 8*V_3 - 3
	Pol(evalrandom2dLeafBlock3in) = 8*V_2 - 8*V_3 - 3
	Pol(evalrandom2dLeafBlock1in) = 8*V_2 - 8*V_3 - 3
	Pol(evalrandom2dLeafBlockin) = 8*V_2 - 8*V_3 - 3
	Pol(evalrandom2dNodeBlock7in) = 8*V_2 - 8*V_3 - 2
	Pol(evalrandom2dNodeBlockin) = 8*V_2 - 8*V_3 - 2
	Pol(evalrandom2dNodeBlock9in) = 8*V_2 - 8*V_3 - 1
	Pol(evalrandom2dbb2in) = 8*V_2 - 8*V_3
	Pol(evalrandom2dbbin) = -8*V_1 + 8*V_2 - 7
	Pol(evalrandom2dentryin) = 8*V_2 - 5
	Pol(evalrandom2dstart) = 8*V_2 - 5
orients all transitions weakly and the transition
	evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
strictly and produces the following problem:
5:	T:
		(?, 1)          evalrandom2dbb9in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)          evalrandom2dbb7in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)          evalrandom2dbb5in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)          evalrandom2dNewDefaultin(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)          evalrandom2dbb3in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(?, 1)          evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 4 ]
		(?, 1)          evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dbb9in(a, b, c, d) [ d = 3 ]
		(?, 1)          evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 1 >= d ]
		(?, 1)          evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dbb7in(a, b, c, d) [ d = 2 ]
		(?, 1)          evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 2 ]
		(?, 1)          evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dbb5in(a, b, c, d) [ d = 1 ]
		(?, 1)          evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d + 1 ]
		(?, 1)          evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dbb3in(a, b, c, d) [ d = 0 ]
		(?, 1)          evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock5in(a, b, c, d) [ d >= 3 ]
		(?, 1)          evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock3in(a, b, c, d) [ 2 >= d ]
		(?, 1)          evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlock1in(a, b, c, d) [ d >= 1 ]
		(?, 1)          evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlockin(a, b, c, d) [ 0 >= d ]
		(?, 1)          evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlock7in(a, b, c, d) [ d >= 2 ]
		(?, 1)          evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlockin(a, b, c, d) [ 1 >= d ]
		(?, 1)          evalrandom2dbb2in(a, b, c, d) -> evalrandom2dNodeBlock9in(a, b, c, d)
		(?, 1)          evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ e >= 4 ]
		(?, 1)          evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ 0 >= e + 1 ]
		(?, 1)          evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb2in(a, b, a + 1, e) [ e >= 0 /\ 3 >= e ]
		(8*b + 5, 1)    evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
		(1, 1)          evalrandom2dentryin(a, b, c, d) -> evalrandom2dbb10in(0, b, c, d)
		(1, 1)          evalrandom2dstart(a, b, c, d) -> evalrandom2dentryin(a, b, c, d)
	start location:	evalrandom2dstart
	leaf cost:	2

Repeatedly propagating knowledge in problem 5 produces the following problem:
6:	T:
		(8*b + 5, 1)      evalrandom2dbb9in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(8*b + 5, 1)      evalrandom2dbb7in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(8*b + 5, 1)      evalrandom2dbb5in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(32*b + 20, 1)    evalrandom2dNewDefaultin(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(8*b + 5, 1)      evalrandom2dbb3in(a, b, c, d) -> evalrandom2dbb10in(c, b, c, d)
		(8*b + 5, 1)      evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 4 ]
		(8*b + 5, 1)      evalrandom2dLeafBlock5in(a, b, c, d) -> evalrandom2dbb9in(a, b, c, d) [ d = 3 ]
		(8*b + 5, 1)      evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 1 >= d ]
		(8*b + 5, 1)      evalrandom2dLeafBlock3in(a, b, c, d) -> evalrandom2dbb7in(a, b, c, d) [ d = 2 ]
		(8*b + 5, 1)      evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ d >= 2 ]
		(8*b + 5, 1)      evalrandom2dLeafBlock1in(a, b, c, d) -> evalrandom2dbb5in(a, b, c, d) [ d = 1 ]
		(8*b + 5, 1)      evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dNewDefaultin(a, b, c, d) [ 0 >= d + 1 ]
		(8*b + 5, 1)      evalrandom2dLeafBlockin(a, b, c, d) -> evalrandom2dbb3in(a, b, c, d) [ d = 0 ]
		(8*b + 5, 1)      evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock5in(a, b, c, d) [ d >= 3 ]
		(8*b + 5, 1)      evalrandom2dNodeBlock7in(a, b, c, d) -> evalrandom2dLeafBlock3in(a, b, c, d) [ 2 >= d ]
		(8*b + 5, 1)      evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlock1in(a, b, c, d) [ d >= 1 ]
		(8*b + 5, 1)      evalrandom2dNodeBlockin(a, b, c, d) -> evalrandom2dLeafBlockin(a, b, c, d) [ 0 >= d ]
		(8*b + 5, 1)      evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlock7in(a, b, c, d) [ d >= 2 ]
		(8*b + 5, 1)      evalrandom2dNodeBlock9in(a, b, c, d) -> evalrandom2dNodeBlockin(a, b, c, d) [ 1 >= d ]
		(8*b + 5, 1)      evalrandom2dbb2in(a, b, c, d) -> evalrandom2dNodeBlock9in(a, b, c, d)
		(8*b + 5, 1)      evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ e >= 4 ]
		(8*b + 5, 1)      evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb10in(a + 1, b, c, d) [ 0 >= e + 1 ]
		(8*b + 5, 1)      evalrandom2dbbin(a, b, c, d) -> evalrandom2dbb2in(a, b, a + 1, e) [ e >= 0 /\ 3 >= e ]
		(8*b + 5, 1)      evalrandom2dbb10in(a, b, c, d) -> evalrandom2dbbin(a, b, c, d) [ b >= a + 1 ]
		(1, 1)            evalrandom2dentryin(a, b, c, d) -> evalrandom2dbb10in(0, b, c, d)
		(1, 1)            evalrandom2dstart(a, b, c, d) -> evalrandom2dentryin(a, b, c, d)
	start location:	evalrandom2dstart
	leaf cost:	2

Complexity upper bound 216*b + 139

Time: 0.797 sec (SMT: 0.741 sec)