// Author: schuessf@informatik.uni-freiburg.de
// Date: 2023-05-10

PetriNet net = (
  alphabet = {a b c d e},
  places = {p1 p2 p3 p4 p5 p6 p7},
  transitions = {
    ({p1} a {p2 p3 p6})
    ({p2} b {p4})
    ({p2} e {p4})
    ({p3} c {p5})
    ({p4 p5 p7} d {p2 p3 p6})
    ({p6} d {p7})
  },
  initialMarking = {p1},
  acceptingPlaces = {p5}
);

assert(!buchiIsEmpty(net));