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	n139.star.cs.uiowa.edu
space	Costa_Julia_09

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.35984 seconds
cpu usage	5.73246
user time	5.46789
system time	0.264572
max virtual memory	1.9086716E7
max residence set size	377760.0

stage attributes

key	value
starexec-result	YES

output

5.34/2.32 YES 5.34/2.33 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 5.34/2.33 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.34/2.33 5.34/2.33 5.34/2.33 termination of the given Bare JBC problem could be proven: 5.34/2.33 5.34/2.33 (0) Bare JBC problem 5.34/2.33 (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] 5.34/2.33 (2) JBC problem 5.34/2.33 (3) JBCToGraph [EQUIVALENT, 233 ms] 5.34/2.33 (4) JBCTerminationGraph 5.34/2.33 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 5.34/2.33 (6) JBCTerminationSCC 5.34/2.33 (7) SCCToIRSProof [SOUND, 31 ms] 5.34/2.33 (8) IRSwT 5.34/2.33 (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 5.34/2.33 (10) IRSwT 5.34/2.33 (11) IRSwTTerminationDigraphProof [EQUIVALENT, 2 ms] 5.34/2.33 (12) IRSwT 5.34/2.33 (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] 5.34/2.33 (14) IRSwT 5.34/2.33 (15) TempFilterProof [SOUND, 29 ms] 5.34/2.33 (16) IntTRS 5.34/2.33 (17) RankingReductionPairProof [EQUIVALENT, 0 ms] 5.34/2.33 (18) YES 5.34/2.33 5.34/2.33 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (0) 5.34/2.33 Obligation: 5.34/2.33 need to prove termination of the following program: 5.34/2.33 /** 5.34/2.33 * A very simple loop over an array. 5.34/2.33 * 5.34/2.33 * All calls terminate. 5.34/2.33 * 5.34/2.33 * Julia + BinTerm prove that all calls terminate 5.34/2.33 * 5.34/2.33 * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> 5.34/2.33 */ 5.34/2.33 5.34/2.33 public class Loop1 { 5.34/2.33 public static void main(String[] args) { 5.34/2.33 for (int i = 0; i < args.length; i++) {} 5.34/2.33 } 5.34/2.33 } 5.34/2.33 5.34/2.33 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (1) BareJBCToJBCProof (EQUIVALENT) 5.34/2.33 initialized classpath 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (2) 5.34/2.33 Obligation: 5.34/2.33 need to prove termination of the following program: 5.34/2.33 /** 5.34/2.33 * A very simple loop over an array. 5.34/2.33 * 5.34/2.33 * All calls terminate. 5.34/2.33 * 5.34/2.33 * Julia + BinTerm prove that all calls terminate 5.34/2.33 * 5.34/2.33 * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> 5.34/2.33 */ 5.34/2.33 5.34/2.33 public class Loop1 { 5.34/2.33 public static void main(String[] args) { 5.34/2.33 for (int i = 0; i < args.length; i++) {} 5.34/2.33 } 5.34/2.33 } 5.34/2.33 5.34/2.33 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (3) JBCToGraph (EQUIVALENT) 5.34/2.33 Constructed TerminationGraph. 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (4) 5.34/2.33 Obligation: 5.34/2.33 Termination Graph based on JBC Program: 5.34/2.33 Loop1.main([Ljava/lang/String;)V: Graph of 17 nodes with 1 SCC. 5.34/2.33 5.34/2.33 5.34/2.33 5.34/2.33 5.34/2.33 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (5) TerminationGraphToSCCProof (SOUND) 5.34/2.33 Splitted TerminationGraph to 1 SCCs. 5.34/2.33 ---------------------------------------- 5.34/2.33 5.34/2.33 (6) 5.34/2.33 Obligation: 5.34/2.33 SCC of termination graph based on JBC Program. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Java_Bytecode 2019-04-01 06.50