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