/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: 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, 195 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 85 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 40 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 10 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * Example taken from "A Term Rewriting Approach to the Automated Termination * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf) * and converted to Java. */ public class PastaB6 { public static void main(String[] args) { Random.args = args; int x = Random.random(); int y = Random.random(); while (x > 0 && y > 0) { 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: /** * Example taken from "A Term Rewriting Approach to the Automated Termination * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf) * and converted to Java. */ public class PastaB6 { public static void main(String[] args) { Random.args = args; int x = Random.random(); int y = Random.random(); while (x > 0 && y > 0) { 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: PastaB6.main([Ljava/lang/String;)V: Graph of 180 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: PastaB6.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 10 IRulesP rules: f610_0_main_LE(EOS(STATIC_610), i128, i114, i128) -> f629_0_main_LE(EOS(STATIC_629), i128, i114, i128) :|: TRUE f629_0_main_LE(EOS(STATIC_629), i128, i114, i128) -> f641_0_main_Load(EOS(STATIC_641), i128, i114) :|: i128 > 0 f641_0_main_Load(EOS(STATIC_641), i128, i114) -> f650_0_main_LE(EOS(STATIC_650), i128, i114, i114) :|: TRUE f650_0_main_LE(EOS(STATIC_650), i128, i134, i134) -> f659_0_main_LE(EOS(STATIC_659), i128, i134, i134) :|: TRUE f659_0_main_LE(EOS(STATIC_659), i128, i134, i134) -> f662_0_main_Inc(EOS(STATIC_662), i128, i134) :|: i134 > 0 f662_0_main_Inc(EOS(STATIC_662), i128, i134) -> f664_0_main_Inc(EOS(STATIC_664), i128 + -1, i134) :|: TRUE f664_0_main_Inc(EOS(STATIC_664), i135, i134) -> f668_0_main_JMP(EOS(STATIC_668), i135, i134 + -1) :|: TRUE f668_0_main_JMP(EOS(STATIC_668), i135, i137) -> f712_0_main_Load(EOS(STATIC_712), i135, i137) :|: TRUE f712_0_main_Load(EOS(STATIC_712), i135, i137) -> f596_0_main_Load(EOS(STATIC_596), i135, i137) :|: TRUE f596_0_main_Load(EOS(STATIC_596), i113, i114) -> f610_0_main_LE(EOS(STATIC_610), i113, i114, i113) :|: TRUE Combined rules. Obtained 1 IRulesP rules: f610_0_main_LE(EOS(STATIC_610), i128:0, i114:0, i128:0) -> f610_0_main_LE(EOS(STATIC_610), i128:0 - 1, i114:0 - 1, i128:0 - 1) :|: i114:0 > 0 && i128:0 > 0 Filtered constant ground arguments: f610_0_main_LE(x1, x2, x3, x4) -> f610_0_main_LE(x2, x3, x4) EOS(x1) -> EOS Filtered duplicate arguments: f610_0_main_LE(x1, x2, x3) -> f610_0_main_LE(x2, x3) Finished conversion. Obtained 1 rules.P rules: f610_0_main_LE(i114:0, i128:0) -> f610_0_main_LE(i114:0 - 1, i128:0 - 1) :|: i114:0 > 0 && i128:0 > 0 ---------------------------------------- (8) Obligation: Rules: f610_0_main_LE(i114:0, i128:0) -> f610_0_main_LE(i114:0 - 1, i128:0 - 1) :|: i114:0 > 0 && i128:0 > 0 ---------------------------------------- (9) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (10) Obligation: Rules: f610_0_main_LE(i114:0, i128:0) -> f610_0_main_LE(arith, arith1) :|: i114:0 > 0 && i128:0 > 0 && arith = i114:0 - 1 && arith1 = i128:0 - 1 ---------------------------------------- (11) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f610_0_main_LE(i114:0, i128:0) -> f610_0_main_LE(arith, arith1) :|: i114:0 > 0 && i128:0 > 0 && arith = i114:0 - 1 && arith1 = i128:0 - 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) f610_0_main_LE(i114:0, i128:0) -> f610_0_main_LE(arith, arith1) :|: i114:0 > 0 && i128:0 > 0 && arith = i114:0 - 1 && arith1 = i128:0 - 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: f610_0_main_LE(i114:0:0, i128:0:0) -> f610_0_main_LE(i114:0:0 - 1, i128:0:0 - 1) :|: i114:0:0 > 0 && i128:0:0 > 0 ---------------------------------------- (15) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f610_0_main_LE(INTEGER, INTEGER) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (16) Obligation: Rules: f610_0_main_LE(i114:0:0, i128:0:0) -> f610_0_main_LE(c, c1) :|: c1 = i128:0:0 - 1 && c = i114:0:0 - 1 && (i114:0:0 > 0 && i128:0:0 > 0) ---------------------------------------- (17) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f610_0_main_LE(x, x1)] = x1 The following rules are decreasing: f610_0_main_LE(i114:0:0, i128:0:0) -> f610_0_main_LE(c, c1) :|: c1 = i128:0:0 - 1 && c = i114:0:0 - 1 && (i114:0:0 > 0 && i128:0:0 > 0) The following rules are bounded: f610_0_main_LE(i114:0:0, i128:0:0) -> f610_0_main_LE(c, c1) :|: c1 = i128:0:0 - 1 && c = i114:0:0 - 1 && (i114:0:0 > 0 && i128:0:0 > 0) ---------------------------------------- (18) YES