YES(?, 2)

Initial complexity problem:
1:	T:
		(1, 1)    f2(a, b) -> f3(a - 1, c) [ a >= 0 ]
		(1, 1)    f2(a, b) -> f3(a, c) [ 0 >= a + 1 ]
	start location:	f2
	leaf cost:	0

Complexity upper bound 2

Time: 0.046 sec (SMT: 0.045 sec)