MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f300(A,B,C,D,E,F,G,H,I,J) -> f1(A,B,C,D,E,F,K,L,I,M) [E >= F] (?,1) 1. f300(A,B,C,D,E,F,G,H,I,J) -> f300(A,B,C,D,E,F,K,L,M,J) [F >= 1 + E] (?,1) 2. f2(A,B,C,D,E,F,G,H,I,J) -> f300(K,L,M,N,E,F,G,H,I,J) True (1,1) Signature: {(f1,10);(f2,10);(f300,10)} Flow Graph: [0->{},1->{0,1},2->{0,1}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f300(A,B,C,D,E,F,G,H,I,J) -> f1(A,B,C,D,E,F,K,L,I,M) [E >= F] (1,1) 1. f300(A,B,C,D,E,F,G,H,I,J) -> f300(A,B,C,D,E,F,K,L,M,J) [F >= 1 + E] (?,1) 2. f2(A,B,C,D,E,F,G,H,I,J) -> f300(K,L,M,N,E,F,G,H,I,J) True (1,1) Signature: {(f1,10);(f2,10);(f300,10)} Flow Graph: [0->{},1->{0,1},2->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,0)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f300(A,B,C,D,E,F,G,H,I,J) -> f1(A,B,C,D,E,F,K,L,I,M) [E >= F] (1,1) 1. f300(A,B,C,D,E,F,G,H,I,J) -> f300(A,B,C,D,E,F,K,L,M,J) [F >= 1 + E] (?,1) 2. f2(A,B,C,D,E,F,G,H,I,J) -> f300(K,L,M,N,E,F,G,H,I,J) True (1,1) Signature: {(f1,10);(f2,10);(f300,10)} Flow Graph: [0->{},1->{1},2->{0,1}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f300(A,B,C,D,E,F,G,H,I,J) -> f1(A,B,C,D,E,F,K,L,I,M) [E >= F] (?,1) 1. f300(A,B,C,D,E,F,G,H,I,J) -> f300(A,B,C,D,E,F,K,L,M,J) [F >= 1 + E] (?,1) 2. f2(A,B,C,D,E,F,G,H,I,J) -> f300(K,L,M,N,E,F,G,H,I,J) True (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True (?,1) Signature: {(exitus616,10);(f1,10);(f2,10);(f300,10)} Flow Graph: [0->{},1->{0,1,3},2->{0,1,3},3->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,0)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f300(A,B,C,D,E,F,G,H,I,J) -> f1(A,B,C,D,E,F,K,L,I,M) [E >= F] (?,1) 1. f300(A,B,C,D,E,F,G,H,I,J) -> f300(A,B,C,D,E,F,K,L,M,J) [F >= 1 + E] (?,1) 2. f2(A,B,C,D,E,F,G,H,I,J) -> f300(K,L,M,N,E,F,G,H,I,J) True (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True (?,1) Signature: {(exitus616,10);(f1,10);(f2,10);(f300,10)} Flow Graph: [0->{},1->{1,3},2->{0,1,3},3->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3] | `- p:[1] c: [] MAYBE