details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	34.2951850891 seconds
cpu usage	36.304926802
max memory	2.691072E7

stage attributes

key	value
output-size	21011
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES DP problem for innermost termination. P = f13#(x1, x2, x3, x4) -> f12#(x1, x2, x3, x4) f12#(I0, I1, I2, I3) -> f1#(I0, 1, I2, I3) f2#(I4, I5, I6, I7) -> f3#(I4, I5, 1, I7) [I5 <= I4] f2#(I8, I9, I10, I11) -> f5#(I8, 1, I10, I11) [1 + I8 <= I9] f4#(I12, I13, I14, I15) -> f3#(I12, I13, 1 + I14, I15) [I14 <= I12] f4#(I16, I17, I18, I19) -> f1#(I16, 1 + I17, I18, I19) [1 + I16 <= I18] f10#(I20, I21, I22, I23) -> f9#(I20, I21, I22, I23) f6#(I24, I25, I26, I27) -> f7#(I24, I25, 1, I27) [I25 <= I24] f8#(I32, I33, I34, I35) -> f10#(I32, I33, I34, 1) [I34 <= I32] f8#(I36, I37, I38, I39) -> f5#(I36, 1 + I37, I38, I39) [1 + I36 <= I38] f9#(I40, I41, I42, I43) -> f10#(I40, I41, I42, 1 + I43) [I43 <= I40] f9#(I44, I45, I46, I47) -> f7#(I44, I45, 1 + I46, I47) [1 + I44 <= I47] f7#(I48, I49, I50, I51) -> f8#(I48, I49, I50, I51) f5#(I52, I53, I54, I55) -> f6#(I52, I53, I54, I55) f3#(I56, I57, I58, I59) -> f4#(I56, I57, I58, I59) f1#(I60, I61, I62, I63) -> f2#(I60, I61, I62, I63) R = f13(x1, x2, x3, x4) -> f12(x1, x2, x3, x4) f12(I0, I1, I2, I3) -> f1(I0, 1, I2, I3) f2(I4, I5, I6, I7) -> f3(I4, I5, 1, I7) [I5 <= I4] f2(I8, I9, I10, I11) -> f5(I8, 1, I10, I11) [1 + I8 <= I9] f4(I12, I13, I14, I15) -> f3(I12, I13, 1 + I14, I15) [I14 <= I12] f4(I16, I17, I18, I19) -> f1(I16, 1 + I17, I18, I19) [1 + I16 <= I18] f10(I20, I21, I22, I23) -> f9(I20, I21, I22, I23) f6(I24, I25, I26, I27) -> f7(I24, I25, 1, I27) [I25 <= I24] f6(I28, I29, I30, I31) -> f11(I28, I29, I30, I31) [1 + I28 <= I29] f8(I32, I33, I34, I35) -> f10(I32, I33, I34, 1) [I34 <= I32] f8(I36, I37, I38, I39) -> f5(I36, 1 + I37, I38, I39) [1 + I36 <= I38] f9(I40, I41, I42, I43) -> f10(I40, I41, I42, 1 + I43) [I43 <= I40] f9(I44, I45, I46, I47) -> f7(I44, I45, 1 + I46, I47) [1 + I44 <= I47] f7(I48, I49, I50, I51) -> f8(I48, I49, I50, I51) f5(I52, I53, I54, I55) -> f6(I52, I53, I54, I55) f3(I56, I57, I58, I59) -> f4(I56, I57, I58, I59) f1(I60, I61, I62, I63) -> f2(I60, I61, I62, I63) The dependency graph for this problem is: 0 -> 1 1 -> 15 2 -> 14 3 -> 13 4 -> 14 5 -> 15 6 -> 10, 11 7 -> 12 8 -> 6 9 -> 13 10 -> 6 11 -> 12 12 -> 8, 9 13 -> 7 14 -> 4, 5 15 -> 2, 3 Where: 0) f13#(x1, x2, x3, x4) -> f12#(x1, x2, x3, x4) 1) f12#(I0, I1, I2, I3) -> f1#(I0, 1, I2, I3) 2) f2#(I4, I5, I6, I7) -> f3#(I4, I5, 1, I7) [I5 <= I4] 3) f2#(I8, I9, I10, I11) -> f5#(I8, 1, I10, I11) [1 + I8 <= I9] 4) f4#(I12, I13, I14, I15) -> f3#(I12, I13, 1 + I14, I15) [I14 <= I12] 5) f4#(I16, I17, I18, I19) -> f1#(I16, 1 + I17, I18, I19) [1 + I16 <= I18] 6) f10#(I20, I21, I22, I23) -> f9#(I20, I21, I22, I23) 7) f6#(I24, I25, I26, I27) -> f7#(I24, I25, 1, I27) [I25 <= I24] 8) f8#(I32, I33, I34, I35) -> f10#(I32, I33, I34, 1) [I34 <= I32] 9) f8#(I36, I37, I38, I39) -> f5#(I36, 1 + I37, I38, I39) [1 + I36 <= I38] 10) f9#(I40, I41, I42, I43) -> f10#(I40, I41, I42, 1 + I43) [I43 <= I40] 11) f9#(I44, I45, I46, I47) -> f7#(I44, I45, 1 + I46, I47) [1 + I44 <= I47] 12) f7#(I48, I49, I50, I51) -> f8#(I48, I49, I50, I51) 13) f5#(I52, I53, I54, I55) -> f6#(I52, I53, I54, I55) 14) f3#(I56, I57, I58, I59) -> f4#(I56, I57, I58, I59) 15) f1#(I60, I61, I62, I63) -> f2#(I60, I61, I62, I63) We have the following SCCs. { 2, 4, 5, 14, 15 } { 6, 7, 8, 9, 10, 11, 12, 13 } DP problem for innermost termination. P = f10#(I20, I21, I22, I23) -> f9#(I20, I21, I22, I23) f6#(I24, I25, I26, I27) -> f7#(I24, I25, 1, I27) [I25 <= I24] f8#(I32, I33, I34, I35) -> f10#(I32, I33, I34, 1) [I34 <= I32] f8#(I36, I37, I38, I39) -> f5#(I36, 1 + I37, I38, I39) [1 + I36 <= I38] f9#(I40, I41, I42, I43) -> f10#(I40, I41, I42, 1 + I43) [I43 <= I40] f9#(I44, I45, I46, I47) -> f7#(I44, I45, 1 + I46, I47) [1 + I44 <= I47] f7#(I48, I49, I50, I51) -> f8#(I48, I49, I50, I51) f5#(I52, I53, I54, I55) -> f6#(I52, I53, I54, I55) R = f13(x1, x2, x3, x4) -> f12(x1, x2, x3, x4) f12(I0, I1, I2, I3) -> f1(I0, 1, I2, I3) f2(I4, I5, I6, I7) -> f3(I4, I5, 1, I7) [I5 <= I4] f2(I8, I9, I10, I11) -> f5(I8, 1, I10, I11) [1 + I8 <= I9] f4(I12, I13, I14, I15) -> f3(I12, I13, 1 + I14, I15) [I14 <= I12] popout

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

job log

popout

actions

all output return to Integer Transition Systems