/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, 8977 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 106 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 18 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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %i = alloca *i32, align 8 %j = alloca *i32, align 8 store 0, %1 %2 = alloca i8, numElementsLit: 4 %3 = bitcast *i8 %2 to *i32 store %3, %i %4 = alloca i8, numElementsLit: 4 %5 = bitcast *i8 %4 to *i32 store %5, %j %6 = load %j store 1, %6 %7 = load %i store 10000, %7 br %8 8: %9 = load %i %10 = load %9 %11 = load %j %12 = load %11 %13 = sub %10 %12 %14 = icmp sge %13 1 br %14, %15, %23 15: %16 = load %j %17 = load %16 %18 = add %17 1 store %18, %16 br %19 19: %20 = load %i %21 = load %20 %22 = add %21 -1 store %22, %20 br %8 23: %24 = load %1 ret %24 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 19 rulesP rules: f_260(v123, v124, v125, v126, v127, v128, v129, v130, 1, v132, v133, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) -> f_261(v123, v124, v125, v126, v127, v133, v129, v130, 1, v132, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) :|: 0 = 0 f_261(v123, v124, v125, v126, v127, v133, v129, v130, 1, v132, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) -> f_262(v123, v124, v125, v126, v127, v133, v129, v130, 1, v132, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) :|: 0 = 0 f_262(v123, v124, v125, v126, v127, v133, v129, v130, 1, v132, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) -> f_263(v123, v124, v125, v126, v127, v133, v132, v130, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) :|: 0 = 0 f_263(v123, v124, v125, v126, v127, v133, v132, v130, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) -> f_264(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8, 9997) :|: v140 + v132 = v133 && 0 <= 9999 + v140 && v140 <= 9997 f_264(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8, 9997) -> f_265(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) :|: 1 <= v140 && v132 <= 9998 && 3 <= v133 && v129 <= 9997 && 4 <= v128 f_265(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) -> f_267(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) :|: 0 = 0 f_267(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) -> f_269(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) :|: TRUE f_269(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) -> f_271(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) :|: 0 = 0 f_271(v123, v124, v125, v126, v127, v133, v132, v140, 1, v129, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 9997, 2, 9998, 9999, 8) -> f_273(v123, v124, v125, v126, v127, v133, v132, v140, 1, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) :|: 0 = 0 f_273(v123, v124, v125, v126, v127, v133, v132, v140, 1, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) -> f_274(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) :|: v141 = 1 + v132 && 3 <= v141 && v141 <= 9999 f_274(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) -> f_275(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) :|: TRUE f_275(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) -> f_276(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) :|: TRUE f_276(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) -> f_277(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) :|: 0 = 0 f_277(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v128, v134, v135, v136, v137, v138, 0, 3, 7, 4, 10000, 2, 9998, 9999, 8, 9997) -> f_278(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) :|: 0 = 0 f_278(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) -> f_279(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) :|: 1 + v143 = v133 && 2 <= v143 && v143 <= 9998 f_279(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) -> f_280(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) :|: TRUE f_280(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) -> f_281(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) :|: TRUE f_281(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 9998, 9999, 4, 8, 9997) -> f_259(v123, v124, v125, v126, v127, v133, v132, v140, 1, v141, v143, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) :|: TRUE f_259(v123, v124, v125, v126, v127, v128, v129, v130, 1, v132, v133, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) -> f_260(v123, v124, v125, v126, v127, v128, v129, v130, 1, v132, v133, v134, v135, v136, v137, v138, 0, 3, 7, 2, 10000, 9999, 4, 8) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_260(v123:0, v124:0, v125:0, v126:0, v127:0, v128:0, v129:0, v130:0, 1, v132:0, 1 + v143:0, v134:0, v135:0, v136:0, v137:0, v138:0, 0, 3, 7, 2, 10000, 9999, 4, 8) -> f_260(v123:0, v124:0, v125:0, v126:0, v127:0, 1 + v143:0, v132:0, v140:0, 1, 1 + v132:0, v143:0, v134:0, v135:0, v136:0, v137:0, v138:0, 0, 3, 7, 2, 10000, 9999, 4, 8) :|: v140:0 > 0 && v132:0 < 9999 && v143:0 > 1 && v140:0 + v132:0 = 1 + v143:0 && v129:0 < 9998 && v140:0 < 9998 && v128:0 > 3 && v132:0 > 1 && v143:0 < 9999 Filtered unneeded arguments: f_260(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24) -> f_260(x6, x7, x10, x11) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_260(v128:0, v129:0, v132:0, sum~cons_1~v143:0) -> f_260(1 + v143:0, v132:0, 1 + v132:0, v143:0) :|: v143:0 > 1 && v132:0 < 9999 && v129:0 < 9998 && v128:0 > 3 && v143:0 < 9999 && v132:0 > 1 && sum~cons_1~v143:0 = 1 + v143:0 ---------------------------------------- (8) Obligation: Rules: f_260(v128:0, v129:0, v132:0, sum~cons_1~v143:0) -> f_260(1 + v143:0, v132:0, 1 + v132:0, v143:0) :|: v143:0 > 1 && v132:0 < 9999 && v129:0 < 9998 && v128:0 > 3 && v143:0 < 9999 && v132:0 > 1 && sum~cons_1~v143:0 = 1 + v143:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_260(v128:0:0, v129:0:0, v132:0:0, sum~cons_1~v143:0:0) -> f_260(1 + v143:0:0, v132:0:0, 1 + v132:0:0, v143:0:0) :|: v143:0:0 < 9999 && v132:0:0 > 1 && v128:0:0 > 3 && v129:0:0 < 9998 && v132:0:0 < 9999 && v143:0:0 > 1 && sum~cons_1~v143:0:0 = 1 + v143:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_260(x, x1, x2, x3)] = x3 The following rules are decreasing: f_260(v128:0:0, v129:0:0, v132:0:0, sum~cons_1~v143:0:0) -> f_260(1 + v143:0:0, v132:0:0, 1 + v132:0:0, v143:0:0) :|: v143:0:0 < 9999 && v132:0:0 > 1 && v128:0:0 > 3 && v129:0:0 < 9998 && v132:0:0 < 9999 && v143:0:0 > 1 && sum~cons_1~v143:0:0 = 1 + v143:0:0 The following rules are bounded: f_260(v128:0:0, v129:0:0, v132:0:0, sum~cons_1~v143:0:0) -> f_260(1 + v143:0:0, v132:0:0, 1 + v132:0:0, v143:0:0) :|: v143:0:0 < 9999 && v132:0:0 > 1 && v128:0:0 > 3 && v129:0:0 < 9998 && v132:0:0 < 9999 && v143:0:0 > 1 && sum~cons_1~v143:0:0 = 1 + v143:0:0 ---------------------------------------- (12) YES