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-177969019900131.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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 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 75K 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-05-LTLCardinality-00
FORMULA_NAME MedleyA-PT-05-LTLCardinality-01
FORMULA_NAME MedleyA-PT-05-LTLCardinality-02
FORMULA_NAME MedleyA-PT-05-LTLCardinality-03
FORMULA_NAME MedleyA-PT-05-LTLCardinality-04
FORMULA_NAME MedleyA-PT-05-LTLCardinality-05
FORMULA_NAME MedleyA-PT-05-LTLCardinality-06
FORMULA_NAME MedleyA-PT-05-LTLCardinality-07
FORMULA_NAME MedleyA-PT-05-LTLCardinality-08
FORMULA_NAME MedleyA-PT-05-LTLCardinality-09
FORMULA_NAME MedleyA-PT-05-LTLCardinality-10
FORMULA_NAME MedleyA-PT-05-LTLCardinality-11
FORMULA_NAME MedleyA-PT-05-LTLCardinality-12
FORMULA_NAME MedleyA-PT-05-LTLCardinality-13
FORMULA_NAME MedleyA-PT-05-LTLCardinality-14
FORMULA_NAME MedleyA-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699152539

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:52:33] [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 08:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:52:34] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-25 08:52:34] [INFO ] Transformed 115 places.
[2026-05-25 08:52:34] [INFO ] Transformed 257 transitions.
[2026-05-25 08:52:34] [INFO ] Found NUPN structural information;
[2026-05-25 08:52:34] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 102 transition count 228
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 102 transition count 228
Applied a total of 26 rules in 34 ms. Remains 102 /115 variables (removed 13) and now considering 228/254 (removed 26) transitions.
[2026-05-25 08:52:34] [INFO ] Flow matrix only has 227 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14069519546590001991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17707220620721416610.kers'
[2026-05-25 08:52:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14069519546590001991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17707220620721416610.kers]
Normalized transition count is 226 out of 227 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 102 cols 853 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 08:52:34] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17707220620721416610.kers
Total runtime 2 ms.
[2026-05-25 08:52:34] [INFO ] Implicit Places using invariants in 391 ms returned []
[2026-05-25 08:52:34] [INFO ] Flow matrix only has 227 transitions (discarded 1 similar events)
[2026-05-25 08:52:34] [INFO ] Invariant cache hit.
[2026-05-25 08:52:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:52:35] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-25 08:52:35] [INFO ] Flow matrix only has 227 transitions (discarded 1 similar events)
[2026-05-25 08:52:35] [INFO ] Invariant cache hit.
[2026-05-25 08:52:35] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 226/328 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 93/221 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 1/329 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 222 constraints, problems are : Problem set: 0 solved, 227 unsolved in 15664 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 226/328 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 93/221 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 227/448 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 1/329 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/329 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 449 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45858ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 45883ms
Starting structural reductions in LTL mode, iteration 1 : 102/115 places, 228/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46637 ms. Remains : 102/115 places, 228/254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-25 08:53:21] [INFO ] Flow matrix only has 227 transitions (discarded 1 similar events)
[2026-05-25 08:53:21] [INFO ] Invariant cache hit.
[2026-05-25 08:53:21] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 08:53:21] [INFO ] Flow matrix only has 227 transitions (discarded 1 similar events)
[2026-05-25 08:53:21] [INFO ] Invariant cache hit.
[2026-05-25 08:53:21] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:53:21] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 102/102 places, 228/228 transitions.
Support contains 27 out of 102 places after structural reductions.
[2026-05-25 08:53:21] [INFO ] Flatten gal took : 45 ms
[2026-05-25 08:53:21] [INFO ] Flatten gal took : 16 ms
[2026-05-25 08:53:21] [INFO ] Input system was already deterministic with 228 transitions.
RANDOM walk for 40000 steps (2992 resets) in 1459 ms. (27 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40003 steps (485 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (466 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (482 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (461 resets) in 190 ms. (209 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (488 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
[2026-05-25 08:53:22] [INFO ] Flow matrix only has 227 transitions (discarded 1 similar events)
[2026-05-25 08:53:22] [INFO ] Invariant cache hit.
[2026-05-25 08:53:22] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 33/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/88 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/100 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 225/325 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/328 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/329 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 33/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/88 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/100 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 225/325 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/328 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/329 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/329 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 220 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1355ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 162 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 228/228 transitions.
Graph (complete) has 409 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 101 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 224
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 10 place count 95 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 95 transition count 214
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 84 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 84 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 80 place count 84 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 83 transition count 259
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 97 place count 83 transition count 312
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 128 place count 68 transition count 296
Applied a total of 128 rules in 68 ms. Remains 68 /102 variables (removed 34) and now considering 296/228 (removed -68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 68/102 places, 296/228 transitions.
RANDOM walk for 34284 steps (4438 resets) in 1007 ms. (34 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-05-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 511 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F((p1 U (p2||G(p1)))))))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 218
Applied a total of 10 rules in 4 ms. Remains 97 /102 variables (removed 5) and now considering 218/228 (removed 10) transitions.
[2026-05-25 08:53:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3215048599631701631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11904259960911619890.kers'
[2026-05-25 08:53:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3215048599631701631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11904259960911619890.kers]
Normalized transition count is 216 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 97 cols 833 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 08:53:24] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11904259960911619890.kers
Total runtime 1 ms.
[2026-05-25 08:53:24] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 08:53:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:53:24] [INFO ] Invariant cache hit.
[2026-05-25 08:53:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:53:25] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 08:53:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:53:25] [INFO ] Invariant cache hit.
[2026-05-25 08:53:25] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16576 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 29173 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45854ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45855ms
Starting structural reductions in LTL mode, iteration 1 : 97/102 places, 218/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46224 ms. Remains : 97/102 places, 218/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(F((p0 U (p1||G(p0)))))))||p2))))'
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 5 reset in 121 ms.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 491 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (3002 resets) in 340 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (481 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (479 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2026-05-25 08:54:11] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:54:11] [INFO ] Invariant cache hit.
[2026-05-25 08:54:11] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/83 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/313 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/314 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/83 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/313 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/314 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/314 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 726ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 13 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 218/218 transitions.
Graph (complete) has 389 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 96 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 95 transition count 214
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 27 place count 84 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 84 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 70 place count 84 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 83 transition count 259
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 87 place count 83 transition count 312
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 118 place count 68 transition count 296
Applied a total of 118 rules in 43 ms. Remains 68 /97 variables (removed 29) and now considering 296/218 (removed -78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 68/97 places, 296/218 transitions.
RANDOM walk for 36835 steps (4792 resets) in 210 ms. (174 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1507 ms.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 08:54:13] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:54:13] [INFO ] Invariant cache hit.
[2026-05-25 08:54:13] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 08:54:13] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:54:13] [INFO ] Invariant cache hit.
[2026-05-25 08:54:13] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:54:13] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 97/97 places, 218/218 transitions.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 491 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (2967 resets) in 220 ms. (180 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (482 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (472 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
[2026-05-25 08:54:14] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:54:14] [INFO ] Invariant cache hit.
[2026-05-25 08:54:14] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/83 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/313 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/314 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/83 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/313 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/314 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/314 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 14 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 218/218 transitions.
Graph (complete) has 389 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 96 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 95 transition count 214
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 27 place count 84 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 84 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 70 place count 84 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 83 transition count 259
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 87 place count 83 transition count 312
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 118 place count 68 transition count 296
Applied a total of 118 rules in 32 ms. Remains 68 /97 variables (removed 29) and now considering 296/218 (removed -78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 68/97 places, 296/218 transitions.
RANDOM walk for 40000 steps (5201 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (538 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1461340 steps, run visited all 1 properties in 2742 ms. (steps per millisecond=532 )
Probabilistic random walk after 1461340 steps, saw 233019 distinct states, run finished after 2758 ms. (steps per millisecond=529 ) properties seen :1
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 4208 ms.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 125 ms.
Product exploration explored 100000 steps with 3 reset in 89 ms.
Spot run failed in 119 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2106849896500680725
[2026-05-25 08:54:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2106849896500680725
Running compilation step : cd /tmp/ltsmin2106849896500680725;'/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 629 ms.
Running link step : cd /tmp/ltsmin2106849896500680725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin2106849896500680725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4122987114703675327.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 08:54:34] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:54:34] [INFO ] Invariant cache hit.
[2026-05-25 08:54:34] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 08:54:34] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:54:34] [INFO ] Invariant cache hit.
[2026-05-25 08:54:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:54:34] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 97/97 places, 218/218 transitions.
Built C files in :
/tmp/ltsmin5594571201955927475
[2026-05-25 08:54:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5594571201955927475
Running compilation step : cd /tmp/ltsmin5594571201955927475;'/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 388 ms.
Running link step : cd /tmp/ltsmin5594571201955927475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5594571201955927475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15410708995876071417.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 08:54:49] [INFO ] Flatten gal took : 14 ms
[2026-05-25 08:54:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:54:49] [INFO ] Time to serialize gal into /tmp/LTL15287012308694522757.gal : 5 ms
[2026-05-25 08:54:49] [INFO ] Time to serialize properties into /tmp/LTL8431629422775191320.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15287012308694522757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10475431877040064334.hoa' '-atoms' '/tmp/LTL8431629422775191320.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8431629422775191320.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10475431877040064334.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t9, t11, t12, t18, t19, t20, t21, t29, t30, t42, t44, t45, t47, t48, t53, t54...354
Computing Next relation with stutter on 384 deadlock states
Detected timeout of ITS tools.
[2026-05-25 08:55:04] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:55:04] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:55:04] [INFO ] Time to serialize gal into /tmp/LTL11690973079344177372.gal : 3 ms
[2026-05-25 08:55:04] [INFO ] Time to serialize properties into /tmp/LTL8390370550509289966.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11690973079344177372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8390370550509289966.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(F(("(p5!=1)")U(("((p1==1)&&(p5!=1))")||(G("(p5!=1)"))))))))||("((p79!=0)&&(p41!=1))")))))
Formula 0 simplified : XF(!"((p79!=0)&&(p41!=1))" & XXXG(!"(p5!=1)" M !"((p1==1)&&(p5!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t9, t11, t12, t18, t19, t20, t21, t29, t30, t42, t44, t45, t47, t48, t53, t54...354
Computing Next relation with stutter on 384 deadlock states
Detected timeout of ITS tools.
[2026-05-25 08:55:19] [INFO ] Flatten gal took : 26 ms
[2026-05-25 08:55:19] [INFO ] Applying decomposition
[2026-05-25 08:55:19] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph773954747334909528.txt' '-o' '/tmp/graph773954747334909528.bin' '-w' '/tmp/graph773954747334909528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph773954747334909528.bin' '-l' '-1' '-v' '-w' '/tmp/graph773954747334909528.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:55:20] [INFO ] Decomposing Gal with order
[2026-05-25 08:55:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:55:20] [INFO ] Removed a total of 386 redundant transitions.
[2026-05-25 08:55:20] [INFO ] Flatten gal took : 123 ms
[2026-05-25 08:55:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 9 ms.
[2026-05-25 08:55:20] [INFO ] Time to serialize gal into /tmp/LTL4923986380152171569.gal : 3 ms
[2026-05-25 08:55:20] [INFO ] Time to serialize properties into /tmp/LTL15008453303020623702.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4923986380152171569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15008453303020623702.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(F(("(i0.u1.p5!=1)")U(("((i4.u24.p1==1)&&(i0.u1.p5!=1))")||(G("(i0.u1.p5!=1)"))))))))||("((i2.u17.p79!=0)&&(i1.i0.u8.p41!...165
Formula 0 simplified : XF(!"((i2.u17.p79!=0)&&(i1.i0.u8.p41!=1))" & XXXG(!"(i0.u1.p5!=1)" M !"((i4.u24.p1==1)&&(i0.u1.p5!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t181, t183, t185, t187, i0.t227, i0.t77, i0.t76, i0.u0.t53, i0.u0.t54, i0.u3.t79, i0.u3.t80, ...494
Computing Next relation with stutter on 384 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
200 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.02574,90544,1,0,131494,1035,2363,416526,495,5644,98579
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-05-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-05-LTLCardinality-01 finished in 118124 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 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Graph (complete) has 511 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 225
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 95 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 95 transition count 217
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
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 29 place count 86 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 86 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 45 place count 86 transition count 255
Applied a total of 45 rules in 21 ms. Remains 86 /102 variables (removed 16) and now considering 255/228 (removed -27) transitions.
[2026-05-25 08:55:22] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5066205545845294379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15414246745151474154.kers'
[2026-05-25 08:55:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5066205545845294379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15414246745151474154.kers]
Normalized transition count is 253 out of 254 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 86 cols 1078 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 08:55:22] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15414246745151474154.kers
Total runtime 1 ms.
[2026-05-25 08:55:22] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 08:55:22] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:55:22] [INFO ] Invariant cache hit.
[2026-05-25 08:55:23] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 08:55:23] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2026-05-25 08:55:23] [INFO ] Redundant transitions in 40 ms returned []
Running 246 sub problems to find dead transitions.
[2026-05-25 08:55:23] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:55:23] [INFO ] Invariant cache hit.
[2026-05-25 08:55:23] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 137 constraints, problems are : Problem set: 0 solved, 246 unsolved in 19160 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 246/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 383 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49331ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 49332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/102 places, 255/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49702 ms. Remains : 86/102 places, 255/228 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 124 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-05
Product exploration explored 100000 steps with 2 reset in 147 ms.
Product exploration explored 100000 steps with 5 reset in 156 ms.
Computed a total of 10 stabilizing places and 123 stable transitions
Computed a total of 10 stabilizing places and 123 stable transitions
Detected a total of 10/86 stabilizing places and 123/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 12 factoid took 83 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 (3806 resets) in 432 ms. (92 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (511 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (482 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (497 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
[2026-05-25 08:56:13] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:56:13] [INFO ] Invariant cache hit.
[2026-05-25 08:56:13] [INFO ] State equation strengthened by 29 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/43 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/49 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 178/227 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 81/308 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 18/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 12/320 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 3/323 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/323 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 3/326 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/326 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 13/339 variables, 17/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/339 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/339 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/340 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/340 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/340 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 135 constraints, problems are : Problem set: 0 solved, 3 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/31 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/43 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/49 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 178/227 variables, 49/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 8/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 81/308 variables, 19/87 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 2/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 18/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/320 variables, 4/113 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/320 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 3/323 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/323 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 3/326 variables, 2/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 13/339 variables, 17/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/339 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/339 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/340 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/340 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/340 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 137 constraints, problems are : Problem set: 1 solved, 2 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 255/255 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 253
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 21 place count 86 transition count 545
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 65 place count 67 transition count 520
Drop transitions (Redundant composition of simpler transitions.) removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 2 with 145 rules applied. Total rules applied 210 place count 67 transition count 375
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 67 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 66 transition count 394
Applied a total of 212 rules in 41 ms. Remains 66 /86 variables (removed 20) and now considering 394/255 (removed -139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 66/86 places, 394/255 transitions.
RANDOM walk for 7089 steps (790 resets) in 238 ms. (29 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 13 factoid took 89 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Knowledge-based reduction took 1564 ms.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Support contains 2 out of 86 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2026-05-25 08:56:14] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:56:14] [INFO ] Invariant cache hit.
[2026-05-25 08:56:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 08:56:14] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:56:14] [INFO ] Invariant cache hit.
[2026-05-25 08:56:14] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 08:56:14] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-25 08:56:14] [INFO ] Redundant transitions in 39 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 86/86 places, 255/255 transitions.
Computed a total of 10 stabilizing places and 123 stable transitions
Computed a total of 10 stabilizing places and 123 stable transitions
Knowledge based reduction with 3 factoid took 51 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 33132 steps (3124 resets) in 70 ms. (466 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 46 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 38 ms :[(NOT p1)]
Knowledge-based reduction took 161 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5 reset in 52 ms.
Product exploration explored 100000 steps with 2 reset in 50 ms.
Built C files in :
/tmp/ltsmin8109020015827929686
[2026-05-25 08:56:15] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2026-05-25 08:56:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:56:15] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2026-05-25 08:56:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:56:15] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2026-05-25 08:56:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:56:15] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8109020015827929686
Running compilation step : cd /tmp/ltsmin8109020015827929686;'/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 619 ms.
Running link step : cd /tmp/ltsmin8109020015827929686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin8109020015827929686;'/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/stateBased4531575368399136632.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2026-05-25 08:56:30] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:56:30] [INFO ] Invariant cache hit.
[2026-05-25 08:56:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 08:56:30] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2026-05-25 08:56:30] [INFO ] Invariant cache hit.
[2026-05-25 08:56:30] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 08:56:30] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2026-05-25 08:56:30] [INFO ] Redundant transitions in 75 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 86/86 places, 255/255 transitions.
Built C files in :
/tmp/ltsmin7206060548132828246
[2026-05-25 08:56:30] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2026-05-25 08:56:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:56:30] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2026-05-25 08:56:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:56:30] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2026-05-25 08:56:30] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:56:30] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7206060548132828246
Running compilation step : cd /tmp/ltsmin7206060548132828246;'/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 588 ms.
Running link step : cd /tmp/ltsmin7206060548132828246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7206060548132828246;'/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/stateBased539614920543778796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 08:56:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:56:45] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:56:45] [INFO ] Time to serialize gal into /tmp/LTL10523582704581150590.gal : 2 ms
[2026-05-25 08:56:45] [INFO ] Time to serialize properties into /tmp/LTL13682209647099783390.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10523582704581150590.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14863270095463530774.hoa' '-atoms' '/tmp/LTL13682209647099783390.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13682209647099783390.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14863270095463530774.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t11, t16, t18, t19, t20, t21, t24, t25, t29, t30, t42, t44, t45, t47, t48...399
Computing Next relation with stutter on 384 deadlock states
Detected timeout of ITS tools.
[2026-05-25 08:57:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:57:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:57:00] [INFO ] Time to serialize gal into /tmp/LTL9362840614465735444.gal : 3 ms
[2026-05-25 08:57:00] [INFO ] Time to serialize properties into /tmp/LTL10674765451682999215.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9362840614465735444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10674765451682999215.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((p67==0)||(p2==1))"))U("((p81==0)||(p27==1))")))))
Formula 0 simplified : GF("((p67==0)||(p2==1))" R !"((p81==0)||(p27==1))")
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t11, t16, t18, t19, t20, t21, t24, t25, t29, t30, t42, t44, t45, t47, t48...399
Computing Next relation with stutter on 384 deadlock states
Detected timeout of ITS tools.
[2026-05-25 08:57:15] [INFO ] Flatten gal took : 25 ms
[2026-05-25 08:57:15] [INFO ] Applying decomposition
[2026-05-25 08:57:15] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5836484890675617922.txt' '-o' '/tmp/graph5836484890675617922.bin' '-w' '/tmp/graph5836484890675617922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5836484890675617922.bin' '-l' '-1' '-v' '-w' '/tmp/graph5836484890675617922.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:57:15] [INFO ] Decomposing Gal with order
[2026-05-25 08:57:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:57:15] [INFO ] Removed a total of 590 redundant transitions.
[2026-05-25 08:57:16] [INFO ] Flatten gal took : 34 ms
[2026-05-25 08:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 11 ms.
[2026-05-25 08:57:16] [INFO ] Time to serialize gal into /tmp/LTL13615640122195190071.gal : 2 ms
[2026-05-25 08:57:16] [INFO ] Time to serialize properties into /tmp/LTL14234189477619961592.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13615640122195190071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14234189477619961592.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((i5.i1.u27.p67==0)||(i1.u5.p2==1))"))U("((i4.u18.p81==0)||(i1.u5.p27==1))")))))
Formula 0 simplified : GF("((i5.i1.u27.p67==0)||(i1.u5.p2==1))" R !"((i4.u18.p81==0)||(i1.u5.p27==1))")
Reverse transition relation is NOT exact ! Due to transitions t21, t182, t186, t189, t180_t27, t184_t27, i0.t227, i0.t77, i0.t76, i0.t71, i0.u0.t52, i0.u2....561
Computing Next relation with stutter on 384 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
184 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.86664,81496,1,0,121855,1243,2223,245953,453,9731,223569
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-05-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MedleyA-PT-05-LTLCardinality-05 finished in 115468 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 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Graph (complete) has 511 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 225
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 96 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 96 transition count 219
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -48
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 25 place count 88 transition count 267
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 88 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 38 place count 88 transition count 254
Applied a total of 38 rules in 38 ms. Remains 88 /102 variables (removed 14) and now considering 254/228 (removed -26) transitions.
[2026-05-25 08:57:18] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1603986894687512741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17115378581978204664.kers'
[2026-05-25 08:57:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1603986894687512741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17115378581978204664.kers]
Normalized transition count is 252 out of 253 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 88 cols 1062 entries
Finished phase 1 with 64 SingleSign rule and 4 generalized
[2026-05-25 08:57:18] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17115378581978204664.kers
Total runtime 4 ms.
[2026-05-25 08:57:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 08:57:18] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
[2026-05-25 08:57:18] [INFO ] Invariant cache hit.
[2026-05-25 08:57:18] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 08:57:18] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2026-05-25 08:57:18] [INFO ] Redundant transitions in 45 ms returned []
Running 245 sub problems to find dead transitions.
[2026-05-25 08:57:18] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
[2026-05-25 08:57:18] [INFO ] Invariant cache hit.
[2026-05-25 08:57:18] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 252/340 variables, 88/109 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 28/137 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 1/341 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (OVERLAPS) 0/341 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 138 constraints, problems are : Problem set: 0 solved, 245 unsolved in 18417 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 252/340 variables, 88/109 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 28/137 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 245/382 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 1/341 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 384 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48561ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 48562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/102 places, 254/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49009 ms. Remains : 88/102 places, 254/228 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 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 56 ms.
Product exploration explored 100000 steps with 1 reset in 47 ms.
Computed a total of 10 stabilizing places and 120 stable transitions
Computed a total of 10 stabilizing places and 120 stable transitions
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3720 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (492 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12051 steps, run visited all 1 properties in 57 ms. (steps per millisecond=211 )
Probabilistic random walk after 12051 steps, saw 2854 distinct states, run finished after 57 ms. (steps per millisecond=211 ) properties seen :1
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 386 ms.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2026-05-25 08:58:08] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
[2026-05-25 08:58:08] [INFO ] Invariant cache hit.
[2026-05-25 08:58:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 08:58:08] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
[2026-05-25 08:58:08] [INFO ] Invariant cache hit.
[2026-05-25 08:58:08] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 08:58:08] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2026-05-25 08:58:08] [INFO ] Redundant transitions in 43 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 88/88 places, 254/254 transitions.
Computed a total of 10 stabilizing places and 120 stable transitions
Computed a total of 10 stabilizing places and 120 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3721 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (512 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12051 steps, run visited all 1 properties in 21 ms. (steps per millisecond=573 )
Probabilistic random walk after 12051 steps, saw 2854 distinct states, run finished after 21 ms. (steps per millisecond=573 ) properties seen :1
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 328 ms.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 55 ms.
Built C files in :
/tmp/ltsmin14032281748963585617
[2026-05-25 08:58:09] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2026-05-25 08:58:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:58:09] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2026-05-25 08:58:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:58:09] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2026-05-25 08:58:09] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:58:09] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14032281748963585617
Running compilation step : cd /tmp/ltsmin14032281748963585617;'/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 639 ms.
Running link step : cd /tmp/ltsmin14032281748963585617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin14032281748963585617;'/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/stateBased11214158410699980002.hoa' '--buchi-type=spotba'
LTSmin run took 3484 ms.
FORMULA MedleyA-PT-05-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLCardinality-06 finished in 55153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(F(G(p1)) U p2)))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 98 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 220
Applied a total of 8 rules in 6 ms. Remains 98 /102 variables (removed 4) and now considering 220/228 (removed 8) transitions.
[2026-05-25 08:58:13] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-534047529265621754.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15593294979281316212.kers'
[2026-05-25 08:58:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-534047529265621754.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15593294979281316212.kers]
Normalized transition count is 218 out of 219 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 98 cols 837 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 08:58:13] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15593294979281316212.kers
Total runtime 3 ms.
[2026-05-25 08:58:13] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 08:58:13] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2026-05-25 08:58:13] [INFO ] Invariant cache hit.
[2026-05-25 08:58:13] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:58:13] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 08:58:13] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2026-05-25 08:58:13] [INFO ] Invariant cache hit.
[2026-05-25 08:58:13] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 213 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12957 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 432 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43035ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 43036ms
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 220/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43400 ms. Remains : 98/102 places, 220/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(F(G(p1)) U p2)))'
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 50 ms.
Entered a terminal (fully accepting) state of product in 82 steps with 9 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-07 finished in 43825 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(F(p0))&&F(p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 98 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 220
Applied a total of 8 rules in 2 ms. Remains 98 /102 variables (removed 4) and now considering 220/228 (removed 8) transitions.
[2026-05-25 08:58:57] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8480080310153548730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6210305734385108725.kers'
[2026-05-25 08:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8480080310153548730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6210305734385108725.kers]
Normalized transition count is 218 out of 219 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 98 cols 837 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 08:58:57] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6210305734385108725.kers
Total runtime 2 ms.
[2026-05-25 08:58:57] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 08:58:57] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2026-05-25 08:58:57] [INFO ] Invariant cache hit.
[2026-05-25 08:58:57] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:58:57] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 220/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 98/102 places, 220/228 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(F(p0))&&F(p1)))'
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-10
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-10 finished in 480 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 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Graph (complete) has 511 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 225
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 8 place count 94 transition count 215
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 94 transition count 215
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
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 27 place count 87 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 87 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 87 transition count 237
Applied a total of 43 rules in 16 ms. Remains 87 /102 variables (removed 15) and now considering 237/228 (removed -9) transitions.
[2026-05-25 08:58:57] [INFO ] Flow matrix only has 236 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11062469742760250272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4616844258628377326.kers'
[2026-05-25 08:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11062469742760250272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4616844258628377326.kers]
Normalized transition count is 235 out of 236 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 87 cols 966 entries
Finished phase 1 with 63 SingleSign rule and 4 generalized
[2026-05-25 08:58:57] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4616844258628377326.kers
Total runtime 1 ms.
[2026-05-25 08:58:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 08:58:57] [INFO ] Flow matrix only has 236 transitions (discarded 1 similar events)
[2026-05-25 08:58:57] [INFO ] Invariant cache hit.
[2026-05-25 08:58:58] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 08:58:58] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2026-05-25 08:58:58] [INFO ] Redundant transitions in 26 ms returned []
Running 228 sub problems to find dead transitions.
[2026-05-25 08:58:58] [INFO ] Flow matrix only has 236 transitions (discarded 1 similar events)
[2026-05-25 08:58:58] [INFO ] Invariant cache hit.
[2026-05-25 08:58:58] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 235/322 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 28/136 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (OVERLAPS) 0/323 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 137 constraints, problems are : Problem set: 0 solved, 228 unsolved in 14077 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 235/322 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 28/136 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 228/364 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 13 (OVERLAPS) 0/323 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 366 constraints, problems are : Problem set: 0 solved, 228 unsolved in 29566 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43715ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 43715ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 237/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44072 ms. Remains : 87/102 places, 237/228 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 54 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-11 finished in 44158 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((F(p1)&&(F(p0) U X(p2))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 218
Applied a total of 10 rules in 3 ms. Remains 97 /102 variables (removed 5) and now considering 218/228 (removed 10) transitions.
[2026-05-25 08:59:41] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10788989120048696048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7037385204650680425.kers'
[2026-05-25 08:59:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10788989120048696048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7037385204650680425.kers]
Normalized transition count is 216 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 97 cols 833 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 08:59:41] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7037385204650680425.kers
Total runtime 2 ms.
[2026-05-25 08:59:42] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 08:59:42] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:59:42] [INFO ] Invariant cache hit.
[2026-05-25 08:59:42] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:59:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 08:59:42] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 08:59:42] [INFO ] Invariant cache hit.
[2026-05-25 08:59:42] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11581 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25536 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37165ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 37167ms
Starting structural reductions in LTL mode, iteration 1 : 97/102 places, 218/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37552 ms. Remains : 97/102 places, 218/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((F(p1)&&(F(p0) U X(p2))))))'
Stuttering acceptance computed with spot in 396 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 2 reset in 64 ms.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 491 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Knowledge based reduction with 17 factoid took 117 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3001 resets) in 239 ms. (166 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (479 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (398 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (391 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (477 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
[2026-05-25 09:00:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 09:00:20] [INFO ] Invariant cache hit.
[2026-05-25 09:00:20] [INFO ] State equation strengthened by 94 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/82 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/313 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/314 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 211 constraints, problems are : Problem set: 0 solved, 4 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/82 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/313 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/314 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 215 constraints, problems are : Problem set: 0 solved, 4 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 218/218 transitions.
Graph (complete) has 389 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 96 transition count 214
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 5 place count 95 transition count 214
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 25 place count 85 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 85 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 68 place count 85 transition count 244
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 85 transition count 270
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 108 place count 71 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 71 transition count 257
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 71 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 70 transition count 276
Applied a total of 111 rules in 35 ms. Remains 70 /97 variables (removed 27) and now considering 276/218 (removed -58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 70/97 places, 276/218 transitions.
RANDOM walk for 40000 steps (4425 resets) in 288 ms. (138 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (354 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (347 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8118856886113304733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11742306412419377029.kers'
[2026-05-25 09:00:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8118856886113304733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11742306412419377029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 70 cols 1359 entries
Finished phase 1 with 46 SingleSign rule and 4 generalized
[2026-05-25 09:00:21] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11742306412419377029.kers
Total runtime 1 ms.
[2026-05-25 09:00:21] [INFO ] State equation strengthened by 154 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/69 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 276/345 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/346 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 154/154 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/69 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 276/345 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/346 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 276/276 transitions.
Applied a total of 0 rules in 4 ms. Remains 70 /70 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 70/70 places, 276/276 transitions.
RANDOM walk for 40000 steps (4431 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (347 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (350 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1281562 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :0 out of 2
Probabilistic random walk after 1281562 steps, saw 228772 distinct states, run finished after 3003 ms. (steps per millisecond=426 ) properties seen :0
[2026-05-25 09:00:25] [INFO ] Invariant cache hit.
[2026-05-25 09:00:25] [INFO ] State equation strengthened by 154 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/69 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 276/345 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/346 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 154/154 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/69 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 276/345 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/346 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2845 steps, including 246 resets, run visited all 2 properties in 60 ms. (steps per millisecond=47 )
Parikh walk visited 2 properties in 62 ms.
Knowledge based reduction with 17 factoid took 191 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6652 ms.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 218/218 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 09:00:27] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17426760618750769865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10500899408698697776.kers'
[2026-05-25 09:00:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17426760618750769865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10500899408698697776.kers]
Normalized transition count is 216 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 97 cols 833 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:00:27] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10500899408698697776.kers
Total runtime 2 ms.
[2026-05-25 09:00:27] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:00:27] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 09:00:27] [INFO ] Invariant cache hit.
[2026-05-25 09:00:27] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 09:00:27] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 97/97 places, 218/218 transitions.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 491 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Knowledge based reduction with 11 factoid took 76 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (2978 resets) in 271 ms. (147 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (485 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (400 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (389 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (472 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
[2026-05-25 09:00:27] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 09:00:27] [INFO ] Invariant cache hit.
[2026-05-25 09:00:27] [INFO ] State equation strengthened by 94 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/82 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/313 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/314 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 211 constraints, problems are : Problem set: 0 solved, 4 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/82 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 215/310 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/313 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/314 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 215 constraints, problems are : Problem set: 0 solved, 4 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 943ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2870 steps, including 126 resets, run visited all 4 properties in 20 ms. (steps per millisecond=143 )
Parikh walk visited 4 properties in 121 ms.
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1663 ms.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 60 ms.
Product exploration explored 100000 steps with 9 reset in 75 ms.
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17504694752838602464
[2026-05-25 09:00:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17504694752838602464
Running compilation step : cd /tmp/ltsmin17504694752838602464;'/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 367 ms.
Running link step : cd /tmp/ltsmin17504694752838602464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17504694752838602464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11334974901385100295.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA MedleyA-PT-05-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLCardinality-12 finished in 48448 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' '!((p0 U X(X(p1))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 218
Applied a total of 10 rules in 2 ms. Remains 97 /102 variables (removed 5) and now considering 218/228 (removed 10) transitions.
[2026-05-25 09:00:30] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 09:00:30] [INFO ] Invariant cache hit.
[2026-05-25 09:00:30] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 09:00:30] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2026-05-25 09:00:30] [INFO ] Invariant cache hit.
[2026-05-25 09:00:30] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 09:00:30] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 97/102 places, 218/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 97/102 places, 218/228 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' '!((p0 U X(X(p1))))'
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 336 ms.
Product exploration explored 100000 steps with 33333 reset in 310 ms.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 491 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Detected a total of 12/97 stabilizing places and 84/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 28 ms. Proved property starting from automaton with 7 states, 10 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA MedleyA-PT-05-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-05-LTLCardinality-14 finished in 1416 ms.
All properties solved by simple procedures.
Total runtime 477818 ms.

BK_STOP 1779699631853

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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-05"
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-05, 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-177969019900131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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