Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099854
details
property
value
status
complete
benchmark
SharingAnalysis.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
1.17305 seconds
cpu usage
1.17469
user time
1.15257
system time
0.022123
max virtual memory
278336.0
max residence set size
21104.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 -> f172_0_appendNewList_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ -arg2P0 == 0 /\ arg2 > 0), cost: 1 1: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (-arg2+arg2P1 > 0 /\ -1+arg1 > 0 /\ arg2 > 0 /\ -1+arg1-arg1P1 == 0), cost: 1 2: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-1+arg1 > 0 /\ -1+arg1-arg1P2 == 0 /\ 1-arg2P2 == 0), cost: 1 3: f172_0_appendNewList_LE -> f282_0_copy_NULL : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-3+arg2P3 > 0 /\ -1+arg1P3 > 0 /\ -arg3P3 == 0 /\ -2+arg1 < 0), cost: 1 4: f282_0_copy_NULL -> f282_0_copy_NULL : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (2+arg3P4-arg2 <= 0 /\ -1+arg1P4-arg2 <= 0 /\ -1+arg1 > 0 /\ -1+arg1P4 > 0 /\ arg2 > 0 /\ 1-arg2+arg2P4 <= 0 /\ 2-arg1+arg3 <= 0 /\ 1+arg2P4 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f172_0_appendNewList_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ -arg2P0 == 0 /\ arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f172_0_appendNewList_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (-arg2+arg2P1 > 0 /\ -1+arg1 > 0 /\ arg2 > 0 /\ -1+arg1-arg1P1 == 0), cost: 1 New rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=-1+arg1, arg3'=arg3P1, arg2'=arg2P1, (-arg2+arg2P1 > 0 /\ -1+arg1 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-1+arg1 > 0 /\ -1+arg1-arg1P2 == 0 /\ 1-arg2P2 == 0), cost: 1 New rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=-1+arg1, arg3'=arg3P2, arg2'=1, -1+arg1 > 0, cost: 1 Applied preprocessing Original rule: f172_0_appendNewList_LE -> f282_0_copy_NULL : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-3+arg2P3 > 0 /\ -1+arg1P3 > 0 /\ -arg3P3 == 0 /\ -2+arg1 < 0), cost: 1 New rule: f172_0_appendNewList_LE -> f282_0_copy_NULL : arg1'=arg1P3, arg3'=0, arg2'=arg2P3, (-3+arg2P3 > 0 /\ 2-arg1 > 0 /\ -1+arg1P3 > 0), cost: 1 Applied preprocessing Original rule: f282_0_copy_NULL -> f282_0_copy_NULL : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (2+arg3P4-arg2 <= 0 /\ -1+arg1P4-arg2 <= 0 /\ -1+arg1 > 0 /\ -1+arg1P4 > 0 /\ arg2 > 0 /\ 1-arg2+arg2P4 <= 0 /\ 2-arg1+arg3 <= 0 /\ 1+arg2P4 > 0), cost: 1 New rule: f282_0_copy_NULL -> f282_0_copy_NULL : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (2+arg3P4-arg2 <= 0 /\ -1+arg1P4-arg2 <= 0 /\ -1+arg1 > 0 /\ -1+arg1P4 > 0 /\ 1-arg2+arg2P4 <= 0 /\ 2-arg1+arg3 <= 0 /\ 1+arg2P4 > 0), cost: 1 Simplified rules Start location: __init 6: f1_0_main_Load -> f172_0_appendNewList_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 7: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=-1+arg1, arg3'=arg3P1, arg2'=arg2P1, (-arg2+arg2P1 > 0 /\ -1+arg1 > 0 /\ arg2 > 0), cost: 1 8: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=-1+arg1, arg3'=arg3P2, arg2'=1, -1+arg1 > 0, cost: 1 9: f172_0_appendNewList_LE -> f282_0_copy_NULL : arg1'=arg1P3, arg3'=0, arg2'=arg2P3, (-3+arg2P3 > 0 /\ 2-arg1 > 0 /\ -1+arg1P3 > 0), cost: 1 10: f282_0_copy_NULL -> f282_0_copy_NULL : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (2+arg3P4-arg2 <= 0 /\ -1+arg1P4-arg2 <= 0 /\ -1+arg1 > 0 /\ -1+arg1P4 > 0 /\ 1-arg2+arg2P4 <= 0 /\ 2-arg1+arg3 <= 0 /\ 1+arg2P4 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1 Applied acceleration Original rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=-1+arg1, arg3'=arg3P2, arg2'=1, -1+arg1 > 0, cost: 1 New rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=arg1-n2, arg3'=arg3P2, arg2'=1, (arg1-n2 > 0 /\ -1+n2 >= 0), cost: n2 Applied instantiation Original rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=arg1-n2, arg3'=arg3P2, arg2'=1, (arg1-n2 > 0 /\ -1+n2 >= 0), cost: n2 New rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=1, arg3'=arg3P2, arg2'=1, (1 > 0 /\ -2+arg1 >= 0), cost: -1+arg1 Applied simplification Original rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=1, arg3'=arg3P2, arg2'=1, (1 > 0 /\ -2+arg1 >= 0), cost: -1+arg1 New rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=1, arg3'=arg3P2, arg2'=1, -2+arg1 >= 0, cost: -1+arg1 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 6: f1_0_main_Load -> f172_0_appendNewList_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 7: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=-1+arg1, arg3'=arg3P1, arg2'=arg2P1, (-arg2+arg2P1 > 0 /\ -1+arg1 > 0 /\ arg2 > 0), cost: 1 9: f172_0_appendNewList_LE -> f282_0_copy_NULL : arg1'=arg1P3, arg3'=0, arg2'=arg2P3, (-3+arg2P3 > 0 /\ 2-arg1 > 0 /\ -1+arg1P3 > 0), cost: 1 12: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=1, arg3'=arg3P2, arg2'=1, -2+arg1 >= 0, cost: -1+arg1 10: f282_0_copy_NULL -> f282_0_copy_NULL : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (2+arg3P4-arg2 <= 0 /\ -1+arg1P4-arg2 <= 0 /\ -1+arg1 > 0 /\ -1+arg1P4 > 0 /\ 1-arg2+arg2P4 <= 0 /\ 2-arg1+arg3 <= 0 /\ 1+arg2P4 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f172_0_appendNewList_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 Second rule: f172_0_appendNewList_LE -> f172_0_appendNewList_LE : arg1'=1, arg3'=arg3P2, arg2'=1, -2+arg1 >= 0, cost: -1+arg1 New rule: f1_0_main_Load -> f172_0_appendNewList_LE : arg1'=1, arg3'=arg3P2, arg2'=1, (arg1 > 0 /\ -2+arg1P0 >= 0 /\ arg2 > 0), cost: arg1P0 Applied deletion Removed the following rules: 7 12 Applied chaining First rule: f172_0_appendNewList_LE -> f282_0_copy_NULL : arg1'=arg1P3, arg3'=0, arg2'=arg2P3, (-3+arg2P3 > 0 /\ 2-arg1 > 0 /\ -1+arg1P3 > 0), cost: 1 Second rule: f282_0_copy_NULL -> f282_0_copy_NULL : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (2+arg3P4-arg2 <= 0 /\ -1+arg1P4-arg2 <= 0 /\ -1+arg1 > 0 /\ -1+arg1P4 > 0 /\ 1-arg2+arg2P4 <= 0 /\ 2-arg1+arg3 <= 0 /\ 1+arg2P4 > 0), cost: 1 New rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS