Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571461
details
property
value
status
complete
benchmark
Loop1.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
Costa_Julia_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.30099701881 seconds
cpu usage
7.890153042
max memory
5.06540032E8
stage attributes
key
value
output-size
8508
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, 242 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 54 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 38 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * A very simple loop over an array. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Loop1 { public static void main(String[] args) { for (int i = 0; i < args.length; i++) {} } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * A very simple loop over an array. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Loop1 { public static void main(String[] args) { for (int i = 0; i < args.length; i++) {} } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: Loop1.main([Ljava/lang/String;)V: Graph of 17 nodes with 1 SCC. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode