[TS PBT] Prioritize original-property, uncovered-edge and optional relation goals in one USVM phase #399

Scope agreed on 2026-10-16

One concrete PBT generation phase is followed by one USVM search phase. No return to random generation is required. Concrete replay and optional shrinking validate a USVM candidate; they are not a second PBT generation phase. This replaces the previous repeated-round acceptance.

Existing implementation

#524 transfers admitted concrete edges into the original-property analysis, uses #526's selector, retains covered prefixes and allocates at least half of turns to the original BFS objective. Keep this implementation; do not replace it with a generic scheduler framework.

Delivery requirements

• Integrate the initial PBT evidence snapshot through [TS PBT] Integrate one PBT evidence phase followed by guided USVM search #355 under [TS PBT] Run two-phase campaigns with shared budgets and result artifacts #354's single deadline.
• With [TS PBT] Infer bounded numeric hypotheses once from PBT observations #397/[TS PBT] Bind one-time observed relations to exact symbolic challenges #398 explicitly enabled, schedule exact one-time relation challenges alongside original-property and edge goals. Keep target roles, scope and outcomes separate.
• Do not turn sampled relations into universal assumptions. Record any focused query and retain a positive bounded unrestricted original-property allocation.
• Remove only natively confirmed covered goals. Failed replay, UNKNOWN, model limitations and unsupported prefixes remain incomplete outcomes, not global infeasibility proofs.
• Bound retries and avoid repeatedly spending the budget on a target whose supported execution cannot reach it. Keep the diagnosed PGOrbit unsupported-prefix case in the regression plan; use [TS PBT] Preserve runtime limitation reasons in property-search results #555's diagnostics rather than silently discarding it.
• Reuse existing deterministic selection, deadline and trace mechanisms. No new public round/revision protocol, adaptive-policy project or persistent query cache is required.

Acceptance

Independently changed admitted PBT edges change the selected symbolic work. An enabled exact relation independently changes its challenge. Original-property search survives covered code, misleading relations, failed replay and unusable targets. The complete decisions and elapsed costs remain inspectable. No second PBT generation phase is required.

Delivery status (2026-10-17)

Admitted-edge transfer and core selector work are retained and separately owned; this task did not change selector policy. Optional exact one-time relation scheduling is published in #603 on composition #602. Each selected relation is challenged at most once; target roles, decisions, source-qualified confirmations and allocations remain in relationGuidance. A timely native original fault ends auxiliary work and prevents a redundant original query. No second PBT phase, adaptive policy or generic scheduler is introduced.

#610's retained-observation correction and #611's strict auxiliary-receipt consumption are published and integrated in frozen local assembly c447392006cb72b06ead3d857b639a23d7e259c9; 42 focused integration tests passed. Final scalar controls use a common outer 60-second deadline, explicit original-machine cap and actual remaining allocations. All 108 scalar artifacts are timely/eligible. A positive unrestricted-original allocation is retained unless an original fault is already confirmed.

The relation modes find the branching mutant in 3/3 seeds where the four original-objective controls do not, but prefix/native-oracle execution independently reaches the same input without learned equality. Thus scheduling functionality is demonstrated; incremental observation value is not. The completed class comparison has zero gain in all 14 strict paired rows, with 55/144 incomplete cells kept separate. See #357/#404 for results and published #614/#615/#616 under #354/#612/#613 for ordinary command-boundary publication/deadline handling, still pending review/merge with cooperative cleanup limits. All PRs remain open; no main merge or superiority claim is implied.