7.48/3.01 YES 7.48/3.03 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 7.48/3.03 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 7.48/3.03 7.48/3.03 7.48/3.03 Termination of the given C Problem could be proven: 7.48/3.03 7.48/3.03 (0) C Problem 7.48/3.03 (1) CToLLVMProof [EQUIVALENT, 174 ms] 7.48/3.03 (2) LLVM problem 7.48/3.03 (3) LLVMToTerminationGraphProof [EQUIVALENT, 682 ms] 7.48/3.03 (4) LLVM Symbolic Execution Graph 7.48/3.03 (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] 7.48/3.03 (6) LLVM Symbolic Execution SCC 7.48/3.03 (7) SCC2IRS [SOUND, 88 ms] 7.48/3.03 (8) IntTRS 7.48/3.03 (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] 7.48/3.03 (10) IntTRS 7.48/3.03 (11) PolynomialOrderProcessor [EQUIVALENT, 11 ms] 7.48/3.03 (12) YES 7.48/3.03 7.48/3.03 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (0) 7.48/3.03 Obligation: 7.48/3.03 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (1) CToLLVMProof (EQUIVALENT) 7.48/3.03 Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (2) 7.48/3.03 Obligation: 7.48/3.03 LLVM Problem 7.48/3.03 7.48/3.03 Aliases: 7.48/3.03 7.48/3.03 Data layout: 7.48/3.03 7.48/3.03 "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" 7.48/3.03 7.48/3.03 Machine: 7.48/3.03 7.48/3.03 "x86_64-pc-linux-gnu" 7.48/3.03 7.48/3.03 Type definitions: 7.48/3.03 7.48/3.03 Global variables: 7.48/3.03 7.48/3.03 Function declarations and definitions: 7.48/3.03 7.48/3.03 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc 7.48/3.03 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 7.48/3.03 0: 7.48/3.03 %1 = alloca i32, align 4 7.48/3.03 %x = alloca i32, align 4 7.48/3.03 %y = alloca i32, align 4 7.48/3.03 %old_y = alloca i32, align 4 7.48/3.03 store 0, %1 7.48/3.03 %2 = call i32 (...)* @__VERIFIER_nondet_int() 7.48/3.03 store %2, %x 7.48/3.03 %3 = call i32 (...)* @__VERIFIER_nondet_int() 7.48/3.03 store %3, %y 7.48/3.03 br %4 7.48/3.03 4: 7.48/3.03 %5 = load %x 7.48/3.03 %6 = icmp sgt %5 0 7.48/3.03 br %6, %7, %17 7.48/3.03 7: 7.48/3.03 %8 = load %y 7.48/3.03 store %8, %x 7.48/3.03 %9 = load %y 7.48/3.03 store %9, %old_y 7.48/3.03 %10 = call i32 (...)* @__VERIFIER_nondet_int() 7.48/3.03 store %10, %y 7.48/3.03 %11 = load %y 7.48/3.03 %12 = load %old_y 7.48/3.03 %13 = sub 0 %12 7.48/3.03 %14 = icmp sgt %11 %13 7.48/3.03 br %14, %15, %16 7.48/3.03 15: 7.48/3.03 br %17 7.48/3.03 16: 7.48/3.03 br %4 7.48/3.03 17: 7.48/3.03 ret 0 7.48/3.03 7.48/3.03 7.48/3.03 Analyze Termination of all function calls matching the pattern: 7.48/3.03 main() 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (3) LLVMToTerminationGraphProof (EQUIVALENT) 7.48/3.03 Constructed symbolic execution graph for LLVM program and proved memory safety. 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (4) 7.48/3.03 Obligation: 7.48/3.03 SE Graph 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (5) SymbolicExecutionGraphToSCCProof (SOUND) 7.48/3.03 Splitted symbolic execution graph to 1 SCC. 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (6) 7.48/3.03 Obligation: 7.48/3.03 SCC 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (7) SCC2IRS (SOUND) 7.48/3.03 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 7.48/3.03 Generated rules. Obtained 18 rulesP rules: 7.48/3.03 f_144(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_145(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 < v49 && 1 + v51 <= 0 && 1 + v50 <= 0 7.48/3.03 f_145(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_147(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 f_147(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_149(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_149(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_151(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 f_151(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_152(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_152(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_153(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 f_153(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_154(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_154(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_155(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_155(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_156(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_156(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_157(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 f_157(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_158(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 f_158(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_159(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: v67 + v50 = 0 && 1 <= v67 7.48/3.03 f_159(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_161(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: v65 <= v67 7.48/3.03 f_161(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_163(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 f_163(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_165(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_165(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_167(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_167(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_143(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: TRUE 7.48/3.03 f_143(v41, v42, v43, v44, v45, v46, v47, 1, v49, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_144(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0 7.48/3.03 Combined rules. Obtained 1 rulesP rules: 7.48/3.03 f_144(v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, v49:0, 1, v50:0, v51:0, 0, v53:0, v54:0, v55:0, v56:0, 3, 4) -> f_144(v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, v50:0, 1, v65:0, v67:0, 0, v53:0, v54:0, v55:0, v56:0, 3, 4) :|: v51:0 < 0 && v49:0 > 0 && v50:0 < 0 && v67:0 > 0 && v67:0 >= v65:0 && v67:0 + v50:0 = 0 7.48/3.03 Filtered unneeded arguments: 7.48/3.03 f_144(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_144(x7, x9, x10) 7.48/3.03 Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: 7.48/3.03 f_144(v49:0, v50:0, v51:0) -> f_144(v50:0, v65:0, v67:0) :|: v49:0 > 0 && v51:0 < 0 && v50:0 < 0 && v67:0 > 0 && v67:0 + v50:0 = 0 && v67:0 >= v65:0 7.48/3.03 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (8) 7.48/3.03 Obligation: 7.48/3.03 Rules: 7.48/3.03 f_144(v49:0, v50:0, v51:0) -> f_144(v50:0, v65:0, v67:0) :|: v49:0 > 0 && v51:0 < 0 && v50:0 < 0 && v67:0 > 0 && v67:0 + v50:0 = 0 && v67:0 >= v65:0 7.48/3.03 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (9) IntTRSCompressionProof (EQUIVALENT) 7.48/3.03 Compressed rules. 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (10) 7.48/3.03 Obligation: 7.48/3.03 Rules: 7.48/3.03 f_144(v49:0:0, v50:0:0, v51:0:0) -> f_144(v50:0:0, v65:0:0, v67:0:0) :|: v67:0:0 + v50:0:0 = 0 && v67:0:0 >= v65:0:0 && v67:0:0 > 0 && v50:0:0 < 0 && v51:0:0 < 0 && v49:0:0 > 0 7.48/3.03 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (11) PolynomialOrderProcessor (EQUIVALENT) 7.48/3.03 Found the following polynomial interpretation: 7.48/3.03 [f_144(x, x1, x2)] = -1 + x 7.48/3.03 7.48/3.03 The following rules are decreasing: 7.48/3.03 f_144(v49:0:0, v50:0:0, v51:0:0) -> f_144(v50:0:0, v65:0:0, v67:0:0) :|: v67:0:0 + v50:0:0 = 0 && v67:0:0 >= v65:0:0 && v67:0:0 > 0 && v50:0:0 < 0 && v51:0:0 < 0 && v49:0:0 > 0 7.48/3.03 The following rules are bounded: 7.48/3.03 f_144(v49:0:0, v50:0:0, v51:0:0) -> f_144(v50:0:0, v65:0:0, v67:0:0) :|: v67:0:0 + v50:0:0 = 0 && v67:0:0 >= v65:0:0 && v67:0:0 > 0 && v50:0:0 < 0 && v51:0:0 < 0 && v49:0:0 > 0 7.48/3.03 7.48/3.03 ---------------------------------------- 7.48/3.03 7.48/3.03 (12) 7.48/3.03 YES 7.48/3.05 EOF