/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, 177 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 2906 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) AND (7) LLVM Symbolic Execution SCC (8) SCC2IRS [SOUND, 81 ms] (9) IntTRS (10) IRS2T2 [EQUIVALENT, 0 ms] (11) T2IntSys (12) T2 [EQUIVALENT, 803 ms] (13) YES (14) LLVM Symbolic Execution SCC (15) SCC2IRS [SOUND, 71 ms] (16) IntTRS (17) IntTRSCompressionProof [EQUIVALENT, 0 ms] (18) IntTRS (19) RankingReductionPairProof [EQUIVALENT, 23 ms] (20) 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: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %2 = alloca i32, align 4 %c = alloca i32, align 4 store %x, %1 store %y, %2 store 0, %c br %3 3: %4 = load %1 %5 = icmp sgt %4 0 br %5, %6, %19 6: store 0, %2 br %7 7: %8 = load %2 %9 = load %1 %10 = icmp slt %8 %9 br %10, %11, %16 11: %12 = load %2 %13 = add %12 1 store %13, %2 %14 = load %c %15 = add %14 1 store %15, %c br %7 16: %17 = load %1 %18 = sub %17 1 store %18, %1 br %3 19: %20 = load %c ret %20 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() %3 = call i32 @__VERIFIER_nondet_int() %4 = call i32 @test_fun(i32 %2, i32 %3) ret %4 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 2 SCCs. ---------------------------------------- (6) Complex Obligation (AND) ---------------------------------------- (7) Obligation: SCC ---------------------------------------- (8) SCC2IRS (SOUND) Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: Generated rules. Obtained 32 rulesP rules: f_403(v483, v484, v485, v486, v487, v488, 1, v490, v492, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_404(v483, v484, v485, v486, v487, v488, 1, v490, v502, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: v502 = 1 + v490 && 1 <= v502 f_404(v483, v484, v485, v486, v487, v488, 1, v490, v502, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_405(v483, v484, v485, v486, v487, v488, 1, v490, v502, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: TRUE f_405(v483, v484, v485, v486, v487, v488, 1, v490, v502, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_406(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: 0 = 0 f_406(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_407(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: v504 = 1 + v494 && 3 <= v504 f_407(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_408(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: TRUE f_408(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_409(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: TRUE f_409(v483, v484, v485, v486, v487, v488, 1, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_410(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: 0 = 0 f_410(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_411(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: 0 = 0 f_411(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_412(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: v502 < v488 && 2 <= v488 && 3 <= v495 && 3 <= v483 f_411(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_413(v483, v484, v485, v486, v487, v502, 1, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: v488 <= v502 && v488 = v502 f_412(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_414(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: 0 = 0 f_414(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_416(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: TRUE f_416(v483, v484, v485, v486, v487, v488, 1, v502, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_402(v483, v484, v485, v486, v487, v488, 1, v502, v490, v502, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: TRUE f_402(v483, v484, v485, v486, v487, v488, 1, v490, v491, v492, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_403(v483, v484, v485, v486, v487, v488, 1, v490, v492, v493, v494, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) :|: 0 = 0 f_413(v483, v484, v485, v486, v487, v502, 1, v490, v494, v504, v495, v496, v497, v498, v499, v500, 0, 3, 2, 4) -> f_415(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v495, v496, v497, v498, v499, v500, 3, 2, 4) :|: 0 = 0 f_415(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v495, v496, v497, v498, v499, v500, 3, 2, 4) -> f_417(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v495, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_417(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v495, v496, v497, v498, v499, v500, 3, 2, 4) -> f_418(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: 0 = 0 f_418(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_419(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: 1 + v490 = v502 f_419(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_420(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_420(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_421(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_421(v483, v484, v485, v486, v487, v502, 1, 0, v490, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_422(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: 0 = 0 f_422(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_423(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: 0 < v490 && 2 <= v502 && 3 <= v483 f_423(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_425(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: 0 = 0 f_425(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_427(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_427(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_429(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_429(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_431(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_431(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) -> f_432(v483, v484, v485, v486, v487, v490, 1, v502, 0, v494, v504, v496, v497, v498, v499, v500, 3, 2, 4) :|: TRUE f_432(v586, v587, v588, v589, v590, v591, 1, v593, 0, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) -> f_434(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) :|: 0 = 0 f_434(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) -> f_435(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) :|: 0 = 0 f_435(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) -> f_436(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) :|: 0 = 0 f_436(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) -> f_437(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) :|: TRUE f_437(v586, v587, v588, v589, v590, v591, 1, 0, v593, v595, v596, v597, v598, v599, v600, v601, 3, 2, 4) -> f_402(v586, v587, v588, v589, v590, v591, 1, 0, v591, v593, v595, v596, v593, v597, v598, v599, v600, v601, 0, 3, 2, 4) :|: TRUE Combined rules. Obtained 2 rulesP rules: f_403(v483:0, v484:0, v485:0, v486:0, v487:0, 1 + v490:0, 1, v490:0, v492:0, v493:0, v494:0, v495:0, v496:0, v497:0, v498:0, v499:0, v500:0, 0, 3, 2, 4) -> f_403(v483:0, v484:0, v485:0, v486:0, v487:0, v490:0, 1, 0, 1 + v490:0, v494:0, 1 + v494:0, 1 + v490:0, v496:0, v497:0, v498:0, v499:0, v500:0, 0, 3, 2, 4) :|: v490:0 > 0 && v494:0 > 1 && v483:0 > 2 f_403(v483:0, v484:0, v485:0, v486:0, v487:0, v488:0, 1, v490:0, v492:0, v493:0, v494:0, v495:0, v496:0, v497:0, v498:0, v499:0, v500:0, 0, 3, 2, 4) -> f_403(v483:0, v484:0, v485:0, v486:0, v487:0, v488:0, 1, 1 + v490:0, 1 + v490:0, v494:0, 1 + v494:0, v495:0, v496:0, v497:0, v498:0, v499:0, v500:0, 0, 3, 2, 4) :|: v490:0 > -1 && v494:0 > 1 && v488:0 > 1 && v488:0 > 1 + v490:0 && v483:0 > 2 && v495:0 > 2 Filtered unneeded arguments: f_403(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_403(x1, x6, x8, x11, x12) Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules: f_403(v483:0, sum~cons_1~v490:0, v490:0, v494:0, v495:0) -> f_403(v483:0, v490:0, 0, 1 + v494:0, 1 + v490:0) :|: v494:0 > 1 && v483:0 > 2 && v490:0 > 0 && sum~cons_1~v490:0 = 1 + v490:0 f_403(v483:0, v488:0, v490:0, v494:0, v495:0) -> f_403(v483:0, v488:0, 1 + v490:0, 1 + v494:0, v495:0) :|: v494:0 > 1 && v490:0 > -1 && v488:0 > 1 && v488:0 > 1 + v490:0 && v495:0 > 2 && v483:0 > 2 ---------------------------------------- (9) Obligation: Rules: f_403(v483:0, sum~cons_1~v490:0, v490:0, v494:0, v495:0) -> f_403(v483:0, v490:0, 0, 1 + v494:0, 1 + v490:0) :|: v494:0 > 1 && v483:0 > 2 && v490:0 > 0 && sum~cons_1~v490:0 = 1 + v490:0 f_403(x, x1, x2, x3, x4) -> f_403(x, x1, 1 + x2, 1 + x3, x4) :|: x3 > 1 && x2 > -1 && x1 > 1 && x1 > 1 + x2 && x4 > 2 && x > 2 ---------------------------------------- (10) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f_403_5,1) ---------------------------------------- (11) Obligation: START: 0; FROM: 0; TO: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; oldX4 := x4; assume(oldX3 > 1 && oldX0 > 2 && oldX2 > 0 && oldX1 = 1 + oldX2); x0 := oldX0; x1 := oldX2; x2 := 0; x3 := 1 + oldX3; x4 := 1 + oldX2; TO: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; oldX4 := x4; assume(oldX3 > 1 && oldX2 > -1 && oldX1 > 1 && oldX1 > 1 + oldX2 && oldX4 > 2 && oldX0 > 2); x0 := oldX0; x1 := oldX1; x2 := 1 + oldX2; x3 := 1 + oldX3; x4 := oldX4; TO: 1; ---------------------------------------- (12) T2 (EQUIVALENT) Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 1, 4, 5 using the following rank functions: - Rank function 1: RF for loc. 5: 2*x1 RF for loc. 6: 2*x1 Bound for (chained) transitions 4: 4 - Rank function 2: RF for loc. 5: 2*x1-2*x2 RF for loc. 6: -1+2*x1-2*x2 Bound for (chained) transitions 5: 3 - Rank function 3: RF for loc. 5: 1 RF for loc. 6: 0 Bound for (chained) transitions 1: 1 ---------------------------------------- (13) YES ---------------------------------------- (14) Obligation: SCC ---------------------------------------- (15) SCC2IRS (SOUND) Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: Generated rules. Obtained 13 rulesP rules: f_258(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 4) -> f_259(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 4) :|: 0 = 0 f_259(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 4) -> f_260(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: v92 < v85 && 2 <= v85 f_260(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_262(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: 0 = 0 f_262(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_264(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: TRUE f_264(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_266(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: 0 = 0 f_266(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_268(v85, v86, v87, v88, v89, 1, v92, v99, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: v99 = 1 + v92 && 2 <= v99 f_268(v85, v86, v87, v88, v89, 1, v92, v99, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_270(v85, v86, v87, v88, v89, 1, v92, v99, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: TRUE f_270(v85, v86, v87, v88, v89, 1, v92, v99, v91, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_272(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: 0 = 0 f_272(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_274(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: v99 = 1 + v92 f_274(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_276(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: TRUE f_276(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_279(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) :|: TRUE f_279(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 2, 4) -> f_257(v85, v86, v87, v88, v89, 1, v92, v99, v93, v94, v95, v96, v97, 0, 3, 4) :|: TRUE f_257(v85, v86, v87, v88, v89, 1, v91, v92, v93, v94, v95, v96, v97, 0, 3, 4) -> f_258(v85, v86, v87, v88, v89, 1, v92, v91, v93, v94, v95, v96, v97, 0, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_258(v85:0, v86:0, v87:0, v88:0, v89:0, 1, v92:0, v91:0, v93:0, v94:0, v95:0, v96:0, v97:0, 0, 3, 4) -> f_258(v85:0, v86:0, v87:0, v88:0, v89:0, 1, 1 + v92:0, v92:0, v93:0, v94:0, v95:0, v96:0, v97:0, 0, 3, 4) :|: v85:0 > 1 && v92:0 > 0 && v92:0 < v85:0 Filtered unneeded arguments: f_258(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_258(x1, x7) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_258(v85:0, v92:0) -> f_258(v85:0, 1 + v92:0) :|: v92:0 > 0 && v92:0 < v85:0 && v85:0 > 1 ---------------------------------------- (16) Obligation: Rules: f_258(v85:0, v92:0) -> f_258(v85:0, 1 + v92:0) :|: v92:0 > 0 && v92:0 < v85:0 && v85:0 > 1 ---------------------------------------- (17) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (18) Obligation: Rules: f_258(v85:0:0, v92:0:0) -> f_258(v85:0:0, 1 + v92:0:0) :|: v92:0:0 > 0 && v92:0:0 < v85:0:0 && v85:0:0 > 1 ---------------------------------------- (19) RankingReductionPairProof (EQUIVALENT) Interpretation: [ f_258 ] = -1*f_258_2 + f_258_1 The following rules are decreasing: f_258(v85:0:0, v92:0:0) -> f_258(v85:0:0, 1 + v92:0:0) :|: v92:0:0 > 0 && v92:0:0 < v85:0:0 && v85:0:0 > 1 The following rules are bounded: f_258(v85:0:0, v92:0:0) -> f_258(v85:0:0, 1 + v92:0:0) :|: v92:0:0 > 0 && v92:0:0 < v85:0:0 && v85:0:0 > 1 ---------------------------------------- (20) YES