details

property	value
status	complete
benchmark	Liveness6.4.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n180.star.cs.uiowa.edu
space	AProVE_04

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.585767 seconds
cpu usage	0.092024
user time	0.051846
system time	0.040178
max virtual memory	113188.0
max residence set size	6460.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: top1(free(x),y) -> top2(check(new(x)),y) 2: top1(free(x),y) -> top2(new(x),check(y)) 3: top1(free(x),y) -> top2(check(x),new(y)) 4: top1(free(x),y) -> top2(x,check(new(y))) 5: top2(x,free(y)) -> top1(check(new(x)),y) 6: top2(x,free(y)) -> top1(new(x),check(y)) 7: top2(x,free(y)) -> top1(check(x),new(y)) 8: top2(x,free(y)) -> top1(x,check(new(y))) 9: new(free(x)) -> free(new(x)) 10: old(free(x)) -> free(old(x)) 11: new(serve()) -> free(serve()) 12: old(serve()) -> free(serve()) 13: check(free(x)) -> free(check(x)) 14: check(new(x)) -> new(check(x)) 15: check(old(x)) -> old(check(x)) 16: check(old(x)) -> old(x) Number of strict rules: 16 Direct POLO(bPol) ... removes: 12 new w: x1 top1 w: 2 * x1 + x2 + 21655 serve w: 18458 free w: x1 top2 w: 2 * x1 + x2 + 21655 check w: x1 old w: x1 + 25907 Number of strict rules: 15 Direct POLO(bPol) ... removes: 10 new w: x1 + 2 top1 w: x1 + x2 + 46418 serve w: 1 free w: x1 + 2 top2 w: x1 + x2 + 46418 check w: x1 old w: 2 * x1 + 28224 Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #top1(free(x),y) -> #top2(new(x),check(y)) #2: #top1(free(x),y) -> #new(x) #3: #top1(free(x),y) -> #check(y) #4: #top2(x,free(y)) -> #top1(new(x),check(y)) #5: #top2(x,free(y)) -> #new(x) #6: #top2(x,free(y)) -> #check(y) #7: #check(free(x)) -> #check(x) #8: #new(free(x)) -> #new(x) #9: #check(new(x)) -> #new(check(x)) #10: #check(new(x)) -> #check(x) #11: #top2(x,free(y)) -> #top1(check(x),new(y)) #12: #top2(x,free(y)) -> #check(x) #13: #top2(x,free(y)) -> #new(y) #14: #top2(x,free(y)) -> #top1(check(new(x)),y) #15: #top2(x,free(y)) -> #check(new(x)) #16: #top2(x,free(y)) -> #new(x) #17: #top1(free(x),y) -> #top2(check(x),new(y)) #18: #top1(free(x),y) -> #check(x) #19: #top1(free(x),y) -> #new(y) #20: #top1(free(x),y) -> #top2(check(new(x)),y) #21: #top1(free(x),y) -> #check(new(x)) #22: #top1(free(x),y) -> #new(x) #23: #top2(x,free(y)) -> #top1(x,check(new(y))) #24: #top2(x,free(y)) -> #check(new(y)) #25: #top2(x,free(y)) -> #new(y) #26: #check(old(x)) -> #check(x) #27: #top1(free(x),y) -> #top2(x,check(new(y))) #28: #top1(free(x),y) -> #check(new(y)) #29: #top1(free(x),y) -> #new(y) Number of SCCs: 3, DPs: 12 SCC { #8 } POLO(Sum)... succeeded. new w: 0 #top2 w: 0 top1 w: 0 #check w: 0 #top1 w: 0 serve w: 0 free w: x1 + 1 top2 w: 0 check w: 0 #new w: x1 old w: 0 USABLE RULES: { } Removed DPs: #8 Number of SCCs: 2, DPs: 11 SCC { #7 #10 #26 } POLO(Sum)... succeeded. new w: x1 + 1 #top2 w: 0 top1 w: 0 #check w: x1 #top1 w: 0 serve w: 0 free w: x1 + 1 top2 w: 0 check w: 0 #new w: 0 old w: x1 + 1 USABLE RULES: { } popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard