Data to …… trials

Record 0a321d3b740a4e0ab2e3a05fa2a2b371

FAIL

Verdict and provenance first; raw prompt/response/reasoning below, collapsed.

✕FAILanswered "{"steps": [{"step": 1, "tool": "run_tests", "args": {}, "ok": true, "kind": n..." · model Gemma 4 31B QAT

finish_reason: stop · tokens in/out: 70448/6292 · cost: $0.008932 · latency: 247800.8 ms

repo_fixtemplatestop

verifier_detail: kind=repo_fix;campaign=1;protocol=text;outcome=stopped_short;detail=no_change;bug=wrong_op;bug_module=taxes;edited=-;turns=16;protocol_version=2;result_rendering=text;calls_per_turn=1;text_stop=1;skipped_calls=0;truncated_turns=1;max_tokens=6000;n_calls=15;n_reads=11;n_searches=0;n_neighbors=0;n_edits=0;n_test_runs=2;edit_nomatch=2;edit_nonunique=0;whole_file_rewrite=0;test_edit_attempts=0;unknown_tool=0;n_errors=2;calls_to_first_cause_read=8;files_read=8;files_read_on_path=4;ran_tests_after_last_edit=0;context_window=32768;wall_s=247

lineage: 0a321d3b

← prev trial · trial 9 of 15 · next trial →

Why did it fail? Nemotron 3 Ultra · live on Nebius Token Factory

Ultra reads the prompt, this answer, the verified correct answer and the difficulty settings, then explains the mistake. The verifier's own classification is shown next to it for comparison.

Prompt 471 chars · 70,448 tokens in
The test suite currently fails:

tests/test_rules.py::test_solve_1 FAILED
    assert solve(-1, 'xybzzz') == [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 573, 63]
    AssertionError: solve(-1, 'xybzzz') returned [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 575, 63]
tests/test_rules.py::test_solve_2 PASSED
tests/test_rules.py::test_solve_3 PASSED
1 failed, 2 passed

