Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571472
details
property
value
status
complete
benchmark
BubbleSort.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
Costa_Julia_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.78417205811 seconds
cpu usage
10.694135379
max memory
7.34765056E8
stage attributes
key
value
output-size
28590
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.jar # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 649 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 4 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 178 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 134 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 4 ms] (14) IRSwT (15) TempFilterProof [SOUND, 88 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 36 ms] (18) IntTRS (19) RankingReductionPairProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: class BubbleSort { public static void main(String[] args) { sort(new int[100]); } 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 for (int i=0; i < n - pass; i++) if (x[i] > x[i+1]) { // exchange elements int temp = x[i]; x[i] = x[i+1]; x[i+1] = temp; } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: class BubbleSort { public static void main(String[] args) { sort(new int[100]); } 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 for (int i=0; i < n - pass; i++) if (x[i] > x[i+1]) { // exchange elements int temp = x[i]; x[i] = x[i+1]; x[i+1] = temp; } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: BubbleSort.main([Ljava/lang/String;)V: Graph of 169 nodes with 1 SCC.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode