NO Initial ITS Start location: __init 0: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ -20-arg2P0 == 0 /\ 20-arg1P0 == 0 /\ 1+arg2 > 0 /\ arg2-arg3P0 == 0), cost: 1 1: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg3-arg2 >= 0 /\ -arg3-arg2P1 == 0 /\ arg3-arg1P1 == 0 /\ arg1-arg3P1 == 0 /\ -arg1+arg3 <= 0 /\ -5+arg1-arg3 < 0), cost: 1 2: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg3-arg2 >= 0 /\ -5+arg1+arg3 < 0 /\ -arg3-arg2P2 == 0 /\ -arg1P2+arg3 == 0 /\ arg1-arg3P2 == 0 /\ -arg1+arg3 <= 0 /\ -5+arg1-arg3 >= 0), cost: 1 4: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (-1-arg1+arg3 < 0 /\ -1+arg3-arg3P4 == 0 /\ arg3-arg2 >= 0 /\ -1+arg3 < 0 /\ -5+arg1+arg3 >= 0 /\ -1-arg1-arg2P4 == 0 /\ -arg1+arg3 <= 0 /\ 1+arg1-arg1P4 == 0 /\ -5+arg1-arg3 >= 0), cost: 1 5: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (-1-arg1+arg3 < 0 /\ arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+arg3-arg3P5 == 0 /\ 1+arg1-arg1P5 == 0 /\ -arg1+arg3 <= 0 /\ -1-arg1-arg2P5 == 0 /\ -5+arg1-arg3 >= 0), cost: 1 6: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, (1-arg3 == 0 /\ -2+arg2 < 0 /\ -arg3P6 == 0 /\ -1-arg1P6 == 0 /\ 1-arg2P6 == 0 /\ -5+arg1 > 0), cost: 1 3: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-arg3-arg2P3 == 0 /\ -arg3P3+arg2 == 0 /\ arg1-arg3 <= 0 /\ -arg1P3+arg3 == 0), cost: 1 7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ -20-arg2P0 == 0 /\ 20-arg1P0 == 0 /\ 1+arg2 > 0 /\ arg2-arg3P0 == 0), cost: 1 New rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg3-arg2 >= 0 /\ -arg3-arg2P1 == 0 /\ arg3-arg1P1 == 0 /\ arg1-arg3P1 == 0 /\ -arg1+arg3 <= 0 /\ -5+arg1-arg3 < 0), cost: 1 New rule: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 1 Applied preprocessing Original rule: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg3-arg2 >= 0 /\ -5+arg1+arg3 < 0 /\ -arg3-arg2P2 == 0 /\ -arg1P2+arg3 == 0 /\ arg1-arg3P2 == 0 /\ -arg1+arg3 <= 0 /\ -5+arg1-arg3 >= 0), cost: 1 New rule: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 Applied preprocessing Original rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-arg3-arg2P3 == 0 /\ -arg3P3+arg2 == 0 /\ arg1-arg3 <= 0 /\ -arg1P3+arg3 == 0), cost: 1 New rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 Applied preprocessing Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (-1-arg1+arg3 < 0 /\ -1+arg3-arg3P4 == 0 /\ arg3-arg2 >= 0 /\ -1+arg3 < 0 /\ -5+arg1+arg3 >= 0 /\ -1-arg1-arg2P4 == 0 /\ -arg1+arg3 <= 0 /\ 1+arg1-arg1P4 == 0 /\ -5+arg1-arg3 >= 0), cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: 1 Applied preprocessing Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (-1-arg1+arg3 < 0 /\ arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+arg3-arg3P5 == 0 /\ 1+arg1-arg1P5 == 0 /\ -arg1+arg3 <= 0 /\ -1-arg1-arg2P5 == 0 /\ -5+arg1-arg3 >= 0), cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 Applied preprocessing Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, (1-arg3 == 0 /\ -2+arg2 < 0 /\ -arg3P6 == 0 /\ -1-arg1P6 == 0 /\ 1-arg2P6 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (2-arg2 > 0 /\ -1+arg3 == 0 /\ -5+arg1 > 0), cost: 1 Simplified rules Start location: __init 8: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 1 10: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 12: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: 1 13: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 14: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (2-arg2 > 0 /\ -1+arg3 == 0 /\ -5+arg1 > 0), cost: 1 11: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Applied nonterm Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: 1 New rule: f437_0_loop_aux_GT -> [4] : (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: NONTERM Applied acceleration Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n2, arg3'=arg3-n2, arg2'=-arg1-n2, (1-arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+n2 >= 0 /\ ((arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: n2 Applied acceleration Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=1+arg1, arg3'=-1+arg3, arg2'=-1-arg1, (arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n4, arg3'=arg3-n4, arg2'=-arg1-n4, (arg3-n4 > 0 /\ -1+n4 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: n4 Applied instantiation Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n4, arg3'=arg3-n4, arg2'=-arg1-n4, (arg3-n4 > 0 /\ -1+n4 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: n4 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1+arg1+arg3, arg3'=1, arg2'=1-arg1-arg3, (1 > 0 /\ -2+arg3 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0))), cost: -1+arg3 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n2, arg3'=arg3-n2, arg2'=-arg1-n2, (1-arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+n2 >= 0 /\ ((arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: n2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n2, arg3'=arg3-n2, arg2'=-arg1-n2, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+n2 >= 0), cost: n2 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1+arg1+arg3, arg3'=1, arg2'=1-arg1-arg3, (1 > 0 /\ -2+arg3 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ -1+arg3 > 0 /\ -5+arg1-arg3 >= 0))), cost: -1+arg3 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1+arg1+arg3, arg3'=1, arg2'=1-arg1-arg3, (arg3-arg2 >= 0 /\ -2+arg3 >= 0 /\ -5+arg1-arg3 >= 0), cost: -1+arg3 Applied deletion Removed the following rules: 12 13 Accelerated simple loops Start location: __init 8: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 1 10: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 14: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (2-arg2 > 0 /\ -1+arg3 == 0 /\ -5+arg1 > 0), cost: 1 15: f437_0_loop_aux_GT -> [4] : (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: NONTERM 18: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n2, arg3'=arg3-n2, arg2'=-arg1-n2, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+n2 >= 0), cost: n2 19: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1+arg1+arg3, arg3'=1, arg2'=1-arg1-arg3, (arg3-arg2 >= 0 /\ -2+arg3 >= 0 /\ -5+arg1-arg3 >= 0), cost: -1+arg3 11: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (2-arg2 > 0 /\ -1+arg3 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1 > 0 /\ -1+arg2 == 0), cost: 2 Applied chaining First rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (2-arg2 > 0 /\ -1+arg3 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (-1+arg2 == 0 /\ -5+arg3 > 0 /\ arg1-arg3 <= 0), cost: 2 Applied chaining First rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f437_0_loop_aux_GT -> [4] : (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: NONTERM New rule: f1_0_main_Load -> [4] : (arg1 > 0 /\ arg2 == 0), cost: NONTERM Applied chaining First rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 Second rule: f437_0_loop_aux_GT -> [4] : (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0), cost: NONTERM New rule: f509_0_loop_aux_InvokeMethod -> [4] : (1-arg2 > 0 /\ -5+arg3+arg2 >= 0 /\ arg1-arg3 <= 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n2, arg3'=arg3-n2, arg2'=-arg1-n2, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+n2 >= 0), cost: n2 New rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2-n2, arg2'=-20-n2, (arg1 > 0 /\ arg2 == 0 /\ -1+n2 >= 0), cost: 1+n2 Applied chaining First rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1+n2, arg3'=arg3-n2, arg2'=-arg1-n2, (arg3-arg2 >= 0 /\ 1-arg3 > 0 /\ -5+arg1+arg3 >= 0 /\ -1+n2 >= 0), cost: n2 New rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3+n2, arg3'=arg2-n2, arg2'=-arg3-n2, (1-arg2 > 0 /\ -5+arg3+arg2 >= 0 /\ arg1-arg3 <= 0 /\ -1+n2 >= 0), cost: 1+n2 Applied chaining First rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1+arg1+arg3, arg3'=1, arg2'=1-arg1-arg3, (arg3-arg2 >= 0 /\ -2+arg3 >= 0 /\ -5+arg1-arg3 >= 0), cost: -1+arg3 New rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=19+arg2, arg3'=1, arg2'=-19-arg2, (arg1 > 0 /\ -2+arg2 >= 0 /\ -15+arg2 <= 0), cost: arg2 Applied chaining First rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=-1+arg1+arg3, arg3'=1, arg2'=1-arg1-arg3, (arg3-arg2 >= 0 /\ -2+arg3 >= 0 /\ -5+arg1-arg3 >= 0), cost: -1+arg3 New rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=-1+arg3+arg2, arg3'=1, arg2'=1-arg3-arg2, (-5+arg3-arg2 >= 0 /\ -2+arg2 >= 0 /\ arg1-arg3 <= 0), cost: arg2 Applied deletion Removed the following rules: 14 15 18 19 Chained accelerated rules with incoming rules Start location: __init 8: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 20: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1 > 0 /\ -1+arg2 == 0), cost: 2 22: f1_0_main_Load -> [4] : (arg1 > 0 /\ arg2 == 0), cost: NONTERM 24: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2-n2, arg2'=-20-n2, (arg1 > 0 /\ arg2 == 0 /\ -1+n2 >= 0), cost: 1+n2 26: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=19+arg2, arg3'=1, arg2'=-19-arg2, (arg1 > 0 /\ -2+arg2 >= 0 /\ -15+arg2 <= 0), cost: arg2 9: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 1 10: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 11: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 21: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (-1+arg2 == 0 /\ -5+arg3 > 0 /\ arg1-arg3 <= 0), cost: 2 23: f509_0_loop_aux_InvokeMethod -> [4] : (1-arg2 > 0 /\ -5+arg3+arg2 >= 0 /\ arg1-arg3 <= 0), cost: NONTERM 25: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3+n2, arg3'=arg2-n2, arg2'=-arg3-n2, (1-arg2 > 0 /\ -5+arg3+arg2 >= 0 /\ arg1-arg3 <= 0 /\ -1+n2 >= 0), cost: 1+n2 27: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=-1+arg3+arg2, arg3'=1, arg2'=1-arg3-arg2, (-5+arg3-arg2 >= 0 /\ -2+arg2 >= 0 /\ arg1-arg3 <= 0), cost: arg2 7: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Second rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2, arg2'=-20, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Second rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1 > 0 /\ -1+arg2 == 0), cost: 2 New rule: __init -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1P7 > 0 /\ -1+arg2P7 == 0), cost: 3 Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Second rule: f1_0_main_Load -> [4] : (arg1 > 0 /\ arg2 == 0), cost: NONTERM New rule: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Second rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2-n2, arg2'=-20-n2, (arg1 > 0 /\ arg2 == 0 /\ -1+n2 >= 0), cost: 1+n2 New rule: __init -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2P7-n2, arg2'=-20-n2, (arg1P7 > 0 /\ arg2P7 == 0 /\ -1+n2 >= 0), cost: 2+n2 Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Second rule: f1_0_main_Load -> f437_0_loop_aux_GT : arg1'=19+arg2, arg3'=1, arg2'=-19-arg2, (arg1 > 0 /\ -2+arg2 >= 0 /\ -15+arg2 <= 0), cost: arg2 New rule: __init -> f437_0_loop_aux_GT : arg1'=19+arg2P7, arg3'=1, arg2'=-19-arg2P7, (arg1P7 > 0 /\ -2+arg2P7 >= 0 /\ -15+arg2P7 <= 0), cost: 1+arg2P7 Applied deletion Removed the following rules: 7 8 20 22 24 26 Eliminating location f509_0_loop_aux_InvokeMethod by chaining: Applied chaining First rule: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 1 Second rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 Applied chaining First rule: f437_0_loop_aux_GT -> f509_0_loop_aux_InvokeMethod : arg1'=arg3, arg3'=arg1, arg2'=-arg3, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 1 Second rule: f509_0_loop_aux_InvokeMethod -> f437_0_loop_aux_GT : arg1'=arg3, arg3'=arg2, arg2'=-arg3, arg1-arg3 <= 0, cost: 1 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -arg1+arg3 <= 0 /\ -5+arg1-arg3 >= 0), cost: 2 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -arg1+arg3 <= 0 /\ -5+arg1-arg3 >= 0), cost: 2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 Applied deletion Removed the following rules: 9 10 11 21 23 25 27 Eliminated locations on tree-shaped paths Start location: __init 33: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 34: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 28: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 29: __init -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1P7 > 0 /\ -1+arg2P7 == 0), cost: 3 30: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM 31: __init -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2P7-n2, arg2'=-20-n2, (arg1P7 > 0 /\ arg2P7 == 0 /\ -1+n2 >= 0), cost: 2+n2 32: __init -> f437_0_loop_aux_GT : arg1'=19+arg2P7, arg3'=1, arg2'=-19-arg2P7, (arg1P7 > 0 /\ -2+arg2P7 >= 0 /\ -15+arg2P7 <= 0), cost: 1+arg2P7 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg1'=arg1, arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 Simplified simple loops Start location: __init 35: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 36: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 28: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 29: __init -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1P7 > 0 /\ -1+arg2P7 == 0), cost: 3 30: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM 31: __init -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2P7-n2, arg2'=-20-n2, (arg1P7 > 0 /\ arg2P7 == 0 /\ -1+n2 >= 0), cost: 2+n2 32: __init -> f437_0_loop_aux_GT : arg1'=19+arg2P7, arg3'=1, arg2'=-19-arg2P7, (arg1P7 > 0 /\ -2+arg2P7 >= 0 /\ -15+arg2P7 <= 0), cost: 1+arg2P7 Applied unrolling Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (-arg1-arg3 <= 0 /\ arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -arg1+arg3 <= 0), cost: 4 Applied nonterm Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (-arg1-arg3 <= 0 /\ arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -arg1+arg3 <= 0), cost: 4 New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0), cost: NONTERM Applied acceleration Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (-arg1-arg3 <= 0 /\ arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -arg1+arg3 <= 0), cost: 4 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n11 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n11 Applied chaining First rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 4 Applied nonterm Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 4 New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: NONTERM Applied acceleration Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 4 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-1+n13 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n13 Applied chaining First rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 Second rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: NONTERM New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: NONTERM Applied chaining First rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-1+n13 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n13 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0 /\ (arg1-arg3 >= 0 \/ (arg1-arg3 >= 0 /\ -5+arg1-arg3 >= 0))), cost: 2+4*n13 Applied chaining First rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-arg1-arg3 <= 0 /\ arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 4 Applied nonterm Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-arg1-arg3 <= 0 /\ arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 4 New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: NONTERM Applied acceleration Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-arg1-arg3 <= 0 /\ arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 4 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n15 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n15 Applied chaining First rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 Second rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: NONTERM New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ -arg1+arg3 <= 0), cost: NONTERM Applied chaining First rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: 2 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n15 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n15 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ -1+n15 >= 0 /\ -arg1+arg3 <= 0), cost: 2+4*n15 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n11 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n11 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n11 >= 0), cost: 4*n11 Applied simplification Original rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: NONTERM New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: NONTERM Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-1+n13 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n13 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: 4*n13 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0 /\ (arg1-arg3 >= 0 \/ (arg1-arg3 >= 0 /\ -5+arg1-arg3 >= 0))), cost: 2+4*n13 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2+4*n13 Applied simplification Original rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ -arg1+arg3 <= 0), cost: NONTERM New rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: NONTERM Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n15 >= 0 /\ -5+arg1-arg3 >= 0 /\ ((arg3-arg2 >= 0 /\ arg1+arg3 >= 0) \/ (arg3-arg2 >= 0 /\ arg1+arg3 >= 0))), cost: 4*n15 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n15 >= 0 /\ -5+arg1-arg3 >= 0), cost: 4*n15 Applied simplification Original rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ -1+n15 >= 0 /\ -arg1+arg3 <= 0), cost: 2+4*n15 New rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -1+n15 >= 0 /\ -arg1+arg3 <= 0), cost: 2+4*n15 Applied deletion Removed the following rules: 35 Applied deletion Removed the following rules: 43 Accelerated simple loops Start location: __init 36: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2 37: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0), cost: NONTERM 39: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: NONTERM 47: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n11 >= 0), cost: 4*n11 48: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: NONTERM 49: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: 4*n13 50: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -5+arg1-arg3 >= 0), cost: 2+4*n13 51: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: NONTERM 52: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (arg3-arg2 >= 0 /\ arg1+arg3 >= 0 /\ 5-arg1-arg3 > 0 /\ -1+n15 >= 0 /\ -5+arg1-arg3 >= 0), cost: 4*n15 53: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -1+n15 >= 0 /\ -arg1+arg3 <= 0), cost: 2+4*n15 28: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 29: __init -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1P7 > 0 /\ -1+arg2P7 == 0), cost: 3 30: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM 31: __init -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2P7-n2, arg2'=-20-n2, (arg1P7 > 0 /\ arg2P7 == 0 /\ -1+n2 >= 0), cost: 2+n2 32: __init -> f437_0_loop_aux_GT : arg1'=19+arg2P7, arg3'=1, arg2'=-19-arg2P7, (arg1P7 > 0 /\ -2+arg2P7 >= 0 /\ -15+arg2P7 <= 0), cost: 1+arg2P7 Applied chaining First rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 Second rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: NONTERM New rule: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM Applied chaining First rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg2'=-arg1, (-1+n13 >= 0 /\ arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ arg1-arg3 >= 0), cost: 4*n13 New rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (-1+n13 >= 0 /\ -20+arg2P7 <= 0 /\ -15+arg2P7 > 0), cost: 2+4*n13 Applied chaining First rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 Second rule: f437_0_loop_aux_GT -> [5] : (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -arg1+arg3 <= 0), cost: NONTERM New rule: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM Applied chaining First rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 Second rule: f437_0_loop_aux_GT -> f437_0_loop_aux_GT : arg3'=-arg3, arg2'=-arg1, (arg3-arg2 >= 0 /\ -5+arg1+arg3 >= 0 /\ 5-arg1+arg3 > 0 /\ -1+n15 >= 0 /\ -arg1+arg3 <= 0), cost: 2+4*n15 New rule: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=-arg2P7, arg2'=-20, (-1+n15 >= 0 /\ -20+arg2P7 <= 0 /\ -15+arg2P7 > 0), cost: 4+4*n15 Applied deletion Removed the following rules: 36 37 39 47 48 49 50 51 52 53 Chained accelerated rules with incoming rules Start location: __init 28: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (arg1P7 > 0 /\ 1+arg2P7 > 0), cost: 2 29: __init -> f437_0_loop_aux_GT : arg1'=-1, arg3'=0, arg2'=1, (arg1P7 > 0 /\ -1+arg2P7 == 0), cost: 3 30: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM 31: __init -> f437_0_loop_aux_GT : arg1'=20+n2, arg3'=arg2P7-n2, arg2'=-20-n2, (arg1P7 > 0 /\ arg2P7 == 0 /\ -1+n2 >= 0), cost: 2+n2 32: __init -> f437_0_loop_aux_GT : arg1'=19+arg2P7, arg3'=1, arg2'=-19-arg2P7, (arg1P7 > 0 /\ -2+arg2P7 >= 0 /\ -15+arg2P7 <= 0), cost: 1+arg2P7 54: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM 55: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=arg2P7, arg2'=-20, (-1+n13 >= 0 /\ -20+arg2P7 <= 0 /\ -15+arg2P7 > 0), cost: 2+4*n13 56: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM 57: __init -> f437_0_loop_aux_GT : arg1'=20, arg3'=-arg2P7, arg2'=-20, (-1+n15 >= 0 /\ -20+arg2P7 <= 0 /\ -15+arg2P7 > 0), cost: 4+4*n15 Removed unreachable locations and irrelevant leafs Start location: __init 30: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM 54: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM 56: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM Removed duplicate rules (ignoring updates) Start location: __init 30: __init -> [4] : (arg1P7 > 0 /\ arg2P7 == 0), cost: NONTERM 56: __init -> [5] : (-20 <= 0 /\ -35 <= 0 /\ -40 <= 0 /\ -4 <= 0), cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 30 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: (arg1P7 > 0 /\ arg2P7 == 0)