{"abstract":"Falling platforms become reachable from absurd distances.","category":"Procedural level generation constraints","checks":8,"contract":"platforms [x1, x2, y] (y grows upward); the player starts on platform 0. From A the player reaches B when rise = yB-yA <= jump_h (any drop is allowed) and the horizontal gap max(0, xB1-xA2, xA1-xB2) <= jump_d - max(0, rise)//2. Reachability is transitive. Returns sorted reachable indices.","evaluation_group":"w2-procedural-level-generation-constraints-platform-jumps","failed_approach":"Penalising drops as well as climbs removes legal drop routes.","family":"w2-procedural-level-generation-constraints-platform-jumps-climb-penalty","id":"FA-86466","implementations":{"attempt":{"sha256":"9cd0f77a2e2874f4d13bbf496cd5258f1d126cfd8bb61c697b9edb417b5ab1e9","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(platforms, jump_h, jump_d):\n    n = len(platforms)\n    seen = {0}\n    queue = [0]\n    while queue:\n        a = queue.pop(0)\n        ax1, ax2, ay = platforms[a]\n        for b in range(n):\n            if b in seen:\n                continue\n            bx1, bx2, by = platforms[b]\n            rise = by - ay\n            if rise > jump_h:\n                continue\n            gap = max(0, bx1 - ax2, ax1 - bx2)\n            reach = jump_d - abs(rise) // 2\n            if gap <= reach:\n                seen.add(b)\n                queue.append(b)\n    return sorted(seen)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncases = [[('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('regression climb penalty #1',\n   [[[23, 25, 6], [15, 16, 2], [21, 21, 7], [27, 33, 3], [2, 8, 3]], 2, 2],\n   [0, 2, 3]),\n  ('fault site climb penalty #1', [[[20, 24, 10], [6, 8, 1], [30, 30, 5]], 5, 5], [0]),\n  ('partial repair boundary #1',\n   [[[5, 9, 8], [7, 13, 0], [0, 2, 9], [13, 13, 2], [25, 31, 3]], 2, 1],\n   [0, 1, 3]),\n  ('partial repair boundary #2', [[[23, 29, 6], [19, 22, 0], [30, 32, 8], [15, 20, 1]], 3, 1], [0, 1, 3]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1', [[[9, 14, 10], [0, 6, 1], [21, 21, 2]], 5, 2], [0]),\n  ('fault site climb penalty #2',\n   [[[0, 6, 6], [20, 25, 2], [5, 9, 8], [28, 31, 3], [7, 11, 8]], 3, 8],\n   [0, 2, 4]),\n  ('partial repair boundary #1', [[[23, 29, 6], [19, 22, 0], [30, 32, 8], [15, 20, 1]], 3, 1], [0, 1, 3]),\n  ('regression climb penalty #1',\n   [[[23, 25, 6], [15, 16, 2], [21, 21, 7], [27, 33, 3], [2, 8, 3]], 2, 2],\n   [0, 2, 3]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1',\n   [[[24, 26, 1], [7, 10, 9], [5, 7, 8], [21, 27, 5], [18, 19, 0], [29, 32, 9]], 1, 4],\n   [0]),\n  ('fault site climb penalty #2',\n   [[[17, 17, 4], [11, 11, 6], [26, 32, 4], [14, 19, 5], [28, 33, 4], [27, 29, 2]], 5, 6],\n   [0, 1, 3]),\n  ('partial repair boundary #1',\n   [[[18, 18, 5], [15, 19, 6], [21, 22, 3], [5, 9, 1], [14, 20, 6], [24, 29, 7]], 1, 5],\n   [0, 1, 2, 3, 4, 5]),\n  ('partial repair boundary #2',\n   [[[7, 9, 9], [10, 15, 0], [7, 10, 2], [9, 14, 4], [26, 30, 8], [15, 19, 1]], 5, 1],\n   [0, 1, 2, 3, 5]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1',\n   [[[4, 9, 10], [0, 5, 1], [27, 30, 1], [18, 21, 5], [19, 25, 6]], 4, 8],\n   [0, 1]),\n  ('fault site climb penalty #2', [[[10, 10, 10], [21, 22, 10], [16, 22, 2], [3, 3, 5]], 1, 2], [0]),\n  ('partial repair boundary #1',\n   [[[5, 10, 6], [19, 21, 1], [6, 7, 0], [11, 17, 10], [29, 35, 5], [0, 0, 8]], 5, 1],\n   [0, 2]),\n  ('partial repair boundary #2',\n   [[[8, 9, 9], [9, 14, 3], [9, 9, 2], [5, 8, 10], [10, 14, 4], [24, 26, 6]], 5, 2],\n   [0, 1, 2, 3, 4]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[23, 29, 1], [3, 9, 0]], 4, 3], [0])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1', [[[20, 23, 7], [24, 26, 9], [25, 25, 6], [7, 12, 0]], 5, 5], [0, 1, 2]),\n  ('fault site climb penalty #2',\n   [[[12, 16, 8], [30, 34, 6], [15, 15, 8], [24, 25, 1], [25, 29, 6], [30, 35, 7]], 2, 7],\n   [0, 2]),\n  ('partial repair boundary #1',\n   [[[20, 26, 10], [29, 29, 4], [18, 18, 3], [17, 18, 0], [16, 22, 8]], 5, 4],\n   [0, 1, 2, 3, 4]),\n  ('partial repair boundary #2',\n   [[[20, 25, 6], [15, 17, 9], [23, 24, 0], [21, 23, 4], [11, 13, 8], [13, 17, 0]], 3, 3],\n   [0, 2, 3, 5]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[17, 20, 8]], 4, 4], [0])]]\nfor label, args, expected in cases[N-1]:\n    check(label, solve(*args), expected)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"7a1c019c51112eba0696c5a59ee9a5b6f4b6065b3b53c41a3dc897e651110910","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(platforms, jump_h, jump_d):\n    n = len(platforms)\n    seen = {0}\n    queue = [0]\n    while queue:\n        a = queue.pop(0)\n        ax1, ax2, ay = platforms[a]\n        for b in range(n):\n            if b in seen:\n                continue\n            bx1, bx2, by = platforms[b]\n            rise = by - ay\n            if rise > jump_h:\n                continue\n            gap = max(0, bx1 - ax2, ax1 - bx2)\n            reach = jump_d - rise // 2\n            if gap <= reach:\n                seen.add(b)\n                queue.append(b)\n    return sorted(seen)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncases = [[('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('regression climb penalty #1',\n   [[[23, 25, 6], [15, 16, 2], [21, 21, 7], [27, 33, 3], [2, 8, 3]], 2, 2],\n   [0, 2, 3]),\n  ('fault site climb penalty #1', [[[20, 24, 10], [6, 8, 1], [30, 30, 5]], 5, 5], [0]),\n  ('partial repair boundary #1',\n   [[[5, 9, 8], [7, 13, 0], [0, 2, 9], [13, 13, 2], [25, 31, 3]], 2, 1],\n   [0, 1, 3]),\n  ('partial repair boundary #2', [[[23, 29, 6], [19, 22, 0], [30, 32, 8], [15, 20, 1]], 3, 1], [0, 1, 3]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1', [[[9, 14, 10], [0, 6, 1], [21, 21, 2]], 5, 2], [0]),\n  ('fault site climb penalty #2',\n   [[[0, 6, 6], [20, 25, 2], [5, 9, 8], [28, 31, 3], [7, 11, 8]], 3, 8],\n   [0, 2, 4]),\n  ('partial repair boundary #1', [[[23, 29, 6], [19, 22, 0], [30, 32, 8], [15, 20, 1]], 3, 1], [0, 1, 3]),\n  ('regression climb penalty #1',\n   [[[23, 25, 6], [15, 16, 2], [21, 21, 7], [27, 33, 3], [2, 8, 3]], 2, 2],\n   [0, 2, 3]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1',\n   [[[24, 26, 1], [7, 10, 9], [5, 7, 8], [21, 27, 5], [18, 19, 0], [29, 32, 9]], 1, 4],\n   [0]),\n  ('fault site climb penalty #2',\n   [[[17, 17, 4], [11, 11, 6], [26, 32, 4], [14, 19, 5], [28, 33, 4], [27, 29, 2]], 5, 6],\n   [0, 1, 3]),\n  ('partial repair boundary #1',\n   [[[18, 18, 5], [15, 19, 6], [21, 22, 3], [5, 9, 1], [14, 20, 6], [24, 29, 7]], 1, 5],\n   [0, 1, 2, 3, 4, 5]),\n  ('partial repair boundary #2',\n   [[[7, 9, 9], [10, 15, 0], [7, 10, 2], [9, 14, 4], [26, 30, 8], [15, 19, 1]], 5, 1],\n   [0, 1, 2, 3, 5]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1',\n   [[[4, 9, 10], [0, 5, 1], [27, 30, 1], [18, 21, 5], [19, 25, 6]], 4, 8],\n   [0, 1]),\n  ('fault site climb penalty #2', [[[10, 10, 10], [21, 22, 10], [16, 22, 2], [3, 3, 5]], 1, 2], [0]),\n  ('partial repair boundary #1',\n   [[[5, 10, 6], [19, 21, 1], [6, 7, 0], [11, 17, 10], [29, 35, 5], [0, 0, 8]], 5, 1],\n   [0, 2]),\n  ('partial repair boundary #2',\n   [[[8, 9, 9], [9, 14, 3], [9, 9, 2], [5, 8, 10], [10, 14, 4], [24, 26, 6]], 5, 2],\n   [0, 1, 2, 3, 4]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[23, 29, 1], [3, 9, 0]], 4, 3], [0])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1', [[[20, 23, 7], [24, 26, 9], [25, 25, 6], [7, 12, 0]], 5, 5], [0, 1, 2]),\n  ('fault site climb penalty #2',\n   [[[12, 16, 8], [30, 34, 6], [15, 15, 8], [24, 25, 1], [25, 29, 6], [30, 35, 7]], 2, 7],\n   [0, 2]),\n  ('partial repair boundary #1',\n   [[[20, 26, 10], [29, 29, 4], [18, 18, 3], [17, 18, 0], [16, 22, 8]], 5, 4],\n   [0, 1, 2, 3, 4]),\n  ('partial repair boundary #2',\n   [[[20, 25, 6], [15, 17, 9], [23, 24, 0], [21, 23, 4], [11, 13, 8], [13, 17, 0]], 3, 3],\n   [0, 2, 3, 5]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[17, 20, 8]], 4, 4], [0])]]\nfor label, args, expected in cases[N-1]:\n    check(label, solve(*args), expected)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"fixed":{"sha256":"3146d701158af3203807f815f98b6c0278e8f13c87808e29b1254b352bb2e099","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(platforms, jump_h, jump_d):\n    n = len(platforms)\n    seen = {0}\n    queue = [0]\n    while queue:\n        a = queue.pop(0)\n        ax1, ax2, ay = platforms[a]\n        for b in range(n):\n            if b in seen:\n                continue\n            bx1, bx2, by = platforms[b]\n            rise = by - ay\n            if rise > jump_h:\n                continue\n            gap = max(0, bx1 - ax2, ax1 - bx2)\n            reach = jump_d - max(0, rise) // 2\n            if gap <= reach:\n                seen.add(b)\n                queue.append(b)\n    return sorted(seen)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncases = [[('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('regression climb penalty #1',\n   [[[23, 25, 6], [15, 16, 2], [21, 21, 7], [27, 33, 3], [2, 8, 3]], 2, 2],\n   [0, 2, 3]),\n  ('fault site climb penalty #1', [[[20, 24, 10], [6, 8, 1], [30, 30, 5]], 5, 5], [0]),\n  ('partial repair boundary #1',\n   [[[5, 9, 8], [7, 13, 0], [0, 2, 9], [13, 13, 2], [25, 31, 3]], 2, 1],\n   [0, 1, 3]),\n  ('partial repair boundary #2', [[[23, 29, 6], [19, 22, 0], [30, 32, 8], [15, 20, 1]], 3, 1], [0, 1, 3]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1', [[[9, 14, 10], [0, 6, 1], [21, 21, 2]], 5, 2], [0]),\n  ('fault site climb penalty #2',\n   [[[0, 6, 6], [20, 25, 2], [5, 9, 8], [28, 31, 3], [7, 11, 8]], 3, 8],\n   [0, 2, 4]),\n  ('partial repair boundary #1', [[[23, 29, 6], [19, 22, 0], [30, 32, 8], [15, 20, 1]], 3, 1], [0, 1, 3]),\n  ('regression climb penalty #1',\n   [[[23, 25, 6], [15, 16, 2], [21, 21, 7], [27, 33, 3], [2, 8, 3]], 2, 2],\n   [0, 2, 3]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1',\n   [[[24, 26, 1], [7, 10, 9], [5, 7, 8], [21, 27, 5], [18, 19, 0], [29, 32, 9]], 1, 4],\n   [0]),\n  ('fault site climb penalty #2',\n   [[[17, 17, 4], [11, 11, 6], [26, 32, 4], [14, 19, 5], [28, 33, 4], [27, 29, 2]], 5, 6],\n   [0, 1, 3]),\n  ('partial repair boundary #1',\n   [[[18, 18, 5], [15, 19, 6], [21, 22, 3], [5, 9, 1], [14, 20, 6], [24, 29, 7]], 1, 5],\n   [0, 1, 2, 3, 4, 5]),\n  ('partial repair boundary #2',\n   [[[7, 9, 9], [10, 15, 0], [7, 10, 2], [9, 14, 4], [26, 30, 8], [15, 19, 1]], 5, 1],\n   [0, 1, 2, 3, 5]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[13, 18, 6], [20, 22, 7]], 2, 8], [0, 1])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1',\n   [[[4, 9, 10], [0, 5, 1], [27, 30, 1], [18, 21, 5], [19, 25, 6]], 4, 8],\n   [0, 1]),\n  ('fault site climb penalty #2', [[[10, 10, 10], [21, 22, 10], [16, 22, 2], [3, 3, 5]], 1, 2], [0]),\n  ('partial repair boundary #1',\n   [[[5, 10, 6], [19, 21, 1], [6, 7, 0], [11, 17, 10], [29, 35, 5], [0, 0, 8]], 5, 1],\n   [0, 2]),\n  ('partial repair boundary #2',\n   [[[8, 9, 9], [9, 14, 3], [9, 9, 2], [5, 8, 10], [10, 14, 4], [24, 26, 6]], 5, 2],\n   [0, 1, 2, 3, 4]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[23, 29, 1], [3, 9, 0]], 4, 3], [0])],\n [('deep drop #1', [[[0, 2, 10], [3, 5, 0]], 2, 2], [0, 1]),\n  ('fault site climb penalty #1', [[[20, 23, 7], [24, 26, 9], [25, 25, 6], [7, 12, 0]], 5, 5], [0, 1, 2]),\n  ('fault site climb penalty #2',\n   [[[12, 16, 8], [30, 34, 6], [15, 15, 8], [24, 25, 1], [25, 29, 6], [30, 35, 7]], 2, 7],\n   [0, 2]),\n  ('partial repair boundary #1',\n   [[[20, 26, 10], [29, 29, 4], [18, 18, 3], [17, 18, 0], [16, 22, 8]], 5, 4],\n   [0, 1, 2, 3, 4]),\n  ('partial repair boundary #2',\n   [[[20, 25, 6], [15, 17, 9], [23, 24, 0], [21, 23, 4], [11, 13, 8], [13, 17, 0]], 3, 3],\n   [0, 2, 3, 5]),\n  ('platform to the left #1', [[[10, 12, 0], [4, 7, 0]], 1, 3], [0, 1]),\n  ('chain of hops #1', [[[0, 1, 0], [3, 4, 2], [6, 7, 4]], 2, 3], [0, 1, 2]),\n  ('control #1', [[[17, 20, 8]], 4, 4], [0])]]\nfor label, args, expected in cases[N-1]:\n    check(label, solve(*args), expected)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":"Deterministic toy contract stipulated for this model; integer or exact arithmetic only, not a reproduction of any specific game engine. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"w2-procedural-level-generation-constraints-platform-jumps-climb-penalty","generated_at":"2026-09-29T14:50:49.917221+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Procedural generators silently emit unplayable or unfair levels when a single constraint check uses the wrong boundary, axis, neighborhood or update order; the defect is visible in exact generated geometry.","repair":"Restore `jump_d - max(0, rise) // 2` at the climb penalty step.","root_cause":"Negative rises reduce the penalty, adding reach on drops.","sha256":"adbdf914afb3d5e35a4636f9df88e2740de38d69d64c13880e50ba3a3c1d852b","title":"Platform jump reachability: Drops extend horizontal reach · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":40.405,"exit_code":1,"observations":[{"actual":[0],"check":"deep drop #1","expected":[0,1],"passed":false},{"actual":[0,2],"check":"regression climb penalty #1","expected":[0,2,3],"passed":false},{"actual":[0],"check":"fault site climb penalty #1","expected":[0],"passed":true},{"actual":[0],"check":"partial repair boundary #1","expected":[0,1,3],"passed":false},{"actual":[0],"check":"partial repair boundary #2","expected":[0,1,3],"passed":false},{"actual":[0,1],"check":"platform to the left #1","expected":[0,1],"passed":true},{"actual":[0,1,2],"check":"chain of hops #1","expected":[0,1,2],"passed":true},{"actual":[0,1],"check":"control #1","expected":[0,1],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"deep drop #1\", \"actual\": [0], \"expected\": [0, 1], \"passed\": false}, {\"check\": \"regression climb penalty #1\", \"actual\": [0, 2], \"expected\": [0, 2, 3], \"passed\": false}, {\"check\": \"fault site climb penalty #1\", \"actual\": [0], \"expected\": [0], \"passed\": true}, {\"check\": \"partial repair boundary #1\", \"actual\": [0], \"expected\": [0, 1, 3], \"passed\": false}, {\"check\": \"partial repair boundary #2\", \"actual\": [0], \"expected\": [0, 1, 3], \"passed\": false}, {\"check\": \"platform to the left #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"chain of hops #1\", \"actual\": [0, 1, 2], \"expected\": [0, 1, 2], \"passed\": true}, {\"check\": \"control #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.471,"exit_code":1,"observations":[{"actual":[0,1],"check":"deep drop #1","expected":[0,1],"passed":true},{"actual":[0,1,2,3],"check":"regression climb penalty #1","expected":[0,2,3],"passed":false},{"actual":[0,2],"check":"fault site climb penalty #1","expected":[0],"passed":false},{"actual":[0,1,3],"check":"partial repair boundary #1","expected":[0,1,3],"passed":true},{"actual":[0,1,3],"check":"partial repair boundary #2","expected":[0,1,3],"passed":true},{"actual":[0,1],"check":"platform to the left #1","expected":[0,1],"passed":true},{"actual":[0,1,2],"check":"chain of hops #1","expected":[0,1,2],"passed":true},{"actual":[0,1],"check":"control #1","expected":[0,1],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"deep drop #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"regression climb penalty #1\", \"actual\": [0, 1, 2, 3], \"expected\": [0, 2, 3], \"passed\": false}, {\"check\": \"fault site climb penalty #1\", \"actual\": [0, 2], \"expected\": [0], \"passed\": false}, {\"check\": \"partial repair boundary #1\", \"actual\": [0, 1, 3], \"expected\": [0, 1, 3], \"passed\": true}, {\"check\": \"partial repair boundary #2\", \"actual\": [0, 1, 3], \"expected\": [0, 1, 3], \"passed\": true}, {\"check\": \"platform to the left #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"chain of hops #1\", \"actual\": [0, 1, 2], \"expected\": [0, 1, 2], \"passed\": true}, {\"check\": \"control #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":40.746,"exit_code":0,"observations":[{"actual":[0,1],"check":"deep drop #1","expected":[0,1],"passed":true},{"actual":[0,2,3],"check":"regression climb penalty #1","expected":[0,2,3],"passed":true},{"actual":[0],"check":"fault site climb penalty #1","expected":[0],"passed":true},{"actual":[0,1,3],"check":"partial repair boundary #1","expected":[0,1,3],"passed":true},{"actual":[0,1,3],"check":"partial repair boundary #2","expected":[0,1,3],"passed":true},{"actual":[0,1],"check":"platform to the left #1","expected":[0,1],"passed":true},{"actual":[0,1,2],"check":"chain of hops #1","expected":[0,1,2],"passed":true},{"actual":[0,1],"check":"control #1","expected":[0,1],"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"deep drop #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"regression climb penalty #1\", \"actual\": [0, 2, 3], \"expected\": [0, 2, 3], \"passed\": true}, {\"check\": \"fault site climb penalty #1\", \"actual\": [0], \"expected\": [0], \"passed\": true}, {\"check\": \"partial repair boundary #1\", \"actual\": [0, 1, 3], \"expected\": [0, 1, 3], \"passed\": true}, {\"check\": \"partial repair boundary #2\", \"actual\": [0, 1, 3], \"expected\": [0, 1, 3], \"passed\": true}, {\"check\": \"platform to the left #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"chain of hops #1\", \"actual\": [0, 1, 2], \"expected\": [0, 1, 2], \"passed\": true}, {\"check\": \"control #1\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}