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