/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, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 225 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 98 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, 16 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:
f134_0_main_Load(EOS(STATIC_134), java.lang.Object(o12sub), java.lang.Object(o12sub), i21, i21) -> f135_0_main_ArrayLength(EOS(STATIC_135), java.lang.Object(o12sub), java.lang.Object(o12sub), i21, i21, java.lang.Object(o12sub)) :|: TRUE
f135_0_main_ArrayLength(EOS(STATIC_135), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, java.lang.Object(ARRAY(i23))) -> f137_0_main_ArrayLength(EOS(STATIC_137), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, java.lang.Object(ARRAY(i23))) :|: i23 >= 0
f137_0_main_ArrayLength(EOS(STATIC_137), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, java.lang.Object(ARRAY(i23))) -> f138_0_main_GE(EOS(STATIC_138), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, i23) :|: i23 >= 0
f138_0_main_GE(EOS(STATIC_138), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, i23) -> f140_0_main_GE(EOS(STATIC_140), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, i23) :|: i21 < i23
f140_0_main_GE(EOS(STATIC_140), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21, i21, i23) -> f144_0_main_Inc(EOS(STATIC_144), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21) :|: i21 < i23
f144_0_main_Inc(EOS(STATIC_144), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21) -> f146_0_main_JMP(EOS(STATIC_146), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i21 + 1) :|: TRUE
f146_0_main_JMP(EOS(STATIC_146), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i24) -> f160_0_main_Load(EOS(STATIC_160), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i24) :|: TRUE
f160_0_main_Load(EOS(STATIC_160), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i24) -> f133_0_main_Load(EOS(STATIC_133), java.lang.Object(ARRAY(i23)), java.lang.Object(ARRAY(i23)), i24) :|: TRUE
f133_0_main_Load(EOS(STATIC_133), java.lang.Object(o12sub), java.lang.Object(o12sub), i21) -> f134_0_main_Load(EOS(STATIC_134), java.lang.Object(o12sub), java.lang.Object(o12sub), i21, i21) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f134_0_main_Load(EOS(STATIC_134), java.lang.Object(ARRAY(i23:0)), java.lang.Object(ARRAY(i23:0)), i21:0, i21:0) -> f134_0_main_Load(EOS(STATIC_134), java.lang.Object(ARRAY(i23:0)), java.lang.Object(ARRAY(i23:0)), i21:0 + 1, i21:0 + 1) :|: i23:0 > -1 && i23:0 > i21:0
Filtered constant ground arguments:
   f134_0_main_Load(x1, x2, x3, x4, x5) -> f134_0_main_Load(x2, x3, x4, x5)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f134_0_main_Load(x1, x2, x3, x4) -> f134_0_main_Load(x2, x4)
Finished conversion. Obtained 1 rules.P rules:
f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), i21:0, i23:0) -> f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), i21:0 + 1, i23:0) :|: i23:0 > -1 && i23:0 > i21:0

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

(8)
Obligation:
Rules:
f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), i21:0, i23:0) -> f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), i21:0 + 1, i23:0) :|: i23:0 > -1 && i23:0 > i21:0

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

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

(10)
Obligation:
Rules:
f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), i21:0, i23:0) -> f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), arith, i23:0) :|: i23:0 > -1 && i23:0 > i21:0 && arith = i21:0 + 1

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

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

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), i21:0, i23:0) -> f134_0_main_Load(java.lang.Object(ARRAY(i23:0)), arith, i23:0) :|: i23:0 > -1 && i23:0 > i21:0 && arith = i21:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f134_0_main_Load(java.lang.Object(ARRAY(i23:0:0)), i21:0:0, i23:0:0) -> f134_0_main_Load(java.lang.Object(ARRAY(i23:0:0)), i21:0:0 + 1, i23:0:0) :|: i23:0:0 > -1 && i23:0:0 > i21:0:0

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

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

(16)
Obligation:
Rules:
f134_0_main_Load(c, i21:0:0, i23:0:0) -> f134_0_main_Load(c1, c2, i23:0:0) :|: c2 = i21:0:0 + 1 && (c1 = 0 && c = 0) && (i23:0:0 > -1 && i23:0:0 > i21:0:0)

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

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

The following rules are decreasing:
f134_0_main_Load(c, i21:0:0, i23:0:0) -> f134_0_main_Load(c1, c2, i23:0:0) :|: c2 = i21:0:0 + 1 && (c1 = 0 && c = 0) && (i23:0:0 > -1 && i23:0:0 > i21:0:0)
The following rules are bounded:
f134_0_main_Load(c, i21:0:0, i23:0:0) -> f134_0_main_Load(c1, c2, i23:0:0) :|: c2 = i21:0:0 + 1 && (c1 = 0 && c = 0) && (i23:0:0 > -1 && i23:0:0 > i21:0:0)

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

(18)
YES