YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(B,A,0) [A >= 1 && B >= 1] (?,1) 2. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && 0 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfbb4in(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && B >= 1] (?,1) 4. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 5. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1] (?,1) 6. evalfbb4in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 + C] 8. evalfbbin(A,B,C) -> evalfbb3in(A,B,0) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= A] (?,1) 9. evalfbb1in(A,B,C) -> evalfbb3in(A,-1 + B,1 + C) [-1 + A + -1*C >= 0 (?,1) && C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 10. evalfreturnin(A,B,C) -> evalfstop(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0] (?,1) Signature: {(evalfbb1in,3) ;(evalfbb3in,3) ;(evalfbb4in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3)} Flow Graph: [0->{1},1->{2,3},2->{10},3->{4,5,6},4->{7,8},5->{7,8},6->{10},7->{9},8->{2,3},9->{2,3},10->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(B,A,0) [A >= 1 && B >= 1] (1,1) 2. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && 0 >= B] (1,1) 3. evalfbb3in(A,B,C) -> evalfbb4in(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && B >= 1] (?,1) 4. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 5. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1] (?,1) 6. evalfbb4in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (1,1) 7. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 + C] 8. evalfbbin(A,B,C) -> evalfbb3in(A,B,0) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= A] (?,1) 9. evalfbb1in(A,B,C) -> evalfbb3in(A,-1 + B,1 + C) [-1 + A + -1*C >= 0 (?,1) && C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 10. evalfreturnin(A,B,C) -> evalfstop(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0] (1,1) Signature: {(evalfbb1in,3) ;(evalfbb3in,3) ;(evalfbb4in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3)} Flow Graph: [0->{1},1->{2,3},2->{10},3->{4,5,6},4->{7,8},5->{7,8},6->{10},7->{9},8->{2,3},9->{2,3},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(8,2)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(B,A,0) [A >= 1 && B >= 1] (1,1) 2. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && 0 >= B] (1,1) 3. evalfbb3in(A,B,C) -> evalfbb4in(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && B >= 1] (?,1) 4. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 5. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1] (?,1) 6. evalfbb4in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (1,1) 7. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 + C] 8. evalfbbin(A,B,C) -> evalfbb3in(A,B,0) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= A] (?,1) 9. evalfbb1in(A,B,C) -> evalfbb3in(A,-1 + B,1 + C) [-1 + A + -1*C >= 0 (?,1) && C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 10. evalfreturnin(A,B,C) -> evalfstop(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0] (1,1) Signature: {(evalfbb1in,3) ;(evalfbb3in,3) ;(evalfbb4in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3)} Flow Graph: [0->{1},1->{3},2->{10},3->{4,5,6},4->{7,8},5->{7,8},6->{10},7->{9},8->{3},9->{2,3},10->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(B,A,0) [A >= 1 && B >= 1] (?,1) 2. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && 0 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfbb4in(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && B >= 1] (?,1) 4. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 5. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1] (?,1) 6. evalfbb4in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 + C] 8. evalfbbin(A,B,C) -> evalfbb3in(A,B,0) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= A] (?,1) 9. evalfbb1in(A,B,C) -> evalfbb3in(A,-1 + B,1 + C) [-1 + A + -1*C >= 0 (?,1) && C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 10. evalfreturnin(A,B,C) -> evalfstop(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb3in,3) ;(evalfbb4in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2,3},2->{10,11},3->{4,5,6},4->{7,8},5->{7,8},6->{10,11},7->{9},8->{2,3},9->{2,3},10->{} ,11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(8,2)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(B,A,0) [A >= 1 && B >= 1] (?,1) 2. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && 0 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfbb4in(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && B >= 1] (?,1) 4. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 5. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1] (?,1) 6. evalfbb4in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 + C] 8. evalfbbin(A,B,C) -> evalfbb3in(A,B,0) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= A] (?,1) 9. evalfbb1in(A,B,C) -> evalfbb3in(A,-1 + B,1 + C) [-1 + A + -1*C >= 0 (?,1) && C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 10. evalfreturnin(A,B,C) -> evalfstop(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb3in,3) ;(evalfbb4in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{3},2->{10,11},3->{4,5,6},4->{7,8},5->{7,8},6->{10,11},7->{9},8->{3},9->{2,3},10->{},11->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | `- p:[3,8,4,5,9,7] c: [9] | `- p:[3,8,4,5] c: [8] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(B,A,0) [A >= 1 && B >= 1] (?,1) 2. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && 0 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfbb4in(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0 && B >= 1] (?,1) 4. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 5. evalfbb4in(A,B,C) -> evalfbbin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1] (?,1) 6. evalfbb4in(A,B,C) -> evalfreturnin(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 0 (?,1) && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 + C] 8. evalfbbin(A,B,C) -> evalfbb3in(A,B,0) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= A] (?,1) 9. evalfbb1in(A,B,C) -> evalfbb3in(A,-1 + B,1 + C) [-1 + A + -1*C >= 0 (?,1) && C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 10. evalfreturnin(A,B,C) -> evalfstop(A,B,C) [C >= 0 && -1 + B + C >= 0 && -1 + A + C >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb3in,3) ;(evalfbb4in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{3},2->{10,11},3->{4,5,6},4->{7,8},5->{7,8},6->{10,11},7->{9},8->{3},9->{2,3},10->{},11->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | `- p:[3,8,4,5,9,7] c: [9] | `- p:[3,8,4,5] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,0.0,0.0.0] evalfstart ~> evalfentryin [A <= A, B <= B, C <= C] evalfentryin ~> evalfbb3in [A <= B, B <= A, C <= 0*K] evalfbb3in ~> evalfreturnin [A <= A, B <= B, C <= C] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C] evalfbb4in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb4in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb4in ~> evalfreturnin [A <= A, B <= B, C <= C] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= 0*K] evalfbb1in ~> evalfbb3in [A <= A, B <= B, C <= A] evalfreturnin ~> evalfstop [A <= A, B <= B, C <= C] evalfreturnin ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= B] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= 0*K] evalfbb4in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb4in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb1in ~> evalfbb3in [A <= A, B <= B, C <= A] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C] + Loop: [0.0.0 <= K + C] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= 0*K] evalfbb4in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb4in ~> evalfbbin [A <= A, B <= B, C <= C] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.0.0] evalfstart ~> evalfentryin [] evalfentryin ~> evalfbb3in [A ~=> B,B ~=> A,K ~=> C] evalfbb3in ~> evalfreturnin [] evalfbb3in ~> evalfbb4in [] evalfbb4in ~> evalfbbin [] evalfbb4in ~> evalfbbin [] evalfbb4in ~> evalfreturnin [] evalfbbin ~> evalfbb1in [] evalfbbin ~> evalfbb3in [K ~=> C] evalfbb1in ~> evalfbb3in [A ~=> C] evalfreturnin ~> evalfstop [] evalfreturnin ~> exitus616 [] + Loop: [B ~=> 0.0] evalfbb3in ~> evalfbb4in [] evalfbbin ~> evalfbb3in [K ~=> C] evalfbb4in ~> evalfbbin [] evalfbb4in ~> evalfbbin [] evalfbb1in ~> evalfbb3in [A ~=> C] evalfbbin ~> evalfbb1in [] + Loop: [C ~+> 0.0.0,K ~+> 0.0.0] evalfbb3in ~> evalfbb4in [] evalfbbin ~> evalfbb3in [K ~=> C] evalfbb4in ~> evalfbbin [] evalfbb4in ~> evalfbbin [] + Applied Processor: LareProcessor + Details: evalfstart ~> exitus616 [A ~=> B ,A ~=> 0.0 ,B ~=> A ,B ~=> C ,K ~=> C ,A ~+> tick ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] evalfstart ~> evalfstop [A ~=> B ,A ~=> 0.0 ,B ~=> A ,B ~=> C ,K ~=> C ,A ~+> tick ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] + evalfbb4in> [A ~=> C ,B ~=> 0.0 ,K ~=> C ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,C ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] evalfbb3in> [A ~=> C ,B ~=> 0.0 ,K ~=> C ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,B ~*> tick ,C ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] + evalfbbin> [K ~=> C,C ~+> 0.0.0,C ~+> tick,tick ~+> tick,K ~+> 0.0.0,K ~+> tick] evalfbb4in> [K ~=> C,C ~+> 0.0.0,C ~+> tick,tick ~+> tick,K ~+> 0.0.0,K ~+> tick] evalfbb3in> [K ~=> C,C ~+> 0.0.0,C ~+> tick,tick ~+> tick,K ~+> 0.0.0,K ~+> tick] YES(?,POLY)