/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, 163 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 88 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, 14 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(18) YES
----------------------------------------
(0)
Obligation:
need to prove termination of the following program:
/**
* A recursive loop.
*
* All calls terminate.
*
* Julia + BinTerm prove that all calls terminate.
*
* @author Fausto Spoto
*/
public class Double3 {
private static void test(int n) {
while (--n > 0) test(n);
}
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 all calls terminate.
*
* @author Fausto Spoto
*/
public class Double3 {
private static void test(int n) {
while (--n > 0) test(n);
}
public static void main(String[] args) {
test(10);
}
}
----------------------------------------
(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------
(4)
Obligation:
Termination Graph based on JBC Program:
Double3.main([Ljava/lang/String;)V: Graph of 7 nodes with 0 SCCs.
Double3.test(I)V: Graph of 14 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: Double3.test(I)V
SCC calls the following helper methods: Double3.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 13 IRulesP rules:
f91_0_test_Load(EOS(STATIC_91), i10, i12) -> f93_0_test_LE(EOS(STATIC_93), i10, i12, i12) :|: TRUE
f93_0_test_LE(EOS(STATIC_93), i10, i14, i14) -> f100_0_test_LE(EOS(STATIC_100), i10, i14, i14) :|: TRUE
f100_0_test_LE(EOS(STATIC_100), i10, i14, i14) -> f103_0_test_Load(EOS(STATIC_103), i10, i14) :|: i14 > 0
f103_0_test_Load(EOS(STATIC_103), i10, i14) -> f107_0_test_InvokeMethod(EOS(STATIC_107), i10, i14, i14) :|: TRUE
f107_0_test_InvokeMethod(EOS(STATIC_107), i10, i14, i14) -> f132_0_test_Inc(EOS(STATIC_132), i14, i14) :|: i14 >= 1
f107_0_test_InvokeMethod(EOS(STATIC_107), i10, i14, i14) -> f132_1_test_Inc(EOS(STATIC_132), i10, i14, i14) :|: i14 >= 1
f132_0_test_Inc(EOS(STATIC_132), i14, i14) -> f136_0_test_Inc(EOS(STATIC_136), i14, i14) :|: TRUE
f136_0_test_Inc(EOS(STATIC_136), i14, i14) -> f88_0_test_Inc(EOS(STATIC_88), i14, i14) :|: TRUE
f88_0_test_Inc(EOS(STATIC_88), i10, i11) -> f91_0_test_Load(EOS(STATIC_91), i10, i11 + -1) :|: TRUE
f961_0_test_Return(EOS(STATIC_961), i10, i21) -> f965_0_test_JMP(EOS(STATIC_965), i10, i21) :|: TRUE
f965_0_test_JMP(EOS(STATIC_965), i10, i21) -> f999_0_test_Inc(EOS(STATIC_999), i10, i21) :|: TRUE
f999_0_test_Inc(EOS(STATIC_999), i10, i21) -> f88_0_test_Inc(EOS(STATIC_88), i10, i21) :|: TRUE
f132_1_test_Inc(EOS(STATIC_132), i10, i21, i21) -> f961_0_test_Return(EOS(STATIC_961), i10, i21) :|: TRUE
Combined rules. Obtained 2 IRulesP rules:
f91_0_test_Load(EOS(STATIC_91), i10:0, i12:0) -> f91_0_test_Load(EOS(STATIC_91), i10:0, i12:0 - 1) :|: i12:0 > 0
f91_0_test_Load(EOS(STATIC_91), i10:0, i12:0) -> f91_0_test_Load(EOS(STATIC_91), i12:0, i12:0 - 1) :|: i12:0 > 0
Filtered constant ground arguments:
f91_0_test_Load(x1, x2, x3) -> f91_0_test_Load(x2, x3)
EOS(x1) -> EOS
Filtered unneeded arguments:
f91_0_test_Load(x1, x2) -> f91_0_test_Load(x2)
Finished conversion. Obtained 1 rules.P rules:
f91_0_test_Load(i12:0) -> f91_0_test_Load(i12:0 - 1) :|: i12:0 > 0
----------------------------------------
(8)
Obligation:
Rules:
f91_0_test_Load(i12:0) -> f91_0_test_Load(i12:0 - 1) :|: i12:0 > 0
----------------------------------------
(9) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------
(10)
Obligation:
Rules:
f91_0_test_Load(i12:0) -> f91_0_test_Load(arith) :|: i12:0 > 0 && arith = i12:0 - 1
----------------------------------------
(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f91_0_test_Load(i12:0) -> f91_0_test_Load(arith) :|: i12:0 > 0 && arith = i12:0 - 1
Arcs:
(1) -> (1)
This digraph is fully evaluated!
----------------------------------------
(12)
Obligation:
Termination digraph:
Nodes:
(1) f91_0_test_Load(i12:0) -> f91_0_test_Load(arith) :|: i12:0 > 0 && arith = i12:0 - 1
Arcs:
(1) -> (1)
This digraph is fully evaluated!
----------------------------------------
(13) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------
(14)
Obligation:
Rules:
f91_0_test_Load(i12:0:0) -> f91_0_test_Load(i12:0:0 - 1) :|: i12:0:0 > 0
----------------------------------------
(15) TempFilterProof (SOUND)
Used the following sort dictionary for filtering:
f91_0_test_Load(INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------
(16)
Obligation:
Rules:
f91_0_test_Load(i12:0:0) -> f91_0_test_Load(c) :|: c = i12:0:0 - 1 && i12:0:0 > 0
----------------------------------------
(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f91_0_test_Load(x)] = x
The following rules are decreasing:
f91_0_test_Load(i12:0:0) -> f91_0_test_Load(c) :|: c = i12:0:0 - 1 && i12:0:0 > 0
The following rules are bounded:
f91_0_test_Load(i12:0:0) -> f91_0_test_Load(c) :|: c = i12:0:0 - 1 && i12:0:0 > 0
----------------------------------------
(18)
YES