details

property	value
status	complete
benchmark	Count.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n118.star.cs.uiowa.edu
space	Aprove_09

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.87262 seconds
cpu usage	14.6415
user time	13.9244
system time	0.717044
max virtual memory	2.1009484E7
max residence set size	1188004.0

stage attributes

key	value
starexec-result	YES

output

14.50/4.81 YES 14.50/4.83 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 14.50/4.83 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.50/4.83 14.50/4.83 14.50/4.83 termination of the given Bare JBC problem could be proven: 14.50/4.83 14.50/4.83 (0) Bare JBC problem 14.50/4.83 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 14.50/4.83 (2) JBC problem 14.50/4.83 (3) JBCToGraph [EQUIVALENT, 1156 ms] 14.50/4.83 (4) JBCTerminationGraph 14.50/4.83 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 14.50/4.83 (6) AND 14.50/4.83 (7) JBCTerminationSCC 14.50/4.83 (8) SCCToQDPProof [SOUND, 203 ms] 14.50/4.83 (9) QDP 14.50/4.83 (10) UsableRulesReductionPairsProof [EQUIVALENT, 66 ms] 14.50/4.83 (11) QDP 14.50/4.83 (12) PisEmptyProof [EQUIVALENT, 0 ms] 14.50/4.83 (13) YES 14.50/4.83 (14) JBCTerminationSCC 14.50/4.83 (15) SCCToQDPProof [SOUND, 177 ms] 14.50/4.83 (16) QDP 14.50/4.83 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.50/4.83 (18) YES 14.50/4.83 (19) JBCTerminationSCC 14.50/4.83 (20) SCCToQDPProof [SOUND, 290 ms] 14.50/4.83 (21) QDP 14.50/4.83 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 14.50/4.83 (23) QDP 14.50/4.83 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.50/4.83 (25) YES 14.50/4.83 (26) JBCTerminationSCC 14.50/4.83 (27) SCCToIRSProof [SOUND, 128 ms] 14.50/4.83 (28) IRSwT 14.50/4.83 (29) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 14.50/4.83 (30) IRSwT 14.50/4.83 (31) IRSwTTerminationDigraphProof [EQUIVALENT, 165 ms] 14.50/4.83 (32) IRSwT 14.50/4.83 (33) IntTRSCompressionProof [EQUIVALENT, 0 ms] 14.50/4.83 (34) IRSwT 14.50/4.83 (35) TempFilterProof [SOUND, 17 ms] 14.50/4.83 (36) IntTRS 14.50/4.83 (37) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 14.50/4.83 (38) YES 14.50/4.83 14.50/4.83 14.50/4.83 ---------------------------------------- 14.50/4.83 14.50/4.83 (0) 14.50/4.83 Obligation: 14.50/4.83 need to prove termination of the following program: 14.50/4.83 public class Count { 14.50/4.83 public static void main(String[] args) { 14.50/4.83 Random.args = args; 14.50/4.83 Tree tree = Tree.createTree(); 14.50/4.83 14.50/4.83 int c = count(tree); 14.50/4.83 } 14.50/4.83 14.50/4.83 public static Tree flatten(Tree start) { 14.50/4.83 Tree result = null; 14.50/4.83 Tree s,t,u; 14.50/4.83 14.50/4.83 while (start != null) { 14.50/4.83 14.50/4.83 if (start.left == null) { 14.50/4.83 14.50/4.83 result = new Tree(null,result); 14.50/4.83 start = start.right; 14.50/4.83 } 14.50/4.83 else { 14.50/4.83 s = start.left.left; 14.50/4.83 t = start.left.right; 14.50/4.83 u = start.right; 14.50/4.83 start = new Tree(s, new Tree(t,u)); 14.50/4.83 14.50/4.83 14.50/4.83 14.50/4.83 } 14.50/4.83 } 14.50/4.83 14.50/4.83 return result; 14.50/4.83 } 14.50/4.83 14.50/4.83 14.50/4.83 public static int count(Tree start) { 14.50/4.83 14.50/4.83 int res = 0; 14.50/4.83 14.50/4.83 while (start != null) { 14.50/4.83 14.50/4.83 if (start.left == null) { 14.50/4.83 14.50/4.83 res++; 14.50/4.83 start = start.right; 14.50/4.83 } 14.50/4.83 else { 14.50/4.83 start = flatten(start); 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