Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487096875
details
property
value
status
complete
benchmark
intSqRoot.t2.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_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.114239 seconds
cpu usage
0.117269
user time
0.100309
system time
0.01696
max virtual memory
113188.0
max residence set size
8148.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l5 0: l0 -> l1 : N^0'=N^post0, q^0'=q^post0, p^0'=p^post0, r^0'=r^post0, (p^0-p^post0 == 0 /\ N^0-N^post0 == 0 /\ r^post0-p^0 == 0 /\ q^0-q^post0 == 0), cost: 1 1: l0 -> l1 : N^0'=N^post1, q^0'=q^post1, p^0'=p^post1, r^0'=r^post1, (-p^post1+p^0 == 0 /\ N^0-N^post1 == 0 /\ q^post1-p^0 == 0 /\ -r^post1+r^0 == 0), cost: 1 4: l1 -> l2 : N^0'=N^post4, q^0'=q^post4, p^0'=p^post4, r^0'=r^post4, (N^0-N^post4 == 0 /\ -r^post4+r^0 == 0 /\ -p^post4+p^0 == 0 /\ -q^post4+q^0 == 0), cost: 1 2: l2 -> l3 : N^0'=N^post2, q^0'=q^post2, p^0'=p^post2, r^0'=r^post2, (-p^post2+p^0 == 0 /\ -1+q^0-r^0 <= 0 /\ q^0-q^post2 == 0 /\ -r^post2+r^0 == 0 /\ N^0-N^post2 == 0), cost: 1 3: l2 -> l0 : N^0'=N^post3, q^0'=q^post3, p^0'=p^post3, r^0'=r^post3, (0 == 0 /\ N^0-N^post3 == 0 /\ q^0-q^post3 == 0 /\ 2-q^0+r^0 <= 0 /\ -r^post3+r^0 == 0), cost: 1 5: l4 -> l1 : N^0'=N^post5, q^0'=q^post5, p^0'=p^post5, r^0'=r^post5, (-1+r^post5 == 0 /\ N^0-N^post5 == 0 /\ -N^0+q^post5 == 0 /\ -p^post5+p^0 == 0), cost: 1 6: l5 -> l4 : N^0'=N^post6, q^0'=q^post6, p^0'=p^post6, r^0'=r^post6, (q^0-q^post6 == 0 /\ r^0-r^post6 == 0 /\ N^0-N^post6 == 0 /\ -p^post6+p^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l5 0: l0 -> l1 : N^0'=N^post0, q^0'=q^post0, p^0'=p^post0, r^0'=r^post0, (p^0-p^post0 == 0 /\ N^0-N^post0 == 0 /\ r^post0-p^0 == 0 /\ q^0-q^post0 == 0), cost: 1 1: l0 -> l1 : N^0'=N^post1, q^0'=q^post1, p^0'=p^post1, r^0'=r^post1, (-p^post1+p^0 == 0 /\ N^0-N^post1 == 0 /\ q^post1-p^0 == 0 /\ -r^post1+r^0 == 0), cost: 1 4: l1 -> l2 : N^0'=N^post4, q^0'=q^post4, p^0'=p^post4, r^0'=r^post4, (N^0-N^post4 == 0 /\ -r^post4+r^0 == 0 /\ -p^post4+p^0 == 0 /\ -q^post4+q^0 == 0), cost: 1 3: l2 -> l0 : N^0'=N^post3, q^0'=q^post3, p^0'=p^post3, r^0'=r^post3, (0 == 0 /\ N^0-N^post3 == 0 /\ q^0-q^post3 == 0 /\ 2-q^0+r^0 <= 0 /\ -r^post3+r^0 == 0), cost: 1 5: l4 -> l1 : N^0'=N^post5, q^0'=q^post5, p^0'=p^post5, r^0'=r^post5, (-1+r^post5 == 0 /\ N^0-N^post5 == 0 /\ -N^0+q^post5 == 0 /\ -p^post5+p^0 == 0), cost: 1 6: l5 -> l4 : N^0'=N^post6, q^0'=q^post6, p^0'=p^post6, r^0'=r^post6, (q^0-q^post6 == 0 /\ r^0-r^post6 == 0 /\ N^0-N^post6 == 0 /\ -p^post6+p^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : N^0'=N^post0, q^0'=q^post0, p^0'=p^post0, r^0'=r^post0, (p^0-p^post0 == 0 /\ N^0-N^post0 == 0 /\ r^post0-p^0 == 0 /\ q^0-q^post0 == 0), cost: 1 New rule: l0 -> l1 : r^0'=p^0, TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l1 : N^0'=N^post1, q^0'=q^post1, p^0'=p^post1, r^0'=r^post1, (-p^post1+p^0 == 0 /\ N^0-N^post1 == 0 /\ q^post1-p^0 == 0 /\ -r^post1+r^0 == 0), cost: 1 New rule: l0 -> l1 : q^0'=p^0, TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : N^0'=N^post3, q^0'=q^post3, p^0'=p^post3, r^0'=r^post3, (0 == 0 /\ N^0-N^post3 == 0 /\ q^0-q^post3 == 0 /\ 2-q^0+r^0 <= 0 /\ -r^post3+r^0 == 0), cost: 1 New rule: l2 -> l0 : p^0'=p^post3, 2-q^0+r^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l2 : N^0'=N^post4, q^0'=q^post4, p^0'=p^post4, r^0'=r^post4, (N^0-N^post4 == 0 /\ -r^post4+r^0 == 0 /\ -p^post4+p^0 == 0 /\ -q^post4+q^0 == 0), cost: 1 New rule: l1 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l1 : N^0'=N^post5, q^0'=q^post5, p^0'=p^post5, r^0'=r^post5, (-1+r^post5 == 0 /\ N^0-N^post5 == 0 /\ -N^0+q^post5 == 0 /\ -p^post5+p^0 == 0), cost: 1 New rule: l4 -> l1 : q^0'=N^0, r^0'=1, TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : N^0'=N^post6, q^0'=q^post6, p^0'=p^post6, r^0'=r^post6, (q^0-q^post6 == 0 /\ r^0-r^post6 == 0 /\ N^0-N^post6 == 0 /\ -p^post6+p^0 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l1 : r^0'=p^0, TRUE, cost: 1 8: l0 -> l1 : q^0'=p^0, TRUE, cost: 1 10: l1 -> l2 : TRUE, cost: 1 9: l2 -> l0 : p^0'=p^post3, 2-q^0+r^0 <= 0, cost: 1 11: l4 -> l1 : q^0'=N^0, r^0'=1, TRUE, cost: 1 12: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l1 : q^0'=N^0, r^0'=1, TRUE, cost: 1 New rule: l5 -> l1 : q^0'=N^0, r^0'=1, TRUE, cost: 2 Applied deletion Removed the following rules: 11 12 Eliminating location l2 by chaining: Applied chaining First rule: l1 -> l2 : TRUE, cost: 1 Second rule: l2 -> l0 : p^0'=p^post3, 2-q^0+r^0 <= 0, cost: 1 New rule: l1 -> l0 : p^0'=p^post3, 2-q^0+r^0 <= 0, cost: 2 Applied deletion Removed the following rules: 9 10 Eliminated locations on linear paths Start location: l5 7: l0 -> l1 : r^0'=p^0, TRUE, cost: 1 8: l0 -> l1 : q^0'=p^0, TRUE, cost: 1 14: l1 -> l0 : p^0'=p^post3, 2-q^0+r^0 <= 0, cost: 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS