Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737545
details
property
value
status
complete
benchmark
array_init.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n003.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
Ctrl
configuration
Transition
runtime (wallclock)
0.806949138641 seconds
cpu usage
0.847802757
max memory
1.232896E7
stage attributes
key
value
output-size
2458
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES DP problem for innermost termination. P = f7#(x1, x2) -> f6#(x1, x2) f6#(I0, I1) -> f4#(I0, 0) f4#(I4, I5) -> f3#(I4, I5) f3#(I6, I7) -> f4#(I6, 1 + I7) [1 + I7 <= I6] f3#(I8, I9) -> f1#(I8, I9) [I8 <= I9] f1#(I10, I11) -> f2#(I10, I11) f1#(I12, I13) -> f2#(I12, I13) R = f7(x1, x2) -> f6(x1, x2) f6(I0, I1) -> f4(I0, 0) f2(I2, I3) -> f5(I2, I3) f4(I4, I5) -> f3(I4, I5) f3(I6, I7) -> f4(I6, 1 + I7) [1 + I7 <= I6] f3(I8, I9) -> f1(I8, I9) [I8 <= I9] f1(I10, I11) -> f2(I10, I11) f1(I12, I13) -> f2(I12, I13) The dependency graph for this problem is: 0 -> 1 1 -> 2 2 -> 3, 4 3 -> 2 4 -> 5, 6 5 -> 6 -> Where: 0) f7#(x1, x2) -> f6#(x1, x2) 1) f6#(I0, I1) -> f4#(I0, 0) 2) f4#(I4, I5) -> f3#(I4, I5) 3) f3#(I6, I7) -> f4#(I6, 1 + I7) [1 + I7 <= I6] 4) f3#(I8, I9) -> f1#(I8, I9) [I8 <= I9] 5) f1#(I10, I11) -> f2#(I10, I11) 6) f1#(I12, I13) -> f2#(I12, I13) We have the following SCCs. { 2, 3 } DP problem for innermost termination. P = f4#(I4, I5) -> f3#(I4, I5) f3#(I6, I7) -> f4#(I6, 1 + I7) [1 + I7 <= I6] R = f7(x1, x2) -> f6(x1, x2) f6(I0, I1) -> f4(I0, 0) f2(I2, I3) -> f5(I2, I3) f4(I4, I5) -> f3(I4, I5) f3(I6, I7) -> f4(I6, 1 + I7) [1 + I7 <= I6] f3(I8, I9) -> f1(I8, I9) [I8 <= I9] f1(I10, I11) -> f2(I10, I11) f1(I12, I13) -> f2(I12, I13) We use the reverse value criterion with the projection function NU: NU[f3#(z1,z2)] = z1 + -1 * (1 + z2) NU[f4#(z1,z2)] = z1 + -1 * (1 + z2) This gives the following inequalities: ==> I4 + -1 * (1 + I5) >= I4 + -1 * (1 + I5) 1 + I7 <= I6 ==> I6 + -1 * (1 + I7) > I6 + -1 * (1 + (1 + I7)) with I6 + -1 * (1 + I7) >= 0 We remove all the strictly oriented dependency pairs. DP problem for innermost termination. P = f4#(I4, I5) -> f3#(I4, I5) R = f7(x1, x2) -> f6(x1, x2) f6(I0, I1) -> f4(I0, 0) f2(I2, I3) -> f5(I2, I3) f4(I4, I5) -> f3(I4, I5) f3(I6, I7) -> f4(I6, 1 + I7) [1 + I7 <= I6] f3(I8, I9) -> f1(I8, I9) [I8 <= I9] f1(I10, I11) -> f2(I10, I11) f1(I12, I13) -> f2(I12, I13) The dependency graph for this problem is: 2 -> Where: 2) f4#(I4, I5) -> f3#(I4, I5) We have the following SCCs.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634