NO Initial ITS Start location: __init 0: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+x80 > 0 /\ 1+x90 > 0 /\ -1+arg2 > 0 /\ arg1-arg1P0 == 0 /\ -arg2P0+arg2 == 0 /\ -2*x100+x90 == 0), cost: 1 1: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1-x130 == 0 /\ -2+x140-2*x150 < 0 /\ x140-2*x150 >= 0 /\ x140-2*x150 == 0 /\ -1+arg2 > 0 /\ 1+x140 > 0 /\ 1+x130 > 0), cost: 1 2: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1P2, arg2'=arg2P2, (-5-arg1 == 0 /\ -5-arg1P2 == 0), cost: 1 3: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1P3, arg2'=arg2P3, (arg1 < 0 /\ 5+arg1 < 0 /\ 1+arg1-arg1P3 == 0), cost: 1 4: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1P4, arg2'=arg2P4, (arg1 < 0 /\ 5+arg1 > 0 /\ 1+arg1-arg1P4 == 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+x80 > 0 /\ 1+x90 > 0 /\ -1+arg2 > 0 /\ arg1-arg1P0 == 0 /\ -arg2P0+arg2 == 0 /\ -2*x100+x90 == 0), cost: 1 New rule: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x100 > 0 /\ -1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1-x130 == 0 /\ -2+x140-2*x150 < 0 /\ x140-2*x150 >= 0 /\ x140-2*x150 == 0 /\ -1+arg2 > 0 /\ 1+x140 > 0 /\ 1+x130 > 0), cost: 1 New rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 Applied preprocessing Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1P2, arg2'=arg2P2, (-5-arg1 == 0 /\ -5-arg1P2 == 0), cost: 1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, 5+arg1 == 0, cost: 1 Applied preprocessing Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1P3, arg2'=arg2P3, (arg1 < 0 /\ 5+arg1 < 0 /\ 1+arg1-arg1P3 == 0), cost: 1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=1+arg1, arg2'=arg2P3, -5-arg1 > 0, cost: 1 Applied preprocessing Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1P4, arg2'=arg2P4, (arg1 < 0 /\ 5+arg1 > 0 /\ 1+arg1-arg1P4 == 0), cost: 1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=1+arg1, arg2'=arg2P4, (5+arg1 > 0 /\ -arg1 > 0), cost: 1 Simplified rules Start location: __init 6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x100 > 0 /\ -1+arg2 > 0), cost: 1 7: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 8: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, 5+arg1 == 0, cost: 1 9: f128_0_loop_GE -> f128_0_loop_GE : arg1'=1+arg1, arg2'=arg2P3, -5-arg1 > 0, cost: 1 10: f128_0_loop_GE -> f128_0_loop_GE : arg1'=1+arg1, arg2'=arg2P4, (5+arg1 > 0 /\ -arg1 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied nonterm Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, 5+arg1 == 0, cost: 1 New rule: f128_0_loop_GE -> [4] : (-5-arg1 >= 0 /\ 5+arg1 >= 0), cost: NONTERM Applied acceleration Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, 5+arg1 == 0, cost: 1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (-5-arg1 >= 0 /\ 5+arg1 >= 0), cost: n2 Applied acceleration Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=1+arg1, arg2'=arg2P3, -5-arg1 > 0, cost: 1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1+n4, arg2'=arg2P3, (-4-arg1-n4 > 0 /\ -1+n4 >= 0), cost: n4 Applied instantiation Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1+n4, arg2'=arg2P3, (-4-arg1-n4 > 0 /\ -1+n4 >= 0), cost: n4 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, (-6-arg1 >= 0 /\ 1 > 0), cost: -5-arg1 Applied acceleration Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=1+arg1, arg2'=arg2P4, (5+arg1 > 0 /\ -arg1 > 0), cost: 1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1+n6, arg2'=arg2P4, (5+arg1 > 0 /\ 1-arg1-n6 > 0 /\ -1+n6 >= 0), cost: n6 Applied instantiation Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=arg1+n6, arg2'=arg2P4, (5+arg1 > 0 /\ 1-arg1-n6 > 0 /\ -1+n6 >= 0), cost: n6 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (1 > 0 /\ 5+arg1 > 0 /\ -1-arg1 >= 0), cost: -arg1 Applied simplification Original rule: f128_0_loop_GE -> [4] : (-5-arg1 >= 0 /\ 5+arg1 >= 0), cost: NONTERM New rule: f128_0_loop_GE -> [4] : (5+arg1 <= 0 /\ 5+arg1 >= 0), cost: NONTERM Applied simplification Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (-5-arg1 >= 0 /\ 5+arg1 >= 0), cost: n2 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (5+arg1 <= 0 /\ 5+arg1 >= 0), cost: n2 Applied simplification Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, (-6-arg1 >= 0 /\ 1 > 0), cost: -5-arg1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, 6+arg1 <= 0, cost: -5-arg1 Applied simplification Original rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (1 > 0 /\ 5+arg1 > 0 /\ -1-arg1 >= 0), cost: -arg1 New rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (5+arg1 > 0 /\ 1+arg1 <= 0), cost: -arg1 Applied deletion Removed the following rules: 8 9 10 Accelerated simple loops Start location: __init 6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x100 > 0 /\ -1+arg2 > 0), cost: 1 7: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 15: f128_0_loop_GE -> [4] : (5+arg1 <= 0 /\ 5+arg1 >= 0), cost: NONTERM 16: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (5+arg1 <= 0 /\ 5+arg1 >= 0), cost: n2 17: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, 6+arg1 <= 0, cost: -5-arg1 18: f128_0_loop_GE -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (5+arg1 > 0 /\ 1+arg1 <= 0), cost: -arg1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 Second rule: f128_0_loop_GE -> [4] : (5+arg1 <= 0 /\ 5+arg1 >= 0), cost: NONTERM New rule: f1_0_main_Load\' -> [4] : (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 Second rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (5+arg1 <= 0 /\ 5+arg1 >= 0), cost: n2 New rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0), cost: 1+n2 Applied chaining First rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 Second rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, 6+arg1 <= 0, cost: -5-arg1 New rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ -6+x130 >= 0), cost: -4+x130 Applied chaining First rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 Second rule: f128_0_loop_GE -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (5+arg1 > 0 /\ 1+arg1 <= 0), cost: -arg1 New rule: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (arg1 > 0 /\ -1+x130 >= 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 5-x130 > 0), cost: 1+x130 Applied deletion Removed the following rules: 15 16 17 18 Chained accelerated rules with incoming rules Start location: __init 6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x100 > 0 /\ -1+arg2 > 0), cost: 1 7: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-x130, arg2'=arg2P1, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 1+x130 > 0), cost: 1 19: f1_0_main_Load\' -> [4] : (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0), cost: NONTERM 20: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P2, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0), cost: 1+n2 21: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=-5, arg2'=arg2P3, (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ -6+x130 >= 0), cost: -4+x130 22: f1_0_main_Load\' -> f128_0_loop_GE : arg1'=0, arg2'=arg2P4, (arg1 > 0 /\ -1+x130 >= 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0 /\ 5-x130 > 0), cost: 1+x130 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x100 > 0 /\ -1+arg2 > 0), cost: 1 19: f1_0_main_Load\' -> [4] : (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0), cost: NONTERM 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Second rule: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x100 > 0 /\ -1+arg2 > 0), cost: 1 New rule: __init -> f1_0_main_Load\' : arg1'=arg1P5, arg2'=arg2P5, (-1+arg2P5 > 0 /\ 1+2*x100 > 0 /\ arg1P5 > 0), cost: 2 Applied deletion Removed the following rules: 5 6 Eliminating location f1_0_main_Load\' by chaining: Applied chaining First rule: __init -> f1_0_main_Load\' : arg1'=arg1P5, arg2'=arg2P5, (-1+arg2P5 > 0 /\ 1+2*x100 > 0 /\ arg1P5 > 0), cost: 2 Second rule: f1_0_main_Load\' -> [4] : (arg1 > 0 /\ 1+2*x150 > 0 /\ -1+arg2 > 0), cost: NONTERM New rule: __init -> [4] : (-1+arg2P5 > 0 /\ 1+2*x150 > 0 /\ 1+2*x100 > 0 /\ arg1P5 > 0), cost: NONTERM Applied deletion Removed the following rules: 19 23 Eliminated locations on linear paths Start location: __init 24: __init -> [4] : (-1+arg2P5 > 0 /\ 1+2*x150 > 0 /\ 1+2*x100 > 0 /\ arg1P5 > 0), cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 24 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: (-1+arg2P5 > 0 /\ 1+2*x150 > 0 /\ 1+2*x100 > 0 /\ arg1P5 > 0)