8.08/3.09 YES 8.08/3.11 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 8.08/3.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.08/3.11 8.08/3.11 8.08/3.11 Termination of the given C Problem could be proven: 8.08/3.11 8.08/3.11 (0) C Problem 8.08/3.11 (1) CToLLVMProof [EQUIVALENT, 175 ms] 8.08/3.11 (2) LLVM problem 8.08/3.11 (3) LLVMToTerminationGraphProof [EQUIVALENT, 690 ms] 8.08/3.11 (4) LLVM Symbolic Execution Graph 8.08/3.11 (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] 8.08/3.11 (6) LLVM Symbolic Execution SCC 8.08/3.11 (7) SCC2IRS [SOUND, 37 ms] 8.08/3.11 (8) IntTRS 8.08/3.11 (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 8.08/3.11 (10) YES 8.08/3.11 8.08/3.11 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (0) 8.08/3.11 Obligation: 8.08/3.11 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (1) CToLLVMProof (EQUIVALENT) 8.08/3.11 Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (2) 8.08/3.11 Obligation: 8.08/3.11 LLVM Problem 8.08/3.11 8.08/3.11 Aliases: 8.08/3.11 8.08/3.11 Data layout: 8.08/3.11 8.08/3.11 "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" 8.08/3.11 8.08/3.11 Machine: 8.08/3.11 8.08/3.11 "x86_64-pc-linux-gnu" 8.08/3.11 8.08/3.11 Type definitions: 8.08/3.11 8.08/3.11 Global variables: 8.08/3.11 8.08/3.11 Function declarations and definitions: 8.08/3.11 8.08/3.11 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc 8.08/3.11 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 8.08/3.11 0: 8.08/3.11 %1 = alloca i32, align 4 8.08/3.11 %x = alloca i32, align 4 8.08/3.11 %y = alloca i32, align 4 8.08/3.11 %z = alloca i32, align 4 8.08/3.11 store 0, %1 8.08/3.11 %2 = call i32 (...)* @__VERIFIER_nondet_int() 8.08/3.11 store %2, %x 8.08/3.11 %3 = call i32 (...)* @__VERIFIER_nondet_int() 8.08/3.11 store %3, %y 8.08/3.11 %4 = call i32 (...)* @__VERIFIER_nondet_int() 8.08/3.11 store %4, %z 8.08/3.11 br %5 8.08/3.11 5: 8.08/3.11 %6 = load %x 8.08/3.11 %7 = load %y 8.08/3.11 %8 = icmp slt %6 %7 8.08/3.11 br %8, %9, %13 8.08/3.11 9: 8.08/3.11 %10 = load %x 8.08/3.11 %11 = add %10 1 8.08/3.11 store %11, %x 8.08/3.11 %12 = load %z 8.08/3.11 store %12, %y 8.08/3.11 br %5 8.08/3.11 13: 8.08/3.11 ret 0 8.08/3.11 8.08/3.11 8.08/3.11 Analyze Termination of all function calls matching the pattern: 8.08/3.11 main() 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (3) LLVMToTerminationGraphProof (EQUIVALENT) 8.08/3.11 Constructed symbolic execution graph for LLVM program and proved memory safety. 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (4) 8.08/3.11 Obligation: 8.08/3.11 SE Graph 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (5) SymbolicExecutionGraphToSCCProof (SOUND) 8.08/3.11 Splitted symbolic execution graph to 1 SCC. 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (6) 8.08/3.11 Obligation: 8.08/3.11 SCC 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (7) SCC2IRS (SOUND) 8.08/3.11 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 8.08/3.11 Generated rules. Obtained 12 rulesP rules: 8.08/3.11 f_129(v40, v41, v42, v43, v44, v45, v46, v50, v48, 1, v47, v51, v52, v53, v54, 0, 3, 4) -> f_130(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) :|: 0 = 0 8.08/3.11 f_130(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) -> f_131(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) :|: v50 < v46 8.08/3.11 f_131(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) -> f_133(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) :|: 0 = 0 8.08/3.11 f_133(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) -> f_135(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) :|: TRUE 8.08/3.11 f_135(v40, v41, v42, v43, v44, v45, v46, v50, 1, v47, v51, v52, v53, v54, 0, 3, 4) -> f_137(v40, v41, v42, v43, v44, v45, v46, v50, 1, v51, v52, v53, v54, 0, 3, 4) :|: 0 = 0 8.08/3.11 f_137(v40, v41, v42, v43, v44, v45, v46, v50, 1, v51, v52, v53, v54, 0, 3, 4) -> f_138(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) :|: v56 = 1 + v50 8.08/3.11 f_138(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) -> f_139(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) :|: TRUE 8.08/3.11 f_139(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) -> f_140(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) :|: 0 = 0 8.08/3.11 f_140(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) -> f_141(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) :|: TRUE 8.08/3.11 f_141(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) -> f_142(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) :|: TRUE 8.08/3.11 f_142(v40, v41, v42, v43, v44, v45, v46, v50, 1, v56, v51, v52, v53, v54, 0, 3, 4) -> f_128(v40, v41, v42, v43, v44, v45, v46, v50, v46, 1, v56, v51, v52, v53, v54, 0, 3, 4) :|: TRUE 8.08/3.11 f_128(v40, v41, v42, v43, v44, v45, v46, v47, v48, 1, v50, v51, v52, v53, v54, 0, 3, 4) -> f_129(v40, v41, v42, v43, v44, v45, v46, v50, v48, 1, v47, v51, v52, v53, v54, 0, 3, 4) :|: 0 = 0 8.08/3.11 Combined rules. Obtained 1 rulesP rules: 8.08/3.11 f_129(v40:0, v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, v50:0, v48:0, 1, v47:0, v51:0, v52:0, v53:0, v54:0, 0, 3, 4) -> f_129(v40:0, v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, 1 + v50:0, v46:0, 1, v50:0, v51:0, v52:0, v53:0, v54:0, 0, 3, 4) :|: v50:0 < v46:0 8.08/3.11 Filtered unneeded arguments: 8.08/3.11 f_129(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_129(x7, x8) 8.08/3.11 Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: 8.08/3.11 f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 8.08/3.11 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (8) 8.08/3.11 Obligation: 8.08/3.11 Rules: 8.08/3.11 f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 8.08/3.11 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (9) PolynomialOrderProcessor (EQUIVALENT) 8.08/3.11 Found the following polynomial interpretation: 8.08/3.11 [f_129(x, x1)] = x - x1 8.08/3.11 8.08/3.11 The following rules are decreasing: 8.08/3.11 f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 8.08/3.11 The following rules are bounded: 8.08/3.11 f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 8.08/3.11 8.08/3.11 ---------------------------------------- 8.08/3.11 8.08/3.11 (10) 8.08/3.11 YES 8.08/3.15 EOF