Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571542
details
property
value
status
complete
benchmark
IntRTA.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
AProVE_10_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.75536108017 seconds
cpu usage
6.582587648
max memory
4.32386048E8
stage attributes
key
value
output-size
13980
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, 328 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 75 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 4 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 53 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class IntRTA { // only wrap a primitive int private int val; // count up to the value // in "limit" public static void count( IntRTA orig, IntRTA limit) { if (orig == null || limit == null) { return; } // introduce sharing IntRTA copy = orig; while (orig.val < limit.val) { copy.val++; } } public static void main(String[] args) { Random.args = args; IntRTA x = new IntRTA(); x.val = Random.random(); IntRTA y = new IntRTA(); y.val = Random.random(); count(x, y); } } public class Random { static String[] args; static int index = 0; public static int random() { 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 IntRTA { // only wrap a primitive int private int val; // count up to the value // in "limit"
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode