Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487100265
details
property
value
status
complete
benchmark
PastaC9.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.253639 seconds
cpu usage
0.258408
user time
0.234498
system time
0.02391
max virtual memory
113188.0
max residence set size
19460.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 -> f368_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 2-arg3P0 == 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ -1+arg1-arg1P1 == 0 /\ 1+arg3-arg3P1 == 0 /\ arg2 > 0 /\ -41+x70 > 0 /\ -arg2P1+arg2 == 0 /\ 1+arg3 > 0), cost: 1 2: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -42+x120 < 0 /\ 1+arg1P2 > 0 /\ arg2 > 0 /\ 2-arg3P2+arg3 == 0 /\ -1-arg2P2+arg2 == 0 /\ 1+arg3 > 0 /\ 1+x120 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 2-arg3P0 == 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ -1+arg1-arg1P1 == 0 /\ 1+arg3-arg3P1 == 0 /\ arg2 > 0 /\ -41+x70 > 0 /\ -arg2P1+arg2 == 0 /\ 1+arg3 > 0), cost: 1 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=-1+arg1, arg3'=1+arg3, (arg1 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: 1 Applied preprocessing Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ -42+x120 < 0 /\ 1+arg1P2 > 0 /\ arg2 > 0 /\ 2-arg3P2+arg3 == 0 /\ -1-arg2P2+arg2 == 0 /\ 1+arg3 > 0 /\ 1+x120 > 0), cost: 1 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=2+arg3, arg2'=-1+arg2, (arg1 > 0 /\ 1+arg1P2 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f368_0_main_LE -> f368_0_main_LE : arg1'=-1+arg1, arg3'=1+arg3, (arg1 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: 1 6: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=2+arg3, arg2'=-1+arg2, (arg1 > 0 /\ 1+arg1P2 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, TRUE, cost: 1 Applied acceleration Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=-1+arg1, arg3'=1+arg3, (arg1 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: 1 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1-n1, arg3'=arg3+n1, (1+arg1-n1 > 0 /\ n1 >= 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: n1 Applied instantiation Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1-n1, arg3'=arg3+n1, (1+arg1-n1 > 0 /\ n1 >= 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: n1 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=0, arg3'=arg1+arg3, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: arg1 Applied acceleration Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=2+arg3, arg2'=-1+arg2, (arg1 > 0 /\ 1+arg1P2 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: 1 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*n3, arg2'=arg2-n3, (arg1 > 0 /\ arg1P2 > 0 /\ 1+arg2-n3 > 0 /\ -1+n3 >= 0 /\ 1+arg1P2 > 0 /\ 1+arg3 > 0), cost: n3 Applied instantiation Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*n3, arg2'=arg2-n3, (arg1 > 0 /\ arg1P2 > 0 /\ 1+arg2-n3 > 0 /\ -1+n3 >= 0 /\ 1+arg1P2 > 0 /\ 1+arg3 > 0), cost: n3 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*arg2, arg2'=0, (arg1 > 0 /\ arg1P2 > 0 /\ 1 > 0 /\ -1+arg2 >= 0 /\ 1+arg1P2 > 0 /\ 1+arg3 > 0), cost: arg2 Applied simplification Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=0, arg3'=arg1+arg3, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: arg1 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=0, arg3'=arg1+arg3, (arg1 >= 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: arg1 Applied simplification Original rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*arg2, arg2'=0, (arg1 > 0 /\ arg1P2 > 0 /\ 1 > 0 /\ -1+arg2 >= 0 /\ 1+arg1P2 > 0 /\ 1+arg3 > 0), cost: arg2 New rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*arg2, arg2'=0, (arg1 > 0 /\ arg1P2 > 0 /\ -1+arg2 >= 0 /\ 1+arg3 > 0), cost: arg2 Applied deletion Removed the following rules: 5 6 Accelerated simple loops Start location: __init 4: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 9: f368_0_main_LE -> f368_0_main_LE : arg1'=0, arg3'=arg1+arg3, (arg1 >= 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: arg1 10: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*arg2, arg2'=0, (arg1 > 0 /\ arg1P2 > 0 /\ -1+arg2 >= 0 /\ 1+arg3 > 0), cost: arg2 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f368_0_main_LE -> f368_0_main_LE : arg1'=0, arg3'=arg1+arg3, (arg1 >= 0 /\ arg2 > 0 /\ 1+arg3 > 0), cost: arg1 New rule: f1_0_main_Load -> f368_0_main_LE : arg1'=0, arg3'=2+arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg2P0 > 0 /\ arg1P0 >= 0 /\ 1+arg2 > 0), cost: 1+arg1P0 Applied chaining First rule: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P2, arg3'=arg3+2*arg2, arg2'=0, (arg1 > 0 /\ arg1P2 > 0 /\ -1+arg2 >= 0 /\ 1+arg3 > 0), cost: arg2 New rule: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P2, arg3'=2+2*arg2P0, arg2'=0, (arg1 > 0 /\ arg1P2 > 0 /\ -1+arg2P0 >= 0 /\ 1+arg2 > 0), cost: 1+arg2P0 Applied deletion
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS