/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 896 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) LLVM Symbolic Execution SCC
        (8) SCC2IRS [SOUND, 31 ms]
        (9) IntTRS
        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (11) IntTRS
        (12) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (13) YES
    (14) LLVM Symbolic Execution SCC
        (15) SCC2IRS [SOUND, 15 ms]
        (16) IntTRS
        (17) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (18) IntTRS
        (19) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (20) YES


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

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToLLVMProof (EQUIVALENT)
Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM.
----------------------------------------

(2)
Obligation:
LLVM Problem

Aliases:

Data layout:

"e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"

Machine:

"x86_64-pc-linux-gnu"

Type definitions:

Global variables:

Function declarations and definitions:

*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		store %x, %1
		store %y, %2
		br %3
	3:
		%4 = load %1
		%5 = icmp sgt %4 0
		br %5, %6, %9
	6:
		%7 = load %2
		%8 = icmp sgt %7 0
		br %9
	9:
		%10 = phi [0, %3], [%8, %6]
		br %10, %11, %32
	11:
		%12 = load %1
		%13 = load %2
		%14 = icmp sgt %12 %13
		br %14, %15, %23
	15:
		br %16
	16:
		%17 = load %1
		%18 = icmp sgt %17 0
		br %18, %19, %22
	19:
		%20 = load %1
		%21 = sub %20 1
		store %21, %1
		br %16
	22:
		br %31
	23:
		br %24
	24:
		%25 = load %2
		%26 = icmp sgt %25 0
		br %26, %27, %30
	27:
		%28 = load %2
		%29 = sub %28 1
		store %29, %2
		br %24
	30:
		br %31
	31:
		br %3
	32:
		%33 = load %1
		%34 = load %2
		%35 = add %33 %34
		ret %35

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		%3 = call i32 @__VERIFIER_nondet_int()
		%4 = call i32 @test_fun(i32 %2, i32 %3)
		ret %4


Analyze Termination of all function calls matching the pattern:
main()
----------------------------------------

(3) LLVMToTerminationGraphProof (EQUIVALENT)
Constructed symbolic execution graph for LLVM program and proved memory safety.
----------------------------------------

(4)
Obligation:
SE Graph
----------------------------------------

(5) SymbolicExecutionGraphToSCCProof (SOUND)
Splitted symbolic execution graph to 2 SCCs.
----------------------------------------

(6)
Complex Obligation (AND)

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

(7)
Obligation:
SCC
----------------------------------------

(8) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 9 rulesP rules:
f_258(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 4) -> f_261(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 2, 4) :|: 0 < v69 && 2 <= v68 && 2 <= v63
f_261(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 2, 4) -> f_265(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 2, 4) :|: 0 = 0
f_265(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 2, 4) -> f_269(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 2, 4) :|: TRUE
f_269(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 2, 4) -> f_273(v62, v63, v64, v65, 1, 0, v69, v70, v71, v72, v73, 3, 2, 4) :|: 0 = 0
f_273(v62, v63, v64, v65, 1, 0, v69, v70, v71, v72, v73, 3, 2, 4) -> f_277(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 2, 4) :|: 1 + v76 = v69 && 0 <= v76
f_277(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 2, 4) -> f_281(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 2, 4) :|: TRUE
f_281(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 2, 4) -> f_284(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 2, 4) :|: TRUE
f_284(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 2, 4) -> f_255(v62, v63, v64, v65, 1, 0, v69, v76, v70, v71, v72, v73, 3, 4) :|: TRUE
f_255(v62, v63, v64, v65, 1, 0, v68, v69, v70, v71, v72, v73, 3, 4) -> f_258(v62, v63, v64, v65, 1, 0, v69, v68, v70, v71, v72, v73, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_258(v62:0, v63:0, v64:0, v65:0, 1, 0, 1 + v76:0, v68:0, v70:0, v71:0, v72:0, v73:0, 3, 4) -> f_258(v62:0, v63:0, v64:0, v65:0, 1, 0, v76:0, 1 + v76:0, v70:0, v71:0, v72:0, v73:0, 3, 4) :|: v68:0 > 1 && v76:0 > -1 && v63:0 > 1
Filtered unneeded arguments:
   f_258(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_258(x2, x7, x8)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_258(v63:0, sum~cons_1~v76:0, v68:0) -> f_258(v63:0, v76:0, 1 + v76:0) :|: v76:0 > -1 && v63:0 > 1 && v68:0 > 1 && sum~cons_1~v76:0 = 1 + v76:0

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

(9)
Obligation:
Rules:
f_258(v63:0, sum~cons_1~v76:0, v68:0) -> f_258(v63:0, v76:0, 1 + v76:0) :|: v76:0 > -1 && v63:0 > 1 && v68:0 > 1 && sum~cons_1~v76:0 = 1 + v76:0

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

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

(11)
Obligation:
Rules:
f_258(v63:0:0, sum~cons_1~v76:0:0, v68:0:0) -> f_258(v63:0:0, v76:0:0, 1 + v76:0:0) :|: v76:0:0 > -1 && v63:0:0 > 1 && v68:0:0 > 1 && sum~cons_1~v76:0:0 = 1 + v76:0:0

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

(12) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_258(x, x1, x2)] = x1

The following rules are decreasing:
f_258(v63:0:0, sum~cons_1~v76:0:0, v68:0:0) -> f_258(v63:0:0, v76:0:0, 1 + v76:0:0) :|: v76:0:0 > -1 && v63:0:0 > 1 && v68:0:0 > 1 && sum~cons_1~v76:0:0 = 1 + v76:0:0
The following rules are bounded:
f_258(v63:0:0, sum~cons_1~v76:0:0, v68:0:0) -> f_258(v63:0:0, v76:0:0, 1 + v76:0:0) :|: v76:0:0 > -1 && v63:0:0 > 1 && v68:0:0 > 1 && sum~cons_1~v76:0:0 = 1 + v76:0:0

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

(13)
YES

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

(14)
Obligation:
SCC
----------------------------------------

(15) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 9 rulesP rules:
f_253(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) -> f_256(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) :|: 0 < v55 && 2 <= v54
f_256(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) -> f_259(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) :|: 0 = 0
f_259(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) -> f_263(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) :|: TRUE
f_263(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) -> f_267(v49, v50, v51, v52, 1, v55, v56, v57, v58, v59, 0, 3, 2, 4) :|: 0 = 0
f_267(v49, v50, v51, v52, 1, v55, v56, v57, v58, v59, 0, 3, 2, 4) -> f_271(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) :|: 1 + v74 = v55 && 0 <= v74
f_271(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) -> f_275(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) :|: TRUE
f_275(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) -> f_279(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) :|: TRUE
f_279(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) -> f_250(v49, v50, v51, v52, 1, v55, v74, v56, v57, v58, v59, 0, 3, 2, 4) :|: TRUE
f_250(v49, v50, v51, v52, 1, v54, v55, v56, v57, v58, v59, 0, 3, 2, 4) -> f_253(v49, v50, v51, v52, 1, v55, v54, v56, v57, v58, v59, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_253(v49:0, v50:0, v51:0, v52:0, 1, 1 + v74:0, v54:0, v56:0, v57:0, v58:0, v59:0, 0, 3, 2, 4) -> f_253(v49:0, v50:0, v51:0, v52:0, 1, v74:0, 1 + v74:0, v56:0, v57:0, v58:0, v59:0, 0, 3, 2, 4) :|: v54:0 > 1 && v74:0 > -1
Filtered unneeded arguments:
   f_253(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_253(x6, x7)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_253(sum~cons_1~v74:0, v54:0) -> f_253(v74:0, 1 + v74:0) :|: v54:0 > 1 && v74:0 > -1 && sum~cons_1~v74:0 = 1 + v74:0

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

(16)
Obligation:
Rules:
f_253(sum~cons_1~v74:0, v54:0) -> f_253(v74:0, 1 + v74:0) :|: v54:0 > 1 && v74:0 > -1 && sum~cons_1~v74:0 = 1 + v74:0

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

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

(18)
Obligation:
Rules:
f_253(sum~cons_1~v74:0:0, v54:0:0) -> f_253(v74:0:0, 1 + v74:0:0) :|: v54:0:0 > 1 && v74:0:0 > -1 && sum~cons_1~v74:0:0 = 1 + v74:0:0

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

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

The following rules are decreasing:
f_253(sum~cons_1~v74:0:0, v54:0:0) -> f_253(v74:0:0, 1 + v74:0:0) :|: v54:0:0 > 1 && v74:0:0 > -1 && sum~cons_1~v74:0:0 = 1 + v74:0:0
The following rules are bounded:
f_253(sum~cons_1~v74:0:0, v54:0:0) -> f_253(v74:0:0, 1 + v74:0:0) :|: v54:0:0 > 1 && v74:0:0 > -1 && sum~cons_1~v74:0:0 = 1 + v74:0:0

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

(20)
YES