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