NO * Step 1: TrivialSCCs NO + Considered Problem: Rules: 0. f2(A,B) -> f1(A,C) [0 >= 1 + A] (?,1) 1. f300(A,B) -> f2(A,B) True (1,1) 2. f2(A,B) -> f2(A,B) [A >= 0] (?,1) Signature: {(f1,2);(f2,2);(f300,2)} Flow Graph: [0->{},1->{0,2},2->{0,2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths NO + Considered Problem: Rules: 0. f2(A,B) -> f1(A,C) [0 >= 1 + A] (1,1) 1. f300(A,B) -> f2(A,B) True (1,1) 2. f2(A,B) -> f2(A,B) [A >= 0] (?,1) Signature: {(f1,2);(f2,2);(f300,2)} Flow Graph: [0->{},1->{0,2},2->{0,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,0)] * Step 3: Looptree NO + Considered Problem: Rules: 0. f2(A,B) -> f1(A,C) [0 >= 1 + A] (1,1) 1. f300(A,B) -> f2(A,B) True (1,1) 2. f2(A,B) -> f2(A,B) [A >= 0] (?,1) Signature: {(f1,2);(f2,2);(f300,2)} Flow Graph: [0->{},1->{0,2},2->{2}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2] | `- p:[2] c: [] NO