Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098489
details
property
value
status
complete
benchmark
7.t2.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_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.045025 seconds
cpu usage
0.029943
user time
0.021124
system time
0.008819
max virtual memory
113188.0
max residence set size
7312.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l4 0: l0 -> l1 : pre_v^0'=pre_v^post0, v_next^0'=v_next^post0, v^0'=v^post0, (pre_v^0-pre_v^post0 == 0 /\ 1-v_next^0+v^0 <= 0 /\ v_next^0-v_next^post0 == 0 /\ -v^post0+v^0 == 0), cost: 1 1: l0 -> l2 : pre_v^0'=pre_v^post1, v_next^0'=v_next^post1, v^0'=v^post1, (v_next^0-v_next^post1 == 0 /\ pre_v^0-pre_v^post1 == 0 /\ v^0-v^post1 == 0), cost: 1 2: l2 -> l0 : pre_v^0'=pre_v^post2, v_next^0'=v_next^post2, v^0'=v^post2, (0 == 0 /\ -1+v^post2-v^10 == 0 /\ -v_next^post2+v^10 == 0 /\ pre_v^post2-v^0 == 0), cost: 1 3: l3 -> l2 : pre_v^0'=pre_v^post3, v_next^0'=v_next^post3, v^0'=v^post3, (v_next^0-v_next^post3 == 0 /\ v^0-v^post3 == 0 /\ pre_v^0-pre_v^post3 == 0), cost: 1 4: l4 -> l3 : pre_v^0'=pre_v^post4, v_next^0'=v_next^post4, v^0'=v^post4, (pre_v^0-pre_v^post4 == 0 /\ v_next^0-v_next^post4 == 0 /\ v^0-v^post4 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 1: l0 -> l2 : pre_v^0'=pre_v^post1, v_next^0'=v_next^post1, v^0'=v^post1, (v_next^0-v_next^post1 == 0 /\ pre_v^0-pre_v^post1 == 0 /\ v^0-v^post1 == 0), cost: 1 2: l2 -> l0 : pre_v^0'=pre_v^post2, v_next^0'=v_next^post2, v^0'=v^post2, (0 == 0 /\ -1+v^post2-v^10 == 0 /\ -v_next^post2+v^10 == 0 /\ pre_v^post2-v^0 == 0), cost: 1 3: l3 -> l2 : pre_v^0'=pre_v^post3, v_next^0'=v_next^post3, v^0'=v^post3, (v_next^0-v_next^post3 == 0 /\ v^0-v^post3 == 0 /\ pre_v^0-pre_v^post3 == 0), cost: 1 4: l4 -> l3 : pre_v^0'=pre_v^post4, v_next^0'=v_next^post4, v^0'=v^post4, (pre_v^0-pre_v^post4 == 0 /\ v_next^0-v_next^post4 == 0 /\ v^0-v^post4 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : pre_v^0'=pre_v^post1, v_next^0'=v_next^post1, v^0'=v^post1, (v_next^0-v_next^post1 == 0 /\ pre_v^0-pre_v^post1 == 0 /\ v^0-v^post1 == 0), cost: 1 New rule: l0 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : pre_v^0'=pre_v^post2, v_next^0'=v_next^post2, v^0'=v^post2, (0 == 0 /\ -1+v^post2-v^10 == 0 /\ -v_next^post2+v^10 == 0 /\ pre_v^post2-v^0 == 0), cost: 1 New rule: l2 -> l0 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : pre_v^0'=pre_v^post3, v_next^0'=v_next^post3, v^0'=v^post3, (v_next^0-v_next^post3 == 0 /\ v^0-v^post3 == 0 /\ pre_v^0-pre_v^post3 == 0), cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : pre_v^0'=pre_v^post4, v_next^0'=v_next^post4, v^0'=v^post4, (pre_v^0-pre_v^post4 == 0 /\ v_next^0-v_next^post4 == 0 /\ v^0-v^post4 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l2 : TRUE, cost: 1 6: l2 -> l0 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 1 7: l3 -> l2 : TRUE, cost: 1 8: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l2 : TRUE, cost: 1 New rule: l4 -> l2 : TRUE, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminating location l0 by chaining: Applied chaining First rule: l2 -> l0 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 1 Second rule: l0 -> l2 : TRUE, cost: 1 New rule: l2 -> l2 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: l4 10: l2 -> l2 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 2 9: l4 -> l2 : TRUE, cost: 2 Applied nonterm Original rule: l2 -> l2 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 2 New rule: l2 -> [5] : 0 >= 0, cost: NONTERM Applied acceleration Original rule: l2 -> l2 : pre_v^0'=v^0, v_next^0'=v^10, v^0'=1+v^10, 0 == 0, cost: 2 New rule: l2 -> l2 : pre_v^0'=1+v^10, v_next^0'=v^10, v^0'=1+v^10, 0 >= 0, cost: 2*n0 Applied deletion Removed the following rules: 10 Accelerated simple loops Start location: l4
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS