Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097085
details
property
value
status
complete
benchmark
florian_sumit.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)
1.84891 seconds
cpu usage
1.86736
user time
1.78189
system time
0.085469
max virtual memory
278608.0
max residence set size
23312.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l8 0: l0 -> l1 : id^0'=id^post0, tmp^0'=tmp^post0, maxId^0'=maxId^post0, tmp___0^0'=tmp___0^post0, (-tmp___0^post0+tmp___0^0 == 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0-maxId^post0 == 0 /\ id^0-id^post0 == 0 /\ tmp^post0 == 0), cost: 1 1: l0 -> l1 : id^0'=id^post1, tmp^0'=tmp^post1, maxId^0'=maxId^post1, tmp___0^0'=tmp___0^post1, (tmp^0-maxId^0 <= 0 /\ -maxId^post1+maxId^0 == 0 /\ -1+tmp^post1-tmp^0 == 0 /\ id^0-id^post1 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1 9: l1 -> l5 : id^0'=id^post9, tmp^0'=tmp^post9, maxId^0'=maxId^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ id^0-id^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -maxId^post9+maxId^0 == 0), cost: 1 2: l2 -> l3 : id^0'=id^post2, tmp^0'=tmp^post2, maxId^0'=maxId^post2, tmp___0^0'=tmp___0^post2, (-maxId^post2+maxId^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ tmp___0^0 <= 0 /\ -tmp___0^0 <= 0 /\ -tmp___0^post2+tmp___0^0 == 0 /\ id^0-id^post2 == 0), cost: 1 3: l2 -> l0 : id^0'=id^post3, tmp^0'=tmp^post3, maxId^0'=maxId^post3, tmp___0^0'=tmp___0^post3, (id^0-id^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ maxId^0-maxId^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ 1-tmp___0^0 <= 0), cost: 1 4: l2 -> l0 : id^0'=id^post4, tmp^0'=tmp^post4, maxId^0'=maxId^post4, tmp___0^0'=tmp___0^post4, (1+tmp___0^0 <= 0 /\ id^0-id^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -maxId^post4+maxId^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 10: l3 -> l6 : id^0'=id^post10, tmp^0'=tmp^post10, maxId^0'=maxId^post10, tmp___0^0'=tmp___0^post10, (-tmp___0^post10+tmp___0^0 == 0 /\ id^0-id^post10 == 0 /\ -maxId^post10+maxId^0 == 0 /\ tmp^0-tmp^post10 == 0), cost: 1 5: l4 -> l2 : id^0'=id^post5, tmp^0'=tmp^post5, maxId^0'=maxId^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ id^0-id^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -maxId^post5+maxId^0 == 0), cost: 1 6: l5 -> l3 : id^0'=id^post6, tmp^0'=tmp^post6, maxId^0'=maxId^post6, tmp___0^0'=tmp___0^post6, (tmp^0-tmp^post6 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ id^0-id^post6 == 0 /\ id^0-tmp^0 <= 0 /\ -maxId^post6+maxId^0 == 0 /\ -id^0+tmp^0 <= 0), cost: 1 7: l5 -> l4 : id^0'=id^post7, tmp^0'=tmp^post7, maxId^0'=maxId^post7, tmp___0^0'=tmp___0^post7, (id^0-id^post7 == 0 /\ maxId^0-maxId^post7 == 0 /\ 1+id^0-tmp^0 <= 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0), cost: 1 8: l5 -> l4 : id^0'=id^post8, tmp^0'=tmp^post8, maxId^0'=maxId^post8, tmp___0^0'=tmp___0^post8, (-tmp___0^post8+tmp___0^0 == 0 /\ -maxId^post8+maxId^0 == 0 /\ id^0-id^post8 == 0 /\ 1-id^0+tmp^0 <= 0 /\ tmp^0-tmp^post8 == 0), cost: 1 11: l7 -> l1 : id^0'=id^post11, tmp^0'=tmp^post11, maxId^0'=maxId^post11, tmp___0^0'=tmp___0^post11, (maxId^0-maxId^post11 == 0 /\ -id^0 <= 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -1-id^0+tmp^post11 == 0 /\ id^0-id^post11 == 0 /\ id^0-maxId^0 <= 0), cost: 1 12: l8 -> l7 : id^0'=id^post12, tmp^0'=tmp^post12, maxId^0'=maxId^post12, tmp___0^0'=tmp___0^post12, (maxId^0-maxId^post12 == 0 /\ id^0-id^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ tmp^0-tmp^post12 == 0), cost: 1 Removed unreachable rules and leafs Start location: l8 0: l0 -> l1 : id^0'=id^post0, tmp^0'=tmp^post0, maxId^0'=maxId^post0, tmp___0^0'=tmp___0^post0, (-tmp___0^post0+tmp___0^0 == 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0-maxId^post0 == 0 /\ id^0-id^post0 == 0 /\ tmp^post0 == 0), cost: 1 1: l0 -> l1 : id^0'=id^post1, tmp^0'=tmp^post1, maxId^0'=maxId^post1, tmp___0^0'=tmp___0^post1, (tmp^0-maxId^0 <= 0 /\ -maxId^post1+maxId^0 == 0 /\ -1+tmp^post1-tmp^0 == 0 /\ id^0-id^post1 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1 9: l1 -> l5 : id^0'=id^post9, tmp^0'=tmp^post9, maxId^0'=maxId^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ id^0-id^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -maxId^post9+maxId^0 == 0), cost: 1 3: l2 -> l0 : id^0'=id^post3, tmp^0'=tmp^post3, maxId^0'=maxId^post3, tmp___0^0'=tmp___0^post3, (id^0-id^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ maxId^0-maxId^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ 1-tmp___0^0 <= 0), cost: 1 4: l2 -> l0 : id^0'=id^post4, tmp^0'=tmp^post4, maxId^0'=maxId^post4, tmp___0^0'=tmp___0^post4, (1+tmp___0^0 <= 0 /\ id^0-id^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -maxId^post4+maxId^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 5: l4 -> l2 : id^0'=id^post5, tmp^0'=tmp^post5, maxId^0'=maxId^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ id^0-id^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -maxId^post5+maxId^0 == 0), cost: 1 7: l5 -> l4 : id^0'=id^post7, tmp^0'=tmp^post7, maxId^0'=maxId^post7, tmp___0^0'=tmp___0^post7, (id^0-id^post7 == 0 /\ maxId^0-maxId^post7 == 0 /\ 1+id^0-tmp^0 <= 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0), cost: 1 8: l5 -> l4 : id^0'=id^post8, tmp^0'=tmp^post8, maxId^0'=maxId^post8, tmp___0^0'=tmp___0^post8, (-tmp___0^post8+tmp___0^0 == 0 /\ -maxId^post8+maxId^0 == 0 /\ id^0-id^post8 == 0 /\ 1-id^0+tmp^0 <= 0 /\ tmp^0-tmp^post8 == 0), cost: 1 11: l7 -> l1 : id^0'=id^post11, tmp^0'=tmp^post11, maxId^0'=maxId^post11, tmp___0^0'=tmp___0^post11, (maxId^0-maxId^post11 == 0 /\ -id^0 <= 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -1-id^0+tmp^post11 == 0 /\ id^0-id^post11 == 0 /\ id^0-maxId^0 <= 0), cost: 1 12: l8 -> l7 : id^0'=id^post12, tmp^0'=tmp^post12, maxId^0'=maxId^post12, tmp___0^0'=tmp___0^post12, (maxId^0-maxId^post12 == 0 /\ id^0-id^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ tmp^0-tmp^post12 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : id^0'=id^post0, tmp^0'=tmp^post0, maxId^0'=maxId^post0, tmp___0^0'=tmp___0^post0, (-tmp___0^post0+tmp___0^0 == 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0-maxId^post0 == 0 /\ id^0-id^post0 == 0 /\ tmp^post0 == 0), cost: 1 New rule: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : id^0'=id^post1, tmp^0'=tmp^post1, maxId^0'=maxId^post1, tmp___0^0'=tmp___0^post1, (tmp^0-maxId^0 <= 0 /\ -maxId^post1+maxId^0 == 0 /\ -1+tmp^post1-tmp^0 == 0 /\ id^0-id^post1 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1 New rule: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : id^0'=id^post3, tmp^0'=tmp^post3, maxId^0'=maxId^post3, tmp___0^0'=tmp___0^post3, (id^0-id^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ maxId^0-maxId^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ 1-tmp___0^0 <= 0), cost: 1 New rule: l2 -> l0 : -1+tmp___0^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : id^0'=id^post4, tmp^0'=tmp^post4, maxId^0'=maxId^post4, tmp___0^0'=tmp___0^post4, (1+tmp___0^0 <= 0 /\ id^0-id^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -maxId^post4+maxId^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 New rule: l2 -> l0 : 1+tmp___0^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l2 : id^0'=id^post5, tmp^0'=tmp^post5, maxId^0'=maxId^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ id^0-id^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -maxId^post5+maxId^0 == 0), cost: 1 New rule: l4 -> l2 : tmp___0^0'=tmp___0^post5, 0 == 0, cost: 1 Applied preprocessing Original rule: l5 -> l4 : id^0'=id^post7, tmp^0'=tmp^post7, maxId^0'=maxId^post7, tmp___0^0'=tmp___0^post7, (id^0-id^post7 == 0 /\ maxId^0-maxId^post7 == 0 /\ 1+id^0-tmp^0 <= 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0), cost: 1 New rule: l5 -> l4 : 1+id^0-tmp^0 <= 0, cost: 1 Applied preprocessing Original rule: l5 -> l4 : id^0'=id^post8, tmp^0'=tmp^post8, maxId^0'=maxId^post8, tmp___0^0'=tmp___0^post8, (-tmp___0^post8+tmp___0^0 == 0 /\ -maxId^post8+maxId^0 == 0 /\ id^0-id^post8 == 0 /\ 1-id^0+tmp^0 <= 0 /\ tmp^0-tmp^post8 == 0), cost: 1 New rule: l5 -> l4 : 1-id^0+tmp^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l5 : id^0'=id^post9, tmp^0'=tmp^post9, maxId^0'=maxId^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ id^0-id^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -maxId^post9+maxId^0 == 0), cost: 1 New rule: l1 -> l5 : TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l1 : id^0'=id^post11, tmp^0'=tmp^post11, maxId^0'=maxId^post11, tmp___0^0'=tmp___0^post11, (maxId^0-maxId^post11 == 0 /\ -id^0 <= 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -1-id^0+tmp^post11 == 0 /\ id^0-id^post11 == 0 /\ id^0-maxId^0 <= 0), cost: 1 New rule: l7 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 1 Applied preprocessing Original rule: l8 -> l7 : id^0'=id^post12, tmp^0'=tmp^post12, maxId^0'=maxId^post12, tmp___0^0'=tmp___0^post12, (maxId^0-maxId^post12 == 0 /\ id^0-id^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ tmp^0-tmp^post12 == 0), cost: 1 New rule: l8 -> l7 : TRUE, cost: 1 Simplified rules Start location: l8 13: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1 14: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1 20: l1 -> l5 : TRUE, cost: 1 15: l2 -> l0 : -1+tmp___0^0 >= 0, cost: 1 16: l2 -> l0 : 1+tmp___0^0 <= 0, cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS