details

property	value
status	complete
benchmark	queue_1000.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n033.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	14.2193 seconds
cpu usage	14.4448
user time	7.52813
system time	6.91668
max virtual memory	749852.0
max residence set size	9304.0

stage attributes

key	value
starexec-result	YES

output

14.34/14.21 YES 14.34/14.21 14.34/14.21 DP problem for innermost termination. 14.34/14.21 P = 14.34/14.21 f19#(x1, x2, x3) -> f18#(x1, x2, x3) 14.34/14.21 f18#(I0, I1, I2) -> f7#(I0, 0, I2) [y1 = 0] 14.34/14.21 f3#(I3, I4, I5) -> f17#(I3, I4, I5) 14.34/14.21 f3#(I6, I7, I8) -> f13#(I6, I7, I8) 14.34/14.21 f3#(I9, I10, I11) -> f17#(I9, I10, I11) 14.34/14.21 f17#(I12, I13, I14) -> f16#(I12, I13, I14) 14.34/14.21 f16#(I15, I16, I17) -> f15#(I15, I16, I17) 14.34/14.21 f16#(I18, I19, I20) -> f14#(I18, I19, I20) 14.34/14.21 f16#(I21, I22, I23) -> f14#(I21, I22, I23) 14.34/14.21 f15#(I24, I25, I26) -> f13#(I24, I25, I26) 14.34/14.21 f14#(I27, I28, I29) -> f15#(I27, I28, I29) 14.34/14.21 f2#(I30, I31, I32) -> f11#(I30, I31, I32) 14.34/14.21 f13#(I33, I34, I35) -> f7#(I33, 1 + I34, I35) 14.34/14.21 f11#(I36, I37, I38) -> f10#(I36, I37, I38) [1 + I37 <= 1000] 14.34/14.21 f10#(I42, I43, I44) -> f9#(I42, I43, I44) 14.34/14.21 f10#(I45, I46, I47) -> f4#(I45, I46, I47) 14.34/14.21 f10#(I48, I49, I50) -> f9#(I48, I49, I50) 14.34/14.21 f9#(I51, I52, I53) -> f8#(I51, I52, rnd3) [rnd3 = rnd3] 14.34/14.21 f8#(I54, I55, I56) -> f6#(I54, I55, I56) 14.34/14.21 f8#(I57, I58, I59) -> f5#(I57, I58, I59) 14.34/14.21 f8#(I60, I61, I62) -> f5#(I60, I61, I62) 14.34/14.21 f7#(I63, I64, I65) -> f1#(I63, I64, I65) 14.34/14.21 f6#(I66, I67, I68) -> f4#(I66, I67, I68) 14.34/14.21 f5#(I69, I70, I71) -> f6#(I69, I70, I71) 14.34/14.21 f4#(I72, I73, I74) -> f2#(I72, 1 + I73, I74) 14.34/14.21 f1#(I75, I76, I77) -> f3#(I76, I76, I77) [1 + I76 <= 1000] 14.34/14.21 f1#(I78, I79, I80) -> f2#(I78, 0, I80) [1000 <= I79] 14.34/14.21 R = 14.34/14.21 f19(x1, x2, x3) -> f18(x1, x2, x3) 14.34/14.21 f18(I0, I1, I2) -> f7(I0, 0, I2) [y1 = 0] 14.34/14.21 f3(I3, I4, I5) -> f17(I3, I4, I5) 14.34/14.21 f3(I6, I7, I8) -> f13(I6, I7, I8) 14.34/14.21 f3(I9, I10, I11) -> f17(I9, I10, I11) 14.34/14.21 f17(I12, I13, I14) -> f16(I12, I13, I14) 14.34/14.21 f16(I15, I16, I17) -> f15(I15, I16, I17) 14.34/14.21 f16(I18, I19, I20) -> f14(I18, I19, I20) 14.34/14.21 f16(I21, I22, I23) -> f14(I21, I22, I23) 14.34/14.21 f15(I24, I25, I26) -> f13(I24, I25, I26) 14.34/14.21 f14(I27, I28, I29) -> f15(I27, I28, I29) 14.34/14.21 f2(I30, I31, I32) -> f11(I30, I31, I32) 14.34/14.21 f13(I33, I34, I35) -> f7(I33, 1 + I34, I35) 14.34/14.21 f11(I36, I37, I38) -> f10(I36, I37, I38) [1 + I37 <= 1000] 14.34/14.21 f11(I39, I40, I41) -> f12(I39, I40, I41) [1000 <= I40] 14.34/14.21 f10(I42, I43, I44) -> f9(I42, I43, I44) 14.34/14.21 f10(I45, I46, I47) -> f4(I45, I46, I47) 14.34/14.21 f10(I48, I49, I50) -> f9(I48, I49, I50) 14.34/14.21 f9(I51, I52, I53) -> f8(I51, I52, rnd3) [rnd3 = rnd3] 14.34/14.21 f8(I54, I55, I56) -> f6(I54, I55, I56) 14.34/14.21 f8(I57, I58, I59) -> f5(I57, I58, I59) 14.34/14.21 f8(I60, I61, I62) -> f5(I60, I61, I62) 14.34/14.21 f7(I63, I64, I65) -> f1(I63, I64, I65) 14.34/14.21 f6(I66, I67, I68) -> f4(I66, I67, I68) 14.34/14.21 f5(I69, I70, I71) -> f6(I69, I70, I71) 14.34/14.21 f4(I72, I73, I74) -> f2(I72, 1 + I73, I74) 14.34/14.21 f1(I75, I76, I77) -> f3(I76, I76, I77) [1 + I76 <= 1000] 14.34/14.21 f1(I78, I79, I80) -> f2(I78, 0, I80) [1000 <= I79] 14.34/14.21 14.34/14.21 The dependency graph for this problem is: 14.34/14.21 0 -> 1 14.34/14.21 1 -> 21 14.34/14.21 2 -> 5 14.34/14.21 3 -> 12 14.34/14.21 4 -> 5 14.34/14.21 5 -> 6, 7, 8 14.34/14.21 6 -> 9 14.34/14.21 7 -> 10 14.34/14.21 8 -> 10 14.34/14.21 9 -> 12 14.34/14.21 10 -> 9 14.34/14.21 11 -> 13 14.34/14.21 12 -> 21 14.34/14.21 13 -> 14, 15, 16 14.34/14.21 14 -> 17 14.34/14.21 15 -> 24 14.34/14.21 16 -> 17 14.34/14.21 17 -> 18, 19, 20 14.34/14.21 18 -> 22 14.34/14.21 19 -> 23 14.34/14.21 20 -> 23 14.34/14.21 21 -> 25, 26 14.34/14.21 22 -> 24 14.34/14.21 23 -> 22 14.34/14.21 24 -> 11 14.34/14.21 25 -> 2, 3, 4 14.34/14.21 26 -> 11 14.34/14.21 Where: 14.34/14.21 0) f19#(x1, x2, x3) -> f18#(x1, x2, x3) 14.34/14.21 1) f18#(I0, I1, I2) -> f7#(I0, 0, I2) [y1 = 0] 14.34/14.21 2) f3#(I3, I4, I5) -> f17#(I3, I4, I5) 14.34/14.21 3) f3#(I6, I7, I8) -> f13#(I6, I7, I8) 14.34/14.21 4) f3#(I9, I10, I11) -> f17#(I9, I10, I11) 14.34/14.21 5) f17#(I12, I13, I14) -> f16#(I12, I13, I14) 14.34/14.21 6) f16#(I15, I16, I17) -> f15#(I15, I16, I17) 14.34/14.21 7) f16#(I18, I19, I20) -> f14#(I18, I19, I20) 14.34/14.21 8) f16#(I21, I22, I23) -> f14#(I21, I22, I23) 14.34/14.21 9) f15#(I24, I25, I26) -> f13#(I24, I25, I26) popout

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

job log

popout

actions

all output return to Integer_Transition_Systems 2019-03-29 01.54