YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. f0(A,B) -> f6(C,0) True (1,1) 1. f6(A,B) -> f6(A,1 + B) [B >= 0 && 9 >= B] (?,1) 2. f6(A,B) -> f15(A,B) [B >= 0 && B >= 10] (?,1) Signature: {(f0,2);(f15,2);(f6,2)} 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: UnsatPaths YES + Considered Problem: Rules: 0. f0(A,B) -> f6(C,0) True (1,1) 1. f6(A,B) -> f6(A,1 + B) [B >= 0 && 9 >= B] (?,1) 2. f6(A,B) -> f15(A,B) [B >= 0 && B >= 10] (1,1) Signature: {(f0,2);(f15,2);(f6,2)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2)] * Step 3: Looptree YES + Considered Problem: Rules: 0. f0(A,B) -> f6(C,0) True (1,1) 1. f6(A,B) -> f6(A,1 + B) [B >= 0 && 9 >= B] (?,1) 2. f6(A,B) -> f15(A,B) [B >= 0 && B >= 10] (1,1) Signature: {(f0,2);(f15,2);(f6,2)} Flow Graph: [0->{1},1->{1,2},2->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2] | `- p:[1] c: [1] YES