/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 215 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 57 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 20 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) IRSwTChainingProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (18) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } public class Round3{ public static void main(String[] args) { Random.args = args; int x = Random.random(); while (x % 3 != 0) { x++; } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } public class Round3{ public static void main(String[] args) { Random.args = args; int x = Random.random(); while (x % 3 != 0) { x++; } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: Round3.main([Ljava/lang/String;)V: Graph of 109 nodes with 1 SCC. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND) Splitted TerminationGraph to 1 SCCs. ---------------------------------------- (6) Obligation: SCC of termination graph based on JBC Program. SCC contains nodes from the following methods: Round3.main([Ljava/lang/String;)V SCC calls the following helper methods: Performed SCC analyses: *Used field analysis yielded the following read fields: *Marker field analysis yielded the following relations that could be markers: ---------------------------------------- (7) SCCToIRSProof (SOUND) Transformed FIGraph SCCs to intTRSs. Log: Generated rules. Obtained 8 IRulesP rules: f269_0_main_ConstantStackPush(EOS(STATIC_269), i37, i37) -> f281_0_main_IntArithmetic(EOS(STATIC_281), i37, i37, 3) :|: TRUE f281_0_main_IntArithmetic(EOS(STATIC_281), i37, i37, matching1) -> f294_0_main_EQ(EOS(STATIC_294), i37, i37 % 3) :|: TRUE && matching1 = 3 f294_0_main_EQ(EOS(STATIC_294), i37, i57) -> f305_0_main_EQ(EOS(STATIC_305), i37, i57) :|: TRUE f305_0_main_EQ(EOS(STATIC_305), i37, i57) -> f316_0_main_Inc(EOS(STATIC_316), i37) :|: i57 > 0 f316_0_main_Inc(EOS(STATIC_316), i37) -> f328_0_main_JMP(EOS(STATIC_328), i37 + 1) :|: TRUE f328_0_main_JMP(EOS(STATIC_328), i63) -> f365_0_main_Load(EOS(STATIC_365), i63) :|: TRUE f365_0_main_Load(EOS(STATIC_365), i63) -> f248_0_main_Load(EOS(STATIC_248), i63) :|: TRUE f248_0_main_Load(EOS(STATIC_248), i37) -> f269_0_main_ConstantStackPush(EOS(STATIC_269), i37, i37) :|: TRUE Combined rules. Obtained 2 IRulesP rules: f269_0_main_ConstantStackPush(EOS(STATIC_269), i37:0, i37:0) -> f269_0_main_ConstantStackPush'(EOS(STATIC_269), i37:0, i37:0) :|: i37:0 - 3 * div > 0 f269_0_main_ConstantStackPush'(EOS(STATIC_269), i37:0, i37:0) -> f269_0_main_ConstantStackPush(EOS(STATIC_269), i37:0 + 1, i37:0 + 1) :|: i37:0 - 3 * div < 3 && i37:0 - 3 * div > 0 Filtered constant ground arguments: f269_0_main_ConstantStackPush(x1, x2, x3) -> f269_0_main_ConstantStackPush(x2, x3) f269_0_main_ConstantStackPush'(x1, x2, x3) -> f269_0_main_ConstantStackPush'(x2, x3) EOS(x1) -> EOS Filtered duplicate arguments: f269_0_main_ConstantStackPush(x1, x2) -> f269_0_main_ConstantStackPush(x2) f269_0_main_ConstantStackPush'(x1, x2) -> f269_0_main_ConstantStackPush'(x2) Finished conversion. Obtained 2 rules.P rules: f269_0_main_ConstantStackPush(i37:0) -> f269_0_main_ConstantStackPush'(i37:0) :|: i37:0 - 3 * div > 0 f269_0_main_ConstantStackPush'(i37:0) -> f269_0_main_ConstantStackPush(i37:0 + 1) :|: i37:0 - 3 * div < 3 && i37:0 - 3 * div > 0 ---------------------------------------- (8) Obligation: Rules: f269_0_main_ConstantStackPush(x) -> f269_0_main_ConstantStackPush'(x) :|: x - 3 * x1 > 0 f269_0_main_ConstantStackPush'(x2) -> f269_0_main_ConstantStackPush(x2 + 1) :|: x2 - 3 * x3 < 3 && x2 - 3 * x3 > 0 ---------------------------------------- (9) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (10) Obligation: Rules: f269_0_main_ConstantStackPush(x) -> f269_0_main_ConstantStackPush'(x) :|: x - 3 * x1 > 0 f269_0_main_ConstantStackPush'(x2) -> f269_0_main_ConstantStackPush(arith) :|: x2 - 3 * x3 < 3 && x2 - 3 * x3 > 0 && arith = x2 + 1 ---------------------------------------- (11) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f269_0_main_ConstantStackPush(x) -> f269_0_main_ConstantStackPush'(x) :|: x - 3 * x1 > 0 (2) f269_0_main_ConstantStackPush'(x2) -> f269_0_main_ConstantStackPush(arith) :|: x2 - 3 * x3 < 3 && x2 - 3 * x3 > 0 && arith = x2 + 1 Arcs: (1) -> (2) (2) -> (1) This digraph is fully evaluated! ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) f269_0_main_ConstantStackPush(x) -> f269_0_main_ConstantStackPush'(x) :|: x - 3 * x1 > 0 (2) f269_0_main_ConstantStackPush'(x2) -> f269_0_main_ConstantStackPush(arith) :|: x2 - 3 * x3 < 3 && x2 - 3 * x3 > 0 && arith = x2 + 1 Arcs: (1) -> (2) (2) -> (1) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: f269_0_main_ConstantStackPush(x:0) -> f269_0_main_ConstantStackPush(x:0 + 1) :|: x:0 - 3 * x3:0 < 3 && x:0 - 3 * x3:0 > 0 && x:0 - 3 * x1:0 > 0 ---------------------------------------- (15) IRSwTChainingProof (EQUIVALENT) Chaining! ---------------------------------------- (16) Obligation: Rules: f269_0_main_ConstantStackPush(x) -> f269_0_main_ConstantStackPush(x + 2) :|: TRUE && x + -3 * x1 <= 2 && x + -3 * x1 >= 1 && x + -3 * x2 >= 1 && x + -3 * x4 <= 1 && x + -3 * x4 >= 0 && x + -3 * x5 >= 0 ---------------------------------------- (17) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f269_0_main_ConstantStackPush(x) -> f269_0_main_ConstantStackPush(x + 2) :|: TRUE && x + -3 * x1 <= 2 && x + -3 * x1 >= 1 && x + -3 * x2 >= 1 && x + -3 * x4 <= 1 && x + -3 * x4 >= 0 && x + -3 * x5 >= 0 No arcs! This digraph is fully evaluated! ---------------------------------------- (18) TRUE