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