Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097685
details
property
value
status
complete
benchmark
ex11.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.363023 seconds
cpu usage
0.371079
user time
0.32766
system time
0.043419
max virtual memory
113188.0
max residence set size
29128.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l6 0: l0 -> l1 : len^0'=len^post0, tmp^0'=tmp^post0, (tmp^0-tmp^post0 == 0 /\ -1-len^0+len^post0 == 0), cost: 1 7: l1 -> l3 : len^0'=len^post7, tmp^0'=tmp^post7, (0 == 0 /\ len^0-len^post7 == 0), cost: 1 1: l2 -> l0 : len^0'=len^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ len^0-len^post1 == 0 /\ 5-len^0 <= 0), cost: 1 2: l2 -> l0 : len^0'=len^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ len^0-len^post2 == 0 /\ -3+len^0 <= 0), cost: 1 3: l2 -> l0 : len^0'=len^post3, tmp^0'=tmp^post3, (len^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ -4+len^0 <= 0 /\ 4-len^0 <= 0), cost: 1 4: l3 -> l4 : len^0'=len^post4, tmp^0'=tmp^post4, (len^0-len^post4 == 0 /\ -tmp^0 <= 0 /\ -tmp^post4+tmp^0 == 0 /\ tmp^0 <= 0), cost: 1 5: l3 -> l2 : len^0'=len^post5, tmp^0'=tmp^post5, (tmp^0-tmp^post5 == 0 /\ 1-tmp^0 <= 0 /\ len^0-len^post5 == 0), cost: 1 6: l3 -> l2 : len^0'=len^post6, tmp^0'=tmp^post6, (-tmp^post6+tmp^0 == 0 /\ 1+tmp^0 <= 0 /\ len^0-len^post6 == 0), cost: 1 8: l5 -> l1 : len^0'=len^post8, tmp^0'=tmp^post8, (len^post8 == 0 /\ tmp^0-tmp^post8 == 0), cost: 1 9: l6 -> l5 : len^0'=len^post9, tmp^0'=tmp^post9, (-tmp^post9+tmp^0 == 0 /\ len^0-len^post9 == 0), cost: 1 Removed unreachable rules and leafs Start location: l6 0: l0 -> l1 : len^0'=len^post0, tmp^0'=tmp^post0, (tmp^0-tmp^post0 == 0 /\ -1-len^0+len^post0 == 0), cost: 1 7: l1 -> l3 : len^0'=len^post7, tmp^0'=tmp^post7, (0 == 0 /\ len^0-len^post7 == 0), cost: 1 1: l2 -> l0 : len^0'=len^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ len^0-len^post1 == 0 /\ 5-len^0 <= 0), cost: 1 2: l2 -> l0 : len^0'=len^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ len^0-len^post2 == 0 /\ -3+len^0 <= 0), cost: 1 3: l2 -> l0 : len^0'=len^post3, tmp^0'=tmp^post3, (len^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ -4+len^0 <= 0 /\ 4-len^0 <= 0), cost: 1 5: l3 -> l2 : len^0'=len^post5, tmp^0'=tmp^post5, (tmp^0-tmp^post5 == 0 /\ 1-tmp^0 <= 0 /\ len^0-len^post5 == 0), cost: 1 6: l3 -> l2 : len^0'=len^post6, tmp^0'=tmp^post6, (-tmp^post6+tmp^0 == 0 /\ 1+tmp^0 <= 0 /\ len^0-len^post6 == 0), cost: 1 8: l5 -> l1 : len^0'=len^post8, tmp^0'=tmp^post8, (len^post8 == 0 /\ tmp^0-tmp^post8 == 0), cost: 1 9: l6 -> l5 : len^0'=len^post9, tmp^0'=tmp^post9, (-tmp^post9+tmp^0 == 0 /\ len^0-len^post9 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : len^0'=len^post0, tmp^0'=tmp^post0, (tmp^0-tmp^post0 == 0 /\ -1-len^0+len^post0 == 0), cost: 1 New rule: l0 -> l1 : len^0'=1+len^0, TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : len^0'=len^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ len^0-len^post1 == 0 /\ 5-len^0 <= 0), cost: 1 New rule: l2 -> l0 : -5+len^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : len^0'=len^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ len^0-len^post2 == 0 /\ -3+len^0 <= 0), cost: 1 New rule: l2 -> l0 : -3+len^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : len^0'=len^post3, tmp^0'=tmp^post3, (len^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ -4+len^0 <= 0 /\ 4-len^0 <= 0), cost: 1 New rule: l2 -> l0 : len^0'=0, -4+len^0 == 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : len^0'=len^post5, tmp^0'=tmp^post5, (tmp^0-tmp^post5 == 0 /\ 1-tmp^0 <= 0 /\ len^0-len^post5 == 0), cost: 1 New rule: l3 -> l2 : -1+tmp^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : len^0'=len^post6, tmp^0'=tmp^post6, (-tmp^post6+tmp^0 == 0 /\ 1+tmp^0 <= 0 /\ len^0-len^post6 == 0), cost: 1 New rule: l3 -> l2 : 1+tmp^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l3 : len^0'=len^post7, tmp^0'=tmp^post7, (0 == 0 /\ len^0-len^post7 == 0), cost: 1 New rule: l1 -> l3 : tmp^0'=tmp^post7, 0 == 0, cost: 1 Applied preprocessing Original rule: l5 -> l1 : len^0'=len^post8, tmp^0'=tmp^post8, (len^post8 == 0 /\ tmp^0-tmp^post8 == 0), cost: 1 New rule: l5 -> l1 : len^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l5 : len^0'=len^post9, tmp^0'=tmp^post9, (-tmp^post9+tmp^0 == 0 /\ len^0-len^post9 == 0), cost: 1 New rule: l6 -> l5 : TRUE, cost: 1 Simplified rules Start location: l6 10: l0 -> l1 : len^0'=1+len^0, TRUE, cost: 1 16: l1 -> l3 : tmp^0'=tmp^post7, 0 == 0, cost: 1 11: l2 -> l0 : -5+len^0 >= 0, cost: 1 12: l2 -> l0 : -3+len^0 <= 0, cost: 1 13: l2 -> l0 : len^0'=0, -4+len^0 == 0, cost: 1 14: l3 -> l2 : -1+tmp^0 >= 0, cost: 1 15: l3 -> l2 : 1+tmp^0 <= 0, cost: 1 17: l5 -> l1 : len^0'=0, TRUE, cost: 1 18: l6 -> l5 : TRUE, cost: 1 Eliminating location l5 by chaining: Applied chaining First rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS