MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] (?,1) 5. f9(A,B,C) -> f17(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] (?,1) 6. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] (?,1) 8. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{5,6,7},1->{5,6,7},2->{3,4},3->{},4->{},5->{3,4},6->{0,1,2},7->{0,1,2},8->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,4),(5,3)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] (?,1) 5. f9(A,B,C) -> f17(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] (?,1) 6. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] (?,1) 8. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{5,6,7},1->{5,6,7},2->{3},3->{},4->{},5->{4},6->{0,1,2},7->{0,1,2},8->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6(A,B,C) -> f17(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] f17(A,B,C) -> f24(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] f17(A,B,C) -> f24(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] f9(A,B,C) -> f17(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f0(A,B,C) -> f6(D,B,0) True Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Rule Graph: [0->{5,6,7},1->{5,6,7},2->{3},3->{},4->{},5->{4},6->{0,1,2},7->{0,1,2},8->{0,1,2}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f6.0(A,B,C) -> f9.5(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6.0(A,B,C) -> f9.6(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6.0(A,B,C) -> f9.7(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6.1(A,B,C) -> f9.5(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6.1(A,B,C) -> f9.6(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6.1(A,B,C) -> f9.7(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6.2(A,B,C) -> f17.3(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] f17.3(A,B,C) -> f24.9(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] f17.4(A,B,C) -> f24.9(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] f9.5(A,B,C) -> f17.4(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] f9.6(A,B,C) -> f6.0(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9.6(A,B,C) -> f6.1(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9.6(A,B,C) -> f6.2(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9.7(A,B,C) -> f6.0(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f9.7(A,B,C) -> f6.1(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f9.7(A,B,C) -> f6.2(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f0.8(A,B,C) -> f6.0(D,B,0) True f0.8(A,B,C) -> f6.1(D,B,0) True f0.8(A,B,C) -> f6.2(D,B,0) True Signature: {(f0.8,3);(f17.3,3);(f17.4,3);(f24.9,3);(f6.0,3);(f6.1,3);(f6.2,3);(f9.5,3);(f9.6,3);(f9.7,3)} Rule Graph: [0->{9},1->{10,11,12},2->{13,14,15},3->{9},4->{10,11,12},5->{13,14,15},6->{7},7->{},8->{},9->{8},10->{0,1 ,2},11->{3,4,5},12->{6},13->{0,1,2},14->{3,4,5},15->{6},16->{0,1,2},17->{3,4,5},18->{6}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: f6.0(A,B,C) -> f9.5(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6.0(A,B,C) -> f9.6(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6.0(A,B,C) -> f9.7(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] f6.1(A,B,C) -> f9.5(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6.1(A,B,C) -> f9.6(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6.1(A,B,C) -> f9.7(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] f6.2(A,B,C) -> f17.3(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] f17.3(A,B,C) -> f24.9(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] f17.4(A,B,C) -> f24.9(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] f9.5(A,B,C) -> f17.4(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] f9.6(A,B,C) -> f6.0(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9.6(A,B,C) -> f6.1(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9.6(A,B,C) -> f6.2(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] f9.7(A,B,C) -> f6.0(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f9.7(A,B,C) -> f6.1(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f9.7(A,B,C) -> f6.2(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] f0.8(A,B,C) -> f6.0(D,B,0) True f0.8(A,B,C) -> f6.1(D,B,0) True f0.8(A,B,C) -> f6.2(D,B,0) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True f24.9(A,B,C) -> exitus616(A,B,C) True Signature: {(exitus616,3) ;(f0.8,3) ;(f17.3,3) ;(f17.4,3) ;(f24.9,3) ;(f6.0,3) ;(f6.1,3) ;(f6.2,3) ;(f9.5,3) ;(f9.6,3) ;(f9.7,3)} Rule Graph: [0->{9},1->{10,11,12},2->{13,14,15},3->{9},4->{10,11,12},5->{13,14,15},6->{7},7->{19,20,21,24,25},8->{22 ,23,26,27},9->{8},10->{0,1,2},11->{3,4,5},12->{6},13->{0,1,2},14->{3,4,5},15->{6},16->{0,1,2},17->{3,4,5} ,18->{6}] + 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,21,22,23,24,25,26,27] | `- p:[1,10,4,11,14,2,13,5] c: [] MAYBE