Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099149
details
property
value
status
complete
benchmark
PastaB17.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
1.67027 seconds
cpu usage
1.67437
user time
1.64198
system time
0.032395
max virtual memory
278328.0
max residence set size
20916.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 1: f213_0_main_LE -> f227_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg3-arg2 < 0 /\ arg3-arg3P1 == 0 /\ -arg1P1+arg2 == 0), cost: 1 2: f227_0_main_LE -> f213_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg1P2+arg2 == 0 /\ arg3-arg3P2 == 0 /\ -arg3+arg2 <= 0 /\ -1+arg1-arg2P2 == 0), cost: 1 3: f227_0_main_LE -> f227_0_main_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg3-arg2 < 0 /\ arg1-arg1P3 == 0 /\ -1+arg2-arg2P3 == 0 /\ arg3-arg3P3 == 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f213_0_main_LE -> f227_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg3-arg2 < 0 /\ arg3-arg3P1 == 0 /\ -arg1P1+arg2 == 0), cost: 1 New rule: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg1, -arg3+arg2 > 0, cost: 1 Applied preprocessing Original rule: f227_0_main_LE -> f213_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg1P2+arg2 == 0 /\ arg3-arg3P2 == 0 /\ -arg3+arg2 <= 0 /\ -1+arg1-arg2P2 == 0), cost: 1 New rule: f227_0_main_LE -> f213_0_main_LE : arg1'=arg2, arg2'=-1+arg1, -arg3+arg2 <= 0, cost: 1 Applied preprocessing Original rule: f227_0_main_LE -> f227_0_main_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg3-arg2 < 0 /\ arg1-arg1P3 == 0 /\ -1+arg2-arg2P3 == 0 /\ arg3-arg3P3 == 0), cost: 1 New rule: f227_0_main_LE -> f227_0_main_LE : arg2'=-1+arg2, -arg3+arg2 > 0, cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 5: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg1, -arg3+arg2 > 0, cost: 1 6: f227_0_main_LE -> f213_0_main_LE : arg1'=arg2, arg2'=-1+arg1, -arg3+arg2 <= 0, cost: 1 7: f227_0_main_LE -> f227_0_main_LE : arg2'=-1+arg2, -arg3+arg2 > 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f227_0_main_LE -> f227_0_main_LE : arg2'=-1+arg2, -arg3+arg2 > 0, cost: 1 New rule: f227_0_main_LE -> f227_0_main_LE : arg2'=-n0+arg2, (n0 >= 0 /\ 1-n0-arg3+arg2 > 0), cost: n0 Applied instantiation Original rule: f227_0_main_LE -> f227_0_main_LE : arg2'=-n0+arg2, (n0 >= 0 /\ 1-n0-arg3+arg2 > 0), cost: n0 New rule: f227_0_main_LE -> f227_0_main_LE : arg2'=arg3, (1 > 0 /\ -arg3+arg2 >= 0), cost: -arg3+arg2 Applied simplification Original rule: f227_0_main_LE -> f227_0_main_LE : arg2'=arg3, (1 > 0 /\ -arg3+arg2 >= 0), cost: -arg3+arg2 New rule: f227_0_main_LE -> f227_0_main_LE : arg2'=arg3, -arg3+arg2 >= 0, cost: -arg3+arg2 Applied deletion Removed the following rules: 7 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 5: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg1, -arg3+arg2 > 0, cost: 1 6: f227_0_main_LE -> f213_0_main_LE : arg1'=arg2, arg2'=-1+arg1, -arg3+arg2 <= 0, cost: 1 9: f227_0_main_LE -> f227_0_main_LE : arg2'=arg3, -arg3+arg2 >= 0, cost: -arg3+arg2 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg1, -arg3+arg2 > 0, cost: 1 Second rule: f227_0_main_LE -> f227_0_main_LE : arg2'=arg3, -arg3+arg2 >= 0, cost: -arg3+arg2 New rule: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg3, (-arg3+arg2 > 0 /\ arg1-arg3 >= 0), cost: 1+arg1-arg3 Applied deletion Removed the following rules: 9 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 5: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg1, -arg3+arg2 > 0, cost: 1 10: f213_0_main_LE -> f227_0_main_LE : arg1'=arg2, arg2'=arg3, (-arg3+arg2 > 0 /\ arg1-arg3 >= 0), cost: 1+arg1-arg3 6: f227_0_main_LE -> f213_0_main_LE : arg1'=arg2, arg2'=-1+arg1, -arg3+arg2 <= 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Second rule: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 New rule: __init -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1P4 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P4 > 0), cost: 2 Applied deletion Removed the following rules: 0 4
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS