Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 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 110K 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 MedleyA-PT-15-LTLCardinality-00
FORMULA_NAME MedleyA-PT-15-LTLCardinality-01
FORMULA_NAME MedleyA-PT-15-LTLCardinality-02
FORMULA_NAME MedleyA-PT-15-LTLCardinality-03
FORMULA_NAME MedleyA-PT-15-LTLCardinality-04
FORMULA_NAME MedleyA-PT-15-LTLCardinality-05
FORMULA_NAME MedleyA-PT-15-LTLCardinality-06
FORMULA_NAME MedleyA-PT-15-LTLCardinality-07
FORMULA_NAME MedleyA-PT-15-LTLCardinality-08
FORMULA_NAME MedleyA-PT-15-LTLCardinality-09
FORMULA_NAME MedleyA-PT-15-LTLCardinality-10
FORMULA_NAME MedleyA-PT-15-LTLCardinality-11
FORMULA_NAME MedleyA-PT-15-LTLCardinality-12
FORMULA_NAME MedleyA-PT-15-LTLCardinality-13
FORMULA_NAME MedleyA-PT-15-LTLCardinality-14
FORMULA_NAME MedleyA-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779700486690

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:14:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:14:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:14:48] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-25 09:14:48] [INFO ] Transformed 192 places.
[2026-05-25 09:14:48] [INFO ] Transformed 475 transitions.
[2026-05-25 09:14:48] [INFO ] Found NUPN structural information;
[2026-05-25 09:14:48] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 155 transition count 411
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 155 transition count 411
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 92 place count 155 transition count 393
Applied a total of 92 rules in 46 ms. Remains 155 /192 variables (removed 37) and now considering 393/473 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2797916749827501060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15422886756327949969.kers'
[2026-05-25 09:14:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2797916749827501060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15422886756327949969.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 155 cols 1322 entries
Finished phase 1 with 147 SingleSign rule and 1 generalized
[2026-05-25 09:14:48] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15422886756327949969.kers
Total runtime 2 ms.
[2026-05-25 09:14:48] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-25 09:14:48] [INFO ] Invariant cache hit.
[2026-05-25 09:14:49] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2026-05-25 09:14:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 393/548 variables, 155/180 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/548 variables, and 181 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 393/548 variables, 155/183 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 392/575 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 580 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 155/192 places, 393/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61157 ms. Remains : 155/192 places, 393/473 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2026-05-25 09:15:49] [INFO ] Invariant cache hit.
[2026-05-25 09:15:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 09:15:49] [INFO ] Invariant cache hit.
[2026-05-25 09:15:49] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 155/155 places, 393/393 transitions.
Support contains 33 out of 155 places after structural reductions.
[2026-05-25 09:15:50] [INFO ] Flatten gal took : 55 ms
[2026-05-25 09:15:50] [INFO ] Flatten gal took : 24 ms
[2026-05-25 09:15:50] [INFO ] Input system was already deterministic with 393 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 1440 ms. (27 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
[2026-05-25 09:15:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 124/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/155 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 393/548 variables, 155/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 162 constraints, problems are : Problem set: 0 solved, 15 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 124/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/155 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 393/548 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 188 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3426 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3888ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 2 properties in 5590 ms.
Support contains 21 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 115 edges and 155 vertex of which 6 / 155 are part of one of the 2 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 151 transition count 370
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 134 transition count 370
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 35 place count 134 transition count 363
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 127 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 124 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 124 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 124 transition count 357
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 124 transition count 355
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 122 transition count 355
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 92 place count 107 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 107 transition count 339
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 105 transition count 335
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 105 transition count 335
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 127 place count 90 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 90 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 165 place count 90 transition count 395
Free-agglomeration rule applied 14 times with reduction of 3 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 179 place count 90 transition count 378
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 204 place count 76 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 215 place count 76 transition count 356
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 218 place count 76 transition count 395
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 231 place count 73 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 257 place count 73 transition count 359
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 258 place count 73 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 73 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 72 transition count 357
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 23 edges and 71 vertex of which 2 / 71 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 262 place count 70 transition count 357
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 268 place count 70 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 9 with 49 rules applied. Total rules applied 317 place count 70 transition count 302
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 318 place count 69 transition count 290
Iterating global reduction 9 with 1 rules applied. Total rules applied 319 place count 69 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 320 place count 69 transition count 289
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 321 place count 69 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 322 place count 68 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 326 place count 68 transition count 284
Applied a total of 326 rules in 119 ms. Remains 68 /155 variables (removed 87) and now considering 284/393 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 68/155 places, 284/393 transitions.
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/5 properties
[2026-05-25 09:16:00] [INFO ] Flow matrix only has 252 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15981046043294478434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10205209375218834666.kers'
[2026-05-25 09:16:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15981046043294478434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10205209375218834666.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 252 rows 67 cols 904 entries
Finished phase 1 with 61 SingleSign rule and 1 generalized
[2026-05-25 09:16:00] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10205209375218834666.kers
Total runtime 1 ms.
[2026-05-25 09:16:00] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/279 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/318 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/320 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/320 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 115 constraints, problems are : Problem set: 0 solved, 2 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/279 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/318 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/320 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/320 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 12 ms.
FORMULA MedleyA-PT-15-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F((p1&&F(G(p2))))) U (p3&&F(p4)))||p0)))'
Support contains 6 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 144 transition count 377
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 144 transition count 377
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 144 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 142 transition count 368
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 142 transition count 368
Applied a total of 31 rules in 8 ms. Remains 142 /155 variables (removed 13) and now considering 368/393 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10320624352238508398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10011217688972066196.kers'
[2026-05-25 09:16:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10320624352238508398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10011217688972066196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 142 cols 1266 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:16:01] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10011217688972066196.kers
Total runtime 1 ms.
[2026-05-25 09:16:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 09:16:01] [INFO ] Invariant cache hit.
[2026-05-25 09:16:01] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:16:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/510 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 172 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/510 variables, 142/172 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 367/539 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 542 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 142/155 places, 368/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60366 ms. Remains : 142/155 places, 368/393 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F((p1&&F(G(p2))))) U (p3&&F(p4)))||p0)))'
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (NOT p3) (NOT p4) (NOT p1) (NOT p2)), (NOT p4), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 11 ms. Proved property starting from automaton with 6 states, 11 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA MedleyA-PT-15-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLCardinality-00 finished in 61209 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 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 157 edges and 155 vertex of which 9 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 148 transition count 364
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 126 transition count 363
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 46 place count 126 transition count 354
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 64 place count 117 transition count 354
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 108 transition count 339
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 108 transition count 339
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 108 transition count 333
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 88 place count 108 transition count 331
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 106 transition count 331
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 105 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 105 transition count 327
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 124 place count 90 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 90 transition count 310
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 88 transition count 305
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 88 transition count 305
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 162 place count 72 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 187 place count 72 transition count 381
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 195 place count 68 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 67 transition count 428
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 74 edges and 65 vertex of which 28 / 65 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 48 transition count 428
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 5 with 87 rules applied. Total rules applied 286 place count 48 transition count 341
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 291 place count 43 transition count 274
Iterating global reduction 6 with 5 rules applied. Total rules applied 296 place count 43 transition count 274
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 306 place count 43 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 7 with 87 rules applied. Total rules applied 393 place count 43 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 393 place count 43 transition count 175
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 397 place count 41 transition count 175
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 398 place count 40 transition count 169
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 40 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 403 place count 38 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 406 place count 38 transition count 164
Applied a total of 406 rules in 72 ms. Remains 38 /155 variables (removed 117) and now considering 164/393 (removed 229) transitions.
[2026-05-25 09:17:02] [INFO ] Flow matrix only has 144 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7164551606503171054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7228264639752282261.kers'
[2026-05-25 09:17:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7164551606503171054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7228264639752282261.kers]
Normalized transition count is 143 out of 144 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 38 cols 590 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:17:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7228264639752282261.kers
Total runtime 1 ms.
[2026-05-25 09:17:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 09:17:02] [INFO ] Flow matrix only has 144 transitions (discarded 20 similar events)
[2026-05-25 09:17:02] [INFO ] Invariant cache hit.
[2026-05-25 09:17:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:17:02] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2026-05-25 09:17:02] [INFO ] Redundant transitions in 30 ms returned [117, 118, 160, 161, 163]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 155 sub problems to find dead transitions.
[2026-05-25 09:17:02] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-915600336606441043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-138261031829840880.kers'
[2026-05-25 09:17:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-915600336606441043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-138261031829840880.kers]
Normalized transition count is 138 out of 139 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 38 cols 570 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:17:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-138261031829840880.kers
Total runtime 1 ms.
[2026-05-25 09:17:02] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 138/176 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/176 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/177 variables, and 84 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 138/176 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 155/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/177 variables, and 239 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35134ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 35134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/155 places, 159/393 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 158
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 36 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 35 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 35 transition count 147
Applied a total of 14 rules in 28 ms. Remains 35 /38 variables (removed 3) and now considering 147/159 (removed 12) transitions.
[2026-05-25 09:17:37] [INFO ] Flow matrix only has 130 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-428840848975504319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11650738879096434580.kers'
[2026-05-25 09:17:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-428840848975504319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11650738879096434580.kers]
Normalized transition count is 129 out of 130 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 35 cols 542 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 09:17:37] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11650738879096434580.kers
Total runtime 2 ms.
[2026-05-25 09:17:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:17:37] [INFO ] Flow matrix only has 130 transitions (discarded 17 similar events)
[2026-05-25 09:17:37] [INFO ] Invariant cache hit.
[2026-05-25 09:17:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:17:37] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/155 places, 147/393 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35513 ms. Remains : 35/155 places, 147/393 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 30 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-01 finished in 35567 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&&X(X(p1))&&F(p2))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 146 transition count 381
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 146 transition count 381
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 25 place count 146 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 145 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 145 transition count 372
Applied a total of 27 rules in 5 ms. Remains 145 /155 variables (removed 10) and now considering 372/393 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12962342157155821794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10817830488180134853.kers'
[2026-05-25 09:17:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12962342157155821794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10817830488180134853.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 145 cols 1268 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-05-25 09:17:37] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10817830488180134853.kers
Total runtime 2 ms.
[2026-05-25 09:17:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:17:38] [INFO ] Invariant cache hit.
[2026-05-25 09:17:38] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2026-05-25 09:17:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 372/517 variables, 145/169 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 170 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/517 variables, 145/173 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 371/544 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 548 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 145/155 places, 372/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60298 ms. Remains : 145/155 places, 372/393 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&&X(X(p1))&&F(p2))))'
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-02 finished in 60574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 143 transition count 376
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 143 transition count 376
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 142 transition count 366
Applied a total of 34 rules in 14 ms. Remains 142 /155 variables (removed 13) and now considering 366/393 (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-9649155628318294928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12358106875388545660.kers'
[2026-05-25 09:18:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9649155628318294928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12358106875388545660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:18:38] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12358106875388545660.kers
Total runtime 5 ms.
[2026-05-25 09:18:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 09:18:38] [INFO ] Invariant cache hit.
[2026-05-25 09:18:38] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 169 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/534 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 538 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 142/155 places, 366/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60451 ms. Remains : 142/155 places, 366/393 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA MedleyA-PT-15-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-03 finished in 60777 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 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 161 edges and 155 vertex of which 9 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 148 transition count 365
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 127 transition count 364
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 44 place count 127 transition count 355
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 62 place count 118 transition count 355
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 108 transition count 338
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 108 transition count 338
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 108 transition count 332
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 88 place count 108 transition count 330
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 92 place count 106 transition count 330
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 105 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 105 transition count 326
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 3 with 32 rules applied. Total rules applied 126 place count 89 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 89 transition count 308
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 87 transition count 303
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 87 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 166 place count 70 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 203 place count 70 transition count 383
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 67 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 66 transition count 417
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 77 edges and 64 vertex of which 28 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 213 place count 47 transition count 417
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 5 with 87 rules applied. Total rules applied 300 place count 47 transition count 330
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 305 place count 42 transition count 263
Iterating global reduction 6 with 5 rules applied. Total rules applied 310 place count 42 transition count 263
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 320 place count 42 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 7 with 80 rules applied. Total rules applied 400 place count 42 transition count 173
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 7 with 1 rules applied. Total rules applied 401 place count 42 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 402 place count 41 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 402 place count 41 transition count 171
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 404 place count 40 transition count 171
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 405 place count 39 transition count 165
Iterating global reduction 9 with 1 rules applied. Total rules applied 406 place count 39 transition count 165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 410 place count 37 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 413 place count 37 transition count 160
Applied a total of 413 rules in 73 ms. Remains 37 /155 variables (removed 118) and now considering 160/393 (removed 233) transitions.
[2026-05-25 09:19:39] [INFO ] Flow matrix only has 143 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16840386132599202246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8181960717879869121.kers'
[2026-05-25 09:19:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16840386132599202246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8181960717879869121.kers]
Normalized transition count is 142 out of 143 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 37 cols 588 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:19:39] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8181960717879869121.kers
Total runtime 1 ms.
[2026-05-25 09:19:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:19:39] [INFO ] Flow matrix only has 143 transitions (discarded 17 similar events)
[2026-05-25 09:19:39] [INFO ] Invariant cache hit.
[2026-05-25 09:19:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:19:39] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2026-05-25 09:19:39] [INFO ] Redundant transitions in 19 ms returned [130, 131, 156, 157, 159]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 149 sub problems to find dead transitions.
[2026-05-25 09:19:39] [INFO ] Flow matrix only has 138 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12298242030620695607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9605211098535302006.kers'
[2026-05-25 09:19:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12298242030620695607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9605211098535302006.kers]
Normalized transition count is 137 out of 138 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 37 cols 568 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:19:39] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9605211098535302006.kers
Total runtime 0 ms.
[2026-05-25 09:19:39] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 137/174 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/175 variables, and 82 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4803 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 137/174 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 35/82 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 149/231 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/175 variables, and 232 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9430 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14264ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 14265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/155 places, 155/393 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 36 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 36 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 35 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 34 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 34 transition count 151
Applied a total of 6 rules in 14 ms. Remains 34 /37 variables (removed 3) and now considering 151/155 (removed 4) transitions.
[2026-05-25 09:19:53] [INFO ] Flow matrix only has 134 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5908544205031408428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6433646181289401954.kers'
[2026-05-25 09:19:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5908544205031408428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6433646181289401954.kers]
Normalized transition count is 133 out of 134 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 34 cols 558 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 09:19:53] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6433646181289401954.kers
Total runtime 2 ms.
[2026-05-25 09:19:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:19:53] [INFO ] Flow matrix only has 134 transitions (discarded 17 similar events)
[2026-05-25 09:19:53] [INFO ] Invariant cache hit.
[2026-05-25 09:19:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:19:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/155 places, 151/393 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14662 ms. Remains : 34/155 places, 151/393 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 28 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-04 finished in 14724 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||F(p1))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 157 edges and 155 vertex of which 9 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 148 transition count 366
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 128 transition count 365
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 42 place count 128 transition count 357
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 120 transition count 357
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 111 transition count 342
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 111 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 82 place count 111 transition count 336
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 82 place count 111 transition count 334
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 86 place count 109 transition count 334
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 108 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 108 transition count 330
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 3 with 32 rules applied. Total rules applied 120 place count 92 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 92 transition count 312
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 90 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 90 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 160 place count 73 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 196 place count 73 transition count 388
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 70 transition count 423
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 70 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 69 transition count 422
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 68 vertex of which 15 / 68 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 206 place count 59 transition count 422
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 246 place count 59 transition count 382
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 249 place count 56 transition count 322
Iterating global reduction 6 with 3 rules applied. Total rules applied 252 place count 56 transition count 322
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 266 place count 56 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 268 place count 55 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 7 with 58 rules applied. Total rules applied 326 place count 55 transition count 260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 327 place count 54 transition count 247
Iterating global reduction 7 with 1 rules applied. Total rules applied 328 place count 54 transition count 247
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
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 332 place count 52 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 350 place count 52 transition count 249
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 351 place count 51 transition count 243
Iterating global reduction 7 with 1 rules applied. Total rules applied 352 place count 51 transition count 243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 357 place count 51 transition count 238
Applied a total of 357 rules in 43 ms. Remains 51 /155 variables (removed 104) and now considering 238/393 (removed 155) transitions.
[2026-05-25 09:19:54] [INFO ] Flow matrix only has 190 transitions (discarded 48 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9598494180468115896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10744590107656376577.kers'
[2026-05-25 09:19:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9598494180468115896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10744590107656376577.kers]
Normalized transition count is 189 out of 190 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 189 rows 50 cols 701 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-25 09:19:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10744590107656376577.kers
Total runtime 1 ms.
[2026-05-25 09:19:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:19:54] [INFO ] Flow matrix only has 190 transitions (discarded 48 similar events)
[2026-05-25 09:19:54] [INFO ] Invariant cache hit.
[2026-05-25 09:19:54] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 09:19:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-25 09:19:54] [INFO ] Redundant transitions in 17 ms returned [216, 228, 235]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 229 sub problems to find dead transitions.
[2026-05-25 09:19:54] [INFO ] Flow matrix only has 187 transitions (discarded 48 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13346225936857452529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4992850706009404084.kers'
[2026-05-25 09:19:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13346225936857452529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4992850706009404084.kers]
Normalized transition count is 186 out of 187 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 186 rows 50 cols 691 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-25 09:19:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4992850706009404084.kers
Total runtime 0 ms.
[2026-05-25 09:19:54] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 186/237 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 51/112 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 113 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10568 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 186/237 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 51/112 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 229/341 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 1/238 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 343 constraints, problems are : Problem set: 0 solved, 229 unsolved in 25927 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36537ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 36537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/155 places, 235/393 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36764 ms. Remains : 51/155 places, 235/393 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((F(p0)||p1)))'
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 344 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/3 properties
[2026-05-25 09:20:31] [INFO ] Flow matrix only has 187 transitions (discarded 48 similar events)
[2026-05-25 09:20:31] [INFO ] Invariant cache hit.
[2026-05-25 09:20:31] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 86/108 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/219 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/229 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/237 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 42/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/238 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 86/108 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/219 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/229 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/237 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 42/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/238 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 235/235 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 51 transition count 229
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 1 with 2 rules applied. Total rules applied 8 place count 50 transition count 238
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 50 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 50 transition count 225
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 31 place count 50 transition count 215
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 45 place count 40 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 58 place count 40 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 40 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 39 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 70 place count 39 transition count 197
Applied a total of 70 rules in 21 ms. Remains 39 /51 variables (removed 12) and now considering 197/235 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 39/51 places, 197/235 transitions.
RANDOM walk for 40000 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 33389 steps (7 resets) in 51 ms. (642 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 840 ms.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 235/235 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2026-05-25 09:20:32] [INFO ] Flow matrix only has 187 transitions (discarded 48 similar events)
[2026-05-25 09:20:32] [INFO ] Invariant cache hit.
[2026-05-25 09:20:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 09:20:32] [INFO ] Flow matrix only has 187 transitions (discarded 48 similar events)
[2026-05-25 09:20:32] [INFO ] Invariant cache hit.
[2026-05-25 09:20:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 09:20:32] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-25 09:20:32] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 51/51 places, 235/235 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 30011 steps (6 resets) in 151 ms. (197 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 260 ms.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Built C files in :
/tmp/ltsmin15107417527974544669
[2026-05-25 09:20:32] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2026-05-25 09:20:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:20:32] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2026-05-25 09:20:32] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:20:32] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2026-05-25 09:20:32] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:20:32] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15107417527974544669
Running compilation step : cd /tmp/ltsmin15107417527974544669;'/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 799 ms.
Running link step : cd /tmp/ltsmin15107417527974544669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin15107417527974544669;'/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/stateBased4105717193495215988.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA MedleyA-PT-15-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLCardinality-06 finished in 40009 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(F(p0)))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 159 edges and 155 vertex of which 9 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 148 transition count 364
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 126 transition count 363
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 46 place count 126 transition count 354
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 64 place count 117 transition count 354
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 108 transition count 339
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 108 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 108 transition count 336
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 85 place count 108 transition count 334
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 106 transition count 334
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 105 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 105 transition count 330
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 3 with 32 rules applied. Total rules applied 123 place count 89 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 89 transition count 312
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 87 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 87 transition count 307
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -128
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 165 place count 69 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 69 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 203 place count 69 transition count 397
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 209 place count 66 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 65 transition count 434
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 74 edges and 63 vertex of which 23 / 63 are part of one of the 9 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 49 transition count 434
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 6 with 66 rules applied. Total rules applied 279 place count 49 transition count 368
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 282 place count 46 transition count 322
Iterating global reduction 7 with 3 rules applied. Total rules applied 285 place count 46 transition count 322
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 296 place count 46 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 298 place count 45 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 299 place count 45 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 124 transitions
Redundant transition composition rules discarded 124 transitions
Iterating global reduction 9 with 124 rules applied. Total rules applied 423 place count 45 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 423 place count 45 transition count 199
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 427 place count 43 transition count 199
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 428 place count 42 transition count 192
Iterating global reduction 9 with 1 rules applied. Total rules applied 429 place count 42 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 433 place count 40 transition count 190
Applied a total of 433 rules in 70 ms. Remains 40 /155 variables (removed 115) and now considering 190/393 (removed 203) transitions.
[2026-05-25 09:20:34] [INFO ] Flow matrix only has 170 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10420021016561893016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2370023149097235320.kers'
[2026-05-25 09:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10420021016561893016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2370023149097235320.kers]
Normalized transition count is 169 out of 170 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 40 cols 684 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 09:20:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2370023149097235320.kers
Total runtime 1 ms.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:20:34] [INFO ] Flow matrix only has 170 transitions (discarded 20 similar events)
[2026-05-25 09:20:34] [INFO ] Invariant cache hit.
[2026-05-25 09:20:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2026-05-25 09:20:34] [INFO ] Redundant transitions in 146 ms returned [10, 97, 98, 100, 102, 128, 130, 131, 164, 165, 172, 173, 174, 177, 178, 181, 183, 184, 185, 186, 189]
Found 21 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 21 transitions
Redundant transitions reduction (with SMT) removed 21 transitions.
Running 163 sub problems to find dead transitions.
[2026-05-25 09:20:34] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14398118708359419455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6339670487697720673.kers'
[2026-05-25 09:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14398118708359419455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6339670487697720673.kers]
Normalized transition count is 148 out of 149 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 40 cols 600 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 09:20:34] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6339670487697720673.kers
Total runtime 2 ms.
[2026-05-25 09:20:34] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 148/188 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/189 variables, and 85 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5930 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 148/188 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 163/248 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/189 variables, and 249 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13995 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19968ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 19969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/155 places, 169/393 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 40 transition count 167
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 37 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 37 transition count 164
Applied a total of 8 rules in 8 ms. Remains 37 /40 variables (removed 3) and now considering 164/169 (removed 5) transitions.
[2026-05-25 09:20:54] [INFO ] Flow matrix only has 144 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5034292928193213189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11306906633109407286.kers'
[2026-05-25 09:20:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5034292928193213189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11306906633109407286.kers]
Normalized transition count is 143 out of 144 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 37 cols 588 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:20:54] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11306906633109407286.kers
Total runtime 1 ms.
[2026-05-25 09:20:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:20:54] [INFO ] Flow matrix only has 144 transitions (discarded 20 similar events)
[2026-05-25 09:20:54] [INFO ] Invariant cache hit.
[2026-05-25 09:20:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:20:54] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/155 places, 164/393 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20666 ms. Remains : 37/155 places, 164/393 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(F(p0)))'
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLCardinality-07 finished in 20756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 144 transition count 377
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 144 transition count 377
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 144 transition count 369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 142 transition count 365
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 142 transition count 365
Applied a total of 34 rules in 6 ms. Remains 142 /155 variables (removed 13) and now considering 365/393 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14067012493153913495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3059999536921426237.kers'
[2026-05-25 09:20:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14067012493153913495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3059999536921426237.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 142 cols 1254 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:20:54] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3059999536921426237.kers
Total runtime 2 ms.
[2026-05-25 09:20:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:20:54] [INFO ] Invariant cache hit.
[2026-05-25 09:20:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/507 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/507 variables, and 167 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/507 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 364/532 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 537 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 142/155 places, 365/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60319 ms. Remains : 142/155 places, 365/393 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Product exploration explored 100000 steps with 33333 reset in 78 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 9 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 12 ms.
FORMULA MedleyA-PT-15-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLCardinality-08 finished in 60707 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 U p1))))'
Support contains 5 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 151 edges and 155 vertex of which 6 / 155 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 150 transition count 366
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 128 transition count 365
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 46 place count 128 transition count 357
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 62 place count 120 transition count 357
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 111 transition count 342
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 111 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 111 transition count 336
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 86 place count 111 transition count 334
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 90 place count 109 transition count 334
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 120 place count 94 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 94 transition count 317
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 92 transition count 311
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 92 transition count 311
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 156 place count 77 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 178 place count 77 transition count 389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 186 place count 73 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 72 transition count 435
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 70 vertex of which 25 / 70 are part of one of the 10 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 190 place count 55 transition count 435
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 5 with 69 rules applied. Total rules applied 259 place count 55 transition count 366
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 263 place count 51 transition count 310
Iterating global reduction 6 with 4 rules applied. Total rules applied 267 place count 51 transition count 310
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 276 place count 51 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 370 place count 51 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 370 place count 51 transition count 206
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 372 place count 50 transition count 206
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 373 place count 49 transition count 200
Iterating global reduction 7 with 1 rules applied. Total rules applied 374 place count 49 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 378 place count 47 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
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 382 place count 45 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 399 place count 45 transition count 194
Applied a total of 399 rules in 66 ms. Remains 45 /155 variables (removed 110) and now considering 194/393 (removed 199) transitions.
[2026-05-25 09:21:55] [INFO ] Flow matrix only has 175 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5677221582752616540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6346501033924966391.kers'
[2026-05-25 09:21:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5677221582752616540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6346501033924966391.kers]
Normalized transition count is 174 out of 175 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 45 cols 758 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 09:21:55] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6346501033924966391.kers
Total runtime 2 ms.
[2026-05-25 09:21:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:21:55] [INFO ] Flow matrix only has 175 transitions (discarded 19 similar events)
[2026-05-25 09:21:55] [INFO ] Invariant cache hit.
[2026-05-25 09:21:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 09:21:55] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2026-05-25 09:21:55] [INFO ] Redundant transitions in 45 ms returned [16, 105, 106, 108, 135, 136, 137, 168, 171, 173, 174, 175]
Found 12 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 12 transitions
Redundant transitions reduction (with SMT) removed 12 transitions.
Running 178 sub problems to find dead transitions.
[2026-05-25 09:21:55] [INFO ] Flow matrix only has 163 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17617113239171921171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18039467417176312019.kers'
[2026-05-25 09:21:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17617113239171921171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18039467417176312019.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 45 cols 710 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 09:21:55] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18039467417176312019.kers
Total runtime 2 ms.
[2026-05-25 09:21:55] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 162/207 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/208 variables, and 69 constraints, problems are : Problem set: 0 solved, 178 unsolved in 8073 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 162/207 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 178/247 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/208 variables, and 247 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38135ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 38136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/155 places, 182/393 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 45 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 43 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 43 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 29 place count 41 transition count 156
Applied a total of 29 rules in 11 ms. Remains 41 /45 variables (removed 4) and now considering 156/182 (removed 26) transitions.
[2026-05-25 09:22:33] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5204799136517896223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3024912854020660155.kers'
[2026-05-25 09:22:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5204799136517896223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3024912854020660155.kers]
Normalized transition count is 142 out of 143 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 41 cols 652 entries
Finished phase 1 with 35 SingleSign rule and 1 generalized
[2026-05-25 09:22:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3024912854020660155.kers
Total runtime 14 ms.
[2026-05-25 09:22:34] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 09:22:34] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
[2026-05-25 09:22:34] [INFO ] Invariant cache hit.
[2026-05-25 09:22:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 09:22:34] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/155 places, 156/393 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38693 ms. Remains : 41/155 places, 156/393 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 U p1))))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 90 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8939 resets) in 497 ms. (80 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (4444 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
[2026-05-25 09:22:34] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
[2026-05-25 09:22:34] [INFO ] Invariant cache hit.
[2026-05-25 09:22:34] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/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) 137/169 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/183 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/184 variables, and 53 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 137/169 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/183 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/184 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 324 steps, including 90 resets, run visited all 1 properties in 2 ms. (steps per millisecond=162 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 11 factoid took 161 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 106 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 923 ms.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-25 09:22:35] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
[2026-05-25 09:22:35] [INFO ] Invariant cache hit.
[2026-05-25 09:22:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 09:22:35] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
[2026-05-25 09:22:35] [INFO ] Invariant cache hit.
[2026-05-25 09:22:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 09:22:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2026-05-25 09:22:35] [INFO ] Redundant transitions in 23 ms returned []
Running 152 sub problems to find dead transitions.
[2026-05-25 09:22:35] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
[2026-05-25 09:22:35] [INFO ] Invariant cache hit.
[2026-05-25 09:22:35] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 142/183 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/184 variables, and 60 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6590 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 142/183 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 152/212 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/184 variables, and 212 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13694ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 13695ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13921 ms. Remains : 41/41 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 58 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8976 resets) in 135 ms. (294 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (4444 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2026-05-25 09:22:49] [INFO ] Flow matrix only has 143 transitions (discarded 13 similar events)
[2026-05-25 09:22:49] [INFO ] Invariant cache hit.
[2026-05-25 09:22:49] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/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) 137/169 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/183 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/184 variables, and 53 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 137/169 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/183 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/184 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 329 steps, including 96 resets, run visited all 1 properties in 2 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 4 ms.
Knowledge based reduction with 11 factoid took 138 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 113 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 723 ms.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Built C files in :
/tmp/ltsmin5834840840910324396
[2026-05-25 09:22:50] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2026-05-25 09:22:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:50] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2026-05-25 09:22:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:50] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2026-05-25 09:22:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:50] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5834840840910324396
Running compilation step : cd /tmp/ltsmin5834840840910324396;'/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 376 ms.
Running link step : cd /tmp/ltsmin5834840840910324396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin5834840840910324396;'/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/stateBased8650111423400214529.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA MedleyA-PT-15-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLCardinality-12 finished in 55686 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)))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 393/393 transitions.
Graph (trivial) has 145 edges and 155 vertex of which 9 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 148 transition count 364
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 126 transition count 363
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 46 place count 126 transition count 354
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 64 place count 117 transition count 354
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 108 transition count 339
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 108 transition count 339
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 108 transition count 333
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 88 place count 108 transition count 331
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 92 place count 106 transition count 331
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 105 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 105 transition count 327
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 124 place count 90 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 90 transition count 311
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 128 place count 87 transition count 304
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 87 transition count 304
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 161 place count 72 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 194 place count 72 transition count 367
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 202 place count 68 transition count 414
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 67 transition count 413
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 67 edges and 65 vertex of which 29 / 65 are part of one of the 11 SCC in 1 ms
Free SCC test removed 18 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 206 place count 47 transition count 413
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 5 with 79 rules applied. Total rules applied 285 place count 47 transition count 334
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 289 place count 43 transition count 280
Iterating global reduction 6 with 4 rules applied. Total rules applied 293 place count 43 transition count 280
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 303 place count 43 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 7 with 98 rules applied. Total rules applied 401 place count 43 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 401 place count 43 transition count 170
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 405 place count 41 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 407 place count 40 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 409 place count 39 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 413 place count 39 transition count 171
Applied a total of 413 rules in 63 ms. Remains 39 /155 variables (removed 116) and now considering 171/393 (removed 222) transitions.
[2026-05-25 09:22:51] [INFO ] Flow matrix only has 156 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13352818767492737349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10493915868567289705.kers'
[2026-05-25 09:22:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13352818767492737349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10493915868567289705.kers]
Normalized transition count is 155 out of 156 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 39 cols 630 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 09:22:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10493915868567289705.kers
Total runtime 1 ms.
[2026-05-25 09:22:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 09:22:51] [INFO ] Flow matrix only has 156 transitions (discarded 15 similar events)
[2026-05-25 09:22:51] [INFO ] Invariant cache hit.
[2026-05-25 09:22:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 09:22:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2026-05-25 09:22:51] [INFO ] Redundant transitions in 24 ms returned [110, 111, 115, 116, 117, 118, 137, 138, 151, 152, 154]
Found 11 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 11 transitions
Redundant transitions reduction (with SMT) removed 11 transitions.
Running 154 sub problems to find dead transitions.
[2026-05-25 09:22:51] [INFO ] Flow matrix only has 145 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12363628150645301501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11765727015019400813.kers'
[2026-05-25 09:22:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12363628150645301501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11765727015019400813.kers]
Normalized transition count is 144 out of 145 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 39 cols 586 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 09:22:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11765727015019400813.kers
Total runtime 1 ms.
[2026-05-25 09:22:51] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 144/183 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/184 variables, and 82 constraints, problems are : Problem set: 0 solved, 154 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 144/183 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 154/236 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/184 variables, and 237 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15235ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 15236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/155 places, 160/393 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 39 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 36 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 36 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 35 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 34 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 30 place count 34 transition count 135
Applied a total of 30 rules in 9 ms. Remains 34 /39 variables (removed 5) and now considering 135/160 (removed 25) transitions.
[2026-05-25 09:23:06] [INFO ] Flow matrix only has 126 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17215013981976186848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1244876492171887292.kers'
[2026-05-25 09:23:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17215013981976186848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1244876492171887292.kers]
Normalized transition count is 125 out of 126 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 34 cols 532 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 09:23:06] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1244876492171887292.kers
Total runtime 1 ms.
[2026-05-25 09:23:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 09:23:06] [INFO ] Flow matrix only has 126 transitions (discarded 9 similar events)
[2026-05-25 09:23:06] [INFO ] Invariant cache hit.
[2026-05-25 09:23:06] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-25 09:23:06] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/155 places, 135/393 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15573 ms. Remains : 34/155 places, 135/393 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)))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 10240 steps (2621 resets) in 27 ms. (365 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Knowledge-based reduction took 247 ms.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 09:23:07] [INFO ] Flow matrix only has 126 transitions (discarded 9 similar events)
[2026-05-25 09:23:07] [INFO ] Invariant cache hit.
[2026-05-25 09:23:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:23:07] [INFO ] Flow matrix only has 126 transitions (discarded 9 similar events)
[2026-05-25 09:23:07] [INFO ] Invariant cache hit.
[2026-05-25 09:23:07] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-25 09:23:07] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2026-05-25 09:23:07] [INFO ] Redundant transitions in 26 ms returned [123, 124, 134]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 126 sub problems to find dead transitions.
[2026-05-25 09:23:07] [INFO ] Flow matrix only has 123 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14390984162821564653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14440876655996723014.kers'
[2026-05-25 09:23:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14390984162821564653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14440876655996723014.kers]
Normalized transition count is 122 out of 123 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 34 cols 520 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 09:23:07] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-14440876655996723014.kers
Total runtime 14 ms.
[2026-05-25 09:23:07] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 122/156 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3801 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 122/156 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 126/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/157 variables, and 197 constraints, problems are : Problem set: 0 solved, 126 unsolved in 7001 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10872ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10873ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 132/135 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 34 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 31 transition count 129
Applied a total of 6 rules in 7 ms. Remains 31 /34 variables (removed 3) and now considering 129/132 (removed 3) transitions.
[2026-05-25 09:23:18] [INFO ] Flow matrix only has 120 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9544830677314918028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10249612563898788387.kers'
[2026-05-25 09:23:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9544830677314918028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10249612563898788387.kers]
Normalized transition count is 119 out of 120 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 31 cols 514 entries
Finished phase 1 with 25 SingleSign rule and 1 generalized
[2026-05-25 09:23:18] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10249612563898788387.kers
Total runtime 1 ms.
[2026-05-25 09:23:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 09:23:18] [INFO ] Flow matrix only has 120 transitions (discarded 9 similar events)
[2026-05-25 09:23:18] [INFO ] Invariant cache hit.
[2026-05-25 09:23:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-25 09:23:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/34 places, 129/135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11308 ms. Remains : 31/34 places, 129/135 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 2683 steps (666 resets) in 11 ms. (223 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Knowledge-based reduction took 237 ms.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 60 ms.
Built C files in :
/tmp/ltsmin2532531507899148567
[2026-05-25 09:23:19] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2026-05-25 09:23:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:23:19] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2026-05-25 09:23:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:23:19] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2026-05-25 09:23:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:23:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2532531507899148567
Running compilation step : cd /tmp/ltsmin2532531507899148567;'/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 303 ms.
Running link step : cd /tmp/ltsmin2532531507899148567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin2532531507899148567;'/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/stateBased7312120899679365768.hoa' '--buchi-type=spotba'
LTSmin run took 82 ms.
FORMULA MedleyA-PT-15-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLCardinality-15 finished in 28470 ms.
All properties solved by simple procedures.
Total runtime 511622 ms.

BK_STOP 1779700999712

--------------------
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="MedleyA-PT-15"
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 MedleyA-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020000211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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