details

property	value
status	complete
benchmark	cousot_rec.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n143.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	1.05116 seconds
cpu usage	1.05876
user time	1.00583
system time	0.052926
max virtual memory	292752.0
max residence set size	30044.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_ConstantStackPush -> f79_0_loop_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (2-arg1P0 == 0 /\ 2-arg2P0 == 0 /\ -arg4P0 == 0 /\ 2-arg3P0 == 0), cost: 1 1: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (-arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ -arg3P1+arg4 == 0 /\ arg1-arg1P1 == 0 /\ 4-arg2P1+arg2 == 0 /\ arg2 > 0), cost: 1 2: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (1+arg4 > 0 /\ 2-arg2P2+arg2 == 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ 1-arg3P2+arg4 == 0 /\ arg2 > 0 /\ arg1-arg1P2 == 0), cost: 1 3: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (arg2-arg3P3 == 0 /\ -arg4P3+arg3 == 0 /\ arg3 > 0 /\ -1+arg1 > 0 /\ -arg1P3+arg2 == 0 /\ -1+arg2 > 0 /\ arg2-arg2P3 == 0), cost: 1 4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f79_0_loop_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (2-arg1P0 == 0 /\ 2-arg2P0 == 0 /\ -arg4P0 == 0 /\ 2-arg3P0 == 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f79_0_loop_GE : arg1'=2, arg3'=2, arg2'=2, arg4'=0, TRUE, cost: 1 Applied preprocessing Original rule: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (-arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ -arg3P1+arg4 == 0 /\ arg1-arg1P1 == 0 /\ 4-arg2P1+arg2 == 0 /\ arg2 > 0), cost: 1 New rule: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=arg4, arg2'=4+arg2, arg4'=arg4P1, (-arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (1+arg4 > 0 /\ 2-arg2P2+arg2 == 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ 1-arg3P2+arg4 == 0 /\ arg2 > 0 /\ arg1-arg1P2 == 0), cost: 1 New rule: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=1+arg4, arg2'=2+arg2, arg4'=arg4P2, (1+arg4 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (arg2-arg3P3 == 0 /\ -arg4P3+arg3 == 0 /\ arg3 > 0 /\ -1+arg1 > 0 /\ -arg1P3+arg2 == 0 /\ -1+arg2 > 0 /\ arg2-arg2P3 == 0), cost: 1 New rule: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg2, arg3'=arg2, arg4'=arg3, (arg3 > 0 /\ -1+arg1 > 0 /\ -1+arg2 > 0), cost: 1 Simplified rules Start location: __init 5: f1_0_main_ConstantStackPush -> f79_0_loop_GE : arg1'=2, arg3'=2, arg2'=2, arg4'=0, TRUE, cost: 1 6: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=arg4, arg2'=4+arg2, arg4'=arg4P1, (-arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0), cost: 1 7: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=1+arg4, arg2'=2+arg2, arg4'=arg4P2, (1+arg4 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0), cost: 1 8: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg2, arg3'=arg2, arg4'=arg3, (arg3 > 0 /\ -1+arg1 > 0 /\ -1+arg2 > 0), cost: 1 4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1 Eliminating location f1_0_main_ConstantStackPush by chaining: Applied chaining First rule: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1 Second rule: f1_0_main_ConstantStackPush -> f79_0_loop_GE : arg1'=2, arg3'=2, arg2'=2, arg4'=0, TRUE, cost: 1 New rule: __init -> f79_0_loop_GE : arg1'=2, arg3'=2, arg2'=2, arg4'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 4 5 Eliminated locations on linear paths Start location: __init 6: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=arg4, arg2'=4+arg2, arg4'=arg4P1, (-arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0), cost: 1 7: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=1+arg4, arg2'=2+arg2, arg4'=arg4P2, (1+arg4 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0), cost: 1 8: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg2, arg3'=arg2, arg4'=arg3, (arg3 > 0 /\ -1+arg1 > 0 /\ -1+arg2 > 0), cost: 1 9: __init -> f79_0_loop_GE : arg1'=2, arg3'=2, arg2'=2, arg4'=0, TRUE, cost: 2 Eliminating location f100_0_loop_InvokeMethod by chaining: Applied chaining First rule: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=arg4, arg2'=4+arg2, arg4'=arg4P1, (-arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0), cost: 1 Second rule: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg2, arg3'=arg2, arg4'=arg3, (arg3 > 0 /\ -1+arg1 > 0 /\ -1+arg2 > 0), cost: 1 New rule: f79_0_loop_GE -> f79_0_loop_GE : arg1'=4+arg2, arg3'=4+arg2, arg2'=4+arg2, arg4'=arg4, (-1+arg1 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ 3+arg2 > 0), cost: 2 Applied simplification Original rule: f79_0_loop_GE -> f79_0_loop_GE : arg1'=4+arg2, arg3'=4+arg2, arg2'=4+arg2, arg4'=arg4, (-1+arg1 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ 3+arg2 > 0), cost: 2 New rule: f79_0_loop_GE -> f79_0_loop_GE : arg1'=4+arg2, arg3'=4+arg2, arg2'=4+arg2, arg4'=arg4, (-1+arg1 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 > 0 /\ arg2 > 0), cost: 2 Applied chaining First rule: f79_0_loop_GE -> f100_0_loop_InvokeMethod : arg3'=1+arg4, arg2'=2+arg2, arg4'=arg4P2, (1+arg4 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0), cost: 1 Second rule: f100_0_loop_InvokeMethod -> f79_0_loop_GE : arg1'=arg2, arg3'=arg2, arg4'=arg3, (arg3 > 0 /\ -1+arg1 > 0 /\ -1+arg2 > 0), cost: 1 New rule: f79_0_loop_GE -> f79_0_loop_GE : arg1'=2+arg2, arg3'=2+arg2, arg2'=2+arg2, arg4'=1+arg4, (1+arg4 > 0 /\ -1+arg1 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0 /\ 1+arg2 > 0), cost: 2 Applied simplification Original rule: f79_0_loop_GE -> f79_0_loop_GE : arg1'=2+arg2, arg3'=2+arg2, arg2'=2+arg2, arg4'=1+arg4, (1+arg4 > 0 /\ -1+arg1 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0 /\ 1+arg2 > 0), cost: 2 New rule: f79_0_loop_GE -> f79_0_loop_GE : arg1'=2+arg2, arg3'=2+arg2, arg2'=2+arg2, arg4'=1+arg4, (1+arg4 > 0 /\ -1+arg1 > 0 /\ -arg3+arg2 == 0 /\ -arg2+arg4 <= 0 /\ arg2 > 0), cost: 2 Applied deletion Removed the following rules: 6 7 8 Eliminated locations on tree-shaped paths Start location: __init popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to ITS