/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, 180 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 1304 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 43 ms] (8) IntTRS (9) IRS2T2 [EQUIVALENT, 0 ms] (10) T2IntSys (11) T2 [EQUIVALENT, 1232 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 %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 = icmp sgt %6 0 br %7, %8, %17 8: %9 = load %x %10 = load %y %11 = add %9 %10 store %11, %x %12 = load %y %13 = load %z %14 = add %12 %13 store %14, %y %15 = load %z %16 = add %15 -1 store %16, %z br %5 17: 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_159(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) -> f_160(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) :|: 0 < v62 f_160(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) -> f_162(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 f_162(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) -> f_164(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) :|: TRUE f_164(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) -> f_166(v52, v53, v54, v55, v56, v57, v58, v62, 1, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 f_166(v52, v53, v54, v55, v56, v57, v58, v62, 1, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) -> f_167(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v61, v63, v65, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 f_167(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v61, v63, v65, v66, v67, v68, v69, 0, 3, 4) -> f_168(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v61, v63, v65, v66, v67, v68, v69, 0, 3, 4) :|: v71 = v62 + v64 f_168(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v61, v63, v65, v66, v67, v68, v69, 0, 3, 4) -> f_169(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v61, v63, v65, v66, v67, v68, v69, 0, 3, 4) :|: TRUE f_169(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v61, v63, v65, v66, v67, v68, v69, 0, 3, 4) -> f_170(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v63, v65, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 f_170(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v63, v65, v66, v67, v68, v69, 0, 3, 4) -> f_171(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v63, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 f_171(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v63, v66, v67, v68, v69, 0, 3, 4) -> f_172(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v63, v66, v67, v68, v69, 0, 3, 4) :|: v73 = v64 + v65 f_172(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v63, v66, v67, v68, v69, 0, 3, 4) -> f_173(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v63, v66, v67, v68, v69, 0, 3, 4) :|: TRUE f_173(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v63, v66, v67, v68, v69, 0, 3, 4) -> f_174(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 f_174(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v66, v67, v68, v69, 0, 3, 4) -> f_175(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) :|: 1 + v75 = v65 f_175(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) -> f_176(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) :|: TRUE f_176(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) -> f_177(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) :|: TRUE f_177(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) -> f_158(v52, v53, v54, v55, v56, v57, v58, v62, 1, v64, v71, v65, v73, v75, v66, v67, v68, v69, 0, 3, 4) :|: TRUE f_158(v52, v53, v54, v55, v56, v57, v58, v59, 1, v61, v62, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) -> f_159(v52, v53, v54, v55, v56, v57, v58, v62, 1, v59, v61, v63, v64, v65, v66, v67, v68, v69, 0, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_159(v52:0, v53:0, v54:0, v55:0, v56:0, v57:0, v58:0, v62:0, 1, v59:0, v61:0, v63:0, v64:0, 1 + v75:0, v66:0, v67:0, v68:0, v69:0, 0, 3, 4) -> f_159(v52:0, v53:0, v54:0, v55:0, v56:0, v57:0, v58:0, v62:0 + v64:0, 1, v62:0, v64:0, 1 + v75:0, v64:0 + (1 + v75:0), v75:0, v66:0, v67:0, v68:0, v69:0, 0, 3, 4) :|: v62:0 > 0 Filtered unneeded arguments: f_159(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_159(x8, x13, x14) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_159(v62:0, v64:0, sum~cons_1~v75:0) -> f_159(v62:0 + v64:0, v64:0 + (1 + v75:0), v75:0) :|: v62:0 > 0 && sum~cons_1~v75:0 = 1 + v75:0 ---------------------------------------- (8) Obligation: Rules: f_159(v62:0, v64:0, sum~cons_1~v75:0) -> f_159(v62:0 + v64:0, v64:0 + (1 + v75:0), v75:0) :|: v62:0 > 0 && sum~cons_1~v75:0 = 1 + v75:0 ---------------------------------------- (9) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f_159_3,1) ---------------------------------------- (10) Obligation: START: 0; FROM: 0; TO: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := oldX2 - 1; assume(oldX0 > 0 && oldX2 = 1 + oldX3); x0 := oldX0 + oldX1; x1 := oldX1 + (1 + oldX3); x2 := oldX2 - 1; TO: 1; ---------------------------------------- (11) T2 (EQUIVALENT) No proof given by T2 ---------------------------------------- (12) YES