Repository files:
billing.py
discounts.py
helpers.py
ingest.py
reporting.py
rules.py
scoring.py
taxes.py
tests/test_rules.py
Response 6,292 tokens out · finish: stop
{"steps": [{"step": 1, "tool": "run_tests", "args": {}, "ok": true, "kind": null, "output": "tests/test_rules.py::test_solve_1 FAILED\n    assert solve(-1, 'xybzzz') == [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 573, 63]\n    AssertionError: solve(-1, 'xybzzz') returned [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 575, 63]\ntests/test_rules.py::test_solve_2 PASSED\ntests/test_rules.py::test_solve_3 PASSED\n1 failed, 2 passed"}, {"step": 2, "tool": "read_file", "args": {"path": "rules.py"}, "ok": true, "kind": null, "output": "   1  from billing import adjust_total\n   2  from discounts import merge_budget\n   3  \n   4  \n   5  def solve(count, token):\n   6      marks = [8, 7, 8]\n   7      cells = [0, 7, 4, 6]\n   8      shift = count + 1\n   9      shift += count\n  10      stack = [3, 8]\n  11      values = stack\n  12      values += [19]\n  13      values = values + [20]\n  14      queue = stack[:]\n  15      queue.append(32)\n  16      marks.append(len(stack) + stack[-1])\n  17      bins = [4, 5, 1, 6, 0]\n  18      size = 0\n  19      for x in bins:\n  20          if x > count:\n  21              size += x\n  22          else:\n  23              size -= 2\n  24      marks.append(size)\n  25      shift = shift + count * 2\n  26      batch = [1, 2, 3, 0, 7]\n  27      items = batch[1:len(batch) - 1]\n  28      marks.append(len(items) + items[-1])\n  29      marks.append(shift)\n  30      marks.append(count * 2)\n  31      marks.append(len(token))\n  32      marks.append(len(cells))\n  33      marks = marks + [merge_budget([6, 5, 9], count)]\n  34      marks = marks + [adjust_total(count)]\n  35      return marks"}, {"step": 3, "tool": "read_file", "args": {"path": "billing.py"}, "ok": true, "kind": null, "output": "   1  def adjust_total(extra):\n   2      size = 9\n   3      factor = 6\n   4      word = 'ab'\n   5      level = 6\n   6      level += factor\n   7      codes = [2, 4, 9]\n   8      values = codes\n   9      values += [14]\n  10      values = values + [24]\n  11      items = codes[:]\n  12      items.append(33)\n  13      size += len(codes) + codes[-1]\n  14      batch = [3, 9, 8, 0, 2]\n  15      limit = 0\n  16      for entry in batch:\n  17          if entry > 4:\n  18              limit += entry\n  19          else:\n  20              limit -= 1\n  21      size += limit\n  22      level = level // 2\n  23      rows = [6, 9, 2, 0, 8]\n  24      scores = rows[1:len(rows) - 1]\n  25      size += len(scores) + scores[-1]\n  26      size += level * 2\n  27      size += factor\n  28      size += len(word)\n  29      size += extra\n  30      return size"}, {"step": 4, "tool": "read_file", "args": {"path": "discounts.py"}, "ok": true, "kind": null, "output": "   1  from helpers import resolve_margin\n   2  \n   3  \n   4  def merge_budget(values, shift):\n   5      height = 4\n   6      extra = 9\n   7      delta = extra + 9\n   8      delta = delta * 2 - 5\n   9      parts = [9, 1]\n  10      stack = parts\n  11      stack += [19]\n  12      stack = stack + [26]\n  13      cells = parts[:]\n  14      cells.append(36)\n  15      height += len(parts) + parts[-1]\n  16      scores = [7, 5, 1, 4]\n  17      level = 0\n  18      for entry in scores:\n  19          if entry > 2:\n  20              level += entry\n  21          else:\n  22              level -= 1\n  23      height += level\n  24      delta += extra\n  25      bins = [6, 3, 1, 0, 8]\n  26      batch = bins[1:len(bins) - 1]\n  27      height += len(batch) + batch[-1]\n  28      height += delta\n  29      height += extra\n  30      height += len(values)\n  31      height += shift\n  32      height = height + sum(resolve_margin(shift))\n  33      reserve = shift\n  34      title = 'aacc'\n  35      items = [0, 2]\n  36      codes = [4, 0]\n  37      count = 4\n  38      count += 2\n  39      items_9 = [9, 5, 9]\n  40      rows = items_9\n  41      rows += [12]\n  42      rows = rows + [27]\n  43      queue = items_9[:]\n  44      queue.append(33)\n  45      reserve += len(items_9) + items_9[-1]\n  46      nums = [9, 7, 0, 6, 8]\n  47      peak = 0\n  48      for x in nums:\n  49          if x > 0:\n  50              peak += x\n  51          else:\n  52              peak -= 2\n  53      reserve += peak\n  54      count += 2\n  55      marks = [0, 4, 1, 5, 2, 8]\n  56      slots = marks[1:len(marks) - 1]\n  57      reserve += len(slots) + slots[-1]\n  58      reserve += count * 2\n  59      reserve += items[0]\n  60      reserve += len(title)\n  61      reserve += len(codes)\n  62      height = height + reserve\n  63      return height"}, {"step": 5, "tool": "read_file", "args": {"path": "helpers.py"}, "ok": true, "kind": null, "output": "   1  from scoring import reconcile_weights\n   2  from taxes import combine_bonus\n   3  \n   4  \n   5  def resolve_margin(factor):\n   6      nums = [5, 7]\n   7      items = [5, 7]\n   8      slots = [6, 7, 1, 2]\n   9      width = 9\n  10      width += factor\n  11      bins = [7, 9]\n  12      stack = bins\n  13      stack += [17]\n  14      stack = stack + [20]\n  15      scores = bins[:]\n  16      scores.append(37)\n  17      nums.append(len(bins) + bins[-1])\n  18      rows = [9, 8, 0, 6, 1]\n  19      peak = 0\n  20      for entry in rows:\n  21          if entry > factor:\n  22              peak += entry\n  23          else:\n  24              peak -= 3\n  25      nums.append(peak)\n  26      width -= 1\n  27      parts = [1, 4, 7, 0, 2, 5]\n  28      codes = parts[1:len(parts) - 1]\n  29      nums.append(len(codes) + codes[-1])\n  30      nums.append(width)\n  31      nums.append(items[0])\n  32      nums.append(factor)\n  33      nums.append(slots[-1])\n  34      nums = nums + combine_bonus([-2, -2], factor)\n  35      nums = nums + [reconcile_weights(factor)]\n  36      return nums"}, {"step": 6, "tool": "read_file", "args": {"path": "scoring.py"}, "ok": true, "kind": null, "output": "   1  from reporting import score_tags\n   2  \n   3  \n   4  def reconcile_weights(value):\n   5      step = 7\n   6      score = 4\n   7      margin = 5\n   8      size = 2\n   9      size = size + margin * 2\n  10      parts = [5, 5]\n  11      batch = parts\n  12      batch += [17]\n  13      batch = batch + [23]\n  14      marks = parts[:]\n  15      marks.append(39)\n  16      step += len(parts) + parts[-1]\n  17      codes = [9, 0, 1, 5, 7]\n  18      bonus = 0\n  19      for cur in codes:\n  20          if cur > margin:\n  21              bonus += cur\n  22          else:\n  23              bonus -= 2\n  24      step += bonus\n  25      size -= 8\n  26      bins = [1, 5, 4, 2, 3, 9]\n  27      items = bins[1:len(bins) - 1]\n  28      step += len(items) + items[-1]\n  29      step += size\n  30      step += value * 2\n  31      step += score\n  32      step += margin\n  33      step = step + score_tags([1, 7])\n  34      step = step + sum(aggregate_budget([1, 0]))\n  35      return step\n  36  \n  37  \n  38  def aggregate_budget(rows):\n  39      word = 'sol'\n  40      label = 'sol'\n  41      limit = 6\n  42      size = 4\n  43      size = size // 2\n  44      cells = [4, 0]\n  45      bins = cells\n  46      bins += [13]\n  47      bins = bins + [21]\n  48      scores = cells[:]\n  49      scores.append(39)\n  50      rows.append(len(cells) + cells[-1])\n  51      slots = [2, 7, 8, 1, 9]\n  52      shift = 0\n  53      for x in slots:\n  54          if x > 7:\n  55              shift += x\n  56          else:\n  57              shift -= 3\n  58      rows.append(shift)\n  59      size = size + limit * 2\n  60      codes = [7, 0, 5, 9, 2]\n  61      items = codes[1:len(codes) - 1]\n  62      rows.append(len(items) + items[-1])\n  63      rows.append(size)\n  64      rows.append(len(word))\n  65      rows.append(len(label))\n  66      rows.append(limit * 2)\n  67      return rows"}, {"step": 7, "tool": "read_file", "args": {"path": "reporting.py"}, "ok": true, "kind": null, "output": "   1  def score_tags(codes):\n   2      delta = 6\n   3      value = 1\n   4      rate = 3\n   5      budget = rate + 1\n   6      budget = budget + value * 2\n   7      marks = [6, 7]\n   8      scores = marks\n   9      scores += [16]\n  10      scores = scores + [22]\n  11      items = marks[:]\n  12      items.append(35)\n  13      delta += len(marks) + marks[-1]\n  14      queue = [0, 3, 8, 2, 5]\n  15      spare = 0\n  16      for cur in queue:\n  17          if cur > value:\n  18              spare += cur\n  19          else:\n  20              spare -= 1\n  21      delta += spare\n  22      budget = budget + value * 2\n  23      nums = [8, 5, 6, 0, 9]\n  24      batch = nums[1:len(nums) - 1]\n  25      delta += len(batch) + batch[-1]\n  26      delta += budget * 2\n  27      delta += value * 2\n  28      delta += rate\n  29      delta += codes[-1]\n  30      return delta"}, {"step": 8, "tool": "read_file", "args": {"path": "taxes.py"}, "ok": true, "kind": null, "output": "   1  from ingest import rank_batch\n   2  \n   3  \n   4  def combine_bonus(codes, base):\n   5      queue = [7, 9, 9]\n   6      factor = 5\n   7      step = 8\n   8      step -= base\n   9      rows = [1, 3, 4]\n  10      marks = rows\n  11      marks += [16]\n  12      marks = marks + [27]\n  13      items = rows[:]\n  14      items.append(36)\n  15      queue.append(len(rows) + rows[-1])\n  16      parts = [9, 8, 3, 6]\n  17      level = 0\n  18      for x in parts:\n  19          if x > factor:\n  20              level += x\n  21          else:\n  22              level -= 2\n  23      queue.append(level)\n  24      step -= 1\n  25      cells = [4, 7, 3, 2, 0]\n  26      values = cells[1:len(cells) - 1]\n  27      queue.append(len(values) + values[-1])\n  28      queue.append(step)\n  29      queue.append(codes[-1])\n  30      queue.append(base)\n  31      queue.append(factor * 2)\n  32      queue = queue + [rank_batch(base, 'by')]\n  33      return queue"}, {"step": 9, "tool": "read_file", "args": {"path": "ingest.py"}, "ok": true, "kind": null, "output": "   1  def rank_batch(limit, text):\n   2      depth = 5\n   3      nums = [9, 5, 9, 7]\n   4      height = depth + 6\n   5      height += depth\n   6      marks = [5, 9, 9]\n   7      scores = marks\n   8      scores += [13]\n   9      scores = scores + [28]\n  10      batch = marks[:]\n  11      batch.append(37)\n  12      limit += len(marks) + marks[-1]\n  13      codes = [4, 3, 2, 0]\n  14      factor = 0\n  15      for cur in codes:\n  16          if cur > 0:\n  17              factor += cur\n  18          else:\n  19              factor -= 1\n  20      limit += factor\n  21      height -= 6\n  22      cells = [6, 7, 8, 0, 1]\n  23      slots = cells[1:len(cells) - 1]\n  24      limit += len(slots) + slots[-1]\n  25      limit += height\n  26      limit += depth\n  27      limit += len(text)\n  28      limit += nums[-1]\n  29      return limit"}, {"step": 10, "tool": "run_tests", "args": {}, "ok": true, "kind": null, "output": "tests/test_rules.py::test_solve_1 FAILED\n    assert solve(-1, 'xybzzz') == [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 573, 63]\n    AssertionError: solve(-1, 'xybzzz') returned [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 575, 63]\ntests/test_rules.py::test_solve_2 PASSED\ntests/test_rules.py::test_solve_3 PASSED\n1 failed, 2 passed"}, {"step": 11, "tool": "read_file", "args": {"path": "rules.py"}, "ok": true, "kind": null, "output": "   1  from billing import adjust_total\n   2  from discounts import merge_budget\n   3  \n   4  \n   5  def solve(count, token):\n   6      marks = [8, 7, 8]\n   7      cells = [0, 7, 4, 6]\n   8      shift = count + 1\n   9      shift += count\n  10      stack = [3, 8]\n  11      values = stack\n  12      values += [19]\n  13      values = values + [20]\n  14      queue = stack[:]\n  15      queue.append(32)\n  16      marks.append(len(stack) + stack[-1])\n  17      bins = [4, 5, 1, 6, 0]\n  18      size = 0\n  19      for x in bins:\n  20          if x > count:\n  21              size += x\n  22          else:\n  23              size -= 2\n  24      marks.append(size)\n  25      shift = shift + count * 2\n  26      batch = [1, 2, 3, 0, 7]\n  27      items = batch[1:len(batch) - 1]\n  28      marks.append(len(items) + items[-1])\n  29      marks.append(shift)\n  30      marks.append(count * 2)\n  31      marks.append(len(token))\n  32      marks.append(len(cells))\n  33      marks = marks + [merge_budget([6, 5, 9], count)]\n  34      marks = marks + [adjust_total(count)]\n  35      return marks"}, {"step": 12, "tool": "read_file", "args": {"path": "tests/test_rules.py"}, "ok": true, "kind": null, "output": "   1  from rules import solve\n   2  \n   3  \n   4  def test_solve_1():\n   5      assert solve(-1, 'xybzzz') == [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 573, 63]\n   6  \n   7  \n   8  def test_solve_2():\n   9      assert solve(0, 'bba') == [8, 7, 8, 22, 14, 3, 1, 0, 3, 4, 579, 64]\n  10  \n  11  \n  12  def test_solve_3():\n  13      assert solve(0, 'cy') == [8, 7, 8, 22, 14, 3, 1, 0, 2, 4, 579, 64]"}, {"step": 13, "tool": "read_file", "args": {"path": "billing.py"}, "ok": true, "kind": null, "output": "   1  def adjust_total(extra):\n   2      size = 9\n   3      factor = 6\n   4      word = 'ab'\n   5      level = 6\n   6      level += factor\n   7      codes = [2, 4, 9]\n   8      values = codes\n   9      values += [14]\n  10      values = values + [24]\n  11      items = codes[:]\n  12      items.append(33)\n  13      size += len(codes) + codes[-1]\n  14      batch = [3, 9, 8, 0, 2]\n  15      limit = 0\n  16      for entry in batch:\n  17          if entry > 4:\n  18              limit += entry\n  19          else:\n  20              limit -= 1\n  21      size += limit\n  22      level = level // 2\n  23      rows = [6, 9, 2, 0, 8]\n  24      scores = rows[1:len(rows) - 1]\n  25      size += len(scores) + scores[-1]\n  26      size += level * 2\n  27      size += factor\n  28      size += len(word)\n  29      size += extra\n  30      return size"}, {"step": 14, "tool": "edit_file", "args": {"path": "billing.py", "old": "      size += factor", "new": "      # size += factor"}, "ok": false, "kind": "edit_nomatch", "output": "`old` was not found in billing.py; it must match the file exactly, indentation included (line numbers from read_file are not part of the file)"}, {"step": 15, "tool": "edit_file", "args": {"path": "billing.py", "old": "      size += factor", "new": "      size += 4"}, "ok": false, "kind": "edit_nomatch", "output": "`old` was not found in billing.py; it must match the file exactly, indentation included (line numbers from read_file are not part of the file)"}], "diff": "", "assistant": ["```tool_code\nrun_tests()\n```", "```tool_code\nread_file(path='rules.py')\n```", "```tool_code\nread_file(path='billing.py')\n```", "```tool_code\nread_file(path='discounts.py')\n```", "```tool_code\nread_file(path='helpers.py')\n```", "```tool_code\nread_file(path='scoring.py')\n```", "```tool_code\nread_file(path='reporting.py')\n```", "```tool_code\nread_file(path='taxes.py')\n```", "```tool_code\nread_file(path='ingest.py')\n```", "```tool_code\nrun_tests()\n```", "```tool_code\nread_file(path='rules.py')\n```", "```tool_code\nread_file(path='tests/test_rules.py')\n```\nWait, the instructions say files under `tests/` are read-only, but I can still read them to understand the expected output. However, I already have the error message:\n`AssertionError: solve(-1, 'xybzzz') returned [8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 575, 63]`\nExpected: `[8, 7, 8, 22, 16, 3, -3, -2, 6, 4, 573, 63]`\n\nThe difference is in the second to last element: 575 vs 573.\nIn `rules.py`:\nLine 33: `marks = marks + [merge_budget([6, 5, 9], count)]`\nLine 34: `marks = marks + [adjust_total(count)]`\n\nThe last element is `adjust_total(count)`.\nThe second to last element is `merge_budget([6, 5, 9], count)`.\nSo `merge_budget([6, 5, 9], -1)` is returning 575, but it should be 573.\n\nLet's trace `merge_budget([6, 5, 9], -1)` in `discounts.py`:\n- `height = 4`\n- `extra = 9`\n- `delta = 9 + 9 = 18`\n- `delta = 18 * 2 - 5 = 31`\n- `parts = [9, 1]`\n- `stack = [9, 1, 19, 26]`\n- `cells = [9, 1, 36]`\n- `height += len([9, 1]) + 1 = 2 + 1 = 3` -> `height = 4 + 3 = 7`\n- `scores = [7, 5, 1, 4]`\n- `level = 0`\n- `entry = 7 (> 2): level = 7`\n- `entry = 5 (> 2): level = 7 + 5 = 12`\n- `entry = 1 (<= 2): level = 12 - 1 = 11`\n- `entry = 4 (> 2): level = 11 + 4 = 15`\n- `height += 15` -> `height = 7 + 15 = 22`\n- `delta += 9` -> `delta = 31 + 9 = 40`\n- `bins = [6, 3, 1, 0, 8]`\n- `batch = [3, 1, 0]`\n- `height += len([3, 1, 0]) + 0 = 3 + 0 = 3` -> `height = 22 + 3 = 25`\n- `height += 40` -> `height = 25 + 40 = 65`\n- `height += 9` -> `height = 65 + 9 = 74`\n- `h\n...[6789 chars clipped]...\n+9+9+7+21+5+8-2-1+10+46+160`\n- `sum = 64+2+7+9+9+7+21+5+8-2-1+10+46+160`\n- `sum = 66+7+9+9+7+21+5+8-2-1+10+46+160`\n- `sum = 73+9+9+7+21+5+8-2-1+10+46+160`\n- `sum = 82+9+7+21+5+8-2-1+10+46+160`\n- `sum = 91+7+21+5+8-2-1+10+46+160`\n- `sum = 98+21+5+8-2-1+10+46+160`\n- `sum = 119+5+8-2-1+10+46+160`\n- `sum = 124+8-2-1+10+46+160`\n- `sum = 132-2-1+10+46+160`\n- `sum = 130-1+10+46+160`\n- `sum = 129+10+46+160`\n- `sum = 139+46+160`\n- `sum = 185+160 = 345`\n\n`height = 76 + 345 = 421`.\nWait, the error says it returned 575. I must have missed something.\nLet's re-calculate `height` in `merge_budget`.\n`height = 4`\n`extra = 9`\n`delta = 31`\n`height += 2 + 1 = 3` -> `height = 7`\n`level = 15`\n`height += 15` -> `height = 22`\n`delta += 9` -> `delta = 40`\n`height += 3 + 0 = 3` -> `height = 25`\n`height += 40` -> `height = 65`\n`height += 9` -> `height = 74`\n`height += 3` -> `height = 77`\n`height += -1` -> `height = 76`\n`height = height + sum(resolve_margin(-1))`\n`reserve = -1`\n`title = 'aacc'`\n`items = [0, 2]`\n`codes = [4, 0]`\n`count = 4 + 2 = 6`\n`items_9 = [9, 5, 9]`\n`rows = [9, 5, 9, 12, 27]`\n`queue = [9, 5, 9, 33]`\n`reserve += 3 + 9 = 12` -> `reserve = -1 + 12 = 11`\n`nums = [9, 7, 0, 6, 8]`\n`peak = 0`\n`x = 9 (> 0): peak = 9`\n`x = 7 (> 0): peak = 9 + 7 = 16`\n`x = 0 (<= 0): peak = 16 - 2 = 14`\n`x = 6 (> 0): peak = 14 + 6 = 20`\n`x = 8 (> 0): peak = 20 + 8 = 28`\n`reserve += 28` -> `reserve = 11 + 28 = 39`\n`count += 2` -> `count = 6 + 2 = 8`\n`marks = [0, 4, 1, 5, 2, 8]`\n`slots = [4, 1, 5, 2]`\n`reserve +=", "```tool_code\nread_file(path='billing.py')\n```", "```tool_code\nedit_file(path='billing.py', old='      size += factor', new='      # size += factor')\n```", "```tool_code\nedit_file(path='billing.py', old='      size += factor', new='      size += 4')\n```", "call:read_file(path='billing.py')"]}
Reasoning not captured

