Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919335
details
property
value
status
complete
benchmark
HanR.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Julia_10_Recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.30478000641 seconds
cpu usage
9.183325086
max memory
4.21572608E8
stage attributes
key
value
output-size
13777
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 709 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 137 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 41 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 17 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class HanoiR { private void solve(int h, int from, int to, int support) { if (h < 1) return; else if (h == 1) { //System.out.println("from " + from + " to " + to + "\n"); } else { solve(h - 1, from, support, to); //System.out.println("from " + from + " to " + to + "\n"); solve(h - 1, support, to, from); } } public static void main(String[] args) { Random.args = args; new HanoiR().solve(Random.random(),1,2,3); } } public class Random { static String[] args; static int index = 0; public static int random() { if (index >= args.length) return 0; String string = args[index]; index++; return string.length(); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class HanoiR { private void solve(int h, int from, int to, int support) { if (h < 1) return; else if (h == 1) { //System.out.println("from " + from + " to " + to + "\n"); } else { solve(h - 1, from, support, to); //System.out.println("from " + from + " to " + to + "\n"); solve(h - 1, support, to, from); } } public static void main(String[] args) { Random.args = args; new HanoiR().solve(Random.random(),1,2,3);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199