/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/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) JBCNonTerm [COMPLETE, 589 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class NO_23 { public static void main(String args[]) { int i = 0; while (i < 100) { if (i < 50) i = 51; else i = 49; } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class NO_23 { public static void main(String args[]) { int i = 0; while (i < 100) { if (i < 50) i = 51; else i = 49; } } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Constructed a run with a repetition. States 8 and 26 are repetitions (when considering only the interesting positions []). 0: YES: (JL1) 1: YES: (JL1) 2: YES: (JL1) 3: YES: (JL1) 4: YES: (JL1) 5: YES: (JL1) 6: YES: (JL1) 7: YES: (JL1) 8: YES: (JL1) 9: YES: (JL1) 10: YES: (JL1) 11: YES: (JL1) 12: YES: (JL1) 13: YES: (JL1) 14: YES: (JL1) 15: YES: (JL1) 16: YES: (JL1) 17: YES: (JL1) 18: YES: (JL1) 19: YES: (JL1) 20: YES: (JL1) 21: YES: (JL1) 22: YES: (JL1) 23: YES: (JL1) 24: YES: (JL1) 25: YES: (JL1) 26: YES: (JL1) ---------------------------------------- (4) NO