4.68/2.04 YES 4.68/2.05 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 4.68/2.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.68/2.05 4.68/2.05 4.68/2.05 Termination of the given C Problem could be proven: 4.68/2.05 4.68/2.05 (0) C Problem 4.68/2.05 (1) CToIRSProof [EQUIVALENT, 0 ms] 4.68/2.05 (2) IntTRS 4.68/2.05 (3) TerminationGraphProcessor [SOUND, 41 ms] 4.68/2.05 (4) IntTRS 4.68/2.05 (5) IntTRSCompressionProof [EQUIVALENT, 32 ms] 4.68/2.05 (6) IntTRS 4.68/2.05 (7) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 4.68/2.05 (8) YES 4.68/2.05 4.68/2.05 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (0) 4.68/2.05 Obligation: 4.68/2.05 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (1) CToIRSProof (EQUIVALENT) 4.68/2.05 Parsed C Integer Program as IRS. 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (2) 4.68/2.05 Obligation: 4.68/2.05 Rules: 4.68/2.05 f1(x, y, z) -> f2(x_1, y, z) :|: TRUE 4.68/2.05 f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE 4.68/2.05 f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE 4.68/2.05 f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1 4.68/2.05 f6(x24, x25, x26) -> f7(x24, x25, x27) :|: TRUE && x27 = x26 + 1 4.68/2.05 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > x16 + x17 4.68/2.05 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 4.68/2.05 f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 <= x22 + x23 4.68/2.05 Start term: f1(x, y, z) 4.68/2.05 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (3) TerminationGraphProcessor (SOUND) 4.68/2.05 Constructed the termination graph and obtained one non-trivial SCC. 4.68/2.05 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (4) 4.68/2.05 Obligation: 4.68/2.05 Rules: 4.68/2.05 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > x16 + x17 4.68/2.05 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 4.68/2.05 f6(x24, x25, x26) -> f7(x24, x25, x27) :|: TRUE && x27 = x26 + 1 4.68/2.05 f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1 4.68/2.05 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (5) IntTRSCompressionProof (EQUIVALENT) 4.68/2.05 Compressed rules. 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (6) 4.68/2.05 Obligation: 4.68/2.05 Rules: 4.68/2.05 f6(x24:0, x25:0, x26:0) -> f6(x24:0, x25:0 + 1, x26:0 + 1) :|: x25:0 + (x26:0 + 1) < x24:0 4.68/2.05 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (7) PolynomialOrderProcessor (EQUIVALENT) 4.68/2.05 Found the following polynomial interpretation: 4.68/2.05 [f6(x, x1, x2)] = -1 + x - x1 - x2 4.68/2.05 4.68/2.05 The following rules are decreasing: 4.68/2.05 f6(x24:0, x25:0, x26:0) -> f6(x24:0, x25:0 + 1, x26:0 + 1) :|: x25:0 + (x26:0 + 1) < x24:0 4.68/2.05 The following rules are bounded: 4.68/2.05 f6(x24:0, x25:0, x26:0) -> f6(x24:0, x25:0 + 1, x26:0 + 1) :|: x25:0 + (x26:0 + 1) < x24:0 4.68/2.05 4.68/2.05 ---------------------------------------- 4.68/2.05 4.68/2.05 (8) 4.68/2.05 YES 4.87/2.09 EOF