Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571599
details
property
value
status
complete
benchmark
Gauss.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Julia_10_Iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.60653185844 seconds
cpu usage
9.827469593
max memory
5.96430848E8
stage attributes
key
value
output-size
9214
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty termination of the given Bare JBC problem could not be shown: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class EquationSystem { private Rational A[][]; private Rational b[]; private int n; public EquationSystem(Rational A[][], Rational b[]) { this.n = A.length; this.A = new Rational[n][n]; this.b = new Rational[n]; for (int l = 0; l < n; l++) { for (int c = 0; c < n; c++) this.A[l][c] = A[l][c]; this.b[l] = b[l]; } } /* public void resolve() { if (diagonalize()) { System.out.print("One solution = "); System.out.print("("); for (int l = 0; l < n; l++) { System.out.print(b[l]); if (l < n-1) System.out.print("; "); } System.out.println(")."); } else System.out.println("Zero or an infinite number of solutions."); } */ private int searchRow(int col) { for (int l = col; l < n; l++) if (!A[l][col].isZero()) return l; return n; } private void permute(int l1, int l2) { Rational temp; for (int col = l1; col < n; col++) { temp = A[l1][col]; A[l1][col] = A[l2][col]; A[l2][col] = temp; } temp = b[l1]; b[l1] = b[l2]; b[l2] = temp; } private void divide(int l, Rational pivot) { for (int col = l; col < n; col++) A[l][col].divideBy(pivot); b[l].divideBy(pivot); } private void substract(int i, int j) { Rational A_ji = new Rational(A[j][i]); for (int col = i; col < n; col++) A[j][col].minus(A_ji.times(A[i][col])); b[j].minus(A_ji.times(b[i])); } public boolean diagonalize() { int current; Rational p; for (int l = 0; l < n; l++) { current = searchRow(l); if (current == n) return false; p = new Rational(A[current][l]); permute(l, current); divide(l, p); for (int ll = 0; ll < n; ll++) if (ll != l) substract(l, ll); } return true; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode