A digital integrated circuit verification system that accelerates verification coverage closure

By using verification IP instead of the unit to be tested in the digital integrated circuit verification system, iterative simulation is performed to adjust the excitation and code coverage, and using random seeds to optimize the coverage point, the problem of low convergence efficiency of verification coverage is solved, and rapid convergence and high efficiency are achieved verify.

CN117993336BActive Publication Date: 2024-11-22沐曦科技(成都)有限公司
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410280477.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-12
Publication Date
2024-11-22
Estimated Expiration
2044-03-12

AI Technical Summary

Technical Problem

In existing digital integrated circuit verification systems, the verification coverage convergence efficiency is low, the RTL code simulation speed is slow, and the collection efficiency of difficult coverage points is low. A large number of iterative regression and forced operations are required to achieve coverage convergence.

Method used

Using a system that accelerates the convergence of verification coverage, the verification IP replaces the unit to be tested, forms the first verification environment for iterative simulation to adjust the excitation coverage, forms the second verification environment for iterative simulation to adjust the code coverage, and generates the excitation using random seeds. , optimize the coverage points that are difficult to cover by intersection, improve the code coverage convergence efficiency.

Benefits of technology

Fast iterative simulation is realized, the convergence efficiency of excitation coverage and code coverage is improved, richer and more complete incentives are provided, and the convergence efficiency of verification coverage in digital integrated circuit verification systems is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117993336B_ABST
    Figure CN117993336B_ABST
Patent Text Reader

Abstract

The present application relates to the field of digital integrated circuit verification technology, and in particular to a digital integrated circuit verification system for accelerating the convergence of verification coverage. The system includes: a unit to be tested, a verification IP, an input proxy module, an output proxy module, a reference model, a comparison unit, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: a first verification environment is formed by the verification IP for iterative simulation, and constraints on sequence items generated by sequence objects are adjusted according to stimulus coverage until the stimulus coverage meets a first preset condition. A second verification environment is formed by the unit to be tested for iterative simulation until the code coverage of the unit to be tested meets a second preset condition, and verification is completed. It can be seen that the verification IP is used instead of the unit to be tested, so that the stimulus coverage can converge quickly. When verifying the unit to be tested, the effective random seeds are recorded to improve the convergence efficiency of the code coverage.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of digital integrated circuit verification, and in particular to a digital integrated circuit verification system that accelerates the convergence of verification coverage. Background Art

[0002] Verification coverage is a measure of the degree of design verification during the integrated circuit verification phase. It can reflect the degree of execution of the verification plan and whether there are any unexecuted branch structures or statements in the RTL code corresponding to the digital integrated circuit. Verification coverage can usually be divided into functional coverage and code coverage.

[0003] At present, when performing RTL code verification, the RTL code is usually directly verified as a unit to be tested, but the simulation speed of the RTL code is slow, and when the stimulus is not comprehensive enough, using the RTL code for simulation verification will make the verification coverage convergence more inefficient. In addition, when collecting code coverage, there may be coverage points that are difficult to cover. The existing technology usually requires a large number of iterative regressions to cover them. If coverage is still not possible, it is necessary to construct directed use cases or even force operations on interface signals to achieve coverage convergence, which also leads to low coverage convergence efficiency.

[0004] Therefore, how to improve the efficiency of verification coverage convergence in digital integrated circuit verification systems has become an urgent problem to be solved. Summary of the invention

[0005] In view of the above technical problems, the technical solution adopted by the present invention is:

[0006] A digital integrated circuit verification system for accelerating the convergence of verification coverage, the system comprising: a unit to be tested, a verification IP, an input proxy module, an output proxy module, a reference model, a comparison unit, a processor and a memory storing a computer program, wherein the input proxy module comprises a sequencer, a driver and a first monitor, and the output proxy module comprises a second monitor. When the computer program is executed by the processor, the following steps are implemented:

[0007] S101, a first verification environment is formed by the verification IP, the input proxy module, the output proxy module, the reference model and the comparison unit.

[0008] S102, performing iterative simulation in the first verification environment, collecting the stimulus sent by the driver to the verification IP, determining the stimulus coverage, and iteratively adjusting the constraints when the sequence object corresponding to the sequence generator generates sequence items according to the stimulus coverage, until the stimulus coverage meets the first preset condition.

[0009] S103, forming a second verification environment by the unit to be tested, the input proxy module, the output proxy module, the reference model and the comparison unit.

[0010] S104, performing iterative simulation in the second verification environment until the code coverage of the unit to be tested meets the second preset condition, and the verification is completed, wherein step S104 further includes the following steps:

[0011] S1041, initialize iteration round i=1.

[0012] S1042, set M(i) random seeds {a i 1, a i 2, …, a i m(i) , …, a i M(i)}, a i m(i) is the m(i)th random seed set in the i-th iteration round, where m(i) is an integer in the range [1, M(i)], according to a i m(i) Generate the corresponding stimulus b i m(i) , use b i m(i) The second verification environment is simulated to obtain b i m(i) The code coverage c corresponding to the unit to be tested i m(i) .

[0013] S1043, from c i 1, c i 2, …, c i m(i) , …, c i M(i) Select N(i) code coverage ranges as reference ranges, and other code coverage ranges as non-reference ranges, N(i) is an integer in the range of [1, M(i)], and take the intersection of all reference ranges to obtain the benchmark range.

[0014] S1044, traverse each non-reference range, take the intersection of the non-reference range and the reference range to obtain an intermediate range, if the intermediate range is larger than the reference range, use the random seed corresponding to the non-reference range as a reference seed, obtain R(i) reference seeds, and increase the iteration round i by 1.

[0015] S1045, returning to execute steps S1042 to S1044, in step S1042, the set M(i) random seeds include all reference seeds, in step S1043, the code coverage range corresponding to each reference seed is used as the reference range, until c i 1, c i 2, …, c i m(i) , …, c i M(i) The code coverage corresponding to the intersection of meets the second preset condition.

[0016] Compared with the prior art, the present invention has obvious beneficial effects. By means of the above technical solution, a digital integrated circuit verification system for accelerating the convergence of verification coverage provided by the present invention can achieve considerable technical advancement and practicality, and has wide industrial utilization value, and has at least the following beneficial effects:

[0017] The present invention provides a digital integrated circuit verification system for accelerating the convergence of verification coverage, the system comprising: a unit to be tested, a verification IP, an input proxy module, an output proxy module, a reference model, a comparison unit, a processor and a memory storing a computer program, wherein the input proxy module comprises a sequencer, a driver and a first monitor, the output proxy module comprises a second monitor, and when the computer program is executed by the processor, the following steps are implemented:

[0018] S101 , a first verification environment is formed by the verification IP, the input proxy module, the output proxy module, the reference model and the comparison unit.

[0019] S102, performing iterative simulation in the first verification environment, collecting the stimulus sent by the driver to the verification IP, determining the stimulus coverage, and iteratively adjusting the constraints when the sequence object corresponding to the sequence generator generates sequence items according to the stimulus coverage, until the stimulus coverage meets the first preset condition.

[0020] S103, forming a second verification environment by the unit to be tested, the input proxy module, the output proxy module, the reference model and the comparison unit.

[0021] S104, performing iterative simulation in the second verification environment until the code coverage of the unit to be tested meets the second preset condition, and the verification is completed, wherein step S104 further includes the following steps:

[0022] S1041, initialize iteration round i=1.

[0023] S1042, set M(i) random seeds {ai 1, a i 2, …, a i m(i) , …, a i M(i)}, a i m(i) is the m(i)th random seed set in the i-th iteration round, where m(i) is an integer in the range [1, M(i)], according to a i m(i) Generate the corresponding stimulus b i m(i) , use b i m(i) The second verification environment is simulated to obtain b i m(i) The code coverage c corresponding to the unit to be tested i m(i) .

[0024] S1043, from c i 1, c i 2, …, c i m(i) , …, c i M(i) Select N(i) code coverage ranges as reference ranges, and other code coverage ranges as non-reference ranges, N(i) is an integer in the range of [1, M(i)], and take the intersection of all reference ranges to obtain the benchmark range.

[0025] S1044, traverse each non-reference range, take the intersection of the non-reference range and the reference range to obtain an intermediate range, if the intermediate range is larger than the reference range, use the random seed corresponding to the non-reference range as a reference seed, obtain R(i) reference seeds, and increase the iteration round i by 1.

[0026] S1045, returning to execute steps S1042 to S1044, in step S1042, the set M(i) random seeds include all reference seeds, in step S1043, the code coverage range corresponding to each reference seed is used as the reference range, until c i 1, c i 2, …, c i m(i) , …, c i M(i) The code coverage corresponding to the intersection of meets the second preset condition.

[0027] It can be seen that verification IP is used to replace the unit to be tested in the early stage of verification, thereby accelerating the simulation and enabling the verification process to iterate quickly, and then continuously adjusting the constraints generated by the sequence items, so that the stimulus coverage in the verification plan can converge quickly, so as to provide richer and more complete stimuli for the verification of the unit to be tested later. When verifying the unit to be tested, the random seeds in the random seeds that have a gain effect on the code coverage are recorded, so that the collection efficiency of the coverage points that are difficult to cover can be effectively improved in the subsequent regression, and the convergence efficiency of the code coverage can be improved, thereby improving the efficiency of the convergence of the verification coverage in the digital integrated circuit verification system. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0029] Figure 1 A schematic diagram of a flow chart of a computer program being executed by a processor in a digital integrated circuit verification system for accelerating the convergence of verification coverage provided by an embodiment of the present invention.

[0030] Figure 2 A schematic diagram of the architecture of a first verification environment in a digital integrated circuit verification system for accelerating verification coverage convergence provided by an embodiment of the present invention;

[0031] Figure 3 A schematic diagram of the architecture of a second verification environment in a digital integrated circuit verification system for accelerating verification coverage convergence provided by an embodiment of the present invention; DETAILED DESCRIPTION

[0032] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0033] This embodiment provides a digital integrated circuit verification system for accelerating the convergence of verification coverage, the system comprising: a unit to be tested, a verification IP, an input proxy module, an output proxy module, a reference model, a comparison unit, a processor, and a memory storing a computer program, wherein the input proxy module comprises a sequencer, a driver, and a first monitor, and the output proxy module comprises a second monitor, see Figure 1, is a flow chart of a computer program executed by a processor in a digital integrated circuit verification system for accelerating the convergence of verification coverage provided by an embodiment of the present invention. When the computer program is executed by the processor, the following steps are implemented:

[0034] S101, forming a first verification environment by the verification IP, the input proxy module, the output proxy module, the reference model and the comparison unit;

[0035] S102, performing iterative simulation in the first verification environment, collecting the stimulus sent by the driver to the verification IP, determining the stimulus coverage, and iteratively adjusting the constraints when the sequence object corresponding to the sequence generator generates sequence items according to the stimulus coverage, until the stimulus coverage meets the first preset condition;

[0036] S103, forming a second verification environment by the unit to be tested, the input proxy module, the output proxy module, the reference model and the comparison unit;

[0037] S104, performing iterative simulation in the second verification environment until the code coverage of the unit to be tested meets the second preset condition, and the verification is completed, wherein step S104 further includes the following steps:

[0038] S1041, initializing iteration round i=1;

[0039] S1042, set M(i) random seeds {a i 1, a i 2, …, a i m(i) , …, a i M(i)}, a i m(i) is the m(i)th random seed set in the i-th iteration round, where m(i) is an integer in the range [1, M(i)], according to a i m(i) Generate the corresponding stimulus b i m(i) , use b i m(i) The second verification environment is simulated to obtain b i m(i) The code coverage c corresponding to the unit to be tested i m(i) ;

[0040] S1043, from c i 1, c i 2, …, c i m(i) , …, ci M(i) Select N(i) code coverage ranges as reference ranges, and other code coverage ranges as non-reference ranges, N(i) is an integer in the range [1, M(i)], and take the intersection of all reference ranges to obtain the benchmark range;

[0041] S1044, traverse each non-reference range, take the intersection of the non-reference range and the reference range to obtain an intermediate range, and if the intermediate range is larger than the reference range, use the random seed corresponding to the non-reference range as a reference seed to obtain R(i) reference seeds, and increase the iteration round i by 1;

[0042] S1045, returning to execute steps S1042 to S1044, in step S1042, the set M(i) random seeds include all reference seeds, in step S1043, the code coverage range corresponding to each reference seed is used as the reference range, until c i 1, c i 2, …, c i m(i) , …, c i M(i) The code coverage corresponding to the intersection of meets the second preset condition.

[0043] The sequence generator can be used to receive sequence items generated by multiple sequence objects and send the sequence items to the driver. The driver can be used to parse the received sequence items and write the parsing results to the interface according to the interface protocol to form a stimulus for the unit to be tested or the verification IP. The first monitor can be used to record the input stimulus, the second monitor can be used to record the actual output corresponding to the recorded stimulus, the reference model can be used to obtain the reference output according to the input stimulus, and the comparison unit can be used to compare the actual output and the reference output of the same stimulus to determine whether the verification is passed according to the comparison result.

[0044] Specifically, see Figure 2 , which is a schematic diagram of the architecture of a first verification environment in a digital integrated circuit verification system for accelerating the convergence of verification coverage provided by an embodiment of the present invention. The first verification environment can be used to collect stimulus coverage. Since the simulation efficiency of the verification IP is higher than that of the RTL code corresponding to the unit to be tested, it is possible to quickly iterate in the first verification environment to adjust the constraints on the generation of sequence items from the sequence object, so that the generated sequence items correspond to the effective stimulus as much as possible, which also effectively improves the efficiency of verification using the unit to be tested.

[0045] See also Figure 3, which is a schematic diagram of the architecture of a second verification environment in a digital integrated circuit verification system for accelerating the convergence of verification coverage provided by an embodiment of the present invention. The second verification environment can be used to collect code coverage and verify by iteratively using different random stimuli so that all code segments in the RTL code can be verified as much as possible.

[0046] The generation of random stimulus can be considered to be determined by the random seed. Therefore, when performing iterative simulation in the second verification environment, each iteration round uses a different random seed to generate stimulus. Each stimulus has a number of code segments that it can cover, that is, the code coverage. It can be foreseen that when there are code segments that are difficult to cover, it may be difficult to generate the corresponding stimulus after multiple iterations. In the iteration process of this embodiment, from c i 1, c i 2, …, c i m(i) , …, c i M(i) N(i) code coverage ranges are selected as reference ranges, and the reference ranges form the benchmark range. If the non-reference range contains a code segment that is not included in the benchmark range, the random seed corresponding to the non-reference range is used as the reference seed, so as to be used as the random seed in subsequent iterations, thereby effectively improving the collection efficiency of coverage points that are difficult to cover in subsequent iterations and improving the convergence efficiency of code coverage.

[0047] In a specific embodiment, the system also includes an arbitrator, which is used to determine a sequence item from all sequence items as a target sequence item to respond when the sequence generator simultaneously receives sequence items generated by S sequence objects, and send the target sequence item to the driver, where S is an integer greater than 1.

[0048] In a specific implementation, the arbitrator is a fixed priority arbitrator, and the S sequence objects are sorted from the highest priority to the lowest priority as {D1, D2, ..., D s , …, D S}, D s is the sequence object with the sth priority among the S sequence objects, where s is an integer in the range of [1, S];

[0049] When the computer program is executed by a processor, the following steps are also implemented:

[0050] S201, when the fixed priority arbitrator responds to D s When the sequence item is sent at the first time point, detect D1, D2, ..., D s-1 The generation of sequence items;

[0051] S202, if D1, D2, ..., Ds-1 If no sequence item is generated at the first time point, the fixed-priority arbitrator verification passes; otherwise, the fixed-priority arbitrator verification fails.

[0052] Among them, since arbiters are widely used in digital integrated circuits, but there is no universal verification solution, if there is an error in the arbiter, the overall verification efficiency of the digital integrated circuit will be reduced. Therefore, this embodiment provides a verification solution for a fixed priority arbiter, thereby improving the completeness and efficiency of the verification.

