Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098537
details
property
value
status
complete
benchmark
array_init_assign.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0832891 seconds
cpu usage
0.084742
user time
0.068664
system time
0.016078
max virtual memory
113188.0
max residence set size
18804.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l8 0: l0 -> l1 : i^0'=i^post0, j^0'=j^post0, (i^0-i^post0 == 0 /\ 2-i^0 <= 0 /\ j^post0 == 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, j^0'=j^post1, (-j^post1+j^0 == 0 /\ -1+i^0 <= 0 /\ -1-i^0+i^post1 == 0), cost: 1 3: l1 -> l3 : i^0'=i^post3, j^0'=j^post3, (i^0-i^post3 == 0 /\ j^0-j^post3 == 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, j^0'=j^post2, (-j^post2+j^0 == 0 /\ i^0-i^post2 == 0), cost: 1 7: l3 -> l6 : i^0'=i^post7, j^0'=j^post7, (2-j^0 <= 0 /\ i^0-i^post7 == 0 /\ -j^post7+j^0 == 0), cost: 1 8: l3 -> l1 : i^0'=i^post8, j^0'=j^post8, (i^0-i^post8 == 0 /\ -1-j^0+j^post8 == 0 /\ -1+j^0 <= 0), cost: 1 4: l4 -> l5 : i^0'=i^post4, j^0'=j^post4, (i^0-i^post4 == 0 /\ -j^post4+j^0 == 0), cost: 1 5: l6 -> l4 : i^0'=i^post5, j^0'=j^post5, (j^0-j^post5 == 0 /\ i^0-i^post5 == 0), cost: 1 6: l6 -> l4 : i^0'=i^post6, j^0'=j^post6, (-j^post6+j^0 == 0 /\ i^0-i^post6 == 0), cost: 1 9: l7 -> l2 : i^0'=i^post9, j^0'=j^post9, (i^post9 == 0 /\ -j^post9+j^0 == 0), cost: 1 10: l8 -> l7 : i^0'=i^post10, j^0'=j^post10, (-j^post10+j^0 == 0 /\ i^0-i^post10 == 0), cost: 1 Removed unreachable rules and leafs Start location: l8 0: l0 -> l1 : i^0'=i^post0, j^0'=j^post0, (i^0-i^post0 == 0 /\ 2-i^0 <= 0 /\ j^post0 == 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, j^0'=j^post1, (-j^post1+j^0 == 0 /\ -1+i^0 <= 0 /\ -1-i^0+i^post1 == 0), cost: 1 3: l1 -> l3 : i^0'=i^post3, j^0'=j^post3, (i^0-i^post3 == 0 /\ j^0-j^post3 == 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, j^0'=j^post2, (-j^post2+j^0 == 0 /\ i^0-i^post2 == 0), cost: 1 8: l3 -> l1 : i^0'=i^post8, j^0'=j^post8, (i^0-i^post8 == 0 /\ -1-j^0+j^post8 == 0 /\ -1+j^0 <= 0), cost: 1 9: l7 -> l2 : i^0'=i^post9, j^0'=j^post9, (i^post9 == 0 /\ -j^post9+j^0 == 0), cost: 1 10: l8 -> l7 : i^0'=i^post10, j^0'=j^post10, (-j^post10+j^0 == 0 /\ i^0-i^post10 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : i^0'=i^post0, j^0'=j^post0, (i^0-i^post0 == 0 /\ 2-i^0 <= 0 /\ j^post0 == 0), cost: 1 New rule: l0 -> l1 : j^0'=0, -2+i^0 >= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : i^0'=i^post1, j^0'=j^post1, (-j^post1+j^0 == 0 /\ -1+i^0 <= 0 /\ -1-i^0+i^post1 == 0), cost: 1 New rule: l0 -> l2 : i^0'=1+i^0, -1+i^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i^0'=i^post2, j^0'=j^post2, (-j^post2+j^0 == 0 /\ i^0-i^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l3 : i^0'=i^post3, j^0'=j^post3, (i^0-i^post3 == 0 /\ j^0-j^post3 == 0), cost: 1 New rule: l1 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l1 : i^0'=i^post8, j^0'=j^post8, (i^0-i^post8 == 0 /\ -1-j^0+j^post8 == 0 /\ -1+j^0 <= 0), cost: 1 New rule: l3 -> l1 : j^0'=1+j^0, -1+j^0 <= 0, cost: 1 Applied preprocessing Original rule: l7 -> l2 : i^0'=i^post9, j^0'=j^post9, (i^post9 == 0 /\ -j^post9+j^0 == 0), cost: 1 New rule: l7 -> l2 : i^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l8 -> l7 : i^0'=i^post10, j^0'=j^post10, (-j^post10+j^0 == 0 /\ i^0-i^post10 == 0), cost: 1 New rule: l8 -> l7 : TRUE, cost: 1 Simplified rules Start location: l8 11: l0 -> l1 : j^0'=0, -2+i^0 >= 0, cost: 1 12: l0 -> l2 : i^0'=1+i^0, -1+i^0 <= 0, cost: 1 14: l1 -> l3 : TRUE, cost: 1 13: l2 -> l0 : TRUE, cost: 1 15: l3 -> l1 : j^0'=1+j^0, -1+j^0 <= 0, cost: 1 16: l7 -> l2 : i^0'=0, TRUE, cost: 1 17: l8 -> l7 : TRUE, cost: 1 Eliminating location l7 by chaining: Applied chaining First rule: l8 -> l7 : TRUE, cost: 1 Second rule: l7 -> l2 : i^0'=0, TRUE, cost: 1 New rule: l8 -> l2 : i^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 16 17 Eliminating location l3 by chaining: Applied chaining First rule: l1 -> l3 : TRUE, cost: 1 Second rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS