Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098447
details
property
value
status
complete
benchmark
mc91.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.408109 seconds
cpu usage
0.413246
user time
0.379227
system time
0.034019
max virtual memory
113188.0
max residence set size
29200.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l4 0: l0 -> l1 : e^0'=e^post0, n^0'=n^post0, (1-e^0 <= 0 /\ -11-n^0+n^post0 == 0 /\ -100+n^0 <= 0 /\ -1-e^0+e^post0 == 0), cost: 1 2: l0 -> l2 : e^0'=e^post2, n^0'=n^post2, (10+n^post2-n^0 == 0 /\ 101-n^0 <= 0 /\ 1-e^0 <= 0 /\ 1-e^0+e^post2 == 0), cost: 1 1: l1 -> l0 : e^0'=e^post1, n^0'=n^post1, (-n^post1+n^0 == 0 /\ e^0-e^post1 == 0), cost: 1 3: l2 -> l0 : e^0'=e^post3, n^0'=n^post3, (e^0-e^post3 == 0 /\ n^0-n^post3 == 0), cost: 1 4: l3 -> l0 : e^0'=e^post4, n^0'=n^post4, (0 == 0 /\ -1+e^post4 == 0), cost: 1 5: l4 -> l3 : e^0'=e^post5, n^0'=n^post5, (n^0-n^post5 == 0 /\ e^0-e^post5 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : e^0'=e^post0, n^0'=n^post0, (1-e^0 <= 0 /\ -11-n^0+n^post0 == 0 /\ -100+n^0 <= 0 /\ -1-e^0+e^post0 == 0), cost: 1 New rule: l0 -> l1 : e^0'=1+e^0, n^0'=11+n^0, (-1+e^0 >= 0 /\ -100+n^0 <= 0), cost: 1 Applied preprocessing Original rule: l1 -> l0 : e^0'=e^post1, n^0'=n^post1, (-n^post1+n^0 == 0 /\ e^0-e^post1 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l2 : e^0'=e^post2, n^0'=n^post2, (10+n^post2-n^0 == 0 /\ 101-n^0 <= 0 /\ 1-e^0 <= 0 /\ 1-e^0+e^post2 == 0), cost: 1 New rule: l0 -> l2 : e^0'=-1+e^0, n^0'=-10+n^0, (-1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 Applied preprocessing Original rule: l2 -> l0 : e^0'=e^post3, n^0'=n^post3, (e^0-e^post3 == 0 /\ n^0-n^post3 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : e^0'=e^post4, n^0'=n^post4, (0 == 0 /\ -1+e^post4 == 0), cost: 1 New rule: l3 -> l0 : e^0'=1, n^0'=n^post4, 0 == 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : e^0'=e^post5, n^0'=n^post5, (n^0-n^post5 == 0 /\ e^0-e^post5 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 6: l0 -> l1 : e^0'=1+e^0, n^0'=11+n^0, (-1+e^0 >= 0 /\ -100+n^0 <= 0), cost: 1 8: l0 -> l2 : e^0'=-1+e^0, n^0'=-10+n^0, (-1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 7: l1 -> l0 : TRUE, cost: 1 9: l2 -> l0 : TRUE, cost: 1 10: l3 -> l0 : e^0'=1, n^0'=n^post4, 0 == 0, cost: 1 11: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l0 : e^0'=1, n^0'=n^post4, 0 == 0, cost: 1 New rule: l4 -> l0 : e^0'=1, n^0'=n^post4, 0 == 0, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : e^0'=1+e^0, n^0'=11+n^0, (-1+e^0 >= 0 /\ -100+n^0 <= 0), cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (-1+e^0 >= 0 /\ -100+n^0 <= 0), cost: 2 Applied deletion Removed the following rules: 6 7 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : e^0'=-1+e^0, n^0'=-10+n^0, (-1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (-1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 2 Applied deletion Removed the following rules: 8 9 Eliminated locations on linear paths Start location: l4 13: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (-1+e^0 >= 0 /\ -100+n^0 <= 0), cost: 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS