/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, 177 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 598 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 46 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 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: true visibilityType: DEFAULT callingConvention: ccc *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %x = alloca i32, align 4 %y = alloca i32, align 4 %z = alloca i32, align 4 store 0, %1 %2 = call i32 (...)* @__VERIFIER_nondet_int() store %2, %x %3 = call i32 (...)* @__VERIFIER_nondet_int() store %3, %y %4 = call i32 (...)* @__VERIFIER_nondet_int() store %4, %z br %5 5: %6 = load %x %7 = load %y %8 = icmp slt %6 %7 br %8, %9, %13 9: %10 = load %x %11 = add %10 1 store %11, %x %12 = load %z store %12, %y br %5 13: ret 0 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 12 rulesP rules: 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 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 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 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 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 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 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 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 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 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 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 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 Combined rules. Obtained 1 rulesP rules: 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 Filtered unneeded arguments: f_129(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_129(x7, x8) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 ---------------------------------------- (8) Obligation: Rules: f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 ---------------------------------------- (9) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_129(x, x1)] = x - x1 The following rules are decreasing: f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 The following rules are bounded: f_129(v46:0, v50:0) -> f_129(v46:0, 1 + v50:0) :|: v50:0 < v46:0 ---------------------------------------- (10) YES