YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalEx1start(A,B,C,D) -> evalEx1entryin(A,B,C,D) True (1,1) 1. evalEx1entryin(A,B,C,D) -> evalEx1bb6in(0,A,C,D) True (?,1) 2. evalEx1bb6in(A,B,C,D) -> evalEx1bbin(A,B,C,D) [A >= 0 && B >= 1 + A] (?,1) 3. evalEx1bb6in(A,B,C,D) -> evalEx1returnin(A,B,C,D) [A >= 0 && A >= B] (?,1) 4. evalEx1bbin(A,B,C,D) -> evalEx1bb4in(A,B,1 + A,B) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalEx1bb4in(A,B,C,D) -> evalEx1bb1in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1 + C] 6. evalEx1bb4in(A,B,C,D) -> evalEx1bb5in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= D] 7. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + E] 8. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= 1] 9. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,1 + C,D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalEx1bb5in(A,B,C,D) -> evalEx1bb6in(1 + A,D,C,D) [C + -1*D >= 0 (?,1) && B + -1*D >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] 11. evalEx1returnin(A,B,C,D) -> evalEx1stop(A,B,C,D) [A + -1*B >= 0 && A >= 0] (?,1) Signature: {(evalEx1bb1in,4) ;(evalEx1bb4in,4) ;(evalEx1bb5in,4) ;(evalEx1bb6in,4) ;(evalEx1bbin,4) ;(evalEx1entryin,4) ;(evalEx1returnin,4) ;(evalEx1start,4) ;(evalEx1stop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{7,8,9},6->{10},7->{5,6},8->{5,6},9->{5,6},10->{2,3},11->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalEx1start(A,B,C,D) -> evalEx1entryin(A,B,C,D) True (1,1) 1. evalEx1entryin(A,B,C,D) -> evalEx1bb6in(0,A,C,D) True (1,1) 2. evalEx1bb6in(A,B,C,D) -> evalEx1bbin(A,B,C,D) [A >= 0 && B >= 1 + A] (?,1) 3. evalEx1bb6in(A,B,C,D) -> evalEx1returnin(A,B,C,D) [A >= 0 && A >= B] (1,1) 4. evalEx1bbin(A,B,C,D) -> evalEx1bb4in(A,B,1 + A,B) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalEx1bb4in(A,B,C,D) -> evalEx1bb1in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1 + C] 6. evalEx1bb4in(A,B,C,D) -> evalEx1bb5in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= D] 7. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + E] 8. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= 1] 9. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,1 + C,D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalEx1bb5in(A,B,C,D) -> evalEx1bb6in(1 + A,D,C,D) [C + -1*D >= 0 (?,1) && B + -1*D >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] 11. evalEx1returnin(A,B,C,D) -> evalEx1stop(A,B,C,D) [A + -1*B >= 0 && A >= 0] (1,1) Signature: {(evalEx1bb1in,4) ;(evalEx1bb4in,4) ;(evalEx1bb5in,4) ;(evalEx1bb6in,4) ;(evalEx1bbin,4) ;(evalEx1entryin,4) ;(evalEx1returnin,4) ;(evalEx1start,4) ;(evalEx1stop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{7,8,9},6->{10},7->{5,6},8->{5,6},9->{5,6},10->{2,3},11->{}] + Applied Processor: AddSinks + Details: () * Step 3: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalEx1start(A,B,C,D) -> evalEx1entryin(A,B,C,D) True (1,1) 1. evalEx1entryin(A,B,C,D) -> evalEx1bb6in(0,A,C,D) True (?,1) 2. evalEx1bb6in(A,B,C,D) -> evalEx1bbin(A,B,C,D) [A >= 0 && B >= 1 + A] (?,1) 3. evalEx1bb6in(A,B,C,D) -> evalEx1returnin(A,B,C,D) [A >= 0 && A >= B] (?,1) 4. evalEx1bbin(A,B,C,D) -> evalEx1bb4in(A,B,1 + A,B) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalEx1bb4in(A,B,C,D) -> evalEx1bb1in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1 + C] 6. evalEx1bb4in(A,B,C,D) -> evalEx1bb5in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= D] 7. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + E] 8. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= 1] 9. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,1 + C,D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalEx1bb5in(A,B,C,D) -> evalEx1bb6in(1 + A,D,C,D) [C + -1*D >= 0 (?,1) && B + -1*D >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] 11. evalEx1returnin(A,B,C,D) -> evalEx1stop(A,B,C,D) [A + -1*B >= 0 && A >= 0] (?,1) 12. evalEx1returnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalEx1bb1in,4) ;(evalEx1bb4in,4) ;(evalEx1bb5in,4) ;(evalEx1bb6in,4) ;(evalEx1bbin,4) ;(evalEx1entryin,4) ;(evalEx1returnin,4) ;(evalEx1start,4) ;(evalEx1stop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11,12},4->{5,6},5->{7,8,9},6->{10},7->{5,6},8->{5,6},9->{5,6},10->{2,3},11->{} ,12->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[2,10,6,4,7,5,8,9] c: [10] | `- p:[5,7,8,9] c: [9] | `- p:[5,7,8] c: [8] | `- p:[5,7] c: [7] * Step 4: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. evalEx1start(A,B,C,D) -> evalEx1entryin(A,B,C,D) True (1,1) 1. evalEx1entryin(A,B,C,D) -> evalEx1bb6in(0,A,C,D) True (?,1) 2. evalEx1bb6in(A,B,C,D) -> evalEx1bbin(A,B,C,D) [A >= 0 && B >= 1 + A] (?,1) 3. evalEx1bb6in(A,B,C,D) -> evalEx1returnin(A,B,C,D) [A >= 0 && A >= B] (?,1) 4. evalEx1bbin(A,B,C,D) -> evalEx1bb4in(A,B,1 + A,B) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalEx1bb4in(A,B,C,D) -> evalEx1bb1in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1 + C] 6. evalEx1bb4in(A,B,C,D) -> evalEx1bb5in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= D] 7. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + E] 8. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= 1] 9. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,1 + C,D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalEx1bb5in(A,B,C,D) -> evalEx1bb6in(1 + A,D,C,D) [C + -1*D >= 0 (?,1) && B + -1*D >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] 11. evalEx1returnin(A,B,C,D) -> evalEx1stop(A,B,C,D) [A + -1*B >= 0 && A >= 0] (?,1) 12. evalEx1returnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalEx1bb1in,4) ;(evalEx1bb4in,4) ;(evalEx1bb5in,4) ;(evalEx1bb6in,4) ;(evalEx1bbin,4) ;(evalEx1entryin,4) ;(evalEx1returnin,4) ;(evalEx1start,4) ;(evalEx1stop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11,12},4->{5,6},5->{7,8,9},6->{10},7->{5,6},8->{5,6},9->{5,6},10->{2,3},11->{} ,12->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[2,10,6,4,7,5,8,9] c: [10] | `- p:[5,7,8,9] c: [9] | `- p:[5,7,8] c: [8] | `- p:[5,7] c: [7]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 5: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalEx1start ~> evalEx1entryin [A <= A, B <= B, C <= C, D <= D] evalEx1entryin ~> evalEx1bb6in [A <= 0*K, B <= A, C <= C, D <= D] evalEx1bb6in ~> evalEx1bbin [A <= A, B <= B, C <= C, D <= D] evalEx1bb6in ~> evalEx1returnin [A <= A, B <= B, C <= C, D <= D] evalEx1bbin ~> evalEx1bb4in [A <= A, B <= B, C <= B, D <= B] evalEx1bb4in ~> evalEx1bb1in [A <= A, B <= B, C <= C, D <= D] evalEx1bb4in ~> evalEx1bb5in [A <= A, B <= B, C <= C, D <= D] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= D, D <= D] evalEx1bb5in ~> evalEx1bb6in [A <= B, B <= D, C <= C, D <= D] evalEx1returnin ~> evalEx1stop [A <= A, B <= B, C <= C, D <= D] evalEx1returnin ~> exitus616 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0 <= A + B + D] evalEx1bb6in ~> evalEx1bbin [A <= A, B <= B, C <= C, D <= D] evalEx1bb5in ~> evalEx1bb6in [A <= B, B <= D, C <= C, D <= D] evalEx1bb4in ~> evalEx1bb5in [A <= A, B <= B, C <= C, D <= D] evalEx1bbin ~> evalEx1bb4in [A <= A, B <= B, C <= B, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb4in ~> evalEx1bb1in [A <= A, B <= B, C <= C, D <= D] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= D, D <= D] + Loop: [0.0.0 <= B + C] evalEx1bb4in ~> evalEx1bb1in [A <= A, B <= B, C <= C, D <= D] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= D, D <= D] + Loop: [0.0.0.0 <= K + D] evalEx1bb4in ~> evalEx1bb1in [A <= A, B <= B, C <= C, D <= D] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] + Loop: [0.0.0.0.0 <= C + D] evalEx1bb4in ~> evalEx1bb1in [A <= A, B <= B, C <= C, D <= D] evalEx1bb1in ~> evalEx1bb4in [A <= A, B <= B, C <= C, D <= B] + Applied Processor: FlowAbstraction + Details: () * Step 6: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalEx1start ~> evalEx1entryin [] evalEx1entryin ~> evalEx1bb6in [A ~=> B,K ~=> A] evalEx1bb6in ~> evalEx1bbin [] evalEx1bb6in ~> evalEx1returnin [] evalEx1bbin ~> evalEx1bb4in [B ~=> C,B ~=> D] evalEx1bb4in ~> evalEx1bb1in [] evalEx1bb4in ~> evalEx1bb5in [] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb1in ~> evalEx1bb4in [D ~=> C] evalEx1bb5in ~> evalEx1bb6in [B ~=> A,D ~=> B] evalEx1returnin ~> evalEx1stop [] evalEx1returnin ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,D ~+> 0.0] evalEx1bb6in ~> evalEx1bbin [] evalEx1bb5in ~> evalEx1bb6in [B ~=> A,D ~=> B] evalEx1bb4in ~> evalEx1bb5in [] evalEx1bbin ~> evalEx1bb4in [B ~=> C,B ~=> D] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb4in ~> evalEx1bb1in [] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb1in ~> evalEx1bb4in [D ~=> C] + Loop: [B ~+> 0.0.0,C ~+> 0.0.0] evalEx1bb4in ~> evalEx1bb1in [] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb1in ~> evalEx1bb4in [D ~=> C] + Loop: [D ~+> 0.0.0.0,K ~+> 0.0.0.0] evalEx1bb4in ~> evalEx1bb1in [] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] + Loop: [C ~+> 0.0.0.0.0,D ~+> 0.0.0.0.0] evalEx1bb4in ~> evalEx1bb1in [] evalEx1bb1in ~> evalEx1bb4in [B ~=> D] + Applied Processor: LareProcessor + Details: evalEx1start ~> exitus616 [A ~=> B ,A ~=> C ,A ~=> D ,K ~=> A ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,D ~+> 0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,D ~*> tick ,K ~*> tick] evalEx1start ~> evalEx1stop [A ~=> B ,A ~=> C ,A ~=> D ,K ~=> A ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,D ~+> 0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,D ~*> tick ,K ~*> tick] + evalEx1bb6in> [B ~=> A ,B ~=> C ,B ~=> D ,A ~+> 0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,D ~+> 0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> 0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,D ~*> tick ,K ~*> tick] + evalEx1bb4in> [B ~=> C ,B ~=> D ,D ~=> C ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> 0.0.0.0.0 ,C ~+> tick ,D ~+> 0.0.0.0 ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> 0.0.0.0.0 ,B ~*> tick ,C ~*> tick ,D ~*> 0.0.0.0.0 ,D ~*> tick ,K ~*> tick] + evalEx1bb1in> [B ~=> D ,B ~+> 0.0.0.0.0 ,B ~+> tick ,C ~+> 0.0.0.0.0 ,C ~+> tick ,D ~+> 0.0.0.0 ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> tick ,C ~*> tick ,D ~*> tick ,K ~*> tick] evalEx1bb4in> [B ~=> D ,B ~+> 0.0.0.0.0 ,B ~+> tick ,C ~+> 0.0.0.0.0 ,C ~+> tick ,D ~+> 0.0.0.0 ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,C ~*> tick ,D ~*> tick ,K ~*> tick] + evalEx1bb1in> [B ~=> D ,C ~+> 0.0.0.0.0 ,C ~+> tick ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick] evalEx1bb4in> [B ~=> D ,C ~+> 0.0.0.0.0 ,C ~+> tick ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick] YES(?,POLY)