/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, 179 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 1092 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 51 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 11 ms] (12) 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 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, %10 7: %8 = load %y %9 = icmp slt %8 0 br %10 10: %11 = phi [0, %4], [%9, %7] br %11, %12, %18 12: %13 = load %x %14 = load %y %15 = add %13 %14 store %15, %x %16 = load %y %17 = add %16 -1 store %17, %y br %4 18: 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 17 rulesP rules: f_158(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) -> f_159(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) :|: 0 < v115 && 2 <= v112 f_159(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) -> f_161(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_161(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) -> f_163(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) :|: TRUE f_163(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) -> f_165(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_165(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) -> f_167(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_167(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) -> f_168(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_168(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) -> f_169(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) :|: TRUE f_169(v107, v108, v109, v110, v111, v115, 1, v116, v112, v114, v117, v118, v119, 0, 3, 2, 4) -> f_170(v107, v108, v109, v110, v111, v115, 1, v116, v114, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_170(v107, v108, v109, v110, v111, v115, 1, v116, v114, v117, v118, v119, 0, 3, 2, 4) -> f_171(v107, v108, v109, v110, v111, v115, 1, v116, v114, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_171(v107, v108, v109, v110, v111, v115, 1, v116, v114, v117, v118, v119, 0, 3, 2, 4) -> f_172(v107, v108, v109, v110, v111, v115, 1, v116, v149, v114, v117, v118, v119, 0, 3, 2, 4) :|: v149 = v115 + v116 f_172(v107, v108, v109, v110, v111, v115, 1, v116, v149, v114, v117, v118, v119, 0, 3, 2, 4) -> f_173(v107, v108, v109, v110, v111, v115, 1, v116, v149, v114, v117, v118, v119, 0, 3, 2, 4) :|: TRUE f_173(v107, v108, v109, v110, v111, v115, 1, v116, v149, v114, v117, v118, v119, 0, 3, 2, 4) -> f_174(v107, v108, v109, v110, v111, v115, 1, v116, v149, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 f_174(v107, v108, v109, v110, v111, v115, 1, v116, v149, v117, v118, v119, 0, 3, 2, 4) -> f_175(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) :|: 1 + v151 = v116 && 3 + v151 <= 0 f_175(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) -> f_176(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) :|: TRUE f_176(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) -> f_177(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) :|: TRUE f_177(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) -> f_157(v107, v108, v109, v110, v111, v115, 1, v116, v149, v151, v117, v118, v119, 0, 3, 2, 4) :|: TRUE f_157(v107, v108, v109, v110, v111, v112, 1, v114, v115, v116, v117, v118, v119, 0, 3, 2, 4) -> f_158(v107, v108, v109, v110, v111, v115, 1, v114, v112, v116, v117, v118, v119, 0, 3, 2, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_158(v107:0, v108:0, v109:0, v110:0, v111:0, v115:0, 1, v114:0, v112:0, 1 + v151:0, v117:0, v118:0, v119:0, 0, 3, 2, 4) -> f_158(v107:0, v108:0, v109:0, v110:0, v111:0, v115:0 + (1 + v151:0), 1, 1 + v151:0, v115:0, v151:0, v117:0, v118:0, v119:0, 0, 3, 2, 4) :|: v112:0 > 1 && v151:0 < -2 && v115:0 > 0 Filtered unneeded arguments: f_158(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_158(x6, x9, x10) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_158(v115:0, v112:0, sum~cons_1~v151:0) -> f_158(v115:0 + (1 + v151:0), v115:0, v151:0) :|: v151:0 < -2 && v115:0 > 0 && v112:0 > 1 && sum~cons_1~v151:0 = 1 + v151:0 ---------------------------------------- (8) Obligation: Rules: f_158(v115:0, v112:0, sum~cons_1~v151:0) -> f_158(v115:0 + (1 + v151:0), v115:0, v151:0) :|: v151:0 < -2 && v115:0 > 0 && v112:0 > 1 && sum~cons_1~v151:0 = 1 + v151:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_158(v115:0:0, v112:0:0, sum~cons_1~v151:0:0) -> f_158(v115:0:0 + (1 + v151:0:0), v115:0:0, v151:0:0) :|: v151:0:0 < -2 && v115:0:0 > 0 && v112:0:0 > 1 && sum~cons_1~v151:0:0 = 1 + v151:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_158(x, x1, x2)] = -2 + x - x2 The following rules are decreasing: f_158(v115:0:0, v112:0:0, sum~cons_1~v151:0:0) -> f_158(v115:0:0 + (1 + v151:0:0), v115:0:0, v151:0:0) :|: v151:0:0 < -2 && v115:0:0 > 0 && v112:0:0 > 1 && sum~cons_1~v151:0:0 = 1 + v151:0:0 The following rules are bounded: f_158(v115:0:0, v112:0:0, sum~cons_1~v151:0:0) -> f_158(v115:0:0 + (1 + v151:0:0), v115:0:0, v151:0:0) :|: v151:0:0 < -2 && v115:0:0 > 0 && v112:0:0 > 1 && sum~cons_1~v151:0:0 = 1 + v151:0:0 ---------------------------------------- (12) YES