YES(?, 1773)

Initial complexity problem:
1:	T:
		(?, 1)    f11(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f14(a, 0, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) [ 9 >= a ]
		(?, 1)    f33(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f36(a, b, c, 0, e, f, g, h, i, j, k, l, m, n, o, p, q) [ 9 >= c ]
		(?, 1)    f36(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f36(a, b, c, d + 1, e + s, f + 1, g, h, i, j, k, l, m, n, o, p, q) [ 9 >= d /\ 0 >= r + 1 ]
		(?, 1)    f36(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f36(a, b, c, d + 1, e, f, g + s, h + 1, i, j, k, l, m, n, o, p, q) [ 9 >= d ]
		(?, 1)    f36(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f33(a, b, c + 1, d, e, f, g, h, i, j, k, l, m, n, o, p, q) [ d >= 10 ]
		(?, 1)    f33(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f58(a, b, c, d, e, f, g, h, e, f, g, h, 1500, s, o, p, q) [ c >= 10 ]
		(?, 1)    f14(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f14(a, b + 1, c, d, e, f, g, h, i, j, k, l, m, n, s, s, q) [ 9 >= b ]
		(?, 1)    f14(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f11(a + 1, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) [ b >= 10 ]
		(?, 1)    f11(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f33(a, b, 0, d, 0, 0, 0, 0, i, j, k, l, m, n, o, p, 1000) [ a >= 10 ]
		(1, 1)    f0(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> f11(0, b, c, d, e, f, g, h, i, j, k, l, m, n, 0, p, q)
	start location:	f0
	leaf cost:	0

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [a, b, c, d].
We thus obtain the following problem:
2:	T:
		(1, 1)    f0(a, b, c, d) -> f11(0, b, c, d)
		(?, 1)    f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(?, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)    f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(?, 1)    f33(a, b, c, d) -> f58(a, b, c, d) [ c >= 10 ]
		(?, 1)    f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(?, 1)    f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(?, 1)    f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	0

Repeatedly removing leaves of the complexity graph in problem 2 produces the following problem:
3:	T:
		(1, 1)    f0(a, b, c, d) -> f11(0, b, c, d)
		(?, 1)    f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(?, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)    f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(?, 1)    f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(?, 1)    f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(?, 1)    f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f0) = 9
	Pol(f11) = 9
	Pol(f33) = -10
	Pol(f14) = 9
	Pol(f36) = -10
orients all transitions weakly and the transition
	f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
strictly and produces the following problem:
4:	T:
		(1, 1)    f0(a, b, c, d) -> f11(0, b, c, d)
		(9, 1)    f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(?, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)    f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(?, 1)    f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(?, 1)    f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(?, 1)    f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f0) = 19
	Pol(f11) = -2*V_1 + 19
	Pol(f33) = -2*V_1 - 2*V_3 + 11
	Pol(f14) = -2*V_1 + 18
	Pol(f36) = -2*V_1 - 2*V_3 + 10
orients all transitions weakly and the transition
	f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
strictly and produces the following problem:
5:	T:
		(1, 1)     f0(a, b, c, d) -> f11(0, b, c, d)
		(9, 1)     f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(?, 1)     f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)     f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(?, 1)     f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)     f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)     f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(?, 1)     f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(19, 1)    f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f36) = -10
	Pol(f33) = -10
	Pol(f14) = 9
	Pol(f11) = 8
and size complexities
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-0) = ?
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-1) = 0
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-2) = c
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-3) = d
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-0) = ?
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-1) = 10
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-2) = ?
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-3) = 0
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-0) = ?
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-1) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-2) = ?
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-3) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-0) = ?
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-1) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-2) = ?
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-3) = 10
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-0) = ?
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-1) = 10
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-2) = ?
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-3) = 10
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-0) = ?
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-1) = 10
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-2) = c
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-3) = d
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-0) = ?
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-1) = 10
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-2) = c
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-3) = d
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-0) = ?
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-1) = 10
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-2) = 0
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-3) = d
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-0) = 0
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-1) = b
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-2) = c
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-3) = d
orients the transitions
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
	f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
	f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
	f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
	f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
