/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.jar # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 314 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 136 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 32 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 49 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 19 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class IntRTA { // only wrap a primitive int private int val; // count up to the value // in "limit" public static void count( IntRTA orig, IntRTA limit) { if (orig == null || limit == null) { return; } // introduce sharing IntRTA copy = orig; while (orig.val < limit.val) { copy.val++; } } public static void main(String[] args) { Random.args = args; IntRTA x = new IntRTA(); x.val = Random.random(); IntRTA y = new IntRTA(); y.val = Random.random(); count(x, y); } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class IntRTA { // only wrap a primitive int private int val; // count up to the value // in "limit" public static void count( IntRTA orig, IntRTA limit) { if (orig == null || limit == null) { return; } // introduce sharing IntRTA copy = orig; while (orig.val < limit.val) { copy.val++; } } public static void main(String[] args) { Random.args = args; IntRTA x = new IntRTA(); x.val = Random.random(); IntRTA y = new IntRTA(); y.val = Random.random(); count(x, y); } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: IntRTA.main([Ljava/lang/String;)V: Graph of 207 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: IntRTA.main([Ljava/lang/String;)V SCC calls the following helper methods: Performed SCC analyses: *Used field analysis yielded the following read fields: *IntRTA: [val] *Marker field analysis yielded the following relations that could be markers: *IntRTA.val > i19 (Introduced counter i61) ---------------------------------------- (7) SCCToIRSProof (SOUND) Transformed FIGraph SCCs to intTRSs. Log: Generated rules. Obtained 14 IRulesP rules: f375_0_count_FieldAccess(EOS(STATIC_375), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i61) -> f378_0_count_Load(EOS(STATIC_378), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, i61) :|: TRUE f378_0_count_Load(EOS(STATIC_378), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, i61) -> f381_0_count_FieldAccess(EOS(STATIC_381), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, java.lang.Object(IntRTA(EOC, i42)), i61) :|: TRUE f381_0_count_FieldAccess(EOS(STATIC_381), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, java.lang.Object(IntRTA(EOC, i42)), i61) -> f383_0_count_GE(EOS(STATIC_383), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, i42, i61) :|: TRUE f383_0_count_GE(EOS(STATIC_383), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, i42, i61) -> f388_0_count_GE(EOS(STATIC_388), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, i42, i61) :|: i19 < i42 f388_0_count_GE(EOS(STATIC_388), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i19, i42, i61) -> f402_0_count_Load(EOS(STATIC_402), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i61) :|: i19 < i42 f402_0_count_Load(EOS(STATIC_402), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i61) -> f405_0_count_Duplicate(EOS(STATIC_405), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i61) :|: TRUE f405_0_count_Duplicate(EOS(STATIC_405), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i61) -> f407_0_count_FieldAccess(EOS(STATIC_407), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i61) :|: TRUE f407_0_count_FieldAccess(EOS(STATIC_407), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i61) -> f408_0_count_ConstantStackPush(EOS(STATIC_408), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i19, i61) :|: TRUE f408_0_count_ConstantStackPush(EOS(STATIC_408), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i19, i61) -> f409_0_count_IntArithmetic(EOS(STATIC_409), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i19, 1, i61) :|: TRUE f409_0_count_IntArithmetic(EOS(STATIC_409), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i19, matching1, i61) -> f410_0_count_FieldAccess(EOS(STATIC_410), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i19 + 1, i61) :|: i19 >= 0 && matching1 = 1 f410_0_count_FieldAccess(EOS(STATIC_410), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i45, i61) -> f411_0_count_JMP(EOS(STATIC_411), java.lang.Object(IntRTA(EOC, i45)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i45)), i61 + 1) :|: i61 >= 0 f411_0_count_JMP(EOS(STATIC_411), java.lang.Object(IntRTA(EOC, i45)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i45)), i61) -> f437_0_count_Load(EOS(STATIC_437), java.lang.Object(IntRTA(EOC, i45)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i45)), i61) :|: TRUE f437_0_count_Load(EOS(STATIC_437), java.lang.Object(IntRTA(EOC, i45)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i45)), i61) -> f372_0_count_Load(EOS(STATIC_372), java.lang.Object(IntRTA(EOC, i45)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i45)), i61) :|: TRUE f372_0_count_Load(EOS(STATIC_372), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), i61) -> f375_0_count_FieldAccess(EOS(STATIC_375), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i42)), java.lang.Object(IntRTA(EOC, i19)), java.lang.Object(IntRTA(EOC, i19)), i61) :|: TRUE Combined rules. Obtained 1 IRulesP rules: f375_0_count_FieldAccess(EOS(STATIC_375), java.lang.Object(IntRTA(EOC, i19:0)), java.lang.Object(IntRTA(EOC, i42:0)), java.lang.Object(IntRTA(EOC, i19:0)), java.lang.Object(IntRTA(EOC, i19:0)), i61:0) -> f375_0_count_FieldAccess(EOS(STATIC_375), java.lang.Object(IntRTA(EOC, i19:0 + 1)), java.lang.Object(IntRTA(EOC, i42:0)), java.lang.Object(IntRTA(EOC, i19:0 + 1)), java.lang.Object(IntRTA(EOC, i19:0 + 1)), i61:0 + 1) :|: i42:0 > i19:0 && i61:0 > -1 && i19:0 > -1 Filtered constant ground arguments: f375_0_count_FieldAccess(x1, x2, x3, x4, x5, x6) -> f375_0_count_FieldAccess(x2, x3, x4, x5, x6) EOS(x1) -> EOS IntRTA(x1, x2) -> IntRTA(x2) Filtered duplicate arguments: f375_0_count_FieldAccess(x1, x2, x3, x4, x5) -> f375_0_count_FieldAccess(x2, x4, x5) Finished conversion. Obtained 1 rules.P rules: f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0)), i61:0, i42:0, i19:0) -> f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0 + 1)), i61:0 + 1, i42:0, i19:0 + 1) :|: i61:0 > -1 && i19:0 > -1 && i42:0 > i19:0 ---------------------------------------- (8) Obligation: Rules: f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0)), i61:0, i42:0, i19:0) -> f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0 + 1)), i61:0 + 1, i42:0, i19:0 + 1) :|: i61:0 > -1 && i19:0 > -1 && i42:0 > i19:0 ---------------------------------------- (9) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (10) Obligation: Rules: f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0)), i61:0, i42:0, i19:0) -> f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(arith1)), arith, i42:0, arith1) :|: i61:0 > -1 && i19:0 > -1 && i42:0 > i19:0 && arith = i61:0 + 1 && arith1 = i19:0 + 1 && arith1 = i19:0 + 1 ---------------------------------------- (11) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0)), i61:0, i42:0, i19:0) -> f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(arith1)), arith, i42:0, arith1) :|: i61:0 > -1 && i19:0 > -1 && i42:0 > i19:0 && arith = i61:0 + 1 && arith1 = i19:0 + 1 && arith1 = i19:0 + 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(i19:0)), i61:0, i42:0, i19:0) -> f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0)), java.lang.Object(IntRTA(arith1)), arith, i42:0, arith1) :|: i61:0 > -1 && i19:0 > -1 && i42:0 > i19:0 && arith = i61:0 + 1 && arith1 = i19:0 + 1 && arith1 = i19:0 + 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0:0)), java.lang.Object(IntRTA(i19:0:0)), i61:0:0, i42:0:0, i19:0:0) -> f375_0_count_FieldAccess(java.lang.Object(IntRTA(i42:0:0)), java.lang.Object(IntRTA(i19:0:0 + 1)), i61:0:0 + 1, i42:0:0, i19:0:0 + 1) :|: i61:0:0 > -1 && i19:0:0 > -1 && i42:0:0 > i19:0:0 ---------------------------------------- (15) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f375_0_count_FieldAccess(VARIABLE, VARIABLE, INTEGER, INTEGER, INTEGER) java.lang.Object(VARIABLE) IntRTA(INTEGER) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (16) Obligation: Rules: f375_0_count_FieldAccess(c, c1, i61:0:0, i42:0:0, i19:0:0) -> f375_0_count_FieldAccess(c2, c3, c4, i42:0:0, c5) :|: c5 = i19:0:0 + 1 && (c4 = i61:0:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0)))) && (i61:0:0 > -1 && i19:0:0 > -1 && i42:0:0 > i19:0:0) ---------------------------------------- (17) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f375_0_count_FieldAccess(x, x1, x2, x3, x4)] = c*x + c1*x1 + x3 - x4 The following rules are decreasing: f375_0_count_FieldAccess(c, c1, i61:0:0, i42:0:0, i19:0:0) -> f375_0_count_FieldAccess(c2, c3, c4, i42:0:0, c5) :|: c5 = i19:0:0 + 1 && (c4 = i61:0:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0)))) && (i61:0:0 > -1 && i19:0:0 > -1 && i42:0:0 > i19:0:0) The following rules are bounded: f375_0_count_FieldAccess(c, c1, i61:0:0, i42:0:0, i19:0:0) -> f375_0_count_FieldAccess(c2, c3, c4, i42:0:0, c5) :|: c5 = i19:0:0 + 1 && (c4 = i61:0:0 + 1 && (c3 = 0 && (c2 = 0 && (c1 = 0 && c = 0)))) && (i61:0:0 > -1 && i19:0:0 > -1 && i42:0:0 > i19:0:0) ---------------------------------------- (18) YES