/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 1392 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 100 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 17 ms] (10) IntTRS (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (14) 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: false 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 8 %y = alloca *i32, align 8 %z = alloca *i32, align 8 store 0, %1 %2 = alloca i8, numElementsLit: 4 %3 = bitcast *i8 %2 to *i32 store %3, %x %4 = alloca i8, numElementsLit: 4 %5 = bitcast *i8 %4 to *i32 store %5, %y %6 = alloca i8, numElementsLit: 4 %7 = bitcast *i8 %6 to *i32 store %7, %z %8 = call i32 @__VERIFIER_nondet_int() %9 = load %x store %8, %9 %10 = call i32 @__VERIFIER_nondet_int() %11 = load %y store %10, %11 %12 = call i32 @__VERIFIER_nondet_int() %13 = load %z store %12, %13 br %14 14: %15 = load %x %16 = load %15 %17 = icmp sgt %16 0 br %17, %18, %33 18: %19 = load %x %20 = load %19 %21 = load %y %22 = load %21 %23 = add %20 %22 %24 = load %x store %23, %24 %25 = load %z %26 = load %25 %27 = load %y store %26, %27 %28 = load %z %29 = load %28 %30 = sub 0 %29 %31 = sub %30 1 %32 = load %z store %31, %32 br %14 33: %34 = load %1 ret %34 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 24 rulesP rules: f_227(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, 1, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_228(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_228(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_229(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 < v49 f_229(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_231(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_231(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_233(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: TRUE f_233(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_235(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_235(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v46, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_237(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_237(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_238(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_238(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v48, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_239(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_239(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_240(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: v61 = v49 + v50 f_240(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_241(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_241(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_242(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: TRUE f_242(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_243(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_243(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_244(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_244(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_245(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_245(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_246(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: TRUE f_246(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_247(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_247(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_248(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_248(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v51, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_249(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: v64 + v52 = 0 f_249(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_250(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 1 + v65 = v64 f_250(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_251(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 f_251(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_252(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: TRUE f_252(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_253(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: TRUE f_253(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_226(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v49, 1, v50, v61, v52, v64, v65, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: TRUE f_226(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, 1, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) -> f_227(v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, 1, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, 0, 3, 7, 4, 8) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_227(v36:0, v37:0, v38:0, v39:0, v40:0, v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, 1, v48:0, v49:0, v50:0, v51:0, v52:0, v53:0, v54:0, v55:0, v56:0, v57:0, v58:0, v59:0, 0, 3, 7, 4, 8) -> f_227(v36:0, v37:0, v38:0, v39:0, v40:0, v41:0, v42:0, v43:0, v44:0, v45:0, v49:0, 1, v50:0, v49:0 + v50:0, v52:0, 1 + v65:0, v65:0, v53:0, v54:0, v55:0, v56:0, v57:0, v58:0, v59:0, 0, 3, 7, 4, 8) :|: 1 + v65:0 + v52:0 = 0 && v49:0 > 0 Filtered unneeded arguments: f_227(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24, x25, x26, x27, x28, x29) -> f_227(x14, x15, x17) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_227(v49:0, v50:0, v52:0) -> f_227(v49:0 + v50:0, v52:0, v65:0) :|: 1 + v65:0 + v52:0 = 0 && v49:0 > 0 ---------------------------------------- (8) Obligation: Rules: f_227(v49:0, v50:0, v52:0) -> f_227(v49:0 + v50:0, v52:0, v65:0) :|: 1 + v65:0 + v52:0 = 0 && v49:0 > 0 ---------------------------------------- (9) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC. f_227(v49:0, v50:0, v52:0) -> f_227(v49:0 + v50:0, v52:0, v65:0) :|: 1 + v65:0 + v52:0 = 0 && v49:0 > 0 has been transformed into f_227(v49:0, v50:0, v52:0) -> f_227(v49:0 + v50:0, v52:0, v65:0) :|: v52:0 = x11 && (v50:0 = x10 && (1 + v65:0 + v52:0 = 0 && v49:0 > 0)) && 1 + x11 + x10 = 0 && x8 > 0. f_227(v49:0, v50:0, v52:0) -> f_227(v49:0 + v50:0, v52:0, v65:0) :|: v52:0 = x11 && (v50:0 = x10 && (1 + v65:0 + v52:0 = 0 && v49:0 > 0)) && 1 + x11 + x10 = 0 && x8 > 0 and f_227(v49:0, v50:0, v52:0) -> f_227(v49:0 + v50:0, v52:0, v65:0) :|: v52:0 = x11 && (v50:0 = x10 && (1 + v65:0 + v52:0 = 0 && v49:0 > 0)) && 1 + x11 + x10 = 0 && x8 > 0 have been merged into the new rule f_227(x26, x27, x28) -> f_227(x26 + x27 + x28, x29, x30) :|: x28 = x31 && (x27 = x32 && (1 + x29 + x28 = 0 && x26 > 0)) && 1 + x31 + x32 = 0 && x33 > 0 && (x29 = x34 && (x28 = x35 && (1 + x30 + x29 = 0 && x26 + x27 > 0)) && 1 + x34 + x35 = 0 && x36 > 0) ---------------------------------------- (10) Obligation: Rules: f_227(x37, x38, x39) -> f_227(x37 + x38 + x39, x40, x41) :|: TRUE && x39 + -1 * x42 = 0 && x38 + -1 * x43 = 0 && x40 + x39 = -1 && x37 >= 1 && x42 + x43 = -1 && x44 >= 1 && x40 + -1 * x45 = 0 && x39 + -1 * x46 = 0 && x41 + x40 = -1 && x37 + x38 >= 1 && x45 + x46 = -1 && x47 >= 1 ---------------------------------------- (11) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (12) Obligation: Rules: f_227(x37:0, x38:0, x39:0) -> f_227(x37:0 + x38:0 + x39:0, x40:0, x41:0) :|: x45:0 + x46:0 = -1 && x47:0 > 0 && x37:0 + x38:0 >= 1 && x41:0 + x40:0 = -1 && x39:0 + -1 * x46:0 = 0 && x40:0 + -1 * x45:0 = 0 && x44:0 > 0 && x42:0 + x43:0 = -1 && x37:0 > 0 && x40:0 + x39:0 = -1 && x39:0 + -1 * x42:0 = 0 && x38:0 + -1 * x43:0 = 0 ---------------------------------------- (13) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_227(x, x1, x2)] = x + x1 The following rules are decreasing: f_227(x37:0, x38:0, x39:0) -> f_227(x37:0 + x38:0 + x39:0, x40:0, x41:0) :|: x45:0 + x46:0 = -1 && x47:0 > 0 && x37:0 + x38:0 >= 1 && x41:0 + x40:0 = -1 && x39:0 + -1 * x46:0 = 0 && x40:0 + -1 * x45:0 = 0 && x44:0 > 0 && x42:0 + x43:0 = -1 && x37:0 > 0 && x40:0 + x39:0 = -1 && x39:0 + -1 * x42:0 = 0 && x38:0 + -1 * x43:0 = 0 The following rules are bounded: f_227(x37:0, x38:0, x39:0) -> f_227(x37:0 + x38:0 + x39:0, x40:0, x41:0) :|: x45:0 + x46:0 = -1 && x47:0 > 0 && x37:0 + x38:0 >= 1 && x41:0 + x40:0 = -1 && x39:0 + -1 * x46:0 = 0 && x40:0 + -1 * x45:0 = 0 && x44:0 > 0 && x42:0 + x43:0 = -1 && x37:0 > 0 && x40:0 + x39:0 = -1 && x39:0 + -1 * x42:0 = 0 && x38:0 + -1 * x43:0 = 0 ---------------------------------------- (14) YES