/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 173 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, 40 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox2/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 store 0, %1 %2 = call i32 (...)* @__VERIFIER_nondet_int() store %2, %x %3 = call i32 (...)* @__VERIFIER_nondet_int() store %3, %y br %4 4: %5 = load %x %6 = icmp sgt %5 0 br %6, %7, %11 7: %8 = load %y store %8, %x %9 = load %y %10 = add %9 -1 store %10, %y br %4 11: 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 11 rulesP rules: f_111(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_112(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 < v40 && 0 <= v41 && 1 <= v37 f_112(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_114(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 f_114(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_116(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: TRUE f_116(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_118(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 f_118(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_119(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: TRUE f_119(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_120(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 f_120(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_121(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: 1 + v47 = v41 && 0 <= 1 + v47 f_121(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) -> f_122(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: TRUE f_122(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) -> f_123(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: TRUE f_123(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) -> f_110(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: TRUE f_110(v33, v34, v35, v36, v37, v38, 1, v40, v41, v42, v43, v44, 0, 3, 4) -> f_111(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_111(v33:0, v34:0, v35:0, v36:0, v37:0, v40:0, 1, 1 + v47:0, v42:0, v43:0, v44:0, 0, 3, 4) -> f_111(v33:0, v34:0, v35:0, v36:0, v37:0, 1 + v47:0, 1, v47:0, v42:0, v43:0, v44:0, 0, 3, 4) :|: v47:0 > -2 && v40:0 > 0 && v37:0 > 0 Filtered unneeded arguments: f_111(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_111(x5, x6, x8) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_111(v37:0, v40:0, sum~cons_1~v47:0) -> f_111(v37:0, 1 + v47:0, v47:0) :|: v40:0 > 0 && v37:0 > 0 && v47:0 > -2 && sum~cons_1~v47:0 = 1 + v47:0 ---------------------------------------- (8) Obligation: Rules: f_111(v37:0, v40:0, sum~cons_1~v47:0) -> f_111(v37:0, 1 + v47:0, v47:0) :|: v40:0 > 0 && v37:0 > 0 && v47:0 > -2 && sum~cons_1~v47:0 = 1 + v47:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_111(v37:0:0, v40:0:0, sum~cons_1~v47:0:0) -> f_111(v37:0:0, 1 + v47:0:0, v47:0:0) :|: v40:0:0 > 0 && v37:0:0 > 0 && v47:0:0 > -2 && sum~cons_1~v47:0:0 = 1 + v47:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_111(x, x1, x2)] = x2 The following rules are decreasing: f_111(v37:0:0, v40:0:0, sum~cons_1~v47:0:0) -> f_111(v37:0:0, 1 + v47:0:0, v47:0:0) :|: v40:0:0 > 0 && v37:0:0 > 0 && v47:0:0 > -2 && sum~cons_1~v47:0:0 = 1 + v47:0:0 The following rules are bounded: f_111(v37:0:0, v40:0:0, sum~cons_1~v47:0:0) -> f_111(v37:0:0, 1 + v47:0:0, v47:0:0) :|: v40:0:0 > 0 && v37:0:0 > 0 && v47:0:0 > -2 && sum~cons_1~v47:0:0 = 1 + v47:0:0 ---------------------------------------- (12) YES