WORST_CASE(Omega(1),?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1==arg1P_1 && arg3==arg3P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg1==arg1P_2 && arg2==arg2P_2 ], cost: 1
      4: f3 -> f4 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ x14_1<0 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      5: f3 -> f4 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ x187_1>0 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      6: f3 -> f5 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ x18_1==0 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      2: f4 -> f7 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ 1==arg1P_3 && arg2==arg2P_3 && arg3==arg3P_3 ], cost: 1
      7: f7 -> f6 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 ], cost: 1
      3: f5 -> f8 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg1P_4==-1 && arg2==arg2P_4 && arg3==arg3P_4 ], cost: 1
      8: f8 -> f6 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 ], cost: 1
     11: f6 -> f9 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, [ arg1>0 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     12: f6 -> f10 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1<=0 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 ], cost: 1
      9: f9 -> f12 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_10==1+arg1 && arg2==arg2P_10 && arg3==arg3P_10 ], cost: 1
     13: f12 -> f11 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 ], cost: 1
     10: f10 -> f13 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, [ arg1P_11==-1+arg1 && arg2==arg2P_11 && arg3==arg3P_11 ], cost: 1
     14: f13 -> f11 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 ], cost: 1
     17: f11 -> f14 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1>0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 ], cost: 1
     18: f11 -> f15 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [ arg1<=0 && arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 ], cost: 1
     15: f14 -> f17 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1P_16==1+arg1 && arg2==arg2P_16 && arg3==arg3P_16 ], cost: 1
     19: f17 -> f16 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, [ arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 ], cost: 1
     16: f15 -> f18 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1P_17==-1+arg1 && arg2==arg2P_17 && arg3==arg3P_17 ], cost: 1
     20: f18 -> f16 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, [ arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 ], cost: 1
     23: f16 -> f19 : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, [ arg1>0 && arg1==arg1P_24 && arg2==arg2P_24 && arg3==arg3P_24 ], cost: 1
     24: f16 -> f20 : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, [ arg1<=0 && arg1==arg1P_25 && arg2==arg2P_25 && arg3==arg3P_25 ], cost: 1
     21: f19 -> f22 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, [ arg1P_22==1+arg1 && arg2==arg2P_22 && arg3==arg3P_22 ], cost: 1
     25: f22 -> f21 : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, [ arg1==arg1P_26 && arg2==arg2P_26 && arg3==arg3P_26 ], cost: 1
     22: f20 -> f23 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [ arg1P_23==-1+arg1 && arg2==arg2P_23 && arg3==arg3P_23 ], cost: 1
     26: f23 -> f21 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, [ arg1==arg1P_27 && arg2==arg2P_27 && arg3==arg3P_27 ], cost: 1
     29: f21 -> f24 : arg1'=arg1P_30, arg2'=arg2P_30, arg3'=arg3P_30, [ arg1>0 && arg1==arg1P_30 && arg2==arg2P_30 && arg3==arg3P_30 ], cost: 1
     30: f21 -> f25 : arg1'=arg1P_31, arg2'=arg2P_31, arg3'=arg3P_31, [ arg1<=0 && arg1==arg1P_31 && arg2==arg2P_31 && arg3==arg3P_31 ], cost: 1
     27: f24 -> f27 : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1P_28==1+arg1 && arg2==arg2P_28 && arg3==arg3P_28 ], cost: 1
     31: f27 -> f26 : arg1'=arg1P_32, arg2'=arg2P_32, arg3'=arg3P_32, [ arg1==arg1P_32 && arg2==arg2P_32 && arg3==arg3P_32 ], cost: 1
     28: f25 -> f28 : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [ arg1P_29==-1+arg1 && arg2==arg2P_29 && arg3==arg3P_29 ], cost: 1
     32: f28 -> f26 : arg1'=arg1P_33, arg2'=arg2P_33, arg3'=arg3P_33, [ arg1==arg1P_33 && arg2==arg2P_33 && arg3==arg3P_33 ], cost: 1
     35: f26 -> f29 : arg1'=arg1P_36, arg2'=arg2P_36, arg3'=arg3P_36, [ arg1>0 && arg1==arg1P_36 && arg2==arg2P_36 && arg3==arg3P_36 ], cost: 1
     36: f26 -> f30 : arg1'=arg1P_37, arg2'=arg2P_37, arg3'=arg3P_37, [ arg1<=0 && arg1==arg1P_37 && arg2==arg2P_37 && arg3==arg3P_37 ], cost: 1
     33: f29 -> f32 : arg1'=arg1P_34, arg2'=arg2P_34, arg3'=arg3P_34, [ arg1P_34==1+arg1 && arg2==arg2P_34 && arg3==arg3P_34 ], cost: 1
     37: f32 -> f31 : arg1'=arg1P_38, arg2'=arg2P_38, arg3'=arg3P_38, [ arg1==arg1P_38 && arg2==arg2P_38 && arg3==arg3P_38 ], cost: 1
     34: f30 -> f33 : arg1'=arg1P_35, arg2'=arg2P_35, arg3'=arg3P_35, [ arg1P_35==-1+arg1 && arg2==arg2P_35 && arg3==arg3P_35 ], cost: 1
     38: f33 -> f31 : arg1'=arg1P_39, arg2'=arg2P_39, arg3'=arg3P_39, [ arg1==arg1P_39 && arg2==arg2P_39 && arg3==arg3P_39 ], cost: 1
     41: f31 -> f34 : arg1'=arg1P_42, arg2'=arg2P_42, arg3'=arg3P_42, [ arg1>0 && arg1==arg1P_42 && arg2==arg2P_42 && arg3==arg3P_42 ], cost: 1
     42: f31 -> f35 : arg1'=arg1P_43, arg2'=arg2P_43, arg3'=arg3P_43, [ arg1<=0 && arg1==arg1P_43 && arg2==arg2P_43 && arg3==arg3P_43 ], cost: 1
     39: f34 -> f37 : arg1'=arg1P_40, arg2'=arg2P_40, arg3'=arg3P_40, [ arg1P_40==1+arg1 && arg2==arg2P_40 && arg3==arg3P_40 ], cost: 1
     43: f37 -> f36 : arg1'=arg1P_44, arg2'=arg2P_44, arg3'=arg3P_44, [ arg1==arg1P_44 && arg2==arg2P_44 && arg3==arg3P_44 ], cost: 1
     40: f35 -> f38 : arg1'=arg1P_41, arg2'=arg2P_41, arg3'=arg3P_41, [ arg1P_41==-1+arg1 && arg2==arg2P_41 && arg3==arg3P_41 ], cost: 1
     44: f38 -> f36 : arg1'=arg1P_45, arg2'=arg2P_45, arg3'=arg3P_45, [ arg1==arg1P_45 && arg2==arg2P_45 && arg3==arg3P_45 ], cost: 1
     47: f36 -> f39 : arg1'=arg1P_48, arg2'=arg2P_48, arg3'=arg3P_48, [ arg1>0 && arg1==arg1P_48 && arg2==arg2P_48 && arg3==arg3P_48 ], cost: 1
     48: f36 -> f40 : arg1'=arg1P_49, arg2'=arg2P_49, arg3'=arg3P_49, [ arg1<=0 && arg1==arg1P_49 && arg2==arg2P_49 && arg3==arg3P_49 ], cost: 1
     45: f39 -> f42 : arg1'=arg1P_46, arg2'=arg2P_46, arg3'=arg3P_46, [ arg1P_46==1+arg1 && arg2==arg2P_46 && arg3==arg3P_46 ], cost: 1
     49: f42 -> f41 : arg1'=arg1P_50, arg2'=arg2P_50, arg3'=arg3P_50, [ arg1==arg1P_50 && arg2==arg2P_50 && arg3==arg3P_50 ], cost: 1
     46: f40 -> f43 : arg1'=arg1P_47, arg2'=arg2P_47, arg3'=arg3P_47, [ arg1P_47==-1+arg1 && arg2==arg2P_47 && arg3==arg3P_47 ], cost: 1
     50: f43 -> f41 : arg1'=arg1P_51, arg2'=arg2P_51, arg3'=arg3P_51, [ arg1==arg1P_51 && arg2==arg2P_51 && arg3==arg3P_51 ], cost: 1
     53: f41 -> f44 : arg1'=arg1P_54, arg2'=arg2P_54, arg3'=arg3P_54, [ arg1>0 && arg1==arg1P_54 && arg2==arg2P_54 && arg3==arg3P_54 ], cost: 1
     54: f41 -> f45 : arg1'=arg1P_55, arg2'=arg2P_55, arg3'=arg3P_55, [ arg1<=0 && arg1==arg1P_55 && arg2==arg2P_55 && arg3==arg3P_55 ], cost: 1
     51: f44 -> f47 : arg1'=arg1P_52, arg2'=arg2P_52, arg3'=arg3P_52, [ arg1P_52==1+arg1 && arg2==arg2P_52 && arg3==arg3P_52 ], cost: 1
     55: f47 -> f46 : arg1'=arg1P_56, arg2'=arg2P_56, arg3'=arg3P_56, [ arg1==arg1P_56 && arg2==arg2P_56 && arg3==arg3P_56 ], cost: 1
     52: f45 -> f48 : arg1'=arg1P_53, arg2'=arg2P_53, arg3'=arg3P_53, [ arg1P_53==-1+arg1 && arg2==arg2P_53 && arg3==arg3P_53 ], cost: 1
     56: f48 -> f46 : arg1'=arg1P_57, arg2'=arg2P_57, arg3'=arg3P_57, [ arg1==arg1P_57 && arg2==arg2P_57 && arg3==arg3P_57 ], cost: 1
     59: f46 -> f49 : arg1'=arg1P_60, arg2'=arg2P_60, arg3'=arg3P_60, [ arg2<100 && arg3<100 && arg1==arg1P_60 && arg2==arg2P_60 && arg3==arg3P_60 ], cost: 1
     61: f46 -> f52 : arg1'=arg1P_62, arg2'=arg2P_62, arg3'=arg3P_62, [ arg2>=100 && arg1==arg1P_62 && arg2==arg2P_62 && arg3==arg3P_62 ], cost: 1
     62: f46 -> f52 : arg1'=arg1P_63, arg2'=arg2P_63, arg3'=arg3P_63, [ arg3>=100 && arg1==arg1P_63 && arg2==arg2P_63 && arg3==arg3P_63 ], cost: 1
     57: f49 -> f50 : arg1'=arg1P_58, arg2'=arg2P_58, arg3'=arg3P_58, [ arg2P_58==arg2+arg1 && arg1==arg1P_58 && arg3==arg3P_58 ], cost: 1
     58: f50 -> f51 : arg1'=arg1P_59, arg2'=arg2P_59, arg3'=arg3P_59, [ arg3P_59==arg3-arg1 && arg1==arg1P_59 && arg2==arg2P_59 ], cost: 1
     60: f51 -> f46 : arg1'=arg1P_61, arg2'=arg2P_61, arg3'=arg3P_61, [ arg1==arg1P_61 && arg2==arg2P_61 && arg3==arg3P_61 ], cost: 1
     63: __init -> f1 : arg1'=arg1P_64, arg2'=arg2P_64, arg3'=arg3P_64, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     63: __init -> f1 : arg1'=arg1P_64, arg2'=arg2P_64, arg3'=arg3P_64, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1==arg1P_1 && arg3==arg3P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg1==arg1P_2 && arg2==arg2P_2 ], cost: 1
      4: f3 -> f4 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ x14_1<0 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      5: f3 -> f4 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ x187_1>0 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      6: f3 -> f5 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ x18_1==0 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      2: f4 -> f7 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ 1==arg1P_3 && arg2==arg2P_3 && arg3==arg3P_3 ], cost: 1
      7: f7 -> f6 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 ], cost: 1
      3: f5 -> f8 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg1P_4==-1 && arg2==arg2P_4 && arg3==arg3P_4 ], cost: 1
      8: f8 -> f6 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 ], cost: 1
     11: f6 -> f9 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, [ arg1>0 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     12: f6 -> f10 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1<=0 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 ], cost: 1
      9: f9 -> f12 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_10==1+arg1 && arg2==arg2P_10 && arg3==arg3P_10 ], cost: 1
     13: f12 -> f11 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 ], cost: 1
     10: f10 -> f13 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, [ arg1P_11==-1+arg1 && arg2==arg2P_11 && arg3==arg3P_11 ], cost: 1
     14: f13 -> f11 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 ], cost: 1
     17: f11 -> f14 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1>0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 ], cost: 1
     18: f11 -> f15 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [ arg1<=0 && arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 ], cost: 1
     15: f14 -> f17 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1P_16==1+arg1 && arg2==arg2P_16 && arg3==arg3P_16 ], cost: 1
     19: f17 -> f16 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, [ arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 ], cost: 1
     16: f15 -> f18 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1P_17==-1+arg1 && arg2==arg2P_17 && arg3==arg3P_17 ], cost: 1
     20: f18 -> f16 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, [ arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 ], cost: 1
     23: f16 -> f19 : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, [ arg1>0 && arg1==arg1P_24 && arg2==arg2P_24 && arg3==arg3P_24 ], cost: 1
     24: f16 -> f20 : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, [ arg1<=0 && arg1==arg1P_25 && arg2==arg2P_25 && arg3==arg3P_25 ], cost: 1
     21: f19 -> f22 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, [ arg1P_22==1+arg1 && arg2==arg2P_22 && arg3==arg3P_22 ], cost: 1
     25: f22 -> f21 : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, [ arg1==arg1P_26 && arg2==arg2P_26 && arg3==arg3P_26 ], cost: 1
     22: f20 -> f23 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [ arg1P_23==-1+arg1 && arg2==arg2P_23 && arg3==arg3P_23 ], cost: 1
     26: f23 -> f21 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, [ arg1==arg1P_27 && arg2==arg2P_27 && arg3==arg3P_27 ], cost: 1
     29: f21 -> f24 : arg1'=arg1P_30, arg2'=arg2P_30, arg3'=arg3P_30, [ arg1>0 && arg1==arg1P_30 && arg2==arg2P_30 && arg3==arg3P_30 ], cost: 1
     30: f21 -> f25 : arg1'=arg1P_31, arg2'=arg2P_31, arg3'=arg3P_31, [ arg1<=0 && arg1==arg1P_31 && arg2==arg2P_31 && arg3==arg3P_31 ], cost: 1
     27: f24 -> f27 : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1P_28==1+arg1 && arg2==arg2P_28 && arg3==arg3P_28 ], cost: 1
     31: f27 -> f26 : arg1'=arg1P_32, arg2'=arg2P_32, arg3'=arg3P_32, [ arg1==arg1P_32 && arg2==arg2P_32 && arg3==arg3P_32 ], cost: 1
     28: f25 -> f28 : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [ arg1P_29==-1+arg1 && arg2==arg2P_29 && arg3==arg3P_29 ], cost: 1
     32: f28 -> f26 : arg1'=arg1P_33, arg2'=arg2P_33, arg3'=arg3P_33, [ arg1==arg1P_33 && arg2==arg2P_33 && arg3==arg3P_33 ], cost: 1
     35: f26 -> f29 : arg1'=arg1P_36, arg2'=arg2P_36, arg3'=arg3P_36, [ arg1>0 && arg1==arg1P_36 && arg2==arg2P_36 && arg3==arg3P_36 ], cost: 1
     36: f26 -> f30 : arg1'=arg1P_37, arg2'=arg2P_37, arg3'=arg3P_37, [ arg1<=0 && arg1==arg1P_37 && arg2==arg2P_37 && arg3==arg3P_37 ], cost: 1
     33: f29 -> f32 : arg1'=arg1P_34, arg2'=arg2P_34, arg3'=arg3P_34, [ arg1P_34==1+arg1 && arg2==arg2P_34 && arg3==arg3P_34 ], cost: 1
     37: f32 -> f31 : arg1'=arg1P_38, arg2'=arg2P_38, arg3'=arg3P_38, [ arg1==arg1P_38 && arg2==arg2P_38 && arg3==arg3P_38 ], cost: 1
     34: f30 -> f33 : arg1'=arg1P_35, arg2'=arg2P_35, arg3'=arg3P_35, [ arg1P_35==-1+arg1 && arg2==arg2P_35 && arg3==arg3P_35 ], cost: 1
     38: f33 -> f31 : arg1'=arg1P_39, arg2'=arg2P_39, arg3'=arg3P_39, [ arg1==arg1P_39 && arg2==arg2P_39 && arg3==arg3P_39 ], cost: 1
     41: f31 -> f34 : arg1'=arg1P_42, arg2'=arg2P_42, arg3'=arg3P_42, [ arg1>0 && arg1==arg1P_42 && arg2==arg2P_42 && arg3==arg3P_42 ], cost: 1
     42: f31 -> f35 : arg1'=arg1P_43, arg2'=arg2P_43, arg3'=arg3P_43, [ arg1<=0 && arg1==arg1P_43 && arg2==arg2P_43 && arg3==arg3P_43 ], cost: 1
     39: f34 -> f37 : arg1'=arg1P_40, arg2'=arg2P_40, arg3'=arg3P_40, [ arg1P_40==1+arg1 && arg2==arg2P_40 && arg3==arg3P_40 ], cost: 1
     43: f37 -> f36 : arg1'=arg1P_44, arg2'=arg2P_44, arg3'=arg3P_44, [ arg1==arg1P_44 && arg2==arg2P_44 && arg3==arg3P_44 ], cost: 1
     40: f35 -> f38 : arg1'=arg1P_41, arg2'=arg2P_41, arg3'=arg3P_41, [ arg1P_41==-1+arg1 && arg2==arg2P_41 && arg3==arg3P_41 ], cost: 1
     44: f38 -> f36 : arg1'=arg1P_45, arg2'=arg2P_45, arg3'=arg3P_45, [ arg1==arg1P_45 && arg2==arg2P_45 && arg3==arg3P_45 ], cost: 1
     47: f36 -> f39 : arg1'=arg1P_48, arg2'=arg2P_48, arg3'=arg3P_48, [ arg1>0 && arg1==arg1P_48 && arg2==arg2P_48 && arg3==arg3P_48 ], cost: 1
     48: f36 -> f40 : arg1'=arg1P_49, arg2'=arg2P_49, arg3'=arg3P_49, [ arg1<=0 && arg1==arg1P_49 && arg2==arg2P_49 && arg3==arg3P_49 ], cost: 1
     45: f39 -> f42 : arg1'=arg1P_46, arg2'=arg2P_46, arg3'=arg3P_46, [ arg1P_46==1+arg1 && arg2==arg2P_46 && arg3==arg3P_46 ], cost: 1
     49: f42 -> f41 : arg1'=arg1P_50, arg2'=arg2P_50, arg3'=arg3P_50, [ arg1==arg1P_50 && arg2==arg2P_50 && arg3==arg3P_50 ], cost: 1
     46: f40 -> f43 : arg1'=arg1P_47, arg2'=arg2P_47, arg3'=arg3P_47, [ arg1P_47==-1+arg1 && arg2==arg2P_47 && arg3==arg3P_47 ], cost: 1
     50: f43 -> f41 : arg1'=arg1P_51, arg2'=arg2P_51, arg3'=arg3P_51, [ arg1==arg1P_51 && arg2==arg2P_51 && arg3==arg3P_51 ], cost: 1
     53: f41 -> f44 : arg1'=arg1P_54, arg2'=arg2P_54, arg3'=arg3P_54, [ arg1>0 && arg1==arg1P_54 && arg2==arg2P_54 && arg3==arg3P_54 ], cost: 1
     54: f41 -> f45 : arg1'=arg1P_55, arg2'=arg2P_55, arg3'=arg3P_55, [ arg1<=0 && arg1==arg1P_55 && arg2==arg2P_55 && arg3==arg3P_55 ], cost: 1
     51: f44 -> f47 : arg1'=arg1P_52, arg2'=arg2P_52, arg3'=arg3P_52, [ arg1P_52==1+arg1 && arg2==arg2P_52 && arg3==arg3P_52 ], cost: 1
     55: f47 -> f46 : arg1'=arg1P_56, arg2'=arg2P_56, arg3'=arg3P_56, [ arg1==arg1P_56 && arg2==arg2P_56 && arg3==arg3P_56 ], cost: 1
     52: f45 -> f48 : arg1'=arg1P_53, arg2'=arg2P_53, arg3'=arg3P_53, [ arg1P_53==-1+arg1 && arg2==arg2P_53 && arg3==arg3P_53 ], cost: 1
     56: f48 -> f46 : arg1'=arg1P_57, arg2'=arg2P_57, arg3'=arg3P_57, [ arg1==arg1P_57 && arg2==arg2P_57 && arg3==arg3P_57 ], cost: 1
     59: f46 -> f49 : arg1'=arg1P_60, arg2'=arg2P_60, arg3'=arg3P_60, [ arg2<100 && arg3<100 && arg1==arg1P_60 && arg2==arg2P_60 && arg3==arg3P_60 ], cost: 1
     57: f49 -> f50 : arg1'=arg1P_58, arg2'=arg2P_58, arg3'=arg3P_58, [ arg2P_58==arg2+arg1 && arg1==arg1P_58 && arg3==arg3P_58 ], cost: 1
     58: f50 -> f51 : arg1'=arg1P_59, arg2'=arg2P_59, arg3'=arg3P_59, [ arg3P_59==arg3-arg1 && arg1==arg1P_59 && arg2==arg2P_59 ], cost: 1
     60: f51 -> f46 : arg1'=arg1P_61, arg2'=arg2P_61, arg3'=arg3P_61, [ arg1==arg1P_61 && arg2==arg2P_61 && arg3==arg3P_61 ], cost: 1
     63: __init -> f1 : arg1'=arg1P_64, arg2'=arg2P_64, arg3'=arg3P_64, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg2'=arg2P_1, [], cost: 1
      1: f2 -> f3 : arg3'=arg3P_2, [], cost: 1
      5: f3 -> f4 : [], cost: 1
      6: f3 -> f5 : [], cost: 1
      2: f4 -> f7 : arg1'=1, [], cost: 1
      7: f7 -> f6 : [], cost: 1
      3: f5 -> f8 : arg1'=-1, [], cost: 1
      8: f8 -> f6 : [], cost: 1
     11: f6 -> f9 : [ arg1>0 ], cost: 1
     12: f6 -> f10 : [ arg1<=0 ], cost: 1
      9: f9 -> f12 : arg1'=1+arg1, [], cost: 1
     13: f12 -> f11 : [], cost: 1
     10: f10 -> f13 : arg1'=-1+arg1, [], cost: 1
     14: f13 -> f11 : [], cost: 1
     17: f11 -> f14 : [ arg1>0 ], cost: 1
     18: f11 -> f15 : [ arg1<=0 ], cost: 1
     15: f14 -> f17 : arg1'=1+arg1, [], cost: 1
     19: f17 -> f16 : [], cost: 1
     16: f15 -> f18 : arg1'=-1+arg1, [], cost: 1
     20: f18 -> f16 : [], cost: 1
     23: f16 -> f19 : [ arg1>0 ], cost: 1
     24: f16 -> f20 : [ arg1<=0 ], cost: 1
     21: f19 -> f22 : arg1'=1+arg1, [], cost: 1
     25: f22 -> f21 : [], cost: 1
     22: f20 -> f23 : arg1'=-1+arg1, [], cost: 1
     26: f23 -> f21 : [], cost: 1
     29: f21 -> f24 : [ arg1>0 ], cost: 1
     30: f21 -> f25 : [ arg1<=0 ], cost: 1
     27: f24 -> f27 : arg1'=1+arg1, [], cost: 1
     31: f27 -> f26 : [], cost: 1
     28: f25 -> f28 : arg1'=-1+arg1, [], cost: 1
     32: f28 -> f26 : [], cost: 1
     35: f26 -> f29 : [ arg1>0 ], cost: 1
     36: f26 -> f30 : [ arg1<=0 ], cost: 1
     33: f29 -> f32 : arg1'=1+arg1, [], cost: 1
     37: f32 -> f31 : [], cost: 1
     34: f30 -> f33 : arg1'=-1+arg1, [], cost: 1
     38: f33 -> f31 : [], cost: 1
     41: f31 -> f34 : [ arg1>0 ], cost: 1
     42: f31 -> f35 : [ arg1<=0 ], cost: 1
     39: f34 -> f37 : arg1'=1+arg1, [], cost: 1
     43: f37 -> f36 : [], cost: 1
     40: f35 -> f38 : arg1'=-1+arg1, [], cost: 1
     44: f38 -> f36 : [], cost: 1
     47: f36 -> f39 : [ arg1>0 ], cost: 1
     48: f36 -> f40 : [ arg1<=0 ], cost: 1
     45: f39 -> f42 : arg1'=1+arg1, [], cost: 1
     49: f42 -> f41 : [], cost: 1
     46: f40 -> f43 : arg1'=-1+arg1, [], cost: 1
     50: f43 -> f41 : [], cost: 1
     53: f41 -> f44 : [ arg1>0 ], cost: 1
     54: f41 -> f45 : [ arg1<=0 ], cost: 1
     51: f44 -> f47 : arg1'=1+arg1, [], cost: 1
     55: f47 -> f46 : [], cost: 1
     52: f45 -> f48 : arg1'=-1+arg1, [], cost: 1
     56: f48 -> f46 : [], cost: 1
     59: f46 -> f49 : [ arg2<100 && arg3<100 ], cost: 1
     57: f49 -> f50 : arg2'=arg2+arg1, [], cost: 1
     58: f50 -> f51 : arg3'=arg3-arg1, [], cost: 1
     60: f51 -> f46 : [], cost: 1
     63: __init -> f1 : arg1'=arg1P_64, arg2'=arg2P_64, arg3'=arg3P_64, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     68: f3 -> f6 : arg1'=1, [], cost: 3
     69: f3 -> f6 : arg1'=-1, [], cost: 3
     72: f6 -> f11 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     73: f6 -> f11 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     76: f11 -> f16 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     77: f11 -> f16 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     80: f16 -> f21 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     81: f16 -> f21 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     84: f21 -> f26 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     85: f21 -> f26 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     88: f26 -> f31 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     89: f26 -> f31 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     92: f31 -> f36 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     93: f31 -> f36 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     96: f36 -> f41 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     97: f36 -> f41 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
    100: f41 -> f46 : arg1'=1+arg1, [ arg1>0 ], cost: 3
    101: f41 -> f46 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
    104: f46 -> f46 : arg2'=arg2+arg1, arg3'=arg3-arg1, [ arg2<100 && arg3<100 ], cost: 4
     65: __init -> f3 : arg1'=arg1P_64, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Accelerating simple loops of location 47.
   Accelerating the following rules:
    104: f46 -> f46 : arg2'=arg2+arg1, arg3'=arg3-arg1, [ arg2<100 && arg3<100 ], cost: 4

   Accelerated rule 104 with non-termination, yielding the new rule 105.
