YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. start(A,B) -> sumto(A,B) True (1,1) 1. sumto(A,B) -> sumto(1 + A,B) [B >= A] (?,1) 2. sumto(A,B) -> end(A,B) [A >= 1 + B] (?,1) Signature: {(end,2);(start,2);(sumto,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: Looptree YES + Considered Problem: Rules: 0. start(A,B) -> sumto(A,B) True (1,1) 1. sumto(A,B) -> sumto(1 + A,B) [B >= A] (?,1) 2. sumto(A,B) -> end(A,B) [A >= 1 + B] (1,1) Signature: {(end,2);(start,2);(sumto,2)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2] | `- p:[1] c: [1] YES