WORST_CASE(Omega(1),?) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: __init 0: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ x4_1>-1 && arg2>1 && arg1P_1>-1 && x5_1>arg2P_1 && x5_1>-1 && arg1>0 ], cost: 1 1: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ x10_1>-1 && arg2>1 && arg2P_2<1 && arg1P_2>-1 && arg1>0 ], cost: 1 7: f1_0_main_Load -> f196_0_create_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, [ x41_1>-1 && arg2>1 && x40_1>-1 && arg1>0 && -1+x40_1==arg1P_8 ], cost: 1 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, arg7'=arg7P_3, [ arg2>0 && arg1==arg1P_3 && 0==arg2P_3 && arg2==arg3P_3 && arg2==arg4P_3 && 0==arg5P_3 && arg2==arg6P_3 && arg2==arg7P_3 ], cost: 1 3: f292_0_slide88_EQ -> f292_0_slide88_EQ\' : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, arg7'=arg7P_4, [ x48_1>0 && arg4>0 && arg5>0 && arg6>-1 && arg6arg6 && arg6arg7 && arg7>-1 && arg7x52_1 && x49_1>0 && arg2>0 && arg1>=x53_1 && x54_1 f292_0_slide88_EQ\' : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, arg7'=arg7P_6, [ arg6>-1 && arg3>0 && arg6arg6 && arg6arg7 && arg7>-1 && arg7x80_1 && x77_1>-1 && arg1>=x81_1 && arg3==arg4 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 && arg3==arg4P_6 && arg5==arg5P_6 && arg6==arg6P_6 && arg7==arg7P_6 ], cost: 1 4: f292_0_slide88_EQ\' -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, arg7'=arg7P_5, [ x67_1>0 && arg4>0 && arg5>0 && arg6>-1 && arg6arg6 && arg6arg7 && arg7>-1 && arg7arg7P_5 && x68_1>0 && arg2>0 && arg5P_5=arg1P_5 && -2*x69_1+arg1>=0 && -2*x69_1+arg1<2 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 && arg3==arg3P_5 && arg2==arg6P_5 ], cost: 1 6: f292_0_slide88_EQ\' -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, arg7'=arg7P_7, [ arg6>-1 && arg3>0 && arg6arg6 && arg6arg7 && arg7>-1 && arg7arg5P_7 && arg1>=arg1P_7 && x93_1>-1 && -2*x94_1+arg1>=0 && -2*x94_1+arg1<2 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 && 1==arg2P_7 && 0==arg6P_7 && arg5P_7==arg7P_7 ], cost: 1 8: f196_0_create_LE -> f196_0_create_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg1>0 && -1+arg1==arg1P_9 ], cost: 1 9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, arg7'=arg7P_10, [], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, arg7'=arg7P_10, [], cost: 1 Simplified all rules, resulting in: Start location: __init 0: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1 1: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2>1 && arg2P_2<1 && arg1P_2>-1 && arg1>0 ], cost: 1 7: f1_0_main_Load -> f196_0_create_LE : arg1'=-1+x40_1, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, [ arg2>1 && x40_1>-1 && arg1>0 ], cost: 1 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 3: f292_0_slide88_EQ -> f292_0_slide88_EQ\' : [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ\' : arg4'=arg3, [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 1 6: f292_0_slide88_EQ\' -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 1 8: f196_0_create_LE -> f196_0_create_LE : arg1'=-1+arg1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg1>0 ], cost: 1 9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, arg7'=arg7P_10, [], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 4. Accelerating the following rules: 8: f196_0_create_LE -> f196_0_create_LE : arg1'=-1+arg1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg1>0 ], cost: 1 Accelerated rule 8 with backward acceleration, yielding the new rule 10. [accelerate] Nesting with 1 inner and 1 outer candidates Removing the simple loops: 8. Accelerated all simple loops using metering functions (where possible): Start location: __init 0: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1 1: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2>1 && arg2P_2<1 && arg1P_2>-1 && arg1>0 ], cost: 1 7: f1_0_main_Load -> f196_0_create_LE : arg1'=-1+x40_1, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, [ arg2>1 && x40_1>-1 && arg1>0 ], cost: 1 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 3: f292_0_slide88_EQ -> f292_0_slide88_EQ\' : [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ\' : arg4'=arg3, [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 1 6: f292_0_slide88_EQ\' -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 1 10: f196_0_create_LE -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg1>=1 ], cost: arg1 9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, arg7'=arg7P_10, [], cost: 1 Chained accelerated rules (with incoming rules): Start location: __init 0: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1 1: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2>1 && arg2P_2<1 && arg1P_2>-1 && arg1>0 ], cost: 1 7: f1_0_main_Load -> f196_0_create_LE : arg1'=-1+x40_1, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, [ arg2>1 && x40_1>-1 && arg1>0 ], cost: 1 11: f1_0_main_Load -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2>1 && arg1>0 && -1+x40_1>=1 ], cost: x40_1 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 3: f292_0_slide88_EQ -> f292_0_slide88_EQ\' : [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ\' : arg4'=arg3, [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 1 6: f292_0_slide88_EQ\' -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 1 9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, arg7'=arg7P_10, [], cost: 1 Removed unreachable locations (and leaf rules with constant cost): Start location: __init 0: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1 1: f1_0_main_Load -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2>1 && arg2P_2<1 && arg1P_2>-1 && arg1>0 ], cost: 1 11: f1_0_main_Load -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2>1 && arg1>0 && -1+x40_1>=1 ], cost: x40_1 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 3: f292_0_slide88_EQ -> f292_0_slide88_EQ\' : [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ\' : arg4'=arg3, [ arg6>-1 && arg6-1 && arg7 f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 1 6: f292_0_slide88_EQ\' -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 1 9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, arg7'=arg7P_10, [], cost: 1 Eliminated locations (on tree-shaped paths): Start location: __init 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 15: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 2 16: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 2 17: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 2 18: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 ], cost: 2 12: __init -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2P_10>1 && arg1P_1>-1 && arg1P_10>0 ], cost: 2 13: __init -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2P_10>1 && arg2P_2<1 && arg1P_2>-1 && arg1P_10>0 ], cost: 2 14: __init -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2P_10>1 && arg1P_10>0 && -1+x40_1>=1 ], cost: 1+x40_1 Accelerating simple loops of location 2. Accelerating the following rules: 15: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 2 16: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 2 17: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 2 18: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 ], cost: 2 Failed to prove monotonicity of the guard of rule 15. Failed to prove monotonicity of the guard of rule 16. Failed to prove monotonicity of the guard of rule 17. Failed to prove monotonicity of the guard of rule 18. [accelerate] Nesting with 4 inner and 4 outer candidates Accelerated all simple loops using metering functions (where possible): Start location: __init 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 15: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 2 16: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 && arg3==arg4 ], cost: 2 17: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_5, arg2'=arg2P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg2, arg7'=arg7P_5, [ arg6>-1 && arg6-1 && arg7=arg1P_5 && -2*arg1P_5+arg1<2 && -2*arg1P_5+arg1>=0 ], cost: 2 18: f292_0_slide88_EQ -> f292_0_slide88_EQ : arg1'=arg1P_7, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=0, arg7'=arg5P_7, [ arg6>-1 && arg6-1 && arg7=arg1P_7 && -2*arg1P_7+arg1<2 && -2*arg1P_7+arg1>=0 ], cost: 2 12: __init -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2P_10>1 && arg1P_1>-1 && arg1P_10>0 ], cost: 2 13: __init -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2P_10>1 && arg2P_2<1 && arg1P_2>-1 && arg1P_10>0 ], cost: 2 14: __init -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2P_10>1 && arg1P_10>0 && -1+x40_1>=1 ], cost: 1+x40_1 Chained accelerated rules (with incoming rules): Start location: __init 2: f234_0_slide88_FieldAccess -> f292_0_slide88_EQ : arg2'=0, arg3'=arg2, arg4'=arg2, arg5'=0, arg6'=arg2, arg7'=arg2, [ arg2>0 ], cost: 1 12: __init -> f234_0_slide88_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, [ arg2P_10>1 && arg1P_1>-1 && arg1P_10>0 ], cost: 2 13: __init -> f234_0_slide88_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, [ arg2P_10>1 && arg2P_2<1 && arg1P_2>-1 && arg1P_10>0 ], cost: 2 14: __init -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2P_10>1 && arg1P_10>0 && -1+x40_1>=1 ], cost: 1+x40_1 Removed unreachable locations (and leaf rules with constant cost): Start location: __init 14: __init -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2P_10>1 && arg1P_10>0 && -1+x40_1>=1 ], cost: 1+x40_1 ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: __init 14: __init -> f196_0_create_LE : arg1'=0, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, arg7'=arg7P_9, [ arg2P_10>1 && arg1P_10>0 && -1+x40_1>=1 ], cost: 1+x40_1 Computing asymptotic complexity for rule 14 Resulting cost 0 has complexity: Unknown 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),?)