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