Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919298
details
property
value
status
complete
benchmark
BinarySearch.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
AProVE_11_recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.93620610237 seconds
cpu usage
18.539371264
max memory
1.668190208E9
stage attributes
key
value
output-size
121840
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, 1534 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 474 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 941 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 154 ms] (17) IntTRS (18) RankingReductionPairProof [EQUIVALENT, 61 ms] (19) YES (20) JBCTerminationSCC (21) SCCToIRSProof [SOUND, 100 ms] (22) IRSwT (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (24) IRSwT (25) IRSwTTerminationDigraphProof [EQUIVALENT, 43 ms] (26) IRSwT (27) IntTRSCompressionProof [EQUIVALENT, 0 ms] (28) IRSwT (29) TempFilterProof [SOUND, 17 ms] (30) IntTRS (31) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (32) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package BinarySearch; public class BinarySearch { public static void main(String[] argv) { Random.args = argv; int[] data = createArray(); binarySearch(data, Random.random()); } public static boolean binarySearch(int[] data, int val) { return binarySearch(data, val, 0, data.length); } private static boolean binarySearch(int[] data, int val, int l, int u) { if (l > u) { return false; } int mid = l + (u - l)/2; if (data[mid] == val) { return true; } else { if (binarySearch(data, val, l, mid - 1)) { return true; } return binarySearch(data, val, mid + 1, u); } } public static int[] createArray() { int[] data = new int[Random.random()]; for (int i = 0; i < data.length; i++) { data[i] = Random.random(); } return data; } } package BinarySearch; public class Random { static String[] args; static int index = 0; public static int random() {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199