unknown Initial ITS Start location: __init Program variables: arg1 arg2 arg3 arg4 0: f1_0_main_Load -> f587_0_main_LT : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=arg4p1, (1+arg1p1 > 0 /\ 1+arg2 > 0 /\ -arg3p1+arg1p1-arg2p1 == 0 /\ 1+arg2p1 > 0 /\ arg1 > 0 /\ 2-arg4p1 == 0), cost: 1 1: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1p2, arg2'=arg2p2, arg3'=arg3p2, arg4'=arg4p2, (1+x9-arg2p2+arg2 == 0 /\ 1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ -arg1p2+arg1-x8 == 0 /\ 1+x8 > 0 /\ -1-arg3p2-x9+arg1-x8-arg2 == 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 2-arg4p2+arg4 == 0 /\ 1+x9 > 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1p3, arg2'=arg2p3, arg3'=arg3p3, arg4'=arg4p3, T, cost: 1 Chained Linear Paths Start location: __init Program variables: arg1 arg2 arg3 arg4 1: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1p2, arg2'=arg2p2, arg3'=arg3p2, arg4'=arg4p2, (1+x9-arg2p2+arg2 == 0 /\ 1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ -arg1p2+arg1-x8 == 0 /\ 1+x8 > 0 /\ -1-arg3p2-x9+arg1-x8-arg2 == 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 2-arg4p2+arg4 == 0 /\ 1+x9 > 0), cost: 1 3: __init -> f587_0_main_LT : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=arg4p1, (1+arg2p3 > 0 /\ 1+arg1p1 > 0 /\ -arg3p1+arg1p1-arg2p1 == 0 /\ 1+arg2p1 > 0 /\ arg1p3 > 0 /\ 2-arg4p1 == 0), cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1p3, arg2'=arg2p3, arg3'=arg3p3, arg4'=arg4p3, T, cost: 1 Second rule: f1_0_main_Load -> f587_0_main_LT : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=arg4p1, (1+arg1p1 > 0 /\ 1+arg2 > 0 /\ -arg3p1+arg1p1-arg2p1 == 0 /\ 1+arg2p1 > 0 /\ arg1 > 0 /\ 2-arg4p1 == 0), cost: 1 New rule: __init -> f587_0_main_LT : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=arg4p1, (1+arg2p3 > 0 /\ 1+arg1p1 > 0 /\ -arg3p1+arg1p1-arg2p1 == 0 /\ 1+arg2p1 > 0 /\ arg1p3 > 0 /\ 2-arg4p1 == 0), cost: 1 Applied deletion Removed the following rules: 0 2 Simplified Transitions Start location: __init Program variables: arg1 arg2 arg3 arg4 4: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1-x8, arg2'=1+x9+arg2, arg3'=-1-x9+arg1-x8-arg2, arg4'=2+arg4, (1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0), cost: 1 5: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0), cost: 1 Propagated Equalities Original rule: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1p2, arg2'=arg2p2, arg3'=arg3p2, arg4'=arg4p2, (1+x9-arg2p2+arg2 == 0 /\ 1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ -arg1p2+arg1-x8 == 0 /\ 1+x8 > 0 /\ -1-arg3p2-x9+arg1-x8-arg2 == 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 2-arg4p2+arg4 == 0 /\ 1+x9 > 0), cost: 1 New rule: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1-x8, arg2'=1+x9+arg2, arg3'=-1-x9+arg1-x8-arg2, arg4'=2+arg4, (0 == 0 /\ 1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0), cost: 1 propagated equality arg2p2 = 1+x9+arg2 propagated equality arg1p2 = arg1-x8 propagated equality arg3p2 = -1-x9+arg1-x8-arg2 propagated equality arg4p2 = 2+arg4 Simplified Guard Original rule: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1-x8, arg2'=1+x9+arg2, arg3'=-1-x9+arg1-x8-arg2, arg4'=2+arg4, (0 == 0 /\ 1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0), cost: 1 New rule: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1-x8, arg2'=1+x9+arg2, arg3'=-1-x9+arg1-x8-arg2, arg4'=2+arg4, (1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0), cost: 1 Propagated Equalities Original rule: __init -> f587_0_main_LT : arg1'=arg1p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=arg4p1, (1+arg2p3 > 0 /\ 1+arg1p1 > 0 /\ -arg3p1+arg1p1-arg2p1 == 0 /\ 1+arg2p1 > 0 /\ arg1p3 > 0 /\ 2-arg4p1 == 0), cost: 1 New rule: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (0 == 0 /\ 1+arg2p3 > 0 /\ 1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0 /\ arg1p3 > 0), cost: 1 propagated equality arg1p1 = arg3p1+arg2p1 propagated equality arg4p1 = 2 Simplified Guard Original rule: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (0 == 0 /\ 1+arg2p3 > 0 /\ 1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0 /\ arg1p3 > 0), cost: 1 New rule: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (1+arg2p3 > 0 /\ 1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0 /\ arg1p3 > 0), cost: 1 Eliminated Temporary Variables via Transitive Closure Original rule: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (1+arg2p3 > 0 /\ 1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0 /\ arg1p3 > 0), cost: 1 New rule: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0), cost: 1 Step with 5 Trace 5[(1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0)] Blocked [{}, {}] Step with 4 Trace 5[(1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0)], 4[(1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0)] Blocked [{}, {}, {}] Accelerate Start location: __init Program variables: arg1 arg2 arg3 arg4 4: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1-x8, arg2'=1+x9+arg2, arg3'=-1-x9+arg1-x8-arg2, arg4'=2+arg4, (1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0), cost: 1 6: f587_0_main_LT -> f587_0_main_LT : arg1'=-x8*n+arg1, arg2'=x9*n+n+arg2, arg3'=-x9*(-1+n)-x9-x8*(-1+n)+arg1-x8-n-arg2, arg4'=arg4+2*n, (1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ 1-x9-(-2+n)*x8+arg1-(-2+n)*x9-x8-n-arg2 > 0 /\ arg3 > 0 /\ -1+n >= 0 /\ 1+x9 > 0), cost: 1 5: __init -> f587_0_main_LT : arg1'=arg3p1+arg2p1, arg2'=arg2p1, arg3'=arg3p1, arg4'=2, (1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0), cost: 1 Loop Acceleration Original rule: f587_0_main_LT -> f587_0_main_LT : arg1'=arg1-x8, arg2'=1+x9+arg2, arg3'=-1-x9+arg1-x8-arg2, arg4'=2+arg4, (1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0), cost: 1 New rule: f587_0_main_LT -> f587_0_main_LT : arg1'=-x8*n+arg1, arg2'=x9*n+n+arg2, arg3'=-x9*(-1+n)-x9-x8*(-1+n)+arg1-x8-n-arg2, arg4'=arg4+2*n, (1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ 1-x9-(-2+n)*x8+arg1-(-2+n)*x9-x8-n-arg2 > 0 /\ arg3 > 0 /\ -1+n >= 0 /\ 1+x9 > 0), cost: 1 1+x9+arg2 >= 0 [0]: monotonic increase yields 1+x9+arg2 >= 0, dependencies: 1+x9 > 0 1+x9+arg2 >= 0 [1]: montonic decrease yields x9*(-1+n)+x9+n+arg2 >= 0, dependencies: 1+arg2 > 0 1+x9+arg2 >= 0 [2]: eventual decrease yields (1+x9+arg2 >= 0 /\ x9*(-1+n)+x9+n+arg2 >= 0), dependencies: 1+x9 > 0 1+x9+arg2 >= 0 [3]: eventual increase yields (1+x9+arg2 >= 0 /\ -1-x9 <= 0), dependencies: 1+x9 > 0 1+arg2 > 0 [0]: monotonic increase yields 1+arg2 > 0, dependencies: 1+x9+arg2 >= 0 1+arg2 > 0 [1]: eventual decrease yields (1+arg2 > 0 /\ x9*(-1+n)+n+arg2 > 0), dependencies: 1+x9 > 0 1+arg2 > 0 [2]: eventual increase yields (1+arg2 > 0 /\ -1-x9 <= 0), dependencies: 1+x9 > 0 1+x8 > 0 [0]: monotonic increase yields 1+x8 > 0 1+arg4 > 0 [0]: monotonic increase yields 1+arg4 > 0 arg3 > 0 [0]: eventual decrease yields (1-x9-(-2+n)*x8+arg1-(-2+n)*x9-x8-n-arg2 > 0 /\ arg3 > 0), dependencies: 1+x8 > 0 1+x9 > 0 1+x9 > 0 [0]: monotonic increase yields 1+x9 > 0 Replacement map: {1+x9+arg2 >= 0 -> 1+x9+arg2 >= 0, 1+arg2 > 0 -> 1+arg2 > 0, 1+x8 > 0 -> 1+x8 > 0, 1+arg4 > 0 -> 1+arg4 > 0, arg3 > 0 -> (1-x9-(-2+n)*x8+arg1-(-2+n)*x9-x8-n-arg2 > 0 /\ arg3 > 0), 1+x9 > 0 -> 1+x9 > 0} Trace 5[(1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0)], 6[(1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ 1-x9-(-2+n)*x8+arg1-(-2+n)*x9-x8-n-arg2 > 0 /\ arg3 > 0 /\ -1+n >= 0 /\ 1+x9 > 0)] Blocked [{}, {}, {4[T], 6[T]}] Backtrack Trace 5[(1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0)] Blocked [{}, {6[T]}] Step with 4 Trace 5[(1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0)], 4[(1+x9+arg2 >= 0 /\ 1+arg2 > 0 /\ 1+x8 > 0 /\ 1+arg4 > 0 /\ arg3 > 0 /\ 1+x9 > 0)] Blocked [{}, {6[T]}, {}] Covered Trace 5[(1+arg2p1 > 0 /\ 1+arg3p1+arg2p1 > 0)] Blocked [{}, {4[T], 6[T]}] Backtrack Trace Blocked [{5[T]}] Accept unknown Build SHA: a05f16bf13df659c382799650051f91bf6828c7b