Verification Academy

Search form

My Account Menu

  • Register
  • Log In
  • Topics
  • Courses
  • Forums
  • Patterns Library
  • Cookbooks
  • Events
  • More
  • All Topics
    The Verification Academy offers users multiple entry points to find the information they need. One of these entry points is through Topic collections. These topics are industry standards that all design and verification engineers should recognize. While we continue to add new topics, users are encourage to further refine collection information to meet their specific interests.
    • Languages & Standards

      • Portable Test and Stimulus
      • Functional Safety
      • Design & Verification Languages
    • Methodologies

      • UVM - Universal Verification Methodology
      • UVM Framework
      • UVM Connect
      • FPGA Verification
      • Coverage
    • Techniques & Tools

      • Verification IQ
      • Verification IP
      • Static-Based Techniques
      • Simulation-Based Techniques
      • Planning, Measurement, and Analysis
      • Formal-Based Techniques
      • Debug
      • Acceleration
  • All Courses
    The Verification Academy is organized into a collection of free online courses, focusing on various key aspects of advanced functional verification. Each course consists of multiple sessions—allowing the participant to pick and choose specific topics of interest, as well as revisit any specific topics for future reference. After completing a specific course, the participant should be armed with enough knowledge to then understand the necessary steps required for maturing their own organization’s skills and infrastructure on the specific topic of interest. The Verification Academy will provide you with a unique opportunity to develop an understanding of how to mature your organization’s processes so that you can then reap the benefits that advanced functional verification offers.
    • Universal Verification Methodology (UVM)

      • Introduction to UVM
      • UVM Basics
      • Advanced UVM
      • UVM Connect
      • UVM Debug
      • UVMF - One Bite at a Time
    • Featured Courses

      • Introduction to ISO 26262
      • Introduction to DO-254
      • Clock-Domain Crossing Verification
      • Portable Stimulus Basics
      • Power Aware CDC Verification
      • Power Aware Verification
      • SystemVerilog OOP for UVM Verification
    • Additional Courses

      • Assertion-Based Verification
      • An Introduction to Unit Testing with SVUnit
      • Evolving FPGA Verification Capabilities
      • Metrics in SoC Verification
      • SystemVerilog Testbench Acceleration
      • Testbench Co-Emulation: SystemC & TLM-2.0
      • Verification Planning and Management
      • VHDL-2008 Why It Matters
    • Formal-Based Techniques

      • Formal Assertion-Based Verification
      • Formal-Based Technology: Automatic Formal Solutions
      • Formal Coverage
      • Getting Started with Formal-Based Technology
      • Handling Inconclusive Assertions in Formal Verification
      • Sequential Logic Equivalence Checking
    • Analog/Mixed Signal

      • AMS Design Configuration Schemes
      • Improve AMS Verification Performance
      • Improve AMS Verification Quality
  • All Forum Topics
    The Verification Community is eager to answer your UVM, SystemVerilog and Coverage related questions. We encourage you to take an active role in the Forums by answering and commenting to any questions that you are able to.
    • UVM Forum

      • Active Questions
      • Solutions
      • Replies
      • No Replies
      • Search
      • UVM Forum
    • SystemVerilog Forum

      • Active Questions
      • Solutions
      • Replies
      • No Replies
      • Search
      • SystemVerilog Forum
    • Coverage Forum

      • Active Questions
      • Solutions
      • Replies
      • No Replies
      • Search
      • Coverage Forum
    • Additional Forums

      • Announcements
      • Downloads
      • OVM Forum
  • Patterns Library
    The Verification Academy Patterns Library contains a collection of solutions to many of today's verification problems. The patterns contained in the library span across the entire domain of verification (i.e., from specification to methodology to implementation—and across multiple verification engines such as formal, simulation, and emulation).
    • Implementation Patterns

      • Environment Patterns
      • Stimulus Patterns
      • Analysis Patterns
      • All Implementation Patterns
    • Specification Patterns

      • Occurrence Property Patterns
      • Order Property Patterns
      • All Specification Patterns
    • Pattern Resources

      • Start Here - Patterns Library Overview
      • Whitepaper - Taking Reuse to the Next Level
      • Verification Horizons - The Verification Academy Patterns Library
      • Contribute a Pattern to the Library
  • All Cookbooks
    Find all the methodology you need in this comprehensive and vast collection. The UVM and Coverage Cookbooks contain dozens of informative, executable articles covering all aspects of UVM and Coverage.
    • UVM Cookbook

      • UVM Basics
      • Testbench Architecture
      • DUT-Testbench Connections
      • Configuring a Test Environment
      • Analysis Components & Techniques
      • End Of Test Mechanisms
      • Sequences
      • The UVM Messaging System
      • Other Stimulus Techniques
      • Register Abstraction Layer
      • Testbench Acceleration through Co-Emulation
      • Debug of SV and UVM
      • UVM Connect - SV-SystemC interoperability
      • UVM Versions and Compatibility
      • UVM Cookbook
    • Coding Guidelines & Deployment

      • Code Examples
      • UVM Verification Component
      • Package/Organization
      • Questa/Compiling UVM
      • SystemVerilog Guidelines
      • SystemVerilog Performance Guidelines
      • UVM Guidelines
      • UVM Performance Guidelines
    • Coverage Cookbook

      • Introduction
      • What is Coverage?
      • Kinds of Coverage
      • Specification to Testplan
      • Testplan to Functional Coverage
      • Bus Protocol Coverage
      • Block Level Coverage
      • Datapath Coverage
      • SoC Coverage Example
      • Requirements Writing Guidelines
      • Coverage Cookbook
  • All Events
    No one argues that the challenges of verification are growing exponentially. What is needed to meet these challenges are tools, methodologies and processes that can help you transform your verification environment. These recorded seminars from Verification Academy trainers and users provide examples for adoption of new technologies and how to evolve your verification process.
    • Featured & On-Demand

      • Continuous Integration - March 28th
      • Questa Verification IQ - April 11th
      • SystemVerilog Assertions
      • SoC Design & Functional Safety Flow
      • 2022 Functional Verification Study
      • Design Solutions as a Sleep Aid
      • CDC and RDC Assist
      • Formal and the Next Normal
      • Protocol and Memory Interface Verification
      • Webinar Calendar
    • On-Demand Library

      • Practical Flows for Continuous Integration
      • Lint vs Formal AutoCheck
      • The Three Pillars of Intent-Focused Insight
      • Formal Verification Made Easy
      • Fix FPGA Failures Faster
      • HPC Protocols & Memories
      • FPGA Design Challenges
      • High Defect Coverage
      • The Dog ate my RTL
      • Questa Lint & CDC
      • Complex Safety Architectures
      • Data Independence and Non-Determinism
      • Hierarchical CDC+RDC
      • All On-Demand Recordings
    • Recording Archive

      • Aerospace & Defense Tech Day
      • Exhaustive Scoreboarding
      • Improving Initial RTL Quality
      • CDC Philosophy
      • Hardware Emulation Productivity
      • Visualizer Debug Environment
      • Preparing for PCIe 6.0: Parts I & II
      • Automotive Functional Safety Forum
      • Siemens EDA Functional Verification
      • Improving Your SystemVerilog & UVM Skills
      • All Webinar Topics
    • Conferences & WRG

      • Industry Data & Surveys
      • DVCon 2023
      • DVCon 2022
      • DVCon 2021
      • Osmosis 2022
      • All Conferences
    • Siemens EDA Learning Center

      • SystemVerilog Fundamentals
      • SystemVerilog UVM
      • EDA Xcelerator Academy(Learning Services) Verification Training, Badging and Certification
      • View all Learning Paths
  • About Verification Academy
    The Verification Academy will provide you with a unique opportunity to develop an understanding of how to mature your organization's processes so that you can then reap the benefits that advanced functional verification offers.
    • Blog & News

      • Verification IQ
      • Verification Horizons Blog
      • Technical Resources
    • Verification Horizons Publication

      • Verification Horizons - March 2023
      • Verification Horizons - December 2022
      • Verification Horizons - July 2022
      • Issue Archive
    • About Us

      • Verification Academy Overview
      • Subject Matter Experts
      • Academy News
      • Contact Us
    • Training

      • Learning @OneGlance (PDF)
      • SystemVerilog & UVM Classes
      • Siemens EDA Classes
Ask a Question
SystemVerilog
  • Home
  • Forums
  • SystemVerilog
  • concurrent assignment to Local Variable

concurrent assignment to Local Variable

SystemVerilog 6308
#System verilog 45 #systemverilog #ASSERTION 110
a72
a72
Full Access
36 posts
October 15, 2022 at 5:00 pm

In the following assertion what will be the value of x if both subsequences end at the same time? Will it be indeterministic?

sequence s1;
int x;
((a ##[1:5] b, x = data1) or (d ##2 e, x = data2)) ##1 (data == x);
endsequence

if both subsequences (a ##[1:5] b) and (d ##2 e) match at the same time, what will be the value assigned to x?

Thanks.

Replies

Log In to Reply
ben@SystemVerilog.us
ben@SystemVerilog.us
Full Access
2598 posts
October 15, 2022 at 7:10 pm

In reply to a72:
From my SVA book:
2.7.9.1 Variables assigned on parallel “or” threads  Rule:
When two sequences are ORed, each sequence produces its own thread that can get carried through to the next step, such as an end point (no more continuity), concatenation with another sequence, or as antecedent to a consequent. For example,

(sequence1 or sequence2) ##1 seq3                               
// is equivalent to         
(sequence1 ##1 sequence3) or (sequence1 ## sequence3)         // two threads  
If the sequence makes assignments to local variables, then each of the sequence involved in the ORing carries its own individual and separate copy of the local variables. Those separate copies of the local variables are carried all the way through each of the ORed sequence thread.
// Consider the following property:  
property p_abv; 
  bit v;  
  (a, v=1) or (b, v=0) |=> v==1;     
endproperty : p_abv  
/* The antecedent of this property has two threads  (a, v=1) and (b, v=0); each of those thread carries its own individual copy of the local variable.  In the consequent, each antecedent thread must be evaluated with consequent.  In this case, the individual copy of the local variable for each thread is carried into the consequent when that thread is evaluated.   Thus for thread (a, v=1) the v in the consequent is the copy used in that thread.  Similarly, for thread (b, v=0) the v in the consequent is the copy used in that thread.   The equivalent property to p_abv is the following:*/
property p_abv_eqv; 
  bit v1, v2;  
   ( (a, v1=1'b1) |=> v1==1)  and  
   ( (b, v2=1'b0) |=> v2==1); 
endproperty : p_abv_eqv  
// In the above example, if a==1'b1, and b==1'b1, then the property will fail. 

Your property:
sequence s1;
  int x;
  ((a ##[1:5] b, x = data1) or (d ##2 e, x = data2)) ##1 (data == x);
endsequence
// Is same as: 
sequence s1;
int x1, x2;
((a ##[1:5] b, x1 = data1) ##1 (data == x1))  or 
((d ##2 e,     x2 = data2) ##1 (data == x2));
endsequence

There are quite a few rules in using local variables. In general, it is better to keep thing simple.
---
Ben Cohen
http://www.systemverilog.us/
** SVA Handbook 4th Edition, 2016 ISBN 978-1518681448
...
1) SVA Package: Dynamic and range delays and repeats https://rb.gy/a89jlh
2) Free books:
* Component Design by Example https://rb.gy/9tcbhl
* Real Chip Design and Verification Using Verilog and VHDL($3) https://rb.gy/cwy7nb
* A Pragmatic Approach to VMM Adoption
http://SystemVerilog.us/vf/VMM/VMM_pdf_release070506.zip
http://SystemVerilog.us/vf/VMM/VMM_code_release_071806.tar
3) Papers:
Understanding the SVA Engine,
https://verificationacademy.com/verification-horizons/july-2020-volume-16-issue-2
Reflections on Users’ Experiences with SVA, part 1 and part 2
https://verificationacademy.com/verification-horizons/march-2022-volume-18-issue-1/reflections-on-users-experiences-with-systemverilog-assertions-sva

https://verificationacademy.com/verification-horizons/july-2022-volume-18-issue-2/reflections-on-users-experiences-with-sva-part-2

SUPPORT LOGIC AND THE ALWAYS PROPERTY
http://systemverilog.us/vf/support_logic_always.pdf
SVA Alternative for Complex Assertions
https://verificationacademy.com/news/verification-horizons-march-2018-issue
SVA in a UVM Class-based Environment
https://verificationacademy.com/verification-horizons/february-2013-volume-9-issue-1/SVA-in-a-UVM-Class-based-Environment
SVA for statistical analysis of a weighted work-conserving prioritized round-robin arbiter.
https://verificationacademy.com/forums/coverage/sva-statistical-analysis-weighted-work-conserving-prioritized-round-robin-arbiter.

Udemy courses by Srinivasan Venkataramanan (http://cvcblr.com/home.html)
https://www.udemy.com/course/sva-basic/
https://www.udemy.com/course/sv-pre-uvm/

a72
a72
Full Access
36 posts
October 16, 2022 at 7:28 am

Thanks much, Ben. Have been using local variables for some time now, but wasn't aware of these nuances.

I had created an example to see how this works. Here's the EDA playground link.

The assertion is the same as posted above except that I added a few $display statements attached to sub-sequences.

sequence s1;
int y, y1;
( (a ##[1:5] b, y = data1, $display($stime,,,"From sequence s1 : A B complete y=%0b",y)) ) or
(d ##2 e, y = data2, $display($stime,,,"From seqeunce D E complete y=%0b",y) ) ##1 (1'b1,$display($stime,,,"y=%b",y) );
endsequence

When I simulate this, the subsequence " ##1 (1'b1,$display($stime,,,"y=%b", y) ); " never gets executed, even when one of the OR subsequence is satisfied. I don't understand that. Please see the EDA playground example.

Thanks in advance.

ben@SystemVerilog.us
ben@SystemVerilog.us
Full Access
2598 posts
October 16, 2022 at 11:25 am

In reply to a72:
Before responding to your specific question, let me take this simple assertion.
Should the assertion pass or fail?

property p1;
    int v; 
    (1, v=0) ##[1:2] (1, v=v+1) ##0 v==2;  
  endproperty
  ap1: assert property(@ (posedge clk) p1);  
// It fails because it has 2 threads, and each thread has its own separate copy 
// of the local variable.  It is equivalent to 
((1, v=0) ##[1] (1, v=v+1) ##0 v==2) or //  This "v" is separate from 
((1, v=0) ##[2] (1, v=v+1) ##0 v==2);  //   this "v" 
// Note: v==1 at the end of each thread
// Each thread has its own local variable v

The thread viewer demonstrates this very well.
See below for your specific model.
http://systemverilog.us/vf/temp1016.sv
http://systemverilog.us/vf/temp1016.png

Quote:
When I simulate this, the subsequence " ##1 (1'b1,$display($stime,,,"y=%b", y) ); " never gets executed, even when one of the OR subsequence is satisfied. I don't understand that.

In a consequent, you are looking for a PASS. Thus, if either thread of an ORing sequence matches, then there is NO NEED to test the other thread.
See the thread viewer below.
http://systemverilog.us/vf/vr1016.png
http://systemverilog.us/vf/vr1016.sv

Ben Cohen
http://www.systemverilog.us/ ben@systemverilog.us
** SVA Handbook 4th Edition, 2016 ISBN 978-1518681448
...
1) SVA Package: Dynamic and range delays and repeats https://rb.gy/a89jlh
2) Free books:
* Component Design by Example https://rb.gy/9tcbhl
* Real Chip Design and Verification Using Verilog and VHDL($3) https://rb.gy/cwy7nb
* A Pragmatic Approach to VMM Adoption
http://SystemVerilog.us/vf/VMM/VMM_pdf_release070506.zip
http://SystemVerilog.us/vf/VMM/VMM_code_release_071806.tar
3) Papers:
Understanding the SVA Engine,
https://verificationacademy.com/verification-horizons/july-2020-volume-16-issue-2
Reflections on Users’ Experiences with SVA, part 1 and part 2
https://verificationacademy.com/verification-horizons/march-2022-volume-18-issue-1/reflections-on-users-experiences-with-systemverilog-assertions-sva
https://verificationacademy.com/verification-horizons/july-2022-volume-18-issue-2/reflections-on-users-experiences-with-sva-part-2
SUPPORT LOGIC AND THE ALWAYS PROPERTY
http://systemverilog.us/vf/support_logic_always.pdf
SVA Alternative for Complex Assertions
https://verificationacademy.com/news/verification-horizons-march-2018-issue
SVA in a UVM Class-based Environment
https://verificationacademy.com/verification-horizons/february-2013-volume-9-issue-1/SVA-in-a-UVM-Class-based-Environment
SVA for statistical analysis of a weighted work-conserving prioritized round-robin arbiter.
https://verificationacademy.com/forums/coverage/sva-statistical-analysis-weighted-work-conserving-prioritized-round-robin-arbiter.
Udemy courses by Srinivasan Venkataramanan (http://cvcblr.com/home.html)
https://www.udemy.com/course/sva-basic/
https://www.udemy.com/course/sv-pre-uvm/

a72
a72
Full Access
36 posts
October 16, 2022 at 2:00 pm

Ben, Thanks very much. One step forward. I think I understand.

You mention:
In a consequent, you are looking for a PASS. Thus, if either thread of an ORing sequence matches, then there is NO NEED to test the other thread.

Agree.

Also, you have mentioned
((sequence1 or sequence2) ##1 seq3
// is equivalent to
(sequence1 ##1 sequence3) or (sequence1 ##1 sequence3)

I still have a question on my case, though. In my case, when sequence1 (namely, ( (a ##[1:5] b, y = data1, $display($stime,,,"From sequence s1 : A B complete y=%0b",y)) ) passes, shouldn't the " ##1 (1'b1,$display($stime,,,"y=%b", y) ); " execute? I understand that the second thread of OR is a don't care since first thread passes. But once the first thread passes, shouldn't the " ##1 (1'b1,$display($stime,,,"y=%b", y) ); " subsequence execute?

Hope the question makes sense. If not, please don't bother.
Thanks.

Solution

Solution

ben@SystemVerilog.us
ben@SystemVerilog.us
Full Access
2598 posts
October 16, 2022 at 4:21 pm

In reply to a72:
TYpo in your equivalence. It should be

((sequence1 or sequence2) ##1 seq3
// is equivalent to
(sequence1 ##1 sequence3) or (sequence2 ##1 sequence3)

Quote:
But once the first thread passes, shouldn't the " ##1 (1'b1,$display($stime,,,"y=%b", y) ); " subsequence execute?

The simulator can execute any concurrent threads in any order.
In this case, it completed the the attempted at time 15 and the next 2 threads at time 25.
At time 35 it started thread 1 and discovered that the sequence ended with a match, thus deducting that the assertion is a PASS. For efficiency reasons, it dropped any further calculations (i.e., the ##1 (1'b1,$display($stime,,,"y=%b", y) ). Do you see any reasons as to why it should finish the second thread?
:)
Ben Cohen
http://www.systemverilog.us/ ben@systemverilog.us
** SVA Handbook 4th Edition, 2016 ISBN 978-1518681448
...
1) SVA Package: Dynamic and range delays and repeats https://rb.gy/a89jlh
2) Free books:
* Component Design by Example https://rb.gy/9tcbhl
* Real Chip Design and Verification Using Verilog and VHDL($3) https://rb.gy/cwy7nb
* A Pragmatic Approach to VMM Adoption
http://SystemVerilog.us/vf/VMM/VMM_pdf_release070506.zip
http://SystemVerilog.us/vf/VMM/VMM_code_release_071806.tar
3) Papers:
Understanding the SVA Engine,
https://verificationacademy.com/verification-horizons/july-2020-volume-16-issue-2
Reflections on Users’ Experiences with SVA, part 1
https://verificationacademy.com/verification-horizons/march-2022-volume-18-issue-1/reflections-on-users-experiences-with-systemverilog-assertions-sva
Reflections on Users’ Experiences with SVA, part 2
https://verificationacademy.com/verification-horizons/july-2022-volume-18-issue-2/reflections-on-users-experiences-with-sva-part-2
SUPPORT LOGIC AND THE ALWAYS PROPERTY
http://systemverilog.us/vf/support_logic_always.pdf
SVA Alternative for Complex Assertions
https://verificationacademy.com/news/verification-horizons-march-2018-issue
SVA in a UVM Class-based Environment
https://verificationacademy.com/verification-horizons/february-2013-volume-9-issue-1/SVA-in-a-UVM-Class-based-Environment
SVA for statistical analysis of a weighted work-conserving prioritized round-robin arbiter.
https://verificationacademy.com/forums/coverage/sva-statistical-analysis-weighted-work-conserving-prioritized-round-robin-arbiter.
Udemy courses by Srinivasan Venkataramanan (http://cvcblr.com/home.html)
https://www.udemy.com/course/sva-basic/
https://www.udemy.com/course/sv-pre-uvm/
a72
a72
Full Access
36 posts
October 17, 2022 at 9:52 am

I spent hours trying to figure out why " ##1 (1'b1,$display($stime,,,"y=%b", y) )" was not being executed. For the developers to not execute it for efficiency reasons does not make sense. I wanted to know the final value of 'y' after one or more of the OR threads pass. If a thread is slated to execute, it must be executed.

But thanks very much for taking time to explain the concepts in such detail. I learnt a lot. Much appreciated. Thanks.

ben@SystemVerilog.us
ben@SystemVerilog.us
Full Access
2598 posts
October 17, 2022 at 11:28 am

In reply to a72:

Quote:

For the developers to not execute it for efficiency reasons does not make sense. I wanted to know the final value of 'y' after one or more of the OR threads pass. If a thread is slated to execute, it must be executed.

If your interest is on the y, write a separate assertion with only the following as the consequent
(d ##2 e, y = data2, $display($stime,,,"From seqeunce D E complete y=%0b",y) ) ##1 (1'b1,$display($stime,,,"y=%b",y) );
Actually, optimization DOES make sense. There is no requirement in 1800 to provide extra information as long as the assertion meets the 1800 requirements (pass or fail).
You do that as a person. For example, you want either a veggie burger with tomatoes on a wheat bun (ANDing) or a salad that includes (the and)shrimp. The attendant says I have the salad and the shrimp, but I have no tomatoes and on the burger, I only have the kind ...
** You interrupt and say, "never mind on the burger; I have no interest if it's regular meat or veggie burger since you did not match my interest with tomatoes". Why did you short-circuit the conversation with the attendant? .. because you're hungry? time is of value?

A bit more on local variables. From my book:
2.7.9 Local variables in concurrent and, or, and intersect threads (rule 14)
 Rule: When local variables are used in sequences that have concurrent threads, it is possible that the values of the local variables may not be assigned, or assigned by one thread and not the other, or assigned in both threads at the same or at different cycles with different values. Concurrent threads in sequences occur with the use of the and, or, and intersect operators. [1] In general, there is no guarantee that evaluation of the two threads results in consistent values for the local variable, or even that there is a consistent view of whether the local variable has been assigned a value. Therefore, the values assigned to the local variable before and during the evaluation of the composite sequence are not always allowed to be visible after the evaluation of the composite sequence. Below are some examples of local variable flow.

// ORing causes 2 separate threads, each with local copies of local variables (LV). 
// In each thread, the LVs must have a value before being read.
sequence q_err; int x;
(a ##1 (b, x=dt) ##1 c) or
(d ##1 e==x); // x read, but not written
 
ap: assert property(@(posedge clk)q_no_out_flow);  
 
      sequence q_no_out_flow;
        bit v, v2;
        (
        ((a, v=x) ##1 b) and // also for the intersect
        (c ##1 (d, v=y))
        )
        ##1 v==1; //  v is blocked from flowing out // because it is common to both threads
        endsequence : q_no_out_flow
// ** Error: Local variable v referenced in expression where it does not flow.
Siemens Digital Industries Software

Siemens Digital Industries Software

#TodayMeetsTomorrow

Portfolio

  • Cloud
  • Mendix
  • Electronic Design Automation
  • MindSphere
  • Design, Manufacturing and PLM Software
  • View all Portfolio

Explore

  • Community
  • Blog
  • Online Store

Siemens

  • About Us
  • Careers
  • Events
  • News and Press
  • Customer Stories
  • Partners
  • Trust Center

Contact

  • VA - Contact Us
  • PLM - Contact Us
  • EDA - Contact Us
  • Worldwide Offices
  • Support Center
  • Give us Feedback
© Siemens 2023
Terms of Use Privacy Statement Cookie Statement DMCA