(no reasoning captured)

Realized dims 34
dimvalue
bug_distance3.0
calls_to_first_cause_read8.0
clone_trap0.0
distractor_modules0.0
edit_nomatch2.0
edit_nonunique0.0
files_read8.0
files_read_on_path4.0
hidden_inputs4.0
inlined1.0
lines323.0
lookalike_twins0.0
max_fanout2.0
n_bugs1.0
n_calls15.0
n_crossing_edges7.0
n_edges8.0
n_edits0.0
n_errors2.0
n_files8.0
n_funcs9.0
n_modules8.0
n_neighbors0.0
n_reads11.0
n_searches0.0
n_test_runs2.0
path_crosses_every_hop1.0
protocol_version2.0
ran_tests_after_last_edit0.0
test_edit_attempts0.0
tokens_in_total70448.0
truncated_turns1.0
unknown_tool0.0
whole_file_rewrite0.0
Latent params 17
paramvalue
bug_distance3.0
bug_mix0.0
clone_trap0.0
distractor_modules0.0
fanout2.0
graph_tools0.0
hidden_inputs4.0
inline_p0.25
lookalike_names0.0
misleading_comments0.0
n_bugs1.0
n_modules8.0
n_statements8.0
opaque_names0.0
restate_imports0.0
restate_symbols0.0
tool_budget20.0