[accelerate] Nesting with 0 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     68: f3 -> f6 : arg1'=1, [], cost: 3
     69: f3 -> f6 : arg1'=-1, [], cost: 3
     72: f6 -> f11 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     73: f6 -> f11 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     76: f11 -> f16 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     77: f11 -> f16 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     80: f16 -> f21 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     81: f16 -> f21 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     84: f21 -> f26 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     85: f21 -> f26 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     88: f26 -> f31 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     89: f26 -> f31 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     92: f31 -> f36 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     93: f31 -> f36 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     96: f36 -> f41 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     97: f36 -> f41 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
    100: f41 -> f46 : arg1'=1+arg1, [ arg1>0 ], cost: 3
    101: f41 -> f46 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
    104: f46 -> f46 : arg2'=arg2+arg1, arg3'=arg3-arg1, [ arg2<100 && arg3<100 ], cost: 4
    105: f46 -> [53] : [ arg2==99 && arg3==99 && arg1==0 ], cost: NONTERM
     65: __init -> f3 : arg1'=arg1P_64, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     68: f3 -> f6 : arg1'=1, [], cost: 3
     69: f3 -> f6 : arg1'=-1, [], cost: 3
     72: f6 -> f11 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     73: f6 -> f11 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     76: f11 -> f16 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     77: f11 -> f16 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     80: f16 -> f21 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     81: f16 -> f21 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     84: f21 -> f26 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     85: f21 -> f26 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     88: f26 -> f31 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     89: f26 -> f31 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     92: f31 -> f36 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     93: f31 -> f36 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
     96: f36 -> f41 : arg1'=1+arg1, [ arg1>0 ], cost: 3
     97: f36 -> f41 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
    100: f41 -> f46 : arg1'=1+arg1, [ arg1>0 ], cost: 3
    101: f41 -> f46 : arg1'=-1+arg1, [ arg1<=0 ], cost: 3
    106: f41 -> f46 : arg1'=1+arg1, arg2'=1+arg2+arg1, arg3'=-1+arg3-arg1, [ arg1>0 && arg2<100 && arg3<100 ], cost: 7
    107: f41 -> f46 : arg1'=-1+arg1, arg2'=-1+arg2+arg1, arg3'=1+arg3-arg1, [ arg1<=0 && arg2<100 && arg3<100 ], cost: 7
     65: __init -> f3 : arg1'=arg1P_64, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)