MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) True (?,1) 2. evalfbb3in(A,B) -> evalfbbin(A,B) [B >= 1 && 254 >= B] (?,1) 3. evalfbb3in(A,B) -> evalfreturnin(A,B) [0 >= B] (?,1) 4. evalfbb3in(A,B) -> evalfreturnin(A,B) [B >= 255] (?,1) 5. evalfbbin(A,B) -> evalfbb1in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] (?,1) 6. evalfbbin(A,B) -> evalfbb1in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A >= 1] (?,1) 7. evalfbbin(A,B) -> evalfbb2in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A = 0] (?,1) 8. evalfbb1in(A,B) -> evalfbb3in(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] (?,1) 9. evalfbb2in(A,B) -> evalfbb3in(A,-1 + B) [254 + -1*B >= 0 (?,1) && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] 10. evalfreturnin(A,B) -> evalfstop(A,B) True (?,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6,7},3->{10},4->{10},5->{8},6->{8},7->{9},8->{2,3,4},9->{2,3,4},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(8,3),(9,4)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) True (?,1) 2. evalfbb3in(A,B) -> evalfbbin(A,B) [B >= 1 && 254 >= B] (?,1) 3. evalfbb3in(A,B) -> evalfreturnin(A,B) [0 >= B] (?,1) 4. evalfbb3in(A,B) -> evalfreturnin(A,B) [B >= 255] (?,1) 5. evalfbbin(A,B) -> evalfbb1in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] (?,1) 6. evalfbbin(A,B) -> evalfbb1in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A >= 1] (?,1) 7. evalfbbin(A,B) -> evalfbb2in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A = 0] (?,1) 8. evalfbb1in(A,B) -> evalfbb3in(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] (?,1) 9. evalfbb2in(A,B) -> evalfbb3in(A,-1 + B) [254 + -1*B >= 0 (?,1) && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] 10. evalfreturnin(A,B) -> evalfstop(A,B) True (?,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6,7},3->{10},4->{10},5->{8},6->{8},7->{9},8->{2,4},9->{2,3},10->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: evalfstart(A,B) -> evalfentryin(A,B) True evalfentryin(A,B) -> evalfbb3in(B,A) True evalfbb3in(A,B) -> evalfbbin(A,B) [B >= 1 && 254 >= B] evalfbb3in(A,B) -> evalfreturnin(A,B) [0 >= B] evalfbb3in(A,B) -> evalfreturnin(A,B) [B >= 255] evalfbbin(A,B) -> evalfbb1in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] evalfbbin(A,B) -> evalfbb1in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A >= 1] evalfbbin(A,B) -> evalfbb2in(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A = 0] evalfbb1in(A,B) -> evalfbb3in(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] evalfbb2in(A,B) -> evalfbb3in(A,-1 + B) [254 + -1*B >= 0 && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] evalfreturnin(A,B) -> evalfstop(A,B) True Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2)} Rule Graph: [0->{1},1->{2,3,4},2->{5,6,7},3->{10},4->{10},5->{8},6->{8},7->{9},8->{2,4},9->{2,3},10->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: evalfstart.0(A,B) -> evalfentryin.1(A,B) True evalfentryin.1(A,B) -> evalfbb3in.2(B,A) True evalfentryin.1(A,B) -> evalfbb3in.3(B,A) True evalfentryin.1(A,B) -> evalfbb3in.4(B,A) True evalfbb3in.2(A,B) -> evalfbbin.5(A,B) [B >= 1 && 254 >= B] evalfbb3in.2(A,B) -> evalfbbin.6(A,B) [B >= 1 && 254 >= B] evalfbb3in.2(A,B) -> evalfbbin.7(A,B) [B >= 1 && 254 >= B] evalfbb3in.3(A,B) -> evalfreturnin.10(A,B) [0 >= B] evalfbb3in.4(A,B) -> evalfreturnin.10(A,B) [B >= 255] evalfbbin.5(A,B) -> evalfbb1in.8(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] evalfbbin.6(A,B) -> evalfbb1in.8(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A >= 1] evalfbbin.7(A,B) -> evalfbb2in.9(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A = 0] evalfbb1in.8(A,B) -> evalfbb3in.2(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] evalfbb1in.8(A,B) -> evalfbb3in.4(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] evalfbb2in.9(A,B) -> evalfbb3in.2(A,-1 + B) [254 + -1*B >= 0 && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] evalfbb2in.9(A,B) -> evalfbb3in.3(A,-1 + B) [254 + -1*B >= 0 && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] evalfreturnin.10(A,B) -> evalfstop.11(A,B) True Signature: {(evalfbb1in.8,2) ;(evalfbb2in.9,2) ;(evalfbb3in.2,2) ;(evalfbb3in.3,2) ;(evalfbb3in.4,2) ;(evalfbbin.5,2) ;(evalfbbin.6,2) ;(evalfbbin.7,2) ;(evalfentryin.1,2) ;(evalfreturnin.10,2) ;(evalfstart.0,2) ;(evalfstop.11,2)} Rule Graph: [0->{1,2,3},1->{4,5,6},2->{7},3->{8},4->{9},5->{10},6->{11},7->{16},8->{16},9->{12,13},10->{12,13},11->{14 ,15},12->{4,5,6},13->{8},14->{4,5,6},15->{7},16->{}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: evalfstart.0(A,B) -> evalfentryin.1(A,B) True evalfentryin.1(A,B) -> evalfbb3in.2(B,A) True evalfentryin.1(A,B) -> evalfbb3in.3(B,A) True evalfentryin.1(A,B) -> evalfbb3in.4(B,A) True evalfbb3in.2(A,B) -> evalfbbin.5(A,B) [B >= 1 && 254 >= B] evalfbb3in.2(A,B) -> evalfbbin.6(A,B) [B >= 1 && 254 >= B] evalfbb3in.2(A,B) -> evalfbbin.7(A,B) [B >= 1 && 254 >= B] evalfbb3in.3(A,B) -> evalfreturnin.10(A,B) [0 >= B] evalfbb3in.4(A,B) -> evalfreturnin.10(A,B) [B >= 255] evalfbbin.5(A,B) -> evalfbb1in.8(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] evalfbbin.6(A,B) -> evalfbb1in.8(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A >= 1] evalfbbin.7(A,B) -> evalfbb2in.9(A,B) [254 + -1*B >= 0 && -1 + B >= 0 && A = 0] evalfbb1in.8(A,B) -> evalfbb3in.2(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] evalfbb1in.8(A,B) -> evalfbb3in.4(A,1 + B) [254 + -1*B >= 0 && -1 + B >= 0] evalfbb2in.9(A,B) -> evalfbb3in.2(A,-1 + B) [254 + -1*B >= 0 && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] evalfbb2in.9(A,B) -> evalfbb3in.3(A,-1 + B) [254 + -1*B >= 0 && 254 + A + -1*B >= 0 && 254 + -1*A + -1*B >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0 && A >= 0] evalfreturnin.10(A,B) -> evalfstop.11(A,B) True evalfstop.11(A,B) -> exitus616(A,B) True evalfstop.11(A,B) -> exitus616(A,B) True evalfstop.11(A,B) -> exitus616(A,B) True evalfstop.11(A,B) -> exitus616(A,B) True Signature: {(evalfbb1in.8,2) ;(evalfbb2in.9,2) ;(evalfbb3in.2,2) ;(evalfbb3in.3,2) ;(evalfbb3in.4,2) ;(evalfbbin.5,2) ;(evalfbbin.6,2) ;(evalfbbin.7,2) ;(evalfentryin.1,2) ;(evalfreturnin.10,2) ;(evalfstart.0,2) ;(evalfstop.11,2) ;(exitus616,2)} Rule Graph: [0->{1,2,3},1->{4,5,6},2->{7},3->{8},4->{9},5->{10},6->{11},7->{16},8->{16},9->{12,13},10->{12,13},11->{14 ,15},12->{4,5,6},13->{8},14->{4,5,6},15->{7},16->{17,18,19,20}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20] | `- p:[4,12,9,10,5,14,11,6] c: [] MAYBE