NO * Step 1: TrivialSCCs NO + Considered Problem: Rules: 0. f0(A,B,C) -> f5(0,0,C) True (1,1) 1. f5(A,B,C) -> f5(1 + A,2 + B,D + E) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 2. f5(A,B,C) -> f16(A,B,C) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) Signature: {(f0,3);(f16,3);(f5,3)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: Looptree NO + Considered Problem: Rules: 0. f0(A,B,C) -> f5(0,0,C) True (1,1) 1. f5(A,B,C) -> f5(1 + A,2 + B,D + E) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 2. f5(A,B,C) -> f16(A,B,C) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (1,1) Signature: {(f0,3);(f16,3);(f5,3)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2] | `- p:[1] c: [] NO