/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, 242 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 54 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, 38 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(18) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
/**
 * A very simple loop over an array.
 *
 * All calls terminate.
 *
 * Julia + BinTerm prove that all calls terminate
 *
 * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A>
 */

public class Loop1 {
    public static void main(String[] args) {
	for (int i = 0; i < args.length; i++) {}
    }
}


----------------------------------------

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
/**
 * A very simple loop over an array.
 *
 * All calls terminate.
 *
 * Julia + BinTerm prove that all calls terminate
 *
 * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A>
 */

public class Loop1 {
    public static void main(String[] args) {
	for (int i = 0; i < args.length; i++) {}
    }
}


----------------------------------------

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
Loop1.main([Ljava/lang/String;)V: Graph of 17 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: Loop1.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 9 IRulesP rules:
f145_0_main_Load(EOS(STATIC_145), java.lang.Object(o12sub), java.lang.Object(o12sub), i22, i22) -> f147_0_main_ArrayLength(EOS(STATIC_147), java.lang.Object(o12sub), java.lang.Object(o12sub), i22, i22, java.lang.Object(o12sub)) :|: TRUE
f147_0_main_ArrayLength(EOS(STATIC_147), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, java.lang.Object(ARRAY(i24))) -> f149_0_main_ArrayLength(EOS(STATIC_149), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, java.lang.Object(ARRAY(i24))) :|: i24 >= 0
f149_0_main_ArrayLength(EOS(STATIC_149), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, java.lang.Object(ARRAY(i24))) -> f150_0_main_GE(EOS(STATIC_150), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, i24) :|: i24 >= 0
f150_0_main_GE(EOS(STATIC_150), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, i24) -> f156_0_main_GE(EOS(STATIC_156), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, i24) :|: i22 < i24
f156_0_main_GE(EOS(STATIC_156), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22, i22, i24) -> f164_0_main_Inc(EOS(STATIC_164), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22) :|: i22 < i24
f164_0_main_Inc(EOS(STATIC_164), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22) -> f168_0_main_JMP(EOS(STATIC_168), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i22 + 1) :|: TRUE
f168_0_main_JMP(EOS(STATIC_168), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i27) -> f180_0_main_Load(EOS(STATIC_180), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i27) :|: TRUE
f180_0_main_Load(EOS(STATIC_180), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i27) -> f141_0_main_Load(EOS(STATIC_141), java.lang.Object(ARRAY(i24)), java.lang.Object(ARRAY(i24)), i27) :|: TRUE
f141_0_main_Load(EOS(STATIC_141), java.lang.Object(o12sub), java.lang.Object(o12sub), i22) -> f145_0_main_Load(EOS(STATIC_145), java.lang.Object(o12sub), java.lang.Object(o12sub), i22, i22) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f145_0_main_Load(EOS(STATIC_145), java.lang.Object(ARRAY(i24:0)), java.lang.Object(ARRAY(i24:0)), i22:0, i22:0) -> f145_0_main_Load(EOS(STATIC_145), java.lang.Object(ARRAY(i24:0)), java.lang.Object(ARRAY(i24:0)), i22:0 + 1, i22:0 + 1) :|: i24:0 > -1 && i24:0 > i22:0
Filtered constant ground arguments:
   f145_0_main_Load(x1, x2, x3, x4, x5) -> f145_0_main_Load(x2, x3, x4, x5)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f145_0_main_Load(x1, x2, x3, x4) -> f145_0_main_Load(x2, x4)
Finished conversion. Obtained 1 rules.P rules:
f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0, i24:0) -> f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0 + 1, i24:0) :|: i24:0 > -1 && i24:0 > i22:0

----------------------------------------

(8)
Obligation:
Rules:
f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0, i24:0) -> f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0 + 1, i24:0) :|: i24:0 > -1 && i24:0 > i22:0

----------------------------------------

(9) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(10)
Obligation:
Rules:
f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0, i24:0) -> f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), arith, i24:0) :|: i24:0 > -1 && i24:0 > i22:0 && arith = i22:0 + 1

----------------------------------------

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0, i24:0) -> f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), arith, i24:0) :|: i24:0 > -1 && i24:0 > i22:0 && arith = i22:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!
----------------------------------------

(12)
Obligation:

Termination digraph:
Nodes:
(1) f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), i22:0, i24:0) -> f145_0_main_Load(java.lang.Object(ARRAY(i24:0)), arith, i24:0) :|: i24:0 > -1 && i24:0 > i22:0 && arith = i22:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

----------------------------------------

(13) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(14)
Obligation:
Rules:
f145_0_main_Load(java.lang.Object(ARRAY(i24:0:0)), i22:0:0, i24:0:0) -> f145_0_main_Load(java.lang.Object(ARRAY(i24:0:0)), i22:0:0 + 1, i24:0:0) :|: i24:0:0 > -1 && i24:0:0 > i22:0:0

----------------------------------------

(15) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f145_0_main_Load(VARIABLE, INTEGER, INTEGER)
java.lang.Object(VARIABLE)
ARRAY(INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(16)
Obligation:
Rules:
f145_0_main_Load(c, i22:0:0, i24:0:0) -> f145_0_main_Load(c1, c2, i24:0:0) :|: c2 = i22:0:0 + 1 && (c1 = 0 && c = 0) && (i24:0:0 > -1 && i24:0:0 > i22:0:0)

----------------------------------------

(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f145_0_main_Load(x, x1, x2)] = c*x - x1 + x2

The following rules are decreasing:
f145_0_main_Load(c, i22:0:0, i24:0:0) -> f145_0_main_Load(c1, c2, i24:0:0) :|: c2 = i22:0:0 + 1 && (c1 = 0 && c = 0) && (i24:0:0 > -1 && i24:0:0 > i22:0:0)
The following rules are bounded:
f145_0_main_Load(c, i22:0:0, i24:0:0) -> f145_0_main_Load(c1, c2, i24:0:0) :|: c2 = i22:0:0 + 1 && (c1 = 0 && c = 0) && (i24:0:0 > -1 && i24:0:0 > i22:0:0)

----------------------------------------

(18)
YES