[0053] Specifically, the fixed priority arbitrator rule is that when multiple sequence objects initiate requests at the same time, if a sequence object has the highest priority, the sequence item of the sequence object will be responded to first, and the sequence item of the sequence object with the second highest priority will be responded to at the next response time point. If the sequence object with the highest priority generates a sequence item before the next response time point, the sequence item of the sequence object with the second highest priority will still be responded to at the next response time point. Therefore, when the sequence item of the low priority is responded to, the sequence item of the high priority should not generate any sequence item.

[0054] In a specific implementation, the arbitrator is a round-robin priority arbitrator;

[0055] When the computer program is executed by a processor, the following steps are also implemented:

[0056] S301, when there are p sequence objects generating sequence items at the second time point at the same time, obtaining p consecutive response results after the second time point, where p is an integer in the range of [1, S];

[0057] S302: If the p response results correspond to the situation where the p sequence objects respond in turn, the polling priority arbitrator verification is passed; otherwise, the polling priority arbitrator verification is not passed.

[0058] Among them, the polling priority arbitrator rule is that when multiple sequence objects initiate requests at the same time, if a sequence object has the highest priority, the sequence item of the sequence object will be responded to first, and then the priority of the sequence object will become the lowest level, and the priorities of other sequence objects will be increased by one level respectively, and the sequence item of the sequence object with the highest real-time priority will be responded to at the next response time point. If before the next response time point, the sequence object with the highest priority previously generates a sequence item again, then the sequence item of the sequence object will not continue to be responded to at the next response time point. Therefore, when multiple sequence objects initiate requests at the same time, multiple sequence objects should be responded to according to the real-time priority to achieve the effect of responding in turns.

[0059] In a specific implementation, the following steps are further included after step S102:

[0060] S401, performing iterative simulation in the first verification environment until the flip coverage in the first verification environment meets a third preset condition, and executing step S103.

[0061] The flip coverage may mean that the interface signals have been flipped, that is, the signals have been changed from a low level to a high level, and from a high level to a low level.

[0062] In a specific implementation manner, the flip coverage ratio in the first verification environment satisfies a third preset condition, which means that the flip coverage ratio is greater than a preset third threshold value.

[0063] In another embodiment, the flip coverage in the first verification environment satisfies the third preset condition and may also mean that the flip coverage converges and / or the flip coverage is greater than a preset third threshold.

[0064] In a specific implementation, the incentive coverage ratio meeting a first preset condition means that the incentive coverage ratio is greater than a preset first threshold value.

[0065] In another embodiment, the incentive coverage ratio meeting the first preset condition may also mean that the incentive coverage ratio converges and / or the incentive coverage ratio is greater than a preset first threshold.

[0066] In a specific implementation manner, the code coverage of the unit to be tested satisfies a second preset condition, which means that the code coverage is greater than a preset second threshold.

[0067] In another embodiment, the code coverage rate satisfying the second preset condition may also refer to the code coverage rate converging and / or the code coverage rate being greater than a preset second threshold value.

[0068] In this embodiment, verification IP is used to replace the unit to be tested in the early stage of verification, thereby accelerating the simulation and allowing the verification process to iterate quickly, and then continuously adjusting the constraints generated by the sequence items, so that the stimulus coverage in the verification plan can converge quickly, so as to provide richer and more complete stimuli for the verification of the unit to be tested later. When verifying the unit to be tested, the random seeds in the random seeds that have a gain effect on the code coverage are recorded, so that in subsequent regression, the collection efficiency of coverage points that are difficult to cover can be effectively improved, and the convergence efficiency of the code coverage can be improved, thereby improving the efficiency of the convergence of the verification coverage in the digital integrated circuit verification system.

[0069] Although some specific embodiments of the present invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present invention. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present invention. The scope of the present invention is defined by the appended claims.

Claims

