/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 275 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 79 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, 41 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 14 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 PastaB1 { public static void main(String[] args) { Random.args = args; int x = Random.random(); int y = Random.random(); while (x > y) { x--; } } } 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 PastaB1 { public static void main(String[] args) { Random.args = args; int x = Random.random(); int y = Random.random(); while (x > y) { x--; } } } 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: PastaB1.main([Ljava/lang/String;)V: Graph of 174 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: PastaB1.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 7 IRulesP rules: f282_0_main_Load(EOS(STATIC_282), i17, i42, i17) -> f285_0_main_LE(EOS(STATIC_285), i17, i42, i17, i42) :|: TRUE f285_0_main_LE(EOS(STATIC_285), i17, i42, i17, i42) -> f288_0_main_LE(EOS(STATIC_288), i17, i42, i17, i42) :|: i17 > i42 f288_0_main_LE(EOS(STATIC_288), i17, i42, i17, i42) -> f298_0_main_Inc(EOS(STATIC_298), i17, i42) :|: i17 > i42 f298_0_main_Inc(EOS(STATIC_298), i17, i42) -> f310_0_main_JMP(EOS(STATIC_310), i17 + -1, i42) :|: TRUE f310_0_main_JMP(EOS(STATIC_310), i45, i42) -> f339_0_main_Load(EOS(STATIC_339), i45, i42) :|: TRUE f339_0_main_Load(EOS(STATIC_339), i45, i42) -> f279_0_main_Load(EOS(STATIC_279), i45, i42) :|: TRUE f279_0_main_Load(EOS(STATIC_279), i17, i42) -> f282_0_main_Load(EOS(STATIC_282), i17, i42, i17) :|: TRUE Combined rules. Obtained 1 IRulesP rules: f282_0_main_Load(EOS(STATIC_282), i17:0, i42:0, i17:0) -> f282_0_main_Load(EOS(STATIC_282), i17:0 - 1, i42:0, i17:0 - 1) :|: i42:0 < i17:0 Filtered constant ground arguments: f282_0_main_Load(x1, x2, x3, x4) -> f282_0_main_Load(x2, x3, x4) EOS(x1) -> EOS Filtered duplicate arguments: f282_0_main_Load(x1, x2, x3) -> f282_0_main_Load(x2, x3) Finished conversion. Obtained 1 rules.P rules: f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0, i17:0 - 1) :|: i42:0 < i17:0 ---------------------------------------- (8) Obligation: Rules: f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0, i17:0 - 1) :|: i42:0 < i17:0 ---------------------------------------- (9) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (10) Obligation: Rules: f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0, arith) :|: i42:0 < i17:0 && arith = i17:0 - 1 ---------------------------------------- (11) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0, arith) :|: i42:0 < i17:0 && arith = i17:0 - 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0, arith) :|: i42:0 < i17:0 && arith = i17:0 - 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(i42:0:0, i17:0:0 - 1) :|: i42:0:0 < i17:0:0 ---------------------------------------- (15) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f282_0_main_Load(INTEGER, INTEGER) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (16) Obligation: Rules: f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(i42:0:0, c) :|: c = i17:0:0 - 1 && i42:0:0 < i17:0:0 ---------------------------------------- (17) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f282_0_main_Load(x, x1)] = -x + x1 The following rules are decreasing: f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(i42:0:0, c) :|: c = i17:0:0 - 1 && i42:0:0 < i17:0:0 The following rules are bounded: f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(i42:0:0, c) :|: c = i17:0:0 - 1 && i42:0:0 < i17:0:0 ---------------------------------------- (18) YES