weakly and the transition
	f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
strictly and produces the following problem:
6:	T:
		(1, 1)      f0(a, b, c, d) -> f11(0, b, c, d)
		(9, 1)      f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(261, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)      f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(?, 1)      f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)      f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)      f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(?, 1)      f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(19, 1)     f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f0) = 19
	Pol(f11) = 19
	Pol(f33) = -2*V_3 + 19
	Pol(f14) = 19
	Pol(f36) = -2*V_3 + 18
orients all transitions weakly and the transition
	f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
strictly and produces the following problem:
7:	T:
		(1, 1)      f0(a, b, c, d) -> f11(0, b, c, d)
		(9, 1)      f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(261, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)      f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(?, 1)      f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)      f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)      f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(19, 1)     f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(19, 1)     f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f36) = 8
	Pol(f33) = 7
	Pol(f14) = 9
and size complexities
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-0) = 261
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-1) = 0
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-2) = c
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-3) = d
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-0) = 261
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-1) = 10
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-2) = ?
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-3) = 0
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-0) = 261
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-1) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-2) = ?
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-3) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-0) = 261
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-1) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-2) = ?
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-3) = 10
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-0) = 261
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-1) = 10
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-2) = ?
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-3) = 10
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-0) = 261
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-1) = 10
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-2) = c
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-3) = d
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-0) = 261
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-1) = 10
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-2) = c
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-3) = d
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-0) = 261
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-1) = 10
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-2) = 0
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-3) = d
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-0) = 0
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-1) = b
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-2) = c
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-3) = d
orients the transitions
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
	f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
	f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
weakly and the transition
	f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
strictly and produces the following problem:
8:	T:
		(1, 1)      f0(a, b, c, d) -> f11(0, b, c, d)
		(9, 1)      f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(261, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(?, 1)      f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(323, 1)    f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(?, 1)      f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(?, 1)      f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(19, 1)     f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(19, 1)     f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f36) = -V_4 + 10
	Pol(f14) = -V_2 + 10
and size complexities
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-0) = 261
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-1) = 0
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-2) = c
	S("f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]", 0-3) = d
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-0) = 261
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-1) = 10
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-2) = 323
	S("f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]", 0-3) = 0
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-0) = 261
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-1) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-2) = 323
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\\ 0 >= r + 1 ]", 0-3) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-0) = 261
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-1) = 10
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-2) = 323
	S("f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]", 0-3) = 10
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-0) = 261
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-1) = 10
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-2) = 323
	S("f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]", 0-3) = 10
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-0) = 261
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-1) = 10
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-2) = c
	S("f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]", 0-3) = d
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-0) = 261
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-1) = 10
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-2) = c
	S("f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]", 0-3) = d
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-0) = 261
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-1) = 10
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-2) = 0
	S("f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]", 0-3) = d
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-0) = 0
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-1) = b
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-2) = c
	S("f0(a, b, c, d) -> f11(0, b, c, d)", 0-3) = d
orients the transitions
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
	f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
weakly and the transitions
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
	f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
	f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
strictly and produces the following problem:
9:	T:
		(1, 1)      f0(a, b, c, d) -> f11(0, b, c, d)
		(9, 1)      f11(a, b, c, d) -> f33(a, b, 0, d) [ a >= 10 ]
		(261, 1)    f14(a, b, c, d) -> f11(a + 1, b, c, d) [ b >= 10 ]
		(380, 1)    f14(a, b, c, d) -> f14(a, b + 1, c, d) [ 9 >= b ]
		(323, 1)    f36(a, b, c, d) -> f33(a, b, c + 1, d) [ d >= 10 ]
		(380, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d ]
		(380, 1)    f36(a, b, c, d) -> f36(a, b, c, d + 1) [ 9 >= d /\ 0 >= r + 1 ]
		(19, 1)     f33(a, b, c, d) -> f36(a, b, c, 0) [ 9 >= c ]
		(19, 1)     f11(a, b, c, d) -> f14(a, 0, c, d) [ 9 >= a ]
	start location:	f0
	leaf cost:	1

Complexity upper bound 1773

Time: 0.389 sec (SMT: 0.366 sec)