/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, 373 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 92 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 46 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 56 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(18) IntTRS
(19) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(20) YES


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

(0)
Obligation:
need to prove termination of the following program:
/**
 * A recursive loop.
 *
 * All calls terminate.
 *
 * Julia + BinTerm prove that the call to <tt>test()</tt> terminates.
 *
 * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A>
 */

public class Double {

    private static void test(int n) {
	for (int i = 0; i < n; i++)
	    test(i);
    }

    public static void main(String[] args) {
	test(10);
    }
}


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

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

(2)
Obligation:
need to prove termination of the following program:
/**
 * A recursive loop.
 *
 * All calls terminate.
 *
 * Julia + BinTerm prove that the call to <tt>test()</tt> terminates.
 *
 * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A>
 */

public class Double {

    private static void test(int n) {
	for (int i = 0; i < n; i++)
	    test(i);
    }

    public static void main(String[] args) {
	test(10);
    }
}


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

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

(4)
Obligation:
Termination Graph based on JBC Program:
Double.main([Ljava/lang/String;)V: Graph of 8 nodes with 0 SCCs.



Double.test(I)V: Graph of 20 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: Double.test(I)V
SCC calls the following helper methods: Double.test(I)V
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 19 IRulesP rules:
f854_0_test_Store(EOS(STATIC_854), i45, i46, matching1) -> f856_0_test_Load(EOS(STATIC_856), i45, i46, 0) :|: TRUE && matching1 = 0
f856_0_test_Load(EOS(STATIC_856), i45, i46, matching1) -> f1185_0_test_Load(EOS(STATIC_1185), i45, i46, 0) :|: TRUE && matching1 = 0
f1185_0_test_Load(EOS(STATIC_1185), i45, i54, i55) -> f1622_0_test_Load(EOS(STATIC_1622), i45, i54, i55) :|: TRUE
f1622_0_test_Load(EOS(STATIC_1622), i45, i67, i68) -> f1720_0_test_Load(EOS(STATIC_1720), i45, i67, i68) :|: TRUE
f1720_0_test_Load(EOS(STATIC_1720), i45, i81, i82) -> f1723_0_test_Load(EOS(STATIC_1723), i45, i81, i82, i82) :|: TRUE
f1723_0_test_Load(EOS(STATIC_1723), i45, i81, i82, i82) -> f1725_0_test_GE(EOS(STATIC_1725), i45, i81, i82, i82, i81) :|: TRUE
f1725_0_test_GE(EOS(STATIC_1725), i45, i81, i82, i82, i81) -> f1820_0_test_GE(EOS(STATIC_1820), i45, i81, i82, i82, i81) :|: i82 < i81
f1820_0_test_GE(EOS(STATIC_1820), i45, i81, i82, i82, i81) -> f1822_0_test_Load(EOS(STATIC_1822), i45, i81, i82) :|: i82 < i81
f1822_0_test_Load(EOS(STATIC_1822), i45, i81, i82) -> f1824_0_test_InvokeMethod(EOS(STATIC_1824), i45, i81, i82, i82) :|: TRUE
f1824_0_test_InvokeMethod(EOS(STATIC_1824), i45, i81, i82, i82) -> f1825_0_test_ConstantStackPush(EOS(STATIC_1825), i82, i82) :|: i81 >= 1 && i82 < i81
f1824_0_test_InvokeMethod(EOS(STATIC_1824), i45, i81, i82, i82) -> f1825_1_test_ConstantStackPush(EOS(STATIC_1825), i45, i81, i82, i82) :|: i81 >= 1 && i82 < i81
f1825_0_test_ConstantStackPush(EOS(STATIC_1825), i82, i82) -> f1827_0_test_ConstantStackPush(EOS(STATIC_1827), i82, i82) :|: TRUE
f1827_0_test_ConstantStackPush(EOS(STATIC_1827), i82, i82) -> f850_0_test_ConstantStackPush(EOS(STATIC_850), i82, i82) :|: TRUE
f850_0_test_ConstantStackPush(EOS(STATIC_850), i45, i46) -> f854_0_test_Store(EOS(STATIC_854), i45, i46, 0) :|: TRUE
f1828_0_test_Return(EOS(STATIC_1828), i45, i81, i92) -> f1829_0_test_Inc(EOS(STATIC_1829), i45, i81, i92) :|: TRUE
f1829_0_test_Inc(EOS(STATIC_1829), i45, i81, i92) -> f1830_0_test_JMP(EOS(STATIC_1830), i45, i81, i92 + 1) :|: TRUE
f1830_0_test_JMP(EOS(STATIC_1830), i45, i81, i93) -> f1831_0_test_Load(EOS(STATIC_1831), i45, i81, i93) :|: TRUE
f1831_0_test_Load(EOS(STATIC_1831), i45, i81, i93) -> f1720_0_test_Load(EOS(STATIC_1720), i45, i81, i93) :|: TRUE
f1825_1_test_ConstantStackPush(EOS(STATIC_1825), i45, i81, i92, i92) -> f1828_0_test_Return(EOS(STATIC_1828), i45, i81, i92) :|: TRUE
Combined rules. Obtained 2 IRulesP rules:
f1824_0_test_InvokeMethod(EOS(STATIC_1824), i45:0, i81:0, i82:0, i82:0) -> f1824_0_test_InvokeMethod(EOS(STATIC_1824), i82:0, i82:0, 0, 0) :|: i82:0 < i81:0 && i81:0 > 0 && i82:0 > 0
f1824_0_test_InvokeMethod(EOS(STATIC_1824), i45:0, i81:0, i82:0, i82:0) -> f1824_0_test_InvokeMethod(EOS(STATIC_1824), i45:0, i81:0, i82:0 + 1, i82:0 + 1) :|: i82:0 + 1 < i81:0 && i81:0 > 0
Filtered constant ground arguments:
   f1824_0_test_InvokeMethod(x1, x2, x3, x4, x5) -> f1824_0_test_InvokeMethod(x2, x3, x4, x5)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f1824_0_test_InvokeMethod(x1, x2, x3, x4) -> f1824_0_test_InvokeMethod(x1, x2, x4)
Filtered unneeded arguments:
   f1824_0_test_InvokeMethod(x1, x2, x3) -> f1824_0_test_InvokeMethod(x2, x3)
Finished conversion. Obtained 2 rules.P rules:
f1824_0_test_InvokeMethod(i81:0, i82:0) -> f1824_0_test_InvokeMethod(i82:0, 0) :|: i81:0 > 0 && i82:0 > 0 && i82:0 < i81:0
f1824_0_test_InvokeMethod(i81:0, i82:0) -> f1824_0_test_InvokeMethod(i81:0, i82:0 + 1) :|: i82:0 + 1 < i81:0 && i81:0 > 0

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

(8)
Obligation:
Rules:
f1824_0_test_InvokeMethod(i81:0, i82:0) -> f1824_0_test_InvokeMethod(i82:0, 0) :|: i81:0 > 0 && i82:0 > 0 && i82:0 < i81:0
f1824_0_test_InvokeMethod(x, x1) -> f1824_0_test_InvokeMethod(x, x1 + 1) :|: x1 + 1 < x && x > 0

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

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

(10)
Obligation:
Rules:
f1824_0_test_InvokeMethod(i81:0, i82:0) -> f1824_0_test_InvokeMethod(i82:0, 0) :|: i81:0 > 0 && i82:0 > 0 && i82:0 < i81:0
f1824_0_test_InvokeMethod(x, x1) -> f1824_0_test_InvokeMethod(x, arith) :|: x1 + 1 < x && x > 0 && arith = x1 + 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1824_0_test_InvokeMethod(i81:0, i82:0) -> f1824_0_test_InvokeMethod(i82:0, 0) :|: i81:0 > 0 && i82:0 > 0 && i82:0 < i81:0
(2) f1824_0_test_InvokeMethod(x, x1) -> f1824_0_test_InvokeMethod(x, arith) :|: x1 + 1 < x && x > 0 && arith = x1 + 1

Arcs:
(1) -> (2)
(2) -> (1), (2)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f1824_0_test_InvokeMethod(i81:0, i82:0) -> f1824_0_test_InvokeMethod(i82:0, 0) :|: i81:0 > 0 && i82:0 > 0 && i82:0 < i81:0
(2) f1824_0_test_InvokeMethod(x, x1) -> f1824_0_test_InvokeMethod(x, arith) :|: x1 + 1 < x && x > 0 && arith = x1 + 1

Arcs:
(1) -> (2)
(2) -> (1), (2)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f1824_0_test_InvokeMethod(x:0, x1:0) -> f1824_0_test_InvokeMethod(x:0, x1:0 + 1) :|: x:0 > x1:0 + 1 && x:0 > 0
f1824_0_test_InvokeMethod(i81:0:0, i82:0:0) -> f1824_0_test_InvokeMethod(i82:0:0, 0) :|: i81:0:0 > 0 && i82:0:0 > 0 && i82:0:0 < i81:0:0

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

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

(16)
Obligation:
Rules:
f1824_0_test_InvokeMethod(x:0, x1:0) -> f1824_0_test_InvokeMethod(x:0, c) :|: c = x1:0 + 1 && (x:0 > x1:0 + 1 && x:0 > 0)
f1824_0_test_InvokeMethod(i81:0:0, i82:0:0) -> f1824_0_test_InvokeMethod(i82:0:0, c1) :|: c1 = 0 && (i81:0:0 > 0 && i82:0:0 > 0 && i82:0:0 < i81:0:0)

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

(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1824_0_test_InvokeMethod(x, x1)] = -2 + x

The following rules are decreasing:
f1824_0_test_InvokeMethod(i81:0:0, i82:0:0) -> f1824_0_test_InvokeMethod(i82:0:0, c1) :|: c1 = 0 && (i81:0:0 > 0 && i82:0:0 > 0 && i82:0:0 < i81:0:0)
The following rules are bounded:
f1824_0_test_InvokeMethod(i81:0:0, i82:0:0) -> f1824_0_test_InvokeMethod(i82:0:0, c1) :|: c1 = 0 && (i81:0:0 > 0 && i82:0:0 > 0 && i82:0:0 < i81:0:0)

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

(18)
Obligation:
Rules:
f1824_0_test_InvokeMethod(x:0, x1:0) -> f1824_0_test_InvokeMethod(x:0, c) :|: c = x1:0 + 1 && (x:0 > x1:0 + 1 && x:0 > 0)

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

(19) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1824_0_test_InvokeMethod(x, x1)] = x - x1

The following rules are decreasing:
f1824_0_test_InvokeMethod(x:0, x1:0) -> f1824_0_test_InvokeMethod(x:0, c) :|: c = x1:0 + 1 && (x:0 > x1:0 + 1 && x:0 > 0)
The following rules are bounded:
f1824_0_test_InvokeMethod(x:0, x1:0) -> f1824_0_test_InvokeMethod(x:0, c) :|: c = x1:0 + 1 && (x:0 > x1:0 + 1 && x:0 > 0)

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

(20)
YES