21.99/10.52 NO 21.99/10.53 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 21.99/10.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 21.99/10.53 21.99/10.53 21.99/10.53 Termination of the given C Problem could be disproven: 21.99/10.53 21.99/10.53 (0) C Problem 21.99/10.53 (1) CToLLVMProof [EQUIVALENT, 171 ms] 21.99/10.53 (2) LLVM problem 21.99/10.53 (3) LLVMToTerminationGraphProof [EQUIVALENT, 687 ms] 21.99/10.53 (4) LLVM Symbolic Execution Graph 21.99/10.53 (5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms] 21.99/10.53 (6) LLVM Symbolic Execution Lasso 21.99/10.53 (7) Lasso2IRS [EQUIVALENT, 115 ms] 21.99/10.53 (8) IntTRS 21.99/10.53 (9) IRS2T2 [EQUIVALENT, 0 ms] 21.99/10.53 (10) T2IntSys 21.99/10.53 (11) T2 [COMPLETE, 5282 ms] 21.99/10.53 (12) NO 21.99/10.53 21.99/10.53 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (0) 21.99/10.53 Obligation: 21.99/10.53 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (1) CToLLVMProof (EQUIVALENT) 21.99/10.53 Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (2) 21.99/10.53 Obligation: 21.99/10.53 LLVM Problem 21.99/10.53 21.99/10.53 Aliases: 21.99/10.53 21.99/10.53 Data layout: 21.99/10.53 21.99/10.53 "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" 21.99/10.53 21.99/10.53 Machine: 21.99/10.53 21.99/10.53 "x86_64-pc-linux-gnu" 21.99/10.53 21.99/10.53 Type definitions: 21.99/10.53 21.99/10.53 Global variables: 21.99/10.53 21.99/10.53 Function declarations and definitions: 21.99/10.53 21.99/10.53 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc 21.99/10.53 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 21.99/10.53 0: 21.99/10.53 %1 = alloca i32, align 4 21.99/10.53 %x = alloca i32, align 4 21.99/10.53 %y = alloca i32, align 4 21.99/10.53 store 0, %1 21.99/10.53 %2 = call i32 (...)* @__VERIFIER_nondet_int() 21.99/10.53 store %2, %x 21.99/10.53 %3 = call i32 (...)* @__VERIFIER_nondet_int() 21.99/10.53 store %3, %y 21.99/10.53 br %4 21.99/10.53 4: 21.99/10.53 %5 = load %x 21.99/10.53 %6 = load %y 21.99/10.53 %7 = icmp slt %5 %6 21.99/10.53 br %7, %8, %14 21.99/10.53 8: 21.99/10.53 %9 = load %x 21.99/10.53 %10 = load %y 21.99/10.53 %11 = add %9 %10 21.99/10.53 store %11, %x 21.99/10.53 %12 = load %y 21.99/10.53 %13 = sdiv %12 2 21.99/10.53 store %13, %y 21.99/10.53 br %4 21.99/10.53 14: 21.99/10.53 ret 0 21.99/10.53 21.99/10.53 21.99/10.53 Analyze Termination of all function calls matching the pattern: 21.99/10.53 main() 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (3) LLVMToTerminationGraphProof (EQUIVALENT) 21.99/10.53 Constructed symbolic execution graph for LLVM program and proved memory safety. 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (4) 21.99/10.53 Obligation: 21.99/10.53 SE Graph 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (5) SymbolicExecutionGraphToLassoProof (EQUIVALENT) 21.99/10.53 Converted SEGraph to 1 independent lasso. 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (6) 21.99/10.53 Obligation: 21.99/10.53 Lasso 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (7) Lasso2IRS (EQUIVALENT) 21.99/10.53 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 21.99/10.53 Generated rules. Obtained 37 rulesP rules: 21.99/10.53 f_112(v19, v20, v21, v22, v23, v27, v25, 1, v24, v28, v29, v30, v31, 0, 3, 2, 4) -> f_113(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) :|: 0 = 0 21.99/10.53 f_113(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) -> f_114(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) :|: v27 < v28 21.99/10.53 f_114(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) -> f_116(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) :|: 0 = 0 21.99/10.53 f_116(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) -> f_118(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_118(v19, v20, v21, v22, v23, v27, v28, 1, v24, v25, v29, v30, v31, 0, 3, 2, 4) -> f_120(v19, v20, v21, v22, v23, v27, v28, 1, v25, v29, v30, v31, 0, 3, 2, 4) :|: 0 = 0 21.99/10.53 f_120(v19, v20, v21, v22, v23, v27, v28, 1, v25, v29, v30, v31, 0, 3, 2, 4) -> f_121(v19, v20, v21, v22, v23, v27, v28, 1, v25, v29, v30, v31, 0, 3, 2, 4) :|: 0 = 0 21.99/10.53 f_121(v19, v20, v21, v22, v23, v27, v28, 1, v25, v29, v30, v31, 0, 3, 2, 4) -> f_122(v19, v20, v21, v22, v23, v27, v28, 1, v33, v25, v29, v30, v31, 0, 3, 2, 4) :|: v33 = v27 + v28 21.99/10.53 f_122(v19, v20, v21, v22, v23, v27, v28, 1, v33, v25, v29, v30, v31, 0, 3, 2, 4) -> f_123(v19, v20, v21, v22, v23, v27, v28, 1, v33, v25, v29, v30, v31, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_123(v19, v20, v21, v22, v23, v27, v28, 1, v33, v25, v29, v30, v31, 0, 3, 2, 4) -> f_124(v19, v20, v21, v22, v23, v27, v28, 1, v33, v29, v30, v31, 0, 3, 4) :|: 0 = 0 21.99/10.53 f_124(v19, v20, v21, v22, v23, v27, v28, 1, v33, v29, v30, v31, 0, 3, 4) -> f_125(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) :|: v35 = v28 / 2 21.99/10.53 f_125(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) -> f_126(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_126(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) -> f_127(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_127(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) -> f_111(v19, v20, v21, v22, v23, v27, v28, 1, v33, v35, v29, v30, v31, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_111(v19, v20, v21, v22, v23, v24, v25, 1, v27, v28, v29, v30, v31, 0, 3, 2, 4) -> f_112(v19, v20, v21, v22, v23, v27, v25, 1, v24, v28, v29, v30, v31, 0, 3, 2, 4) :|: 0 = 0 21.99/10.53 f_69 -> f_70(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2 21.99/10.53 f_70(v1, v2, 3, 1, 4) -> f_71(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4 21.99/10.53 f_71(v1, v3, v2, v4, 3, 1, 4) -> f_72(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6 21.99/10.53 f_72(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_73(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 21.99/10.53 f_73(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_74(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 21.99/10.53 f_74(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_75(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 21.99/10.53 f_75(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_76(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 21.99/10.53 f_76(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_77(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 21.99/10.53 f_77(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_78(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 21.99/10.53 f_78(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_79(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0 21.99/10.53 f_79(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_80(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0 21.99/10.53 f_80(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_81(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: v7 < v9 21.99/10.53 f_81(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_83(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0 21.99/10.53 f_83(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_85(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: TRUE 21.99/10.53 f_85(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_87(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0 21.99/10.53 f_87(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_88(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0 21.99/10.53 f_88(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_89(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: v11 = v7 + v9 21.99/10.53 f_89(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_90(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: TRUE 21.99/10.53 f_90(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_91(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: 0 = 0 21.99/10.53 f_91(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_92(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) :|: v13 = v9 / 2 21.99/10.53 f_92(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) -> f_93(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_93(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) -> f_94(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) :|: TRUE 21.99/10.53 f_94(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) -> f_111(v1, v3, v5, v7, v9, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 2, 4) :|: TRUE 21.99/10.53 Combined rules. Obtained 2 rulesP rules: 21.99/10.53 f_112(v19:0, v20:0, v21:0, v22:0, v23:0, v27:0, v25:0, 1, v24:0, v28:0, v29:0, v30:0, v31:0, 0, 3, 2, 4) -> f_112(v19:0, v20:0, v21:0, v22:0, v23:0, v27:0 + v28:0, v28:0, 1, v27:0, v35:0, v29:0, v30:0, v31:0, 0, 3, 2, 4) :|: v35:0 = v28:0 / 2 && v28:0 > v27:0 21.99/10.53 f_69 -> f_112(v1:0, v3:0, v5:0, v7:0, v9:0, v7:0 + v9:0, v9:0, 1, v7:0, v13:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 0, 3, 2, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v9:0 / 2 = v13:0 && v9:0 > v7:0 21.99/10.53 Filtered unneeded arguments: 21.99/10.53 f_112(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_112(x6, x10) 21.99/10.53 Removed division, modulo operations, cleaned up constraints. Obtained 6 rules.P rules: 21.99/10.53 f_112(v27:0, v28:0) -> f_112'(v27:0, v28:0) :|: v28:0 > v27:0 21.99/10.53 f_112'(v27:0, v28:0) -> f_112(v27:0 + v28:0, div) :|: v28:0 < 0 && v28:0 > v27:0 && v28:0 - 2 * div <= 0 && v28:0 - 2 * div > -2 21.99/10.53 f_112'(v27:0, v28:0) -> f_112(v27:0 + v28:0, div) :|: v28:0 > -1 && v28:0 > v27:0 && v28:0 - 2 * div < 2 && v28:0 - 2 * div >= 0 21.99/10.53 f_69 -> f_69' :|: TRUE 21.99/10.53 f_69' -> f_112(v7:0 + v9:0, div) :|: v9:0 < 0 && v9:0 > v7:0 && v9:0 - 2 * div <= 0 && v9:0 - 2 * div > -2 21.99/10.53 f_69' -> f_112(v7:0 + v9:0, div) :|: v9:0 > -1 && v9:0 > v7:0 && v9:0 - 2 * div < 2 && v9:0 - 2 * div >= 0 21.99/10.53 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (8) 21.99/10.53 Obligation: 21.99/10.53 Rules: 21.99/10.53 f_112(v27:0, v28:0) -> f_112'(v27:0, v28:0) :|: v28:0 > v27:0 21.99/10.53 f_112'(x, x1) -> f_112(x + x1, x2) :|: x1 < 0 && x1 > x && x1 - 2 * x2 <= 0 && x1 - 2 * x2 > -2 21.99/10.53 f_112'(x3, x4) -> f_112(x3 + x4, x5) :|: x4 > -1 && x4 > x3 && x4 - 2 * x5 < 2 && x4 - 2 * x5 >= 0 21.99/10.53 f_69 -> f_69' :|: TRUE 21.99/10.53 f_69' -> f_112(x6 + x7, x8) :|: x7 < 0 && x7 > x6 && x7 - 2 * x8 <= 0 && x7 - 2 * x8 > -2 21.99/10.53 f_69' -> f_112(x9 + x10, x11) :|: x10 > -1 && x10 > x9 && x10 - 2 * x11 < 2 && x10 - 2 * x11 >= 0 21.99/10.53 Start term: f_69 21.99/10.53 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (9) IRS2T2 (EQUIVALENT) 21.99/10.53 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 21.99/10.53 21.99/10.53 (f_112_2,1) 21.99/10.53 (f_112'_2,2) 21.99/10.53 (f_69_2,3) 21.99/10.53 (f_69'_2,4) 21.99/10.53 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (10) 21.99/10.53 Obligation: 21.99/10.53 START: 3; 21.99/10.53 21.99/10.53 FROM: 1; 21.99/10.53 oldX0 := x0; 21.99/10.53 oldX1 := x1; 21.99/10.53 assume(oldX1 > oldX0); 21.99/10.53 x0 := oldX0; 21.99/10.53 x1 := oldX1; 21.99/10.53 TO: 2; 21.99/10.53 21.99/10.53 FROM: 2; 21.99/10.53 oldX0 := x0; 21.99/10.53 oldX1 := x1; 21.99/10.53 oldX2 := nondet(); 21.99/10.53 assume(oldX1 < 0 && oldX1 > oldX0 && oldX1 - 2 * oldX2 <= 0 && oldX1 - 2 * oldX2 > -2); 21.99/10.53 x0 := oldX0 + oldX1; 21.99/10.53 x1 := oldX2; 21.99/10.53 TO: 1; 21.99/10.53 21.99/10.53 FROM: 2; 21.99/10.53 oldX0 := x0; 21.99/10.53 oldX1 := x1; 21.99/10.53 oldX2 := nondet(); 21.99/10.53 assume(oldX1 > -1 && oldX1 > oldX0 && oldX1 - 2 * oldX2 < 2 && oldX1 - 2 * oldX2 >= 0); 21.99/10.53 x0 := oldX0 + oldX1; 21.99/10.53 x1 := oldX2; 21.99/10.53 TO: 1; 21.99/10.53 21.99/10.53 FROM: 3; 21.99/10.53 oldX0 := x0; 21.99/10.53 oldX1 := x1; 21.99/10.53 oldX2 := nondet(); 21.99/10.53 oldX3 := nondet(); 21.99/10.53 assume(0 = 0); 21.99/10.53 x0 := oldX2; 21.99/10.53 x1 := oldX3; 21.99/10.53 TO: 4; 21.99/10.53 21.99/10.53 FROM: 4; 21.99/10.53 oldX0 := x0; 21.99/10.53 oldX1 := x1; 21.99/10.53 oldX2 := nondet(); 21.99/10.53 oldX3 := nondet(); 21.99/10.53 oldX4 := nondet(); 21.99/10.53 assume(oldX3 < 0 && oldX3 > oldX2 && oldX3 - 2 * oldX4 <= 0 && oldX3 - 2 * oldX4 > -2); 21.99/10.53 x0 := oldX2 + oldX3; 21.99/10.53 x1 := oldX4; 21.99/10.53 TO: 1; 21.99/10.53 21.99/10.53 FROM: 4; 21.99/10.53 oldX0 := x0; 21.99/10.53 oldX1 := x1; 21.99/10.53 oldX2 := nondet(); 21.99/10.53 oldX3 := nondet(); 21.99/10.53 oldX4 := nondet(); 21.99/10.53 assume(oldX3 > -1 && oldX3 > oldX2 && oldX3 - 2 * oldX4 < 2 && oldX3 - 2 * oldX4 >= 0); 21.99/10.53 x0 := oldX2 + oldX3; 21.99/10.53 x1 := oldX4; 21.99/10.53 TO: 1; 21.99/10.53 21.99/10.53 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (11) T2 (COMPLETE) 21.99/10.53 Found this recurrent set for cutpoint 7: oldX2 == 0 and oldX3 == 0 and oldX4 == 0 and x0 == -1 and x1 == 0 21.99/10.53 21.99/10.53 ---------------------------------------- 21.99/10.53 21.99/10.53 (12) 21.99/10.53 NO 22.06/10.55 EOF