Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487096761
details
property
value
status
complete
benchmark
p-1b.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.062254 seconds
cpu usage
0.063111
user time
0.048708
system time
0.014403
max virtual memory
113188.0
max residence set size
18472.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l4 0: l0 -> l1 : Result_4^0'=Result_4^post0, y_6^0'=y_6^post0, x_5^0'=x_5^post0, (0 == 0 /\ y_6^0-x_5^0 <= 0 /\ y_6^0-y_6^post0 == 0 /\ -x_5^post0+x_5^0 == 0), cost: 1 1: l0 -> l2 : Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, x_5^0'=x_5^post1, (y_6^0-y_6^post1 == 0 /\ Result_4^0-Result_4^post1 == 0 /\ 1-y_6^0+x_5^0 <= 0 /\ -1-x_5^0+x_5^post1 == 0), cost: 1 2: l2 -> l0 : Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, x_5^0'=x_5^post2, (y_6^0-y_6^post2 == 0 /\ x_5^0-x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 3: l3 -> l0 : Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, x_5^0'=x_5^post3, (x_5^0-x_5^post3 == 0 /\ Result_4^0-Result_4^post3 == 0 /\ y_6^0-y_6^post3 == 0), cost: 1 4: l4 -> l3 : Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, x_5^0'=x_5^post4, (y_6^0-y_6^post4 == 0 /\ x_5^0-x_5^post4 == 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 1: l0 -> l2 : Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, x_5^0'=x_5^post1, (y_6^0-y_6^post1 == 0 /\ Result_4^0-Result_4^post1 == 0 /\ 1-y_6^0+x_5^0 <= 0 /\ -1-x_5^0+x_5^post1 == 0), cost: 1 2: l2 -> l0 : Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, x_5^0'=x_5^post2, (y_6^0-y_6^post2 == 0 /\ x_5^0-x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 3: l3 -> l0 : Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, x_5^0'=x_5^post3, (x_5^0-x_5^post3 == 0 /\ Result_4^0-Result_4^post3 == 0 /\ y_6^0-y_6^post3 == 0), cost: 1 4: l4 -> l3 : Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, x_5^0'=x_5^post4, (y_6^0-y_6^post4 == 0 /\ x_5^0-x_5^post4 == 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, x_5^0'=x_5^post1, (y_6^0-y_6^post1 == 0 /\ Result_4^0-Result_4^post1 == 0 /\ 1-y_6^0+x_5^0 <= 0 /\ -1-x_5^0+x_5^post1 == 0), cost: 1 New rule: l0 -> l2 : x_5^0'=1+x_5^0, 1-y_6^0+x_5^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, x_5^0'=x_5^post2, (y_6^0-y_6^post2 == 0 /\ x_5^0-x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, x_5^0'=x_5^post3, (x_5^0-x_5^post3 == 0 /\ Result_4^0-Result_4^post3 == 0 /\ y_6^0-y_6^post3 == 0), cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, x_5^0'=x_5^post4, (y_6^0-y_6^post4 == 0 /\ x_5^0-x_5^post4 == 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l2 : x_5^0'=1+x_5^0, 1-y_6^0+x_5^0 <= 0, cost: 1 6: l2 -> l0 : TRUE, cost: 1 7: l3 -> l0 : 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 -> l0 : TRUE, cost: 1 New rule: l4 -> l0 : TRUE, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : x_5^0'=1+x_5^0, 1-y_6^0+x_5^0 <= 0, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x_5^0'=1+x_5^0, 1-y_6^0+x_5^0 <= 0, cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: l4 10: l0 -> l0 : x_5^0'=1+x_5^0, 1-y_6^0+x_5^0 <= 0, cost: 2 9: l4 -> l0 : TRUE, cost: 2 Applied acceleration Original rule: l0 -> l0 : x_5^0'=1+x_5^0, 1-y_6^0+x_5^0 <= 0, cost: 2 New rule: l0 -> l0 : x_5^0'=n0+x_5^0, (n0 >= 0 /\ -n0+y_6^0-x_5^0 >= 0), cost: 2*n0 Applied instantiation Original rule: l0 -> l0 : x_5^0'=n0+x_5^0, (n0 >= 0 /\ -n0+y_6^0-x_5^0 >= 0), cost: 2*n0 New rule: l0 -> l0 : x_5^0'=y_6^0, (0 >= 0 /\ y_6^0-x_5^0 >= 0), cost: 2*y_6^0-2*x_5^0 Applied simplification Original rule: l0 -> l0 : x_5^0'=y_6^0, (0 >= 0 /\ y_6^0-x_5^0 >= 0), cost: 2*y_6^0-2*x_5^0 New rule: l0 -> l0 : x_5^0'=y_6^0, y_6^0-x_5^0 >= 0, cost: 2*y_6^0-2*x_5^0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS