Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919174
details
property
value
status
complete
benchmark
BubbleSortR.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Julia_10_Recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.614372015 seconds
cpu usage
13.903388639
max memory
9.88913664E8
stage attributes
key
value
output-size
68628
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 1414 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 227 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 65 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 29 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (19) YES (20) JBCTerminationSCC (21) SCCToIRSProof [SOUND, 74 ms] (22) IRSwT (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (24) IRSwT (25) IRSwTTerminationDigraphProof [EQUIVALENT, 42 ms] (26) IRSwT (27) IntTRSCompressionProof [EQUIVALENT, 0 ms] (28) IRSwT (29) TempFilterProof [SOUND, 16 ms] (30) IntTRS (31) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (32) YES (33) JBCTerminationSCC (34) SCCToIRSProof [SOUND, 67 ms] (35) IRSwT (36) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (37) IRSwT (38) IRSwTTerminationDigraphProof [EQUIVALENT, 60 ms] (39) AND (40) IRSwT (41) IntTRSCompressionProof [EQUIVALENT, 0 ms] (42) IRSwT (43) TempFilterProof [SOUND, 22 ms] (44) IntTRS (45) RankingReductionPairProof [EQUIVALENT, 7 ms] (46) YES (47) IRSwT (48) IntTRSCompressionProof [EQUIVALENT, 0 ms] (49) IRSwT (50) TempFilterProof [SOUND, 18 ms] (51) IntTRS (52) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (53) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: class BubbleSortR { public static void main(String[] args) { Random.args = args; int dim = Random.random()*Random.random(); int[] t = new int[dim] ; for(int i = 0; i < t.length; i++) t[i] = Random.random(); sort(t); } public static void sort(int[] x) { int n = x.length; for (int pass=1; pass < n; pass++) // count how many times // This next loop becomes shorter and shorter aux(0,n-pass,x); //for (int i = 0; i < x.length; i++) // System.out.print(x[i]+ " "); } private static void aux(int min, int max, int[] x) { if (min >= max) return; int i = min; if (x[i] > x[i+1]) { // exchange elements int temp = x[i]; x[i] = x[i+1]; x[i+1] = temp; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199