Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098588
details
property
value
status
complete
benchmark
heidy7.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.174549 seconds
cpu usage
0.178017
user time
0.149552
system time
0.028465
max virtual memory
113188.0
max residence set size
19012.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l5 0: l0 -> l1 : nd^0'=nd^post0, x^0'=x^post0, p^0'=p^post0, (nd^0 <= 0 /\ nd^0-nd^post0 == 0 /\ x^0-x^post0 == 0 /\ -2+p^post0 == 0), cost: 1 1: l0 -> l1 : nd^0'=nd^post1, x^0'=x^post1, p^0'=p^post1, (1-nd^0 <= 0 /\ x^0-x^post1 == 0 /\ nd^0-nd^post1 == 0 /\ -1+p^post1 == 0), cost: 1 2: l1 -> l0 : nd^0'=nd^post2, x^0'=x^post2, p^0'=p^post2, (0 == 0 /\ x^0-x^post2 == 0 /\ p^0-p^post2 == 0), cost: 1 3: l2 -> l3 : nd^0'=nd^post3, x^0'=x^post3, p^0'=p^post3, (nd^0 <= 0 /\ p^0-p^post3 == 0 /\ 2-x^0+x^post3 == 0 /\ nd^0-nd^post3 == 0), cost: 1 4: l2 -> l3 : nd^0'=nd^post4, x^0'=x^post4, p^0'=p^post4, (1-nd^0 <= 0 /\ 1-x^0+x^post4 == 0 /\ p^0-p^post4 == 0 /\ nd^0-nd^post4 == 0), cost: 1 5: l3 -> l1 : nd^0'=nd^post5, x^0'=x^post5, p^0'=p^post5, (x^0 <= 0 /\ nd^0-nd^post5 == 0 /\ x^0-x^post5 == 0 /\ p^0-p^post5 == 0), cost: 1 6: l3 -> l2 : nd^0'=nd^post6, x^0'=x^post6, p^0'=p^post6, (0 == 0 /\ p^0-p^post6 == 0 /\ 1-x^0 <= 0 /\ x^0-x^post6 == 0), cost: 1 7: l4 -> l3 : nd^0'=nd^post7, x^0'=x^post7, p^0'=p^post7, (p^post7 == 0 /\ x^0-x^post7 == 0 /\ nd^0-nd^post7 == 0), cost: 1 8: l5 -> l4 : nd^0'=nd^post8, x^0'=x^post8, p^0'=p^post8, (nd^0-nd^post8 == 0 /\ x^0-x^post8 == 0 /\ p^0-p^post8 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : nd^0'=nd^post0, x^0'=x^post0, p^0'=p^post0, (nd^0 <= 0 /\ nd^0-nd^post0 == 0 /\ x^0-x^post0 == 0 /\ -2+p^post0 == 0), cost: 1 New rule: l0 -> l1 : p^0'=2, nd^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : nd^0'=nd^post1, x^0'=x^post1, p^0'=p^post1, (1-nd^0 <= 0 /\ x^0-x^post1 == 0 /\ nd^0-nd^post1 == 0 /\ -1+p^post1 == 0), cost: 1 New rule: l0 -> l1 : p^0'=1, -1+nd^0 >= 0, cost: 1 Applied preprocessing Original rule: l1 -> l0 : nd^0'=nd^post2, x^0'=x^post2, p^0'=p^post2, (0 == 0 /\ x^0-x^post2 == 0 /\ p^0-p^post2 == 0), cost: 1 New rule: l1 -> l0 : nd^0'=nd^post2, 0 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : nd^0'=nd^post3, x^0'=x^post3, p^0'=p^post3, (nd^0 <= 0 /\ p^0-p^post3 == 0 /\ 2-x^0+x^post3 == 0 /\ nd^0-nd^post3 == 0), cost: 1 New rule: l2 -> l3 : x^0'=-2+x^0, nd^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : nd^0'=nd^post4, x^0'=x^post4, p^0'=p^post4, (1-nd^0 <= 0 /\ 1-x^0+x^post4 == 0 /\ p^0-p^post4 == 0 /\ nd^0-nd^post4 == 0), cost: 1 New rule: l2 -> l3 : x^0'=-1+x^0, -1+nd^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : nd^0'=nd^post5, x^0'=x^post5, p^0'=p^post5, (x^0 <= 0 /\ nd^0-nd^post5 == 0 /\ x^0-x^post5 == 0 /\ p^0-p^post5 == 0), cost: 1 New rule: l3 -> l1 : x^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : nd^0'=nd^post6, x^0'=x^post6, p^0'=p^post6, (0 == 0 /\ p^0-p^post6 == 0 /\ 1-x^0 <= 0 /\ x^0-x^post6 == 0), cost: 1 New rule: l3 -> l2 : nd^0'=nd^post6, -1+x^0 >= 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : nd^0'=nd^post7, x^0'=x^post7, p^0'=p^post7, (p^post7 == 0 /\ x^0-x^post7 == 0 /\ nd^0-nd^post7 == 0), cost: 1 New rule: l4 -> l3 : p^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : nd^0'=nd^post8, x^0'=x^post8, p^0'=p^post8, (nd^0-nd^post8 == 0 /\ x^0-x^post8 == 0 /\ p^0-p^post8 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 9: l0 -> l1 : p^0'=2, nd^0 <= 0, cost: 1 10: l0 -> l1 : p^0'=1, -1+nd^0 >= 0, cost: 1 11: l1 -> l0 : nd^0'=nd^post2, 0 == 0, cost: 1 12: l2 -> l3 : x^0'=-2+x^0, nd^0 <= 0, cost: 1 13: l2 -> l3 : x^0'=-1+x^0, -1+nd^0 >= 0, cost: 1 14: l3 -> l1 : x^0 <= 0, cost: 1 15: l3 -> l2 : nd^0'=nd^post6, -1+x^0 >= 0, cost: 1 16: l4 -> l3 : p^0'=0, TRUE, cost: 1 17: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l3 : p^0'=0, TRUE, cost: 1 New rule: l5 -> l3 : p^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 16 17 Eliminated locations on linear paths Start location: l5 9: l0 -> l1 : p^0'=2, nd^0 <= 0, cost: 1 10: l0 -> l1 : p^0'=1, -1+nd^0 >= 0, cost: 1 11: l1 -> l0 : nd^0'=nd^post2, 0 == 0, cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS