/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, 1910 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 101 ms]
(8) IntTRS
(9) RankingReductionPairProof [EQUIVALENT, 23 ms]
(10) 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
		%c = alloca i32, align 4
		store %x, %1
		store %y, %2
		store 0, %c
		br %3
	3:
		%4 = load %1
		%5 = load %2
		%6 = icmp sgt %4 %5
		br %6, %7, %14
	7:
		%8 = load %1
		%9 = add %8 1
		store %9, %1
		%10 = load %2
		%11 = add %10 2
		store %11, %2
		%12 = load %c
		%13 = add %12 1
		store %13, %c
		br %3
	14:
		%15 = load %c
		ret %15

*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 1 SCC.
----------------------------------------

(6)
Obligation:
SCC
----------------------------------------

(7) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 16 rulesP rules:
f_229(v117, v118, v119, v120, v121, v125, v123, 1, v122, v126, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_230(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: 0 = 0
f_230(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_231(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: v126 < v125
f_231(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_233(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: 0 = 0
f_233(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_235(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: TRUE
f_235(v117, v118, v119, v120, v121, v125, v126, 1, v122, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_237(v117, v118, v119, v120, v121, v125, v126, 1, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: 0 = 0
f_237(v117, v118, v119, v120, v121, v125, v126, 1, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_239(v117, v118, v119, v120, v121, v125, v126, 1, v135, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: v135 = 1 + v125
f_239(v117, v118, v119, v120, v121, v125, v126, 1, v135, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_241(v117, v118, v119, v120, v121, v125, v126, 1, v135, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: TRUE
f_241(v117, v118, v119, v120, v121, v125, v126, 1, v135, v123, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_242(v117, v118, v119, v120, v121, v125, v126, 1, v135, v127, v128, v129, v130, v131, v132, v133, 0, 3, 4) :|: 0 = 0
f_242(v117, v118, v119, v120, v121, v125, v126, 1, v135, v127, v128, v129, v130, v131, v132, v133, 0, 3, 4) -> f_243(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: v137 = 2 + v126
f_243(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_244(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: TRUE
f_244(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_245(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: 0 = 0
f_245(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_246(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: v139 = 1 + v128 && 2 <= v139
f_246(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_247(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: TRUE
f_247(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_248(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: TRUE
f_248(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_228(v117, v118, v119, v120, v121, v125, v126, 1, v135, v137, v128, v139, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: TRUE
f_228(v117, v118, v119, v120, v121, v122, v123, 1, v125, v126, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) -> f_229(v117, v118, v119, v120, v121, v125, v123, 1, v122, v126, v127, v128, v129, v130, v131, v132, v133, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_229(v117:0, v118:0, v119:0, v120:0, v121:0, v125:0, v123:0, 1, v122:0, v126:0, v127:0, v128:0, v129:0, v130:0, v131:0, v132:0, v133:0, 0, 3, 2, 4) -> f_229(v117:0, v118:0, v119:0, v120:0, v121:0, 1 + v125:0, v126:0, 1, v125:0, 2 + v126:0, v128:0, 1 + v128:0, v129:0, v130:0, v131:0, v132:0, v133:0, 0, 3, 2, 4) :|: v128:0 > 0 && v126:0 < v125:0
Filtered unneeded arguments:
   f_229(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_229(x6, x10, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_229(v125:0, v126:0, v128:0) -> f_229(1 + v125:0, 2 + v126:0, 1 + v128:0) :|: v128:0 > 0 && v126:0 < v125:0

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

(8)
Obligation:
Rules:
f_229(v125:0, v126:0, v128:0) -> f_229(1 + v125:0, 2 + v126:0, 1 + v128:0) :|: v128:0 > 0 && v126:0 < v125:0

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

(9) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_229 ] = -1*f_229_2 + f_229_1

The following rules are decreasing:
f_229(v125:0, v126:0, v128:0) -> f_229(1 + v125:0, 2 + v126:0, 1 + v128:0) :|: v128:0 > 0 && v126:0 < v125:0

The following rules are bounded:
f_229(v125:0, v126:0, v128:0) -> f_229(1 + v125:0, 2 + v126:0, 1 + v128:0) :|: v128:0 > 0 && v126:0 < v125:0


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

(10)
YES