MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D) -> f3(A,E,C,D) [A >= 10] (?,1) 1. f0(A,B,C,D) -> f0(-1 + A,B,A,D) [9 >= A] (?,1) 2. f1(A,B,C,D) -> f0(-1,B,C,-1) [9 >= A] (?,1) 3. f2(A,B,C,D) -> f0(0,B,C,D) True (1,1) Signature: {(f0,4);(f1,4);(f2,4);(f3,4)} Flow Graph: [0->{},1->{0,1},2->{0,1},3->{0,1}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D) -> f3(A,E,C,D) [A >= 10] (1,1) 1. f0(A,B,C,D) -> f0(-1 + A,B,A,D) [9 >= A] (?,1) 2. f1(A,B,C,D) -> f0(-1,B,C,-1) [9 >= A] (1,1) 3. f2(A,B,C,D) -> f0(0,B,C,D) True (1,1) Signature: {(f0,4);(f1,4);(f2,4);(f3,4)} Flow Graph: [0->{},1->{0,1},2->{0,1},3->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,0),(2,0),(3,0)] * Step 3: UnreachableRules MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D) -> f3(A,E,C,D) [A >= 10] (1,1) 1. f0(A,B,C,D) -> f0(-1 + A,B,A,D) [9 >= A] (?,1) 2. f1(A,B,C,D) -> f0(-1,B,C,-1) [9 >= A] (1,1) 3. f2(A,B,C,D) -> f0(0,B,C,D) True (1,1) Signature: {(f0,4);(f1,4);(f2,4);(f3,4)} Flow Graph: [0->{},1->{1},2->{1},3->{1}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [0,2] * Step 4: AddSinks MAYBE + Considered Problem: Rules: 1. f0(A,B,C,D) -> f0(-1 + A,B,A,D) [9 >= A] (?,1) 3. f2(A,B,C,D) -> f0(0,B,C,D) True (1,1) Signature: {(f0,4);(f1,4);(f2,4);(f3,4)} Flow Graph: [1->{1},3->{1}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: 1. f0(A,B,C,D) -> f0(-1 + A,B,A,D) [9 >= A] (?,1) 3. f2(A,B,C,D) -> f0(0,B,C,D) True (1,1) 4. f0(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(exitus616,4);(f0,4);(f1,4);(f2,4);(f3,4)} Flow Graph: [1->{1,4},3->{1,4},4->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [1,3,4] | `- p:[1] c: [] MAYBE