Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 CO4-PT-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.5K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 191K 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 CO4-PT-13-LTLCardinality-00
FORMULA_NAME CO4-PT-13-LTLCardinality-01
FORMULA_NAME CO4-PT-13-LTLCardinality-02
FORMULA_NAME CO4-PT-13-LTLCardinality-03
FORMULA_NAME CO4-PT-13-LTLCardinality-04
FORMULA_NAME CO4-PT-13-LTLCardinality-05
FORMULA_NAME CO4-PT-13-LTLCardinality-06
FORMULA_NAME CO4-PT-13-LTLCardinality-07
FORMULA_NAME CO4-PT-13-LTLCardinality-08
FORMULA_NAME CO4-PT-13-LTLCardinality-09
FORMULA_NAME CO4-PT-13-LTLCardinality-10
FORMULA_NAME CO4-PT-13-LTLCardinality-11
FORMULA_NAME CO4-PT-13-LTLCardinality-12
FORMULA_NAME CO4-PT-13-LTLCardinality-13
FORMULA_NAME CO4-PT-13-LTLCardinality-14
FORMULA_NAME CO4-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779523094807

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 07:58:15] [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-23 07:58:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:58:16] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-23 07:58:16] [INFO ] Transformed 649 places.
[2026-05-23 07:58:16] [INFO ] Transformed 816 transitions.
[2026-05-23 07:58:16] [INFO ] Found NUPN structural information;
[2026-05-23 07:58:16] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 172 places in 9 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 464 transition count 586
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 94 place count 386 transition count 506
Iterating global reduction 1 with 78 rules applied. Total rules applied 172 place count 386 transition count 506
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 231 place count 327 transition count 427
Iterating global reduction 1 with 59 rules applied. Total rules applied 290 place count 327 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 295 place count 327 transition count 422
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 325 place count 297 transition count 389
Iterating global reduction 2 with 30 rules applied. Total rules applied 355 place count 297 transition count 389
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 372 place count 280 transition count 372
Iterating global reduction 2 with 17 rules applied. Total rules applied 389 place count 280 transition count 372
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 394 place count 280 transition count 367
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 398 place count 276 transition count 363
Iterating global reduction 3 with 4 rules applied. Total rules applied 402 place count 276 transition count 363
Applied a total of 402 rules in 108 ms. Remains 276 /477 variables (removed 201) and now considering 363/589 (removed 226) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15847236827030862877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3618034303125967950.kers'
[2026-05-23 07:58:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15847236827030862877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3618034303125967950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 276 cols 984 entries
Finished phase 1 with 270 SingleSign rule and 0 generalized
[2026-05-23 07:58:16] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3618034303125967950.kers
Total runtime 2 ms.
[2026-05-23 07:58:16] [INFO ] Implicit Places using invariants in 245 ms returned [6, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 273 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/477 places, 363/589 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 274/477 places, 363/589 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18388903449087150200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1080976997877170101.kers'
[2026-05-23 07:58:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18388903449087150200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1080976997877170101.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 274 cols 964 entries
Finished phase 1 with 270 SingleSign rule and 0 generalized
[2026-05-23 07:58:16] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1080976997877170101.kers
Total runtime 2 ms.
[2026-05-23 07:58:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 07:58:16] [INFO ] Invariant cache hit.
[2026-05-23 07:58:16] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2026-05-23 07:58:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 363/634 variables, 271/279 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 3/637 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/637 variables, and 283 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 363/634 variables, 271/280 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 331/611 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/637 variables, and 612 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 271/274 constraints, PredecessorRefiner: 331/362 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Finished structural reductions in LTL mode , in 1 iterations and 60465 ms. Remains : 274/274 places, 363/363 transitions.
Support contains 30 out of 274 places after structural reductions.
[2026-05-23 07:59:17] [INFO ] Flatten gal took : 47 ms
[2026-05-23 07:59:17] [INFO ] Flatten gal took : 21 ms
[2026-05-23 07:59:17] [INFO ] Input system was already deterministic with 363 transitions.
RANDOM walk for 40000 steps (254 resets) in 1620 ms. (24 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40002 steps (305 resets) in 116 ms. (341 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (214 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (119 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (179 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (154 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (193 resets) in 90 ms. (439 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (145 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (129 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (44 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (206 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
[2026-05-23 07:59:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 33/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 120/171 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 203/374 variables, 80/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 166/540 variables, 83/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 67/607 variables, 42/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 22/629 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 8/637 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/637 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 278 constraints, problems are : Problem set: 0 solved, 9 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 33/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 120/171 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 203/374 variables, 80/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 166/540 variables, 83/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 67/607 variables, 42/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/607 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 22/629 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/629 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 15 (OVERLAPS) 8/637 variables, 6/288 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/637 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/637 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 637/637 variables, and 288 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2294ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 7 properties in 737 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 363/363 transitions.
Graph (trivial) has 282 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 537 edges and 272 vertex of which 251 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 251 transition count 209
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 254 place count 134 transition count 209
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 254 place count 134 transition count 193
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 286 place count 118 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 290 place count 114 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 294 place count 114 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 114 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 295 place count 114 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 299 place count 112 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 111 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 111 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 111 transition count 184
Performed 44 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 390 place count 67 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 395 place count 67 transition count 122
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 400 place count 62 transition count 115
Iterating global reduction 5 with 5 rules applied. Total rules applied 405 place count 62 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 406 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 407 place count 61 transition count 113
Iterating global reduction 6 with 1 rules applied. Total rules applied 408 place count 61 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 409 place count 61 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 413 place count 59 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 189 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 3 rules applied. Total rules applied 416 place count 58 transition count 108
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 448 place count 42 transition count 124
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 485 place count 42 transition count 87
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 496 place count 31 transition count 65
Iterating global reduction 9 with 11 rules applied. Total rules applied 507 place count 31 transition count 65
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 515 place count 31 transition count 57
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 517 place count 29 transition count 49
Iterating global reduction 10 with 2 rules applied. Total rules applied 519 place count 29 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 521 place count 29 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 523 place count 29 transition count 45
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 524 place count 28 transition count 43
Iterating global reduction 11 with 1 rules applied. Total rules applied 525 place count 28 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 526 place count 28 transition count 42
Free-agglomeration rule applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 533 place count 28 transition count 35
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 541 place count 21 transition count 34
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 543 place count 21 transition count 34
Graph (complete) has 67 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 544 place count 20 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 546 place count 20 transition count 32
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 548 place count 20 transition count 32
Graph (complete) has 61 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 549 place count 19 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 551 place count 19 transition count 30
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 553 place count 19 transition count 30
Graph (complete) has 55 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 554 place count 18 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 556 place count 18 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 557 place count 17 transition count 27
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t96.t97.t302.t93.t335 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 4 rules applied. Total rules applied 561 place count 14 transition count 23
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 5 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 12 rules applied. Total rules applied 573 place count 6 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 581 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 581 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 583 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 584 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 586 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 588 place count 3 transition count 4
Applied a total of 588 rules in 62 ms. Remains 3 /274 variables (removed 271) and now considering 4/363 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 3/274 places, 4/363 transitions.
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA CO4-PT-13-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-13-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 540 edges and 274 vertex of which 262 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 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(p0)||G(p1)))'
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 271 transition count 362
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 17 place count 258 transition count 349
Iterating global reduction 1 with 13 rules applied. Total rules applied 30 place count 258 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 258 transition count 347
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 248 transition count 337
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 248 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 244 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 244 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 244 transition count 331
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 242 transition count 329
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 242 transition count 329
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 240 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 240 transition count 327
Applied a total of 70 rules in 29 ms. Remains 240 /274 variables (removed 34) and now considering 327/363 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11607790150577036474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14118041405527979591.kers'
[2026-05-23 07:59:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11607790150577036474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14118041405527979591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 240 cols 880 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-23 07:59:21] [INFO ] Computed 4 invariants in 5 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14118041405527979591.kers
Total runtime 6 ms.
[2026-05-23 07:59:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 07:59:21] [INFO ] Invariant cache hit.
[2026-05-23 07:59:22] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-23 07:59:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 327/567 variables, 240/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/567 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 248 constraints, problems are : Problem set: 0 solved, 326 unsolved in 21884 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 327/567 variables, 240/248 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 326/574 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 575 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51967ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 51969ms
Starting structural reductions in LTL mode, iteration 1 : 240/274 places, 327/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52195 ms. Remains : 240/274 places, 327/363 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(p0)||G(p1)))'
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 495 edges and 240 vertex of which 235 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 11 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA CO4-PT-13-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-13-LTLCardinality-00 finished in 52948 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(F(p0)))))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 271 transition count 362
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 256 transition count 347
Iterating global reduction 1 with 15 rules applied. Total rules applied 34 place count 256 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 256 transition count 345
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 47 place count 245 transition count 334
Iterating global reduction 2 with 11 rules applied. Total rules applied 58 place count 245 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 240 transition count 329
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 240 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 240 transition count 327
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 237 transition count 324
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 237 transition count 324
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 235 transition count 322
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 235 transition count 322
Applied a total of 80 rules in 21 ms. Remains 235 /274 variables (removed 39) and now considering 322/363 (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-2768549598111428939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10062284746426156565.kers'
[2026-05-23 08:00:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2768549598111428939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10062284746426156565.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 235 cols 870 entries
Finished phase 1 with 231 SingleSign rule and 0 generalized
[2026-05-23 08:00:14] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10062284746426156565.kers
Total runtime 6 ms.
[2026-05-23 08:00:14] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-23 08:00:14] [INFO ] Invariant cache hit.
[2026-05-23 08:00:15] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2026-05-23 08:00:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 243 constraints, problems are : Problem set: 0 solved, 321 unsolved in 21120 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/564 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 566 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51181ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 51186ms
Starting structural reductions in LTL mode, iteration 1 : 235/274 places, 322/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51519 ms. Remains : 235/274 places, 322/363 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(F(p0)))))'
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 97 ms.
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (248 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (214 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 458737 steps, run visited all 1 properties in 617 ms. (steps per millisecond=743 )
Probabilistic random walk after 458737 steps, saw 88463 distinct states, run finished after 620 ms. (steps per millisecond=739 ) properties seen :1
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 968 ms.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2026-05-23 08:01:07] [INFO ] Invariant cache hit.
[2026-05-23 08:01:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 08:01:07] [INFO ] Invariant cache hit.
[2026-05-23 08:01:07] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 235/235 places, 322/322 transitions.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge based reduction with 1 factoid took 39 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (130 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (210 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 458737 steps, run visited all 1 properties in 581 ms. (steps per millisecond=789 )
Probabilistic random walk after 458737 steps, saw 88463 distinct states, run finished after 581 ms. (steps per millisecond=789 ) properties seen :1
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 908 ms.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 92 ms.
Spot run failed in 75 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6944879255001026406
[2026-05-23 08:01:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6944879255001026406
Running compilation step : cd /tmp/ltsmin6944879255001026406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 548 ms.
Running link step : cd /tmp/ltsmin6944879255001026406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6944879255001026406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12172168046514170820.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA CO4-PT-13-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLCardinality-05 finished in 55494 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' '!(F(p0))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Graph (trivial) has 281 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 538 edges and 272 vertex of which 260 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 259 transition count 238
Reduce places removed 111 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 112 rules applied. Total rules applied 226 place count 148 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 147 transition count 237
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 227 place count 147 transition count 220
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 261 place count 130 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 265 place count 126 transition count 216
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 126 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 126 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 270 place count 126 transition count 213
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 274 place count 124 transition count 213
Performed 48 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 370 place count 76 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 374 place count 76 transition count 145
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 379 place count 71 transition count 138
Iterating global reduction 5 with 5 rules applied. Total rules applied 384 place count 71 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 385 place count 71 transition count 137
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 419 place count 54 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 427 place count 54 transition count 148
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 437 place count 44 transition count 108
Iterating global reduction 7 with 10 rules applied. Total rules applied 447 place count 44 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 454 place count 44 transition count 101
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 457 place count 41 transition count 83
Iterating global reduction 8 with 3 rules applied. Total rules applied 460 place count 41 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 462 place count 41 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 464 place count 40 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 481 place count 40 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 483 place count 38 transition count 71
Applied a total of 483 rules in 52 ms. Remains 38 /274 variables (removed 236) and now considering 71/363 (removed 292) transitions.
[2026-05-23 08:01:10] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17757667046701999084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17168420474893642055.kers'
[2026-05-23 08:01:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17757667046701999084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17168420474893642055.kers]
Normalized transition count is 65 out of 66 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 38 cols 187 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 08:01:10] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17168420474893642055.kers
Total runtime 0 ms.
[2026-05-23 08:01:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 08:01:10] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2026-05-23 08:01:10] [INFO ] Invariant cache hit.
[2026-05-23 08:01:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:01:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2026-05-23 08:01:10] [INFO ] Redundant transitions in 2 ms returned []
Running 56 sub problems to find dead transitions.
[2026-05-23 08:01:10] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2026-05-23 08:01:10] [INFO ] Invariant cache hit.
[2026-05-23 08:01:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 65/103 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 44 constraints, problems are : Problem set: 0 solved, 56 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 65/103 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 56/99 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 100 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2556ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2556ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/274 places, 71/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2692 ms. Remains : 38/274 places, 71/363 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))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-06
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-06 finished in 2755 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' '!(F(G((p0||X(p1)))))'
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 362
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 258 transition count 348
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 258 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 258 transition count 346
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 248 transition count 336
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 248 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 243 transition count 331
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 243 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 243 transition count 329
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 240 transition count 326
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 240 transition count 326
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 238 transition count 324
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 238 transition count 324
Applied a total of 75 rules in 24 ms. Remains 238 /274 variables (removed 36) and now considering 324/363 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11082879542911260827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12413788520267621718.kers'
[2026-05-23 08:01:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11082879542911260827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12413788520267621718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 238 cols 874 entries
Finished phase 1 with 234 SingleSign rule and 0 generalized
[2026-05-23 08:01:13] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12413788520267621718.kers
Total runtime 1 ms.
[2026-05-23 08:01:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 08:01:13] [INFO ] Invariant cache hit.
[2026-05-23 08:01:13] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2026-05-23 08:01:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/245 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 1/562 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 246 constraints, problems are : Problem set: 0 solved, 323 unsolved in 26654 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/245 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 322/567 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/562 variables, and 569 constraints, problems are : Problem set: 0 solved, 323 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 237/238 constraints, PredecessorRefiner: 322/323 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56709ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 56709ms
Starting structural reductions in LTL mode, iteration 1 : 238/274 places, 324/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56952 ms. Remains : 238/274 places, 324/363 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(G((p0||X(p1)))))'
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-13-LTLCardinality-07
Product exploration explored 100000 steps with 9 reset in 69 ms.
Product exploration explored 100000 steps with 21 reset in 116 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 492 edges and 238 vertex of which 230 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Detected a total of 15/238 stabilizing places and 21/324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 14 factoid took 65 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (395 resets) in 96 ms. (412 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (132 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2026-05-23 08:02:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/118 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 175/293 variables, 67/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/463 variables, 80/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 537/562 variables, and 228 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 224/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 15 factoid took 123 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2026-05-23 08:02:10] [INFO ] Invariant cache hit.
[2026-05-23 08:02:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:02:10] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-23 08:02:10] [INFO ] Computed and/alt/rep : 316/610/316 causal constraints (skipped 7 transitions) in 15 ms.
[2026-05-23 08:02:10] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 723 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 324/324 transitions.
Graph (trivial) has 248 edges and 238 vertex of which 3 / 238 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 490 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 231 transition count 230
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 145 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 144 transition count 229
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 176 place count 144 transition count 206
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 222 place count 121 transition count 206
Performed 45 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 312 place count 76 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 316 place count 76 transition count 143
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 320 place count 72 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 324 place count 72 transition count 137
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 360 place count 54 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 369 place count 54 transition count 148
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 380 place count 43 transition count 104
Iterating global reduction 5 with 11 rules applied. Total rules applied 391 place count 43 transition count 104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 399 place count 43 transition count 96
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 402 place count 40 transition count 78
Iterating global reduction 6 with 3 rules applied. Total rules applied 405 place count 40 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 407 place count 40 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 411 place count 38 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 436 place count 38 transition count 67
Applied a total of 436 rules in 38 ms. Remains 38 /238 variables (removed 200) and now considering 67/324 (removed 257) transitions.
[2026-05-23 08:02:11] [INFO ] Flow matrix only has 55 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14537030317811251913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4017566356896469182.kers'
[2026-05-23 08:02:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14537030317811251913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4017566356896469182.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 38 cols 157 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 08:02:11] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4017566356896469182.kers
Total runtime 0 ms.
[2026-05-23 08:02:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 08:02:11] [INFO ] Flow matrix only has 55 transitions (discarded 12 similar events)
[2026-05-23 08:02:11] [INFO ] Invariant cache hit.
[2026-05-23 08:02:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-23 08:02:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-23 08:02:11] [INFO ] Redundant transitions in 15 ms returned [55]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 65 sub problems to find dead transitions.
[2026-05-23 08:02:11] [INFO ] Flow matrix only has 55 transitions (discarded 11 similar events)
[2026-05-23 08:02:11] [INFO ] Invariant cache hit.
[2026-05-23 08:02:11] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 54/91 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/92 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/93 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 58 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 54/91 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 64/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/92 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 1/93 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (OVERLAPS) 0/93 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 123 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2696 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4353ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 4354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/238 places, 66/324 transitions.
Applied a total of 0 rules in 9 ms. Remains 38 /38 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4498 ms. Remains : 38/238 places, 66/324 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Graph (complete) has 146 edges and 38 vertex of which 36 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 12 stable transitions
Detected a total of 8/38 stabilizing places and 12/66 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 44 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 101 steps (8 resets) in 7 ms. (12 steps per ms) remains 0/4 properties
Knowledge based reduction with 10 factoid took 99 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2026-05-23 08:02:15] [INFO ] Flow matrix only has 55 transitions (discarded 11 similar events)
[2026-05-23 08:02:15] [INFO ] Invariant cache hit.
[2026-05-23 08:02:15] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2026-05-23 08:02:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-23 08:02:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-23 08:02:15] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2026-05-23 08:02:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:02:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-23 08:02:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2026-05-23 08:02:15] [INFO ] Computed and/alt/rep : 42/160/42 causal constraints (skipped 12 transitions) in 3 ms.
[2026-05-23 08:02:15] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 369 ms.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 81 reset in 141 ms.
Product exploration explored 100000 steps with 51 reset in 156 ms.
Built C files in :
/tmp/ltsmin5536891255150148881
[2026-05-23 08:02:16] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2026-05-23 08:02:16] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:02:16] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2026-05-23 08:02:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:02:16] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2026-05-23 08:02:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:02:16] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5536891255150148881
Running compilation step : cd /tmp/ltsmin5536891255150148881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin5536891255150148881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5536891255150148881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5140425780620170590.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA CO4-PT-13-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLCardinality-07 finished in 63969 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' '!(((G(!p0) U X(p1))&&(G(p2) U p3)))'
Support contains 7 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 363
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 263 transition count 353
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 263 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 263 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 257 transition count 346
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 257 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 253 transition count 342
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 253 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 253 transition count 341
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 46 place count 250 transition count 338
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 250 transition count 338
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 248 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 248 transition count 336
Applied a total of 53 rules in 17 ms. Remains 248 /274 variables (removed 26) and now considering 336/363 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15742903889627220950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1853984352513930004.kers'
[2026-05-23 08:02:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15742903889627220950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1853984352513930004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 248 cols 898 entries
Finished phase 1 with 244 SingleSign rule and 0 generalized
[2026-05-23 08:02:16] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1853984352513930004.kers
Total runtime 4 ms.
[2026-05-23 08:02:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 08:02:17] [INFO ] Invariant cache hit.
[2026-05-23 08:02:17] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2026-05-23 08:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/582 variables, 246/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 2/584 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/584 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 256 constraints, problems are : Problem set: 0 solved, 335 unsolved in 29288 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/582 variables, 246/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 305/559 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/584 variables, and 560 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 246/248 constraints, PredecessorRefiner: 305/335 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59345ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 59346ms
Starting structural reductions in LTL mode, iteration 1 : 248/274 places, 336/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59569 ms. Remains : 248/274 places, 336/363 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' '!(((G(!p0) U X(p1))&&(G(p2) U p3)))'
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p3), (NOT p1), p0]
Running random walk in product with property : CO4-PT-13-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 504 edges and 248 vertex of which 239 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 19 ms. Proved property starting from automaton with 7 states, 17 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA CO4-PT-13-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-13-LTLCardinality-09 finished in 60244 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' '!(G(((!p0 U X(X(X(p1)))) U p1)))'
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 363/363 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 271 transition count 362
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 259 transition count 350
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 259 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 259 transition count 348
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 38 place count 251 transition count 340
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 251 transition count 340
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 248 transition count 337
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 248 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 248 transition count 336
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 246 transition count 334
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 246 transition count 334
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 245 transition count 333
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 245 transition count 333
Applied a total of 59 rules in 16 ms. Remains 245 /274 variables (removed 29) and now considering 333/363 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1581596645221914768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14664208493754713684.kers'
[2026-05-23 08:03:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1581596645221914768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14664208493754713684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 245 cols 898 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-23 08:03:17] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14664208493754713684.kers
Total runtime 4 ms.
[2026-05-23 08:03:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 08:03:17] [INFO ] Invariant cache hit.
[2026-05-23 08:03:17] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-23 08:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (OVERLAPS) 333/578 variables, 245/253 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (OVERLAPS) 0/578 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 253 constraints, problems are : Problem set: 0 solved, 332 unsolved in 22441 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (OVERLAPS) 333/578 variables, 245/253 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 332/585 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 587 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52494ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 52495ms
Starting structural reductions in LTL mode, iteration 1 : 245/274 places, 333/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52730 ms. Remains : 245/274 places, 333/363 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' '!(G(((!p0 U X(X(X(p1)))) U p1)))'
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-11 finished in 53172 ms.
All properties solved by simple procedures.
Total runtime 354460 ms.

BK_STOP 1779523450415

--------------------
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="CO4-PT-13"
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 CO4-PT-13, 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 r066-tall-177946967700379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-13.tgz
mv CO4-PT-13 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 ;