YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(0,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (1,1) 1. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(U,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [63 >= B] (?,1) 2. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 3. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 4. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 5. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 6. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [B >= 64] (?,1) Signature: {(f0,20);(f101,20);(f14,20);(f57,20);(f6,20)} Flow Graph: [0->{1,6},1->{1,6},2->{2,5},3->{3,4},4->{},5->{3,4},6->{2,5}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(0,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (1,1) 1. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(U,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [63 >= B] (?,1) 2. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 3. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 4. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (1,1) 5. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (1,1) 6. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [B >= 64] (1,1) Signature: {(f0,20);(f101,20);(f14,20);(f57,20);(f6,20)} Flow Graph: [0->{1,6},1->{1,6},2->{2,5},3->{3,4},4->{},5->{3,4},6->{2,5}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,6),(5,4),(6,5)] * Step 3: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(0,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (1,1) 1. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(U,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [63 >= B] (?,1) 2. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 3. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 4. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (1,1) 5. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (1,1) 6. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [B >= 64] (1,1) Signature: {(f0,20);(f101,20);(f14,20);(f57,20);(f6,20)} Flow Graph: [0->{1},1->{1,6},2->{2,5},3->{3,4},4->{},5->{3},6->{2}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(0,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (1,1) 1. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(U,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [63 >= B] (?,1) 2. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 3. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 4. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 5. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 6. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [B >= 64] (?,1) 7. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) Signature: {(exitus616,20);(f0,20);(f101,20);(f14,20);(f57,20);(f6,20)} Flow Graph: [0->{1,6},1->{1,6},2->{2,5},3->{3,4,7},4->{},5->{3,4,7},6->{2,5},7->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,6),(5,4),(6,5)] * Step 5: LooptreeTransformer WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(0,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (1,1) 1. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(U,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [63 >= B] (?,1) 2. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 3. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 4. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 5. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 6. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [B >= 64] (?,1) 7. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) Signature: {(exitus616,20);(f0,20);(f101,20);(f14,20);(f57,20);(f6,20)} Flow Graph: [0->{1},1->{1,6},2->{2,5},3->{3,4,7},4->{},5->{3,7},6->{2},7->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7] | +- p:[1] c: [1] | +- p:[2] c: [2] | `- p:[3] c: [3] * Step 6: SizeAbstraction WORST_CASE(?,O(1)) + Considered Problem: (Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(0,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (1,1) 1. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f6(U,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [63 >= B] (?,1) 2. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 3. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,-1 + C,U + V,W,X + Y,Z,A1 + B1,C1,D1 + E1,F1,D1 + E1 + U + V,-1*D1 + -1*E1 + U + V[C >= 0] (?,1) ,A1 + B1 + X + Y,-1*A1 + -1*B1 + X + Y,G1,H1,I1 + J1,J1 + K1,J1) 4. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 5. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f57(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [0 >= 1 + C] (?,1) 6. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f14(A,B,7,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [B >= 64] (?,1) 7. f57(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) Signature: {(exitus616,20);(f0,20);(f101,20);(f14,20);(f57,20);(f6,20)} Flow Graph: [0->{1},1->{1,6},2->{2,5},3->{3,4,7},4->{},5->{3,7},6->{2},7->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7] | +- p:[1] c: [1] | +- p:[2] c: [2] | `- p:[3] c: [3]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,0.0,0.1,0.2] f0 ~> f6 [A <= 0*K, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] f6 ~> f6 [A <= unknown, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] f14 ~> f14 [A <= A, B <= B, C <= K + C, D <= unknown, E <= unknown, F <= unknown, G <= unknown, H <= unknown, I <= unknown, J <= unknown, K <= unknown, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= unknown, Q <= unknown, R <= unknown, S <= unknown, T <= unknown] f57 ~> f57 [A <= A, B <= B, C <= K + C, D <= unknown, E <= unknown, F <= unknown, G <= unknown, H <= unknown, I <= unknown, J <= unknown, K <= unknown, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= unknown, Q <= unknown, R <= unknown, S <= unknown, T <= unknown] f57 ~> f101 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] f14 ~> f57 [A <= A, B <= B, C <= 7*K, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] f6 ~> f14 [A <= A, B <= B, C <= 7*K, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] f57 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] + Loop: [0.0 <= 64*K + B] f6 ~> f6 [A <= unknown, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R, S <= S, T <= T] + Loop: [0.1 <= K + C] f14 ~> f14 [A <= A, B <= B, C <= K + C, D <= unknown, E <= unknown, F <= unknown, G <= unknown, H <= unknown, I <= unknown, J <= unknown, K <= unknown, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= unknown, Q <= unknown, R <= unknown, S <= unknown, T <= unknown] + Loop: [0.2 <= K + C] f57 ~> f57 [A <= A, B <= B, C <= K + C, D <= unknown, E <= unknown, F <= unknown, G <= unknown, H <= unknown, I <= unknown, J <= unknown, K <= unknown, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= unknown, Q <= unknown, R <= unknown, S <= unknown, T <= unknown] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,0.0,0.1,0.2] f0 ~> f6 [K ~=> A,K ~=> B] f6 ~> f6 [huge ~=> A,B ~+> B,K ~+> B] f14 ~> f14 [huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,C ~+> C ,K ~+> C] f57 ~> f57 [huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,C ~+> C ,K ~+> C] f57 ~> f101 [] f14 ~> f57 [K ~=> C] f6 ~> f14 [K ~=> C] f57 ~> exitus616 [] + Loop: [B ~+> 0.0,K ~*> 0.0] f6 ~> f6 [huge ~=> A,B ~+> B,K ~+> B] + Loop: [C ~+> 0.1,K ~+> 0.1] f14 ~> f14 [huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,C ~+> C ,K ~+> C] + Loop: [C ~+> 0.2,K ~+> 0.2] f57 ~> f57 [huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,C ~+> C ,K ~+> C] + Applied Processor: LareProcessor + Details: f0 ~> exitus616 [K ~=> A ,K ~=> B ,K ~=> C ,huge ~=> A ,huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.2 ,K ~+> tick ,K ~*> B ,K ~*> C ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> tick] f0 ~> f101 [K ~=> A ,K ~=> B ,K ~=> C ,huge ~=> A ,huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.2 ,K ~+> tick ,K ~*> B ,K ~*> C ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> tick] + f6> [huge ~=> A ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,B ~*> B ,K ~*> B ,K ~*> 0.0 ,K ~*> tick] + f14> [huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,C ~+> C ,C ~+> 0.1 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.1 ,K ~+> tick ,C ~*> C ,K ~*> C] + f57> [huge ~=> D ,huge ~=> E ,huge ~=> F ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> P ,huge ~=> Q ,huge ~=> R ,huge ~=> S ,huge ~=> T ,C ~+> C ,C ~+> 0.2 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.2 ,K ~+> tick ,C ~*> C ,K ~*> C] YES(?,O(1))