Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571355
details
property
value
status
complete
benchmark
Velroyen08-lcm.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
BSOG_FoVeOOS_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.35216999054 seconds
cpu usage
9.0165935
max memory
6.11495936E8
stage attributes
key
value
output-size
30791
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 691 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 402 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.lcm; public class Lcm { // does not terminate if exactly one of the input values is negative public static int lcm (int a, int b) { int am = a; int bm = b; while (am != bm) { if (am > bm) { bm = bm+b; } else { am = am+a; } } return am; } } package simple.lcm; public class Main { /** * @param args */ public static void main(String[] args) { int x = args[2].length(); int y = args[3].length(); if (args[0].length() % 2 == 0) { x = -x; } if (args[1].length() % 2 == 0) { y = -y; } Lcm.lcm(x, y); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.lcm; public class Lcm { // does not terminate if exactly one of the input values is negative public static int lcm (int a, int b) { int am = a; int bm = b; while (am != bm) { if (am > bm) { bm = bm+b; } else { am = am+a; } } return am;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode