Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100299.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyB-PT-B03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 626K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779705360224

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 10:36:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:36:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:36:02] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2026-05-25 10:36:02] [INFO ] Transformed 1529 places.
[2026-05-25 10:36:02] [INFO ] Transformed 2131 transitions.
[2026-05-25 10:36:02] [INFO ] Found NUPN structural information;
[2026-05-25 10:36:02] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyB-PT-B03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 1529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 1410 transition count 2012
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 1410 transition count 2012
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 311 place count 1337 transition count 1939
Iterating global reduction 0 with 73 rules applied. Total rules applied 384 place count 1337 transition count 1939
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 427 place count 1294 transition count 1896
Iterating global reduction 0 with 43 rules applied. Total rules applied 470 place count 1294 transition count 1896
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 508 place count 1256 transition count 1858
Iterating global reduction 0 with 38 rules applied. Total rules applied 546 place count 1256 transition count 1858
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 579 place count 1223 transition count 1825
Iterating global reduction 0 with 33 rules applied. Total rules applied 612 place count 1223 transition count 1825
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 645 place count 1190 transition count 1792
Iterating global reduction 0 with 33 rules applied. Total rules applied 678 place count 1190 transition count 1792
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 710 place count 1158 transition count 1760
Iterating global reduction 0 with 32 rules applied. Total rules applied 742 place count 1158 transition count 1760
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 774 place count 1126 transition count 1728
Iterating global reduction 0 with 32 rules applied. Total rules applied 806 place count 1126 transition count 1728
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 833 place count 1099 transition count 1701
Iterating global reduction 0 with 27 rules applied. Total rules applied 860 place count 1099 transition count 1701
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 881 place count 1078 transition count 1680
Iterating global reduction 0 with 21 rules applied. Total rules applied 902 place count 1078 transition count 1680
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 907 place count 1078 transition count 1675
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 915 place count 1070 transition count 1667
Iterating global reduction 1 with 8 rules applied. Total rules applied 923 place count 1070 transition count 1667
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 931 place count 1062 transition count 1659
Iterating global reduction 1 with 8 rules applied. Total rules applied 939 place count 1062 transition count 1659
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 942 place count 1059 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 945 place count 1059 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 948 place count 1056 transition count 1653
Iterating global reduction 1 with 3 rules applied. Total rules applied 951 place count 1056 transition count 1653
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 954 place count 1053 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 957 place count 1053 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 960 place count 1050 transition count 1647
Iterating global reduction 1 with 3 rules applied. Total rules applied 963 place count 1050 transition count 1647
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 966 place count 1047 transition count 1644
Iterating global reduction 1 with 3 rules applied. Total rules applied 969 place count 1047 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 972 place count 1044 transition count 1641
Iterating global reduction 1 with 3 rules applied. Total rules applied 975 place count 1044 transition count 1641
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 978 place count 1041 transition count 1638
Iterating global reduction 1 with 3 rules applied. Total rules applied 981 place count 1041 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 984 place count 1038 transition count 1635
Iterating global reduction 1 with 3 rules applied. Total rules applied 987 place count 1038 transition count 1635
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 990 place count 1035 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 993 place count 1035 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 996 place count 1032 transition count 1629
Iterating global reduction 1 with 3 rules applied. Total rules applied 999 place count 1032 transition count 1629
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1002 place count 1032 transition count 1626
Applied a total of 1002 rules in 1731 ms. Remains 1032 /1529 variables (removed 497) and now considering 1626/2131 (removed 505) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2665064675226131771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5121348316155546485.kers'
[2026-05-25 10:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2665064675226131771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5121348316155546485.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1626 rows 1032 cols 7553 entries
Finished phase 1 with 1026 SingleSign rule and 0 generalized
[2026-05-25 10:36:04] [INFO ] Computed 6 invariants in 14 ms
Computed 6 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-5121348316155546485.kers
Total runtime 16 ms.
[2026-05-25 10:36:05] [INFO ] Implicit Places using invariants in 1513 ms returned []
[2026-05-25 10:36:06] [INFO ] Invariant cache hit.
[2026-05-25 10:36:08] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
Running 1625 sub problems to find dead transitions.
[2026-05-25 10:36:08] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1031/2658 variables, and 0 constraints, problems are : Problem set: 0 solved, 1625 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1032 constraints, PredecessorRefiner: 1625/1625 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1031/2658 variables, and 0 constraints, problems are : Problem set: 0 solved, 1625 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1032 constraints, PredecessorRefiner: 0/1625 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61735ms problems are : Problem set: 0 solved, 1625 unsolved
Search for dead transitions found 0 dead transitions in 61765ms
Starting structural reductions in LTL mode, iteration 1 : 1032/1529 places, 1626/2131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67410 ms. Remains : 1032/1529 places, 1626/2131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Applied a total of 0 rules in 48 ms. Remains 1032 /1032 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2026-05-25 10:37:10] [INFO ] Invariant cache hit.
[2026-05-25 10:37:11] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2026-05-25 10:37:11] [INFO ] Invariant cache hit.
[2026-05-25 10:37:12] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2762 ms. Remains : 1032/1032 places, 1626/1626 transitions.
Support contains 16 out of 1032 places after structural reductions.
[2026-05-25 10:37:13] [INFO ] Flatten gal took : 160 ms
[2026-05-25 10:37:13] [INFO ] Flatten gal took : 88 ms
[2026-05-25 10:37:13] [INFO ] Input system was already deterministic with 1626 transitions.
RANDOM walk for 40000 steps (423 resets) in 1300 ms. (30 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (78 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
[2026-05-25 10:37:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 624/629 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 403/1032 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1626/2658 variables, 1032/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2658 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2658 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2658/2658 variables, and 1038 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1032/1032 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 624/629 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/629 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 403/1032 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 6493ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Graph (trivial) has 1018 edges and 1032 vertex of which 79 / 1032 are part of one of the 15 SCC in 18 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 1650 edges and 968 vertex of which 962 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 717 transitions
Trivial Post-agglo rules discarded 717 transitions
Performed 717 trivial Post agglomeration. Transition count delta: 717
Iterating post reduction 0 with 722 rules applied. Total rules applied 724 place count 962 transition count 816
Reduce places removed 717 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 734 rules applied. Total rules applied 1458 place count 245 transition count 799
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1466 place count 238 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1467 place count 237 transition count 798
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1467 place count 237 transition count 739
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1585 place count 178 transition count 739
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1588 place count 175 transition count 736
Iterating global reduction 4 with 3 rules applied. Total rules applied 1591 place count 175 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1591 place count 175 transition count 735
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1593 place count 174 transition count 735
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1596 place count 171 transition count 732
Iterating global reduction 4 with 3 rules applied. Total rules applied 1599 place count 171 transition count 732
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1600 place count 170 transition count 731
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 170 transition count 731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 170 transition count 730
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1674 place count 134 transition count 693
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1682 place count 134 transition count 685
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 1709 place count 107 transition count 237
Iterating global reduction 6 with 27 rules applied. Total rules applied 1736 place count 107 transition count 237
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1751 place count 107 transition count 222
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1763 place count 95 transition count 210
Iterating global reduction 7 with 12 rules applied. Total rules applied 1775 place count 95 transition count 210
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1785 place count 85 transition count 200
Iterating global reduction 7 with 10 rules applied. Total rules applied 1795 place count 85 transition count 200
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1800 place count 85 transition count 195
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1814 place count 78 transition count 188
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1824 place count 73 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1826 place count 73 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1827 place count 73 transition count 193
Free-agglomeration rule applied 27 times.
Iterating global reduction 9 with 27 rules applied. Total rules applied 1854 place count 73 transition count 166
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 1886 place count 46 transition count 161
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1891 place count 41 transition count 156
Iterating global reduction 10 with 5 rules applied. Total rules applied 1896 place count 41 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 10 with 34 rules applied. Total rules applied 1930 place count 41 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1932 place count 40 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1936 place count 38 transition count 139
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1937 place count 38 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1938 place count 37 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1940 place count 37 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1941 place count 37 transition count 137
Applied a total of 1941 rules in 274 ms. Remains 37 /1032 variables (removed 995) and now considering 137/1626 (removed 1489) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 37/1032 places, 137/1626 transitions.
RANDOM walk for 582 steps (0 resets) in 28 ms. (20 steps per ms) remains 0/3 properties
FORMULA MedleyB-PT-B03-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 219 stabilizing places and 229 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 3 out of 1032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Graph (trivial) has 1021 edges and 1032 vertex of which 83 / 1032 are part of one of the 15 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 706 transitions
Trivial Post-agglo rules discarded 706 transitions
Performed 706 trivial Post agglomeration. Transition count delta: 706
Iterating post reduction 0 with 706 rules applied. Total rules applied 707 place count 963 transition count 841
Reduce places removed 706 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 723 rules applied. Total rules applied 1430 place count 257 transition count 824
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1439 place count 250 transition count 822
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1441 place count 248 transition count 822
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1441 place count 248 transition count 767
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1551 place count 193 transition count 767
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1558 place count 186 transition count 760
Iterating global reduction 4 with 7 rules applied. Total rules applied 1565 place count 186 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1565 place count 186 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1567 place count 185 transition count 759
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1570 place count 182 transition count 756
Iterating global reduction 4 with 3 rules applied. Total rules applied 1573 place count 182 transition count 756
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1574 place count 181 transition count 755
Iterating global reduction 4 with 1 rules applied. Total rules applied 1575 place count 181 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1576 place count 181 transition count 754
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 1652 place count 143 transition count 716
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 1681 place count 114 transition count 270
Iterating global reduction 5 with 29 rules applied. Total rules applied 1710 place count 114 transition count 270
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1725 place count 114 transition count 255
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1740 place count 99 transition count 235
Iterating global reduction 6 with 15 rules applied. Total rules applied 1755 place count 99 transition count 235
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1770 place count 84 transition count 215
Iterating global reduction 6 with 15 rules applied. Total rules applied 1785 place count 84 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1790 place count 84 transition count 210
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1808 place count 75 transition count 217
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1809 place count 74 transition count 207
Iterating global reduction 7 with 1 rules applied. Total rules applied 1810 place count 74 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1811 place count 74 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1816 place count 74 transition count 201
Applied a total of 1816 rules in 105 ms. Remains 74 /1032 variables (removed 958) and now considering 201/1626 (removed 1425) transitions.
[2026-05-25 10:37:21] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2553198142854101734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13426547386953595388.kers'
[2026-05-25 10:37:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2553198142854101734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13426547386953595388.kers]
Normalized transition count is 194 out of 195 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 194 rows 73 cols 1066 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-25 10:37:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13426547386953595388.kers
Total runtime 1 ms.
[2026-05-25 10:37:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 10:37:21] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2026-05-25 10:37:21] [INFO ] Invariant cache hit.
[2026-05-25 10:37:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:37:21] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2026-05-25 10:37:21] [INFO ] Redundant transitions in 4 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 10:37:21] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2026-05-25 10:37:21] [INFO ] Invariant cache hit.
[2026-05-25 10:37:21] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 194/268 variables, 74/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 125 constraints, problems are : Problem set: 0 solved, 184 unsolved in 23766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 194/268 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 184/309 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 1/269 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 314 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53873ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 53874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/1032 places, 201/1626 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54237 ms. Remains : 74/1032 places, 201/1626 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-04 finished in 54693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p0)))))'
Support contains 2 out of 1032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1026 transition count 1620
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1026 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1022 transition count 1616
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1022 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 1019 transition count 1613
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 1019 transition count 1613
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 1016 transition count 1610
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 1016 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1014 transition count 1608
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1014 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1012 transition count 1606
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1012 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1010 transition count 1604
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1010 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1008 transition count 1602
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1008 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1006 transition count 1600
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1006 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1004 transition count 1598
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1003 transition count 1597
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1002 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1002 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1001 transition count 1595
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1001 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1000 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1000 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 999 transition count 1593
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 999 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 998 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 998 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 997 transition count 1591
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 997 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 996 transition count 1590
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 996 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 995 transition count 1589
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 995 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 994 transition count 1588
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 994 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 993 transition count 1587
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 993 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 992 transition count 1586
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 992 transition count 1586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 992 transition count 1585
Applied a total of 81 rules in 1084 ms. Remains 992 /1032 variables (removed 40) and now considering 1585/1626 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6047352922897059292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12926968882088509749.kers'
[2026-05-25 10:38:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6047352922897059292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12926968882088509749.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1585 rows 992 cols 7465 entries
Finished phase 1 with 986 SingleSign rule and 0 generalized
[2026-05-25 10:38:16] [INFO ] Computed 6 invariants in 26 ms
Computed 6 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-12926968882088509749.kers
Total runtime 29 ms.
[2026-05-25 10:38:17] [INFO ] Implicit Places using invariants in 746 ms returned []
[2026-05-25 10:38:17] [INFO ] Invariant cache hit.
[2026-05-25 10:38:19] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2451 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2026-05-25 10:38:19] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/2577 variables, and 0 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/2577 variables, and 0 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61636ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 61646ms
Starting structural reductions in LTL mode, iteration 1 : 992/1032 places, 1585/1626 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65189 ms. Remains : 992/1032 places, 1585/1626 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||p0))))'
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-07 finished in 65389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1026 transition count 1620
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1026 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1022 transition count 1616
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1022 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1018 transition count 1612
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1018 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1014 transition count 1608
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1014 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 1011 transition count 1605
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 1011 transition count 1605
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1008 transition count 1602
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1008 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1005 transition count 1599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1002 transition count 1596
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1002 transition count 1596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 999 transition count 1593
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 999 transition count 1593
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 996 transition count 1590
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 996 transition count 1590
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 994 transition count 1588
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 994 transition count 1588
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 992 transition count 1586
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 992 transition count 1586
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 990 transition count 1584
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 990 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 984 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 983 transition count 1576
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 983 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 982 transition count 1575
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 982 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 981 transition count 1574
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 981 transition count 1574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 981 transition count 1573
Applied a total of 104 rules in 787 ms. Remains 981 /1032 variables (removed 51) and now considering 1573/1626 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5324470014288773501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5185649316794532537.kers'
[2026-05-25 10:39:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5324470014288773501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5185649316794532537.kers]
Culled 0 columns in 15 ms.
// Phase 1: matrix 1573 rows 981 cols 7435 entries
Finished phase 1 with 975 SingleSign rule and 0 generalized
[2026-05-25 10:39:21] [INFO ] Computed 6 invariants in 26 ms
Computed 6 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-5185649316794532537.kers
Total runtime 41 ms.
[2026-05-25 10:39:22] [INFO ] Implicit Places using invariants in 692 ms returned []
[2026-05-25 10:39:22] [INFO ] Invariant cache hit.
[2026-05-25 10:39:23] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
Running 1572 sub problems to find dead transitions.
[2026-05-25 10:39:23] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/2554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/981 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/2554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/981 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61319ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 61335ms
Starting structural reductions in LTL mode, iteration 1 : 981/1032 places, 1573/1626 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64169 ms. Remains : 981/1032 places, 1573/1626 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-08 finished in 64405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 1032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1028 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1028 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1025 transition count 1619
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1025 transition count 1619
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1023 transition count 1617
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1023 transition count 1617
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1021 transition count 1615
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1021 transition count 1615
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1019 transition count 1613
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1019 transition count 1613
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1017 transition count 1611
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1017 transition count 1611
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1015 transition count 1609
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1015 transition count 1609
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1013 transition count 1607
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1013 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1011 transition count 1605
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1011 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1009 transition count 1603
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1009 transition count 1603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1007 transition count 1601
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1007 transition count 1601
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1005 transition count 1599
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1003 transition count 1597
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1003 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1002 transition count 1595
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1002 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1001 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1001 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1000 transition count 1593
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1000 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 999 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 999 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 998 transition count 1591
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 998 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 997 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 994 transition count 1587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 994 transition count 1586
Applied a total of 78 rules in 822 ms. Remains 994 /1032 variables (removed 38) and now considering 1586/1626 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9765937228032336645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2312202193948340467.kers'
[2026-05-25 10:40:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9765937228032336645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2312202193948340467.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1586 rows 994 cols 7461 entries
Finished phase 1 with 988 SingleSign rule and 0 generalized
[2026-05-25 10:40:26] [INFO ] Computed 6 invariants in 8 ms
Computed 6 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2312202193948340467.kers
Total runtime 12 ms.
[2026-05-25 10:40:26] [INFO ] Implicit Places using invariants in 692 ms returned []
[2026-05-25 10:40:26] [INFO ] Invariant cache hit.
[2026-05-25 10:40:28] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
Running 1585 sub problems to find dead transitions.
[2026-05-25 10:40:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/2580 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 1585/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1585 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/2580 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 0/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61313ms problems are : Problem set: 0 solved, 1585 unsolved
Search for dead transitions found 0 dead transitions in 61316ms
Starting structural reductions in LTL mode, iteration 1 : 994/1032 places, 1586/1626 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64809 ms. Remains : 994/1032 places, 1586/1626 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 332 ms.
Product exploration explored 100000 steps with 33333 reset in 376 ms.
Computed a total of 219 stabilizing places and 229 stable transitions
Computed a total of 219 stabilizing places and 229 stable transitions
Detected a total of 219/994 stabilizing places and 229/1586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 97 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 154 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B03-LTLCardinality-09 finished in 65843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 1032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1032/1032 places, 1626/1626 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1026 transition count 1620
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1026 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 1021 transition count 1615
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 1021 transition count 1615
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 1017 transition count 1611
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 1017 transition count 1611
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1013 transition count 1607
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1013 transition count 1607
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1010 transition count 1604
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1010 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1007 transition count 1601
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1007 transition count 1601
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1004 transition count 1598
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1004 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1001 transition count 1595
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1001 transition count 1595
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 998 transition count 1592
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 998 transition count 1592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 995 transition count 1589
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 995 transition count 1589
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 993 transition count 1587
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 993 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 991 transition count 1585
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 991 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 989 transition count 1583
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 989 transition count 1583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 984 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 983 transition count 1576
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 983 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 982 transition count 1575
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 982 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 981 transition count 1574
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 980 transition count 1573
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 980 transition count 1573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 980 transition count 1572
Applied a total of 106 rules in 778 ms. Remains 980 /1032 variables (removed 52) and now considering 1572/1626 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13311563414397431824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16804959673014389008.kers'
[2026-05-25 10:41:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13311563414397431824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16804959673014389008.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1572 rows 980 cols 7433 entries
Finished phase 1 with 974 SingleSign rule and 0 generalized
[2026-05-25 10:41:32] [INFO ] Computed 6 invariants in 12 ms
Computed 6 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-16804959673014389008.kers
Total runtime 31 ms.
[2026-05-25 10:41:32] [INFO ] Implicit Places using invariants in 775 ms returned []
[2026-05-25 10:41:32] [INFO ] Invariant cache hit.
[2026-05-25 10:41:34] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
Running 1571 sub problems to find dead transitions.
[2026-05-25 10:41:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/2552 variables, and 0 constraints, problems are : Problem set: 0 solved, 1571 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1571/1571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 979/2552 variables, and 0 constraints, problems are : Problem set: 0 solved, 1571 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61213ms problems are : Problem set: 0 solved, 1571 unsolved
Search for dead transitions found 0 dead transitions in 61217ms
Starting structural reductions in LTL mode, iteration 1 : 980/1032 places, 1572/1626 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64251 ms. Remains : 980/1032 places, 1572/1626 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 868 steps with 9 reset in 3 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-13 finished in 64598 ms.
All properties solved by simple procedures.
Total runtime 393818 ms.

BK_STOP 1779705755950

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020100299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B03.tgz
mv MedleyB-PT-B03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;