MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalcousot9start(A,B,C) -> evalcousot9entryin(A,B,C) True (1,1) 1. evalcousot9entryin(A,B,C) -> evalcousot9bb3in(D,C,C) True (?,1) 2. evalcousot9bb3in(A,B,C) -> evalcousot9bbin(A,B,C) [-1*B + C >= 0 && B >= 1] (?,1) 3. evalcousot9bb3in(A,B,C) -> evalcousot9returnin(A,B,C) [-1*B + C >= 0 && 0 >= B] (?,1) 4. evalcousot9bbin(A,B,C) -> evalcousot9bb1in(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && A >= 1] (?,1) 5. evalcousot9bbin(A,B,C) -> evalcousot9bb2in(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && 0 >= A] (?,1) 6. evalcousot9bb1in(A,B,C) -> evalcousot9bb3in(-1 + A,B,C) [-1 + C >= 0 (?,1) && -2 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 7. evalcousot9bb2in(A,B,C) -> evalcousot9bb3in(C,-1 + B,C) [-1 + C >= 0 (?,1) && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] 8. evalcousot9returnin(A,B,C) -> evalcousot9stop(A,B,C) [-1*B + C >= 0 && -1*B >= 0] (?,1) Signature: {(evalcousot9bb1in,3) ;(evalcousot9bb2in,3) ;(evalcousot9bb3in,3) ;(evalcousot9bbin,3) ;(evalcousot9entryin,3) ;(evalcousot9returnin,3) ;(evalcousot9start,3) ;(evalcousot9stop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(6,3)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. evalcousot9start(A,B,C) -> evalcousot9entryin(A,B,C) True (1,1) 1. evalcousot9entryin(A,B,C) -> evalcousot9bb3in(D,C,C) True (?,1) 2. evalcousot9bb3in(A,B,C) -> evalcousot9bbin(A,B,C) [-1*B + C >= 0 && B >= 1] (?,1) 3. evalcousot9bb3in(A,B,C) -> evalcousot9returnin(A,B,C) [-1*B + C >= 0 && 0 >= B] (?,1) 4. evalcousot9bbin(A,B,C) -> evalcousot9bb1in(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && A >= 1] (?,1) 5. evalcousot9bbin(A,B,C) -> evalcousot9bb2in(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && 0 >= A] (?,1) 6. evalcousot9bb1in(A,B,C) -> evalcousot9bb3in(-1 + A,B,C) [-1 + C >= 0 (?,1) && -2 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 7. evalcousot9bb2in(A,B,C) -> evalcousot9bb3in(C,-1 + B,C) [-1 + C >= 0 (?,1) && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] 8. evalcousot9returnin(A,B,C) -> evalcousot9stop(A,B,C) [-1*B + C >= 0 && -1*B >= 0] (?,1) Signature: {(evalcousot9bb1in,3) ;(evalcousot9bb2in,3) ;(evalcousot9bb3in,3) ;(evalcousot9bbin,3) ;(evalcousot9entryin,3) ;(evalcousot9returnin,3) ;(evalcousot9start,3) ;(evalcousot9stop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2},7->{2,3},8->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: evalcousot9start(A,B,C) -> evalcousot9entryin(A,B,C) True evalcousot9entryin(A,B,C) -> evalcousot9bb3in(D,C,C) True evalcousot9bb3in(A,B,C) -> evalcousot9bbin(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in(A,B,C) -> evalcousot9returnin(A,B,C) [-1*B + C >= 0 && 0 >= B] evalcousot9bbin(A,B,C) -> evalcousot9bb1in(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && A >= 1] evalcousot9bbin(A,B,C) -> evalcousot9bb2in(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && 0 >= A] evalcousot9bb1in(A,B,C) -> evalcousot9bb3in(-1 + A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalcousot9bb2in(A,B,C) -> evalcousot9bb3in(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9returnin(A,B,C) -> evalcousot9stop(A,B,C) [-1*B + C >= 0 && -1*B >= 0] Signature: {(evalcousot9bb1in,3) ;(evalcousot9bb2in,3) ;(evalcousot9bb3in,3) ;(evalcousot9bbin,3) ;(evalcousot9entryin,3) ;(evalcousot9returnin,3) ;(evalcousot9start,3) ;(evalcousot9stop,3)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2},7->{2,3},8->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: evalcousot9start.0(A,B,C) -> evalcousot9entryin.1(A,B,C) True evalcousot9entryin.1(A,B,C) -> evalcousot9bb3in.2(D,C,C) True evalcousot9entryin.1(A,B,C) -> evalcousot9bb3in.3(D,C,C) True evalcousot9bb3in.2(A,B,C) -> evalcousot9bbin.4(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in.2(A,B,C) -> evalcousot9bbin.5(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in.3(A,B,C) -> evalcousot9returnin.8(A,B,C) [-1*B + C >= 0 && 0 >= B] evalcousot9bbin.4(A,B,C) -> evalcousot9bb1in.6(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && A >= 1] evalcousot9bbin.5(A,B,C) -> evalcousot9bb2in.7(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && 0 >= A] evalcousot9bb1in.6(A,B,C) -> evalcousot9bb3in.2(-1 + A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalcousot9bb2in.7(A,B,C) -> evalcousot9bb3in.2(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9bb2in.7(A,B,C) -> evalcousot9bb3in.3(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9returnin.8(A,B,C) -> evalcousot9stop.9(A,B,C) [-1*B + C >= 0 && -1*B >= 0] Signature: {(evalcousot9bb1in.6,3) ;(evalcousot9bb2in.7,3) ;(evalcousot9bb3in.2,3) ;(evalcousot9bb3in.3,3) ;(evalcousot9bbin.4,3) ;(evalcousot9bbin.5,3) ;(evalcousot9entryin.1,3) ;(evalcousot9returnin.8,3) ;(evalcousot9start.0,3) ;(evalcousot9stop.9,3)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{11},6->{8},7->{9,10},8->{3,4},9->{3,4},10->{5},11->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: evalcousot9start.0(A,B,C) -> evalcousot9entryin.1(A,B,C) True evalcousot9entryin.1(A,B,C) -> evalcousot9bb3in.2(D,C,C) True evalcousot9entryin.1(A,B,C) -> evalcousot9bb3in.3(D,C,C) True evalcousot9bb3in.2(A,B,C) -> evalcousot9bbin.4(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in.2(A,B,C) -> evalcousot9bbin.5(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in.3(A,B,C) -> evalcousot9returnin.8(A,B,C) [-1*B + C >= 0 && 0 >= B] evalcousot9bbin.4(A,B,C) -> evalcousot9bb1in.6(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && A >= 1] evalcousot9bbin.5(A,B,C) -> evalcousot9bb2in.7(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && 0 >= A] evalcousot9bb1in.6(A,B,C) -> evalcousot9bb3in.2(-1 + A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalcousot9bb2in.7(A,B,C) -> evalcousot9bb3in.2(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9bb2in.7(A,B,C) -> evalcousot9bb3in.3(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9returnin.8(A,B,C) -> evalcousot9stop.9(A,B,C) [-1*B + C >= 0 && -1*B >= 0] evalcousot9stop.9(A,B,C) -> exitus616(A,B,C) True evalcousot9stop.9(A,B,C) -> exitus616(A,B,C) True Signature: {(evalcousot9bb1in.6,3) ;(evalcousot9bb2in.7,3) ;(evalcousot9bb3in.2,3) ;(evalcousot9bb3in.3,3) ;(evalcousot9bbin.4,3) ;(evalcousot9bbin.5,3) ;(evalcousot9entryin.1,3) ;(evalcousot9returnin.8,3) ;(evalcousot9start.0,3) ;(evalcousot9stop.9,3) ;(exitus616,3)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{11},6->{8},7->{9,10},8->{3,4},9->{3,4},10->{5},11->{12,13}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | `- p:[3,8,6,9,7,4] c: [4,7,9] | `- p:[3,8,6] c: [3,6,8] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: evalcousot9start.0(A,B,C) -> evalcousot9entryin.1(A,B,C) True evalcousot9entryin.1(A,B,C) -> evalcousot9bb3in.2(D,C,C) True evalcousot9entryin.1(A,B,C) -> evalcousot9bb3in.3(D,C,C) True evalcousot9bb3in.2(A,B,C) -> evalcousot9bbin.4(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in.2(A,B,C) -> evalcousot9bbin.5(A,B,C) [-1*B + C >= 0 && B >= 1] evalcousot9bb3in.3(A,B,C) -> evalcousot9returnin.8(A,B,C) [-1*B + C >= 0 && 0 >= B] evalcousot9bbin.4(A,B,C) -> evalcousot9bb1in.6(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && A >= 1] evalcousot9bbin.5(A,B,C) -> evalcousot9bb2in.7(A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + B >= 0 && 0 >= A] evalcousot9bb1in.6(A,B,C) -> evalcousot9bb3in.2(-1 + A,B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalcousot9bb2in.7(A,B,C) -> evalcousot9bb3in.2(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9bb2in.7(A,B,C) -> evalcousot9bb3in.3(C,-1 + B,C) [-1 + C >= 0 && -2 + B + C >= 0 && -1*B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + -1*A + B >= 0 && -1*A >= 0] evalcousot9returnin.8(A,B,C) -> evalcousot9stop.9(A,B,C) [-1*B + C >= 0 && -1*B >= 0] evalcousot9stop.9(A,B,C) -> exitus616(A,B,C) True evalcousot9stop.9(A,B,C) -> exitus616(A,B,C) True Signature: {(evalcousot9bb1in.6,3) ;(evalcousot9bb2in.7,3) ;(evalcousot9bb3in.2,3) ;(evalcousot9bb3in.3,3) ;(evalcousot9bbin.4,3) ;(evalcousot9bbin.5,3) ;(evalcousot9entryin.1,3) ;(evalcousot9returnin.8,3) ;(evalcousot9start.0,3) ;(evalcousot9stop.9,3) ;(exitus616,3)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{11},6->{8},7->{9,10},8->{3,4},9->{3,4},10->{5},11->{12,13}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | `- p:[3,8,6,9,7,4] c: [4,7,9] | `- p:[3,8,6] c: [3,6,8]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,0.0,0.0.0] evalcousot9start.0 ~> evalcousot9entryin.1 [A <= A, B <= B, C <= C] evalcousot9entryin.1 ~> evalcousot9bb3in.2 [A <= unknown, B <= C, C <= C] evalcousot9entryin.1 ~> evalcousot9bb3in.3 [A <= unknown, B <= C, C <= C] evalcousot9bb3in.2 ~> evalcousot9bbin.4 [A <= A, B <= B, C <= C] evalcousot9bb3in.2 ~> evalcousot9bbin.5 [A <= A, B <= B, C <= C] evalcousot9bb3in.3 ~> evalcousot9returnin.8 [A <= A, B <= B, C <= C] evalcousot9bbin.4 ~> evalcousot9bb1in.6 [A <= A, B <= B, C <= C] evalcousot9bbin.5 ~> evalcousot9bb2in.7 [A <= A, B <= B, C <= C] evalcousot9bb1in.6 ~> evalcousot9bb3in.2 [A <= A, B <= B, C <= C] evalcousot9bb2in.7 ~> evalcousot9bb3in.2 [A <= C, B <= C, C <= C] evalcousot9bb2in.7 ~> evalcousot9bb3in.3 [A <= C, B <= C, C <= C] evalcousot9returnin.8 ~> evalcousot9stop.9 [A <= A, B <= B, C <= C] evalcousot9stop.9 ~> exitus616 [A <= A, B <= B, C <= C] evalcousot9stop.9 ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= K + B] evalcousot9bb3in.2 ~> evalcousot9bbin.4 [A <= A, B <= B, C <= C] evalcousot9bb1in.6 ~> evalcousot9bb3in.2 [A <= A, B <= B, C <= C] evalcousot9bbin.4 ~> evalcousot9bb1in.6 [A <= A, B <= B, C <= C] evalcousot9bb2in.7 ~> evalcousot9bb3in.2 [A <= C, B <= C, C <= C] evalcousot9bbin.5 ~> evalcousot9bb2in.7 [A <= A, B <= B, C <= C] evalcousot9bb3in.2 ~> evalcousot9bbin.5 [A <= A, B <= B, C <= C] + Loop: [0.0.0 <= K + A] evalcousot9bb3in.2 ~> evalcousot9bbin.4 [A <= A, B <= B, C <= C] evalcousot9bb1in.6 ~> evalcousot9bb3in.2 [A <= A, B <= B, C <= C] evalcousot9bbin.4 ~> evalcousot9bb1in.6 [A <= A, B <= B, C <= C] + Applied Processor: AbstractFlow + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.0.0] evalcousot9start.0 ~> evalcousot9entryin.1 [] evalcousot9entryin.1 ~> evalcousot9bb3in.2 [C ~=> B,huge ~=> A] evalcousot9entryin.1 ~> evalcousot9bb3in.3 [C ~=> B,huge ~=> A] evalcousot9bb3in.2 ~> evalcousot9bbin.4 [] evalcousot9bb3in.2 ~> evalcousot9bbin.5 [] evalcousot9bb3in.3 ~> evalcousot9returnin.8 [] evalcousot9bbin.4 ~> evalcousot9bb1in.6 [] evalcousot9bbin.5 ~> evalcousot9bb2in.7 [] evalcousot9bb1in.6 ~> evalcousot9bb3in.2 [] evalcousot9bb2in.7 ~> evalcousot9bb3in.2 [C ~=> A,C ~=> B] evalcousot9bb2in.7 ~> evalcousot9bb3in.3 [C ~=> A,C ~=> B] evalcousot9returnin.8 ~> evalcousot9stop.9 [] evalcousot9stop.9 ~> exitus616 [] evalcousot9stop.9 ~> exitus616 [] + Loop: [B ~+> 0.0,K ~+> 0.0] evalcousot9bb3in.2 ~> evalcousot9bbin.4 [] evalcousot9bb1in.6 ~> evalcousot9bb3in.2 [] evalcousot9bbin.4 ~> evalcousot9bb1in.6 [] evalcousot9bb2in.7 ~> evalcousot9bb3in.2 [C ~=> A,C ~=> B] evalcousot9bbin.5 ~> evalcousot9bb2in.7 [] evalcousot9bb3in.2 ~> evalcousot9bbin.5 [] + Loop: [A ~+> 0.0.0,K ~+> 0.0.0] evalcousot9bb3in.2 ~> evalcousot9bbin.4 [] evalcousot9bb1in.6 ~> evalcousot9bb3in.2 [] evalcousot9bbin.4 ~> evalcousot9bb1in.6 [] + Applied Processor: Lare + Details: Unknown bound. MAYBE