1. A digital integrated circuit verification system for accelerating verification coverage convergence, characterized in that: The system comprises: a unit to be tested, a verification IP, an input proxy module, an output proxy module, a reference model, a comparison unit, a processor and a memory storing a computer program, wherein the input proxy module comprises a sequencer, a driver and a first monitor, and the output proxy module comprises a second monitor. When the computer program is executed by the processor, the following steps are implemented: S101, forming a first verification environment by the verification IP, the input proxy module, the output proxy module, the reference model and the comparison unit; S102, performing iterative simulation in the first verification environment, collecting the stimulus sent by the driver to the verification IP, determining the stimulus coverage, and iteratively adjusting the constraints when the sequence object corresponding to the sequence generator generates sequence items according to the stimulus coverage, until the stimulus coverage satisfies a first preset condition, wherein the stimulus coverage satisfies the first preset condition means that: the stimulus coverage is greater than a preset first threshold; S103, forming a second verification environment by the unit to be tested, the input proxy module, the output proxy module, the reference model and the comparison unit; S104, performing iterative simulation in the second verification environment until the code coverage of the unit to be tested meets a second preset condition, and the verification is completed, wherein the code coverage of the unit to be tested meets the second preset condition means that the code coverage is greater than a preset second threshold; Step S104 also includes the following steps: S1041, initializing iteration round i=1; S1042, set M(i) random seeds {a i 1, a i 2, …, a i m(i) , …, a i M(i) }, a i m(i) is the m(i)th random seed set in the i-th iteration round, where m(i) is an integer in the range [1, M(i)], according to a i m(i) Generate the corresponding stimulus b i m(i) , use b i m(i) The second verification environment is simulated to obtain b i m(i) The code coverage c corresponding to the unit to be tested i m(i) ; S1043, from c i 1, c i 2, …, c i m(i) , …, c i M(i) Select N(i) code coverage ranges as reference ranges, and other code coverage ranges as non-reference ranges, N(i) is an integer in the range [1, M(i)], and take the intersection of all reference ranges to obtain the benchmark range; S1044, traverse each non-reference range, take the intersection of the non-reference range and the reference range to obtain an intermediate range, and if the intermediate range is larger than the reference range, use the random seed corresponding to the non-reference range as a reference seed to obtain R(i) reference seeds, and increase the iteration round i by 1; S1045, returning to execute steps S1042 to S1044, in step S1042, the set M(i) random seeds include all reference seeds, in step S1043, the code coverage range corresponding to each reference seed is used as the reference range, until c i 1, c i 2, …, c i m(i) , …, c i M(i) The code coverage corresponding to the intersection of meets the second preset condition.

2. The digital integrated circuit verification system for accelerating verification coverage convergence according to claim 1, characterized in that: The system also includes an arbitrator, which is used to determine a sequence item from all sequence items as a target sequence item to respond when the sequence generator simultaneously receives sequence items generated by S sequence objects, and send the target sequence item to the driver, where S is an integer greater than 1.

3. The digital integrated circuit verification system for accelerating verification coverage convergence according to claim 2, characterized in that: The arbitrator is a fixed priority arbitrator, and the S sequence objects are sorted from large to small according to their priorities as follows: {D1, D2, ..., D s , …, D S }, D s is the sequence object with the sth priority among the S sequence objects, where s is an integer in the range of [1, S]; When the computer program is executed by a processor, the following steps are also implemented: S201, when the fixed priority arbitrator responds to D s When the sequence item is sent at the first time point, detect D1, D2, ..., D s-1 The generation of sequence items; S202, if D1, D2, ..., D s-1 If no sequence item is generated at the first time point, the fixed-priority arbitrator verification passes; otherwise, the fixed-priority arbitrator verification fails.

4. The digital integrated circuit verification system for accelerating verification coverage convergence according to claim 2, characterized in that: The arbitrator is a round-robin priority arbitrator; When the computer program is executed by a processor, the following steps are also implemented: S301, when there are p sequence objects generating sequence items at the second time point at the same time, obtaining p consecutive response results after the second time point, where p is an integer in the range of [1, S]; S302: If the p response results correspond to the situation where the p sequence objects respond in turn, the polling priority arbitrator verification is passed; otherwise, the polling priority arbitrator verification is not passed.

5. The digital integrated circuit verification system for accelerating verification coverage convergence according to claim 1, characterized in that: After step S102, the following steps are also included: S401, performing iterative simulation in the first verification environment until the flip coverage in the first verification environment meets a third preset condition, and executing step S103.

6. The digital integrated circuit verification system for accelerating verification coverage convergence according to claim 5, characterized in that: The flip coverage ratio under the first verification environment satisfies a third preset condition, which means that the flip coverage ratio is greater than a preset third threshold.