YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. evaleasy2start(A) -> evaleasy2entryin(A) True (1,1) 1. evaleasy2entryin(A) -> evaleasy2bb1in(A) True (?,1) 2. evaleasy2bb1in(A) -> evaleasy2bbin(A) [A >= 1] (?,1) 3. evaleasy2bb1in(A) -> evaleasy2returnin(A) [0 >= A] (?,1) 4. evaleasy2bbin(A) -> evaleasy2bb1in(-1 + A) [-1 + A >= 0] (?,1) 5. evaleasy2returnin(A) -> evaleasy2stop(A) [-1*A >= 0] (?,1) Signature: {(evaleasy2bb1in,1) ;(evaleasy2bbin,1) ;(evaleasy2entryin,1) ;(evaleasy2returnin,1) ;(evaleasy2start,1) ;(evaleasy2stop,1)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{5},4->{2,3},5->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: Looptree YES + Considered Problem: Rules: 0. evaleasy2start(A) -> evaleasy2entryin(A) True (1,1) 1. evaleasy2entryin(A) -> evaleasy2bb1in(A) True (1,1) 2. evaleasy2bb1in(A) -> evaleasy2bbin(A) [A >= 1] (?,1) 3. evaleasy2bb1in(A) -> evaleasy2returnin(A) [0 >= A] (1,1) 4. evaleasy2bbin(A) -> evaleasy2bb1in(-1 + A) [-1 + A >= 0] (?,1) 5. evaleasy2returnin(A) -> evaleasy2stop(A) [-1*A >= 0] (1,1) Signature: {(evaleasy2bb1in,1) ;(evaleasy2bbin,1) ;(evaleasy2entryin,1) ;(evaleasy2returnin,1) ;(evaleasy2start,1) ;(evaleasy2stop,1)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{5},4->{2,3},5->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5] | `- p:[2,4] c: [4] YES