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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 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 175K 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-17-LTLCardinality-00
FORMULA_NAME MedleyA-PT-17-LTLCardinality-01
FORMULA_NAME MedleyA-PT-17-LTLCardinality-02
FORMULA_NAME MedleyA-PT-17-LTLCardinality-03
FORMULA_NAME MedleyA-PT-17-LTLCardinality-04
FORMULA_NAME MedleyA-PT-17-LTLCardinality-05
FORMULA_NAME MedleyA-PT-17-LTLCardinality-06
FORMULA_NAME MedleyA-PT-17-LTLCardinality-07
FORMULA_NAME MedleyA-PT-17-LTLCardinality-08
FORMULA_NAME MedleyA-PT-17-LTLCardinality-09
FORMULA_NAME MedleyA-PT-17-LTLCardinality-10
FORMULA_NAME MedleyA-PT-17-LTLCardinality-11
FORMULA_NAME MedleyA-PT-17-LTLCardinality-12
FORMULA_NAME MedleyA-PT-17-LTLCardinality-13
FORMULA_NAME MedleyA-PT-17-LTLCardinality-14
FORMULA_NAME MedleyA-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779700700572

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:18:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:18:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:18:22] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 09:18:22] [INFO ] Transformed 248 places.
[2026-05-25 09:18:22] [INFO ] Transformed 591 transitions.
[2026-05-25 09:18:22] [INFO ] Found NUPN structural information;
[2026-05-25 09:18:22] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 199 transition count 509
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 199 transition count 509
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 132 place count 199 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 197 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 197 transition count 471
Applied a total of 136 rules in 56 ms. Remains 197 /248 variables (removed 51) and now considering 471/589 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6584099692632085983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-20294772223321260.kers'
[2026-05-25 09:18:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6584099692632085983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-20294772223321260.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 197 cols 2332 entries
Finished phase 1 with 189 SingleSign rule and 1 generalized
[2026-05-25 09:18:22] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-20294772223321260.kers
Total runtime 3 ms.
[2026-05-25 09:18:22] [INFO ] Implicit Places using invariants in 354 ms returned []
[2026-05-25 09:18:22] [INFO ] Invariant cache hit.
[2026-05-25 09:18:23] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-25 09:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/668 variables, and 55 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 6 (OVERLAPS) 471/668 variables, 197/259 constraints. Problems are: Problem set: 50 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 420/679 constraints. Problems are: Problem set: 50 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 679 constraints, problems are : Problem set: 50 solved, 420 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 420/470 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 50 solved, 420 unsolved
Search for dead transitions found 50 dead transitions in 60414ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/248 places, 421/589 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61321 ms. Remains : 197/248 places, 421/589 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3339425618382213753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10165281692114036669.kers'
[2026-05-25 09:19:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3339425618382213753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10165281692114036669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 421 rows 197 cols 1832 entries
Finished phase 1 with 189 SingleSign rule and 1 generalized
[2026-05-25 09:19:23] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10165281692114036669.kers
Total runtime 7 ms.
[2026-05-25 09:19:24] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-25 09:19:24] [INFO ] Invariant cache hit.
[2026-05-25 09:19:24] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-05-25 09:19:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/618 variables, and 69 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 421/618 variables, 197/276 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 420/696 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/618 variables, and 696 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in LTL mode , in 1 iterations and 60867 ms. Remains : 197/197 places, 421/421 transitions.
Support contains 16 out of 197 places after structural reductions.
[2026-05-25 09:20:24] [INFO ] Flatten gal took : 86 ms
[2026-05-25 09:20:25] [INFO ] Flatten gal took : 41 ms
[2026-05-25 09:20:25] [INFO ] Input system was already deterministic with 421 transitions.
RANDOM walk for 40000 steps (1376 resets) in 1437 ms. (27 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (300 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (298 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (300 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (315 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (298 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (301 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (296 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
[2026-05-25 09:20:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 41/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 421/618 variables, 197/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/618 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 208 constraints, problems are : Problem set: 0 solved, 7 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 41/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 421/618 variables, 197/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 7/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/618 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/618 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/618 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/618 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 6045ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3737 ms.
Support contains 13 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 178 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 191 transition count 387
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 166 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 164 transition count 385
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 55 place count 164 transition count 372
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 81 place count 151 transition count 372
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 127 place count 128 transition count 349
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 126 transition count 335
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 126 transition count 335
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 185 place count 99 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 203 place count 99 transition count 460
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 97 transition count 444
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 97 transition count 444
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 215 place count 97 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 232 place count 97 transition count 419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 238 place count 94 transition count 416
Free-agglomeration rule applied 27 times.
Iterating global reduction 5 with 27 rules applied. Total rules applied 265 place count 94 transition count 389
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 340 place count 67 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 374 place count 67 transition count 307
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 376 place count 67 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 378 place count 65 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 394 place count 65 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 396 place count 64 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 398 place count 64 transition count 306
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 400 place count 64 transition count 334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 402 place count 62 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 61 transition count 333
Applied a total of 403 rules in 152 ms. Remains 61 /197 variables (removed 136) and now considering 333/421 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 61/197 places, 333/421 transitions.
RANDOM walk for 22430 steps (1858 resets) in 879 ms. (25 steps per ms) remains 0/7 properties
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 193 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 388
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 164 transition count 386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 162 transition count 386
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 57 place count 162 transition count 373
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 149 transition count 373
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 145 transition count 366
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 145 transition count 366
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 144 transition count 364
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 144 transition count 364
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 141 place count 120 transition count 340
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 118 transition count 326
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 118 transition count 326
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 199 place count 91 transition count 446
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 91 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 89 transition count 426
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 89 transition count 426
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 215 place count 89 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 246 place count 89 transition count 387
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 252 place count 86 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 85 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 84 transition count 395
Applied a total of 255 rules in 68 ms. Remains 84 /197 variables (removed 113) and now considering 395/421 (removed 26) transitions.
[2026-05-25 09:20:36] [INFO ] Flow matrix only has 361 transitions (discarded 34 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16306401800834538742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15683672189175689917.kers'
[2026-05-25 09:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16306401800834538742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15683672189175689917.kers]
Normalized transition count is 360 out of 361 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 360 rows 84 cols 1828 entries
Finished phase 1 with 76 SingleSign rule and 1 generalized
[2026-05-25 09:20:36] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15683672189175689917.kers
Total runtime 4 ms.
[2026-05-25 09:20:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:20:36] [INFO ] Flow matrix only has 361 transitions (discarded 34 similar events)
[2026-05-25 09:20:36] [INFO ] Invariant cache hit.
[2026-05-25 09:20:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:20:36] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2026-05-25 09:20:37] [INFO ] Redundant transitions in 29 ms returned []
Running 386 sub problems to find dead transitions.
[2026-05-25 09:20:37] [INFO ] Flow matrix only has 361 transitions (discarded 34 similar events)
[2026-05-25 09:20:37] [INFO ] Invariant cache hit.
[2026-05-25 09:20:37] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 360/444 variables, 84/108 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (OVERLAPS) 1/445 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 185 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 360/444 variables, 84/112 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 72/184 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 386/570 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/445 variables, and 570 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/197 places, 395/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61115 ms. Remains : 84/197 places, 395/421 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(p1)))'
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-17-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-03 finished in 61513 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(G(p0))))'
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 411
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 411
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 190 transition count 407
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 190 transition count 407
Applied a total of 14 rules in 14 ms. Remains 190 /197 variables (removed 7) and now considering 407/421 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13284343028870872218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7038980574400714814.kers'
[2026-05-25 09:21:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13284343028870872218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7038980574400714814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 407 rows 190 cols 1796 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:21:37] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7038980574400714814.kers
Total runtime 5 ms.
[2026-05-25 09:21:37] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-25 09:21:37] [INFO ] Invariant cache hit.
[2026-05-25 09:21:38] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2026-05-25 09:21:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/597 variables, and 63 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 407/597 variables, 190/260 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 406/666 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/597 variables, and 666 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 407/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60627 ms. Remains : 190/197 places, 407/421 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(G(p0))))'
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-07
Product exploration explored 100000 steps with 3446 reset in 177 ms.
Product exploration explored 100000 steps with 3447 reset in 178 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (299 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1482709 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1482709 steps, saw 276873 distinct states, run finished after 3022 ms. (steps per millisecond=490 ) properties seen :0
[2026-05-25 09:22:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/190 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 407/597 variables, 190/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/597 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/190 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 407/597 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/597 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2079ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 407/407 transitions.
Graph (trivial) has 190 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 184 transition count 368
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 154 transition count 368
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 61 place count 154 transition count 355
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 87 place count 141 transition count 355
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 135 place count 117 transition count 331
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 115 transition count 317
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 115 transition count 317
Performed 29 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 197 place count 86 transition count 473
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 215 place count 86 transition count 455
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 217 place count 84 transition count 439
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 84 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 227 place count 84 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 244 place count 84 transition count 414
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 250 place count 81 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 80 transition count 423
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 280 place count 80 transition count 395
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 4 with 84 rules applied. Total rules applied 364 place count 52 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 400 place count 52 transition count 303
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 404 place count 52 transition count 299
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 408 place count 48 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 6 with 32 rules applied. Total rules applied 440 place count 48 transition count 267
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 444 place count 48 transition count 263
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 448 place count 44 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 456 place count 44 transition count 255
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 458 place count 44 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 460 place count 42 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 461 place count 41 transition count 282
Applied a total of 461 rules in 98 ms. Remains 41 /190 variables (removed 149) and now considering 282/407 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 41/190 places, 282/407 transitions.
RANDOM walk for 101 steps (8 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5592 ms.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 407/407 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2026-05-25 09:22:44] [INFO ] Invariant cache hit.
[2026-05-25 09:22:44] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:22:44] [INFO ] Invariant cache hit.
[2026-05-25 09:22:44] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 190/190 places, 407/407 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (301 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1514917 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :0 out of 1
Probabilistic random walk after 1514917 steps, saw 282151 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
[2026-05-25 09:22:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/190 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 407/597 variables, 190/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/597 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/190 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 407/597 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/597 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 407/407 transitions.
Graph (trivial) has 190 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 184 transition count 368
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 154 transition count 368
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 61 place count 154 transition count 355
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 87 place count 141 transition count 355
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 135 place count 117 transition count 331
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 115 transition count 317
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 115 transition count 317
Performed 29 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 197 place count 86 transition count 473
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 215 place count 86 transition count 455
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 217 place count 84 transition count 439
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 84 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 227 place count 84 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 244 place count 84 transition count 414
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 250 place count 81 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 80 transition count 423
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 280 place count 80 transition count 395
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 4 with 84 rules applied. Total rules applied 364 place count 52 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 400 place count 52 transition count 303
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 404 place count 52 transition count 299
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 408 place count 48 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 6 with 32 rules applied. Total rules applied 440 place count 48 transition count 267
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 444 place count 48 transition count 263
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 448 place count 44 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 456 place count 44 transition count 255
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 458 place count 44 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 460 place count 42 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 461 place count 41 transition count 282
Applied a total of 461 rules in 71 ms. Remains 41 /190 variables (removed 149) and now considering 282/407 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 41/190 places, 282/407 transitions.
RANDOM walk for 233 steps (24 resets) in 5 ms. (38 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 4984 ms.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3448 reset in 113 ms.
Product exploration explored 100000 steps with 3448 reset in 119 ms.
Spot run failed in 150 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/ltsmin15396972785942468946
[2026-05-25 09:22:50] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15396972785942468946
Running compilation step : cd /tmp/ltsmin15396972785942468946;'/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 904 ms.
Running link step : cd /tmp/ltsmin15396972785942468946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin15396972785942468946;'/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/stateBased17802622693704122748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 407/407 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2026-05-25 09:23:05] [INFO ] Invariant cache hit.
[2026-05-25 09:23:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-25 09:23:05] [INFO ] Invariant cache hit.
[2026-05-25 09:23:06] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 190/190 places, 407/407 transitions.
Built C files in :
/tmp/ltsmin10549831897834767257
[2026-05-25 09:23:06] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10549831897834767257
Running compilation step : cd /tmp/ltsmin10549831897834767257;'/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 673 ms.
Running link step : cd /tmp/ltsmin10549831897834767257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin10549831897834767257;'/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/stateBased17642742582400696216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:23:21] [INFO ] Time to serialize gal into /tmp/LTL12785626947939148560.gal : 7 ms
[2026-05-25 09:23:21] [INFO ] Time to serialize properties into /tmp/LTL3079992194695278817.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/LTL12785626947939148560.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12310509013787162911.hoa' '-atoms' '/tmp/LTL3079992194695278817.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/LTL3079992194695278817.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12310509013787162911.hoa
Detected timeout of ITS tools.
[2026-05-25 09:23:36] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:23:36] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:23:36] [INFO ] Time to serialize gal into /tmp/LTL6483197582171251699.gal : 4 ms
[2026-05-25 09:23:36] [INFO ] Time to serialize properties into /tmp/LTL4260302042269946273.ltl : 3 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/LTL6483197582171251699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4260302042269946273.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p57!=1)")))))
Formula 0 simplified : XXF!"(p57!=1)"
Detected timeout of ITS tools.
[2026-05-25 09:23:51] [INFO ] Flatten gal took : 46 ms
[2026-05-25 09:23:51] [INFO ] Applying decomposition
[2026-05-25 09:23:51] [INFO ] Flatten gal took : 25 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/graph7628772628031066445.txt' '-o' '/tmp/graph7628772628031066445.bin' '-w' '/tmp/graph7628772628031066445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7628772628031066445.bin' '-l' '-1' '-v' '-w' '/tmp/graph7628772628031066445.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:51] [INFO ] Removed a total of 922 redundant transitions.
[2026-05-25 09:23:51] [INFO ] Flatten gal took : 104 ms
[2026-05-25 09:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 34 ms.
[2026-05-25 09:23:51] [INFO ] Time to serialize gal into /tmp/LTL2118909006729405585.gal : 6 ms
[2026-05-25 09:23:51] [INFO ] Time to serialize properties into /tmp/LTL8526568615910266147.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/LTL2118909006729405585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8526568615910266147.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i5.u14.p57!=1)")))))
Formula 0 simplified : XXF!"(i5.u14.p57!=1)"
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-17-LTLCardinality-07 finished in 149207 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((X(X((G(X(X(p0)))&&p1))) U p0)))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 411
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 411
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 190 transition count 407
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 190 transition count 407
Applied a total of 14 rules in 6 ms. Remains 190 /197 variables (removed 7) and now considering 407/421 (removed 14) transitions.
[2026-05-25 09:24:06] [INFO ] Invariant cache hit.
[2026-05-25 09:24:07] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-25 09:24:07] [INFO ] Invariant cache hit.
[2026-05-25 09:24:07] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 407/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 190/197 places, 407/421 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((X(X((G(X(X(p0)))&&p1))) U p0)))'
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-10
Product exploration explored 100000 steps with 3447 reset in 132 ms.
Product exploration explored 100000 steps with 3448 reset in 157 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (312 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (300 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 759004 steps, run visited all 2 properties in 1658 ms. (steps per millisecond=457 )
Probabilistic random walk after 759004 steps, saw 141625 distinct states, run finished after 1666 ms. (steps per millisecond=455 ) properties seen :2
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Knowledge-based reduction took 2370 ms.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 407/407 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2026-05-25 09:24:10] [INFO ] Invariant cache hit.
[2026-05-25 09:24:10] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-25 09:24:10] [INFO ] Invariant cache hit.
[2026-05-25 09:24:11] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 190/190 places, 407/407 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (312 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (299 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 759004 steps, run visited all 2 properties in 1603 ms. (steps per millisecond=473 )
Probabilistic random walk after 759004 steps, saw 141625 distinct states, run finished after 1603 ms. (steps per millisecond=473 ) properties seen :2
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Knowledge-based reduction took 2280 ms.
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3447 reset in 162 ms.
Product exploration explored 100000 steps with 3447 reset in 115 ms.
Spot run failed in 79 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/ltsmin16659296693280456499
[2026-05-25 09:24:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16659296693280456499
Running compilation step : cd /tmp/ltsmin16659296693280456499;'/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 690 ms.
Running link step : cd /tmp/ltsmin16659296693280456499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16659296693280456499;'/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/stateBased10750929171511243602.hoa' '--buchi-type=spotba'
LTSmin run took 1536 ms.
FORMULA MedleyA-PT-17-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLCardinality-10 finished in 10027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 197 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 190 transition count 385
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 161 transition count 385
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 59 place count 161 transition count 372
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 148 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 143 transition count 363
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 143 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 142 transition count 361
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 142 transition count 361
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 9 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 145 place count 118 transition count 337
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 116 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 116 transition count 323
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 203 place count 89 transition count 445
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 207 place count 89 transition count 441
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 87 transition count 425
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 87 transition count 425
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 219 place count 87 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 250 place count 87 transition count 386
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 256 place count 84 transition count 383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 83 transition count 395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 82 transition count 394
Applied a total of 259 rules in 128 ms. Remains 82 /197 variables (removed 115) and now considering 394/421 (removed 27) transitions.
[2026-05-25 09:24:17] [INFO ] Flow matrix only has 356 transitions (discarded 38 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5442687867842209557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4502713224133621134.kers'
[2026-05-25 09:24:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5442687867842209557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4502713224133621134.kers]
Normalized transition count is 355 out of 356 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 355 rows 82 cols 1814 entries
Finished phase 1 with 74 SingleSign rule and 1 generalized
[2026-05-25 09:24:17] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4502713224133621134.kers
Total runtime 3 ms.
[2026-05-25 09:24:17] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 09:24:17] [INFO ] Flow matrix only has 356 transitions (discarded 38 similar events)
[2026-05-25 09:24:17] [INFO ] Invariant cache hit.
[2026-05-25 09:24:17] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:24:17] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2026-05-25 09:24:17] [INFO ] Redundant transitions in 26 ms returned []
Running 385 sub problems to find dead transitions.
[2026-05-25 09:24:17] [INFO ] Flow matrix only has 356 transitions (discarded 38 similar events)
[2026-05-25 09:24:17] [INFO ] Invariant cache hit.
[2026-05-25 09:24:17] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (OVERLAPS) 355/437 variables, 82/105 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 72/177 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 181 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (OVERLAPS) 355/437 variables, 82/110 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 72/182 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 385/567 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 567 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 385 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/197 places, 394/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60789 ms. Remains : 82/197 places, 394/421 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 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-11
Product exploration explored 100000 steps with 18228 reset in 216 ms.
Stuttering criterion allowed to conclude after 10271 steps with 1862 reset in 19 ms.
FORMULA MedleyA-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-11 finished in 61162 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 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Graph (trivial) has 197 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 190 transition count 385
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 161 transition count 385
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 59 place count 161 transition count 372
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 148 transition count 372
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 144 transition count 365
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 144 transition count 365
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 142 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 142 transition count 361
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 145 place count 118 transition count 337
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 116 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 116 transition count 323
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 203 place count 89 transition count 441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 207 place count 89 transition count 437
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 87 transition count 421
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 87 transition count 421
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 219 place count 87 transition count 413
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 85 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 4 with 39 rules applied. Total rules applied 262 place count 85 transition count 404
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 268 place count 82 transition count 401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 81 transition count 400
Applied a total of 269 rules in 71 ms. Remains 81 /197 variables (removed 116) and now considering 400/421 (removed 21) transitions.
[2026-05-25 09:25:18] [INFO ] Flow matrix only has 368 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4020232300665782270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16214493739734116285.kers'
[2026-05-25 09:25:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4020232300665782270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16214493739734116285.kers]
Normalized transition count is 367 out of 368 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 81 cols 1798 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-25 09:25:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16214493739734116285.kers
Total runtime 2 ms.
[2026-05-25 09:25:18] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 09:25:18] [INFO ] Flow matrix only has 368 transitions (discarded 32 similar events)
[2026-05-25 09:25:18] [INFO ] Invariant cache hit.
[2026-05-25 09:25:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:25:18] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2026-05-25 09:25:18] [INFO ] Redundant transitions in 13 ms returned []
Running 391 sub problems to find dead transitions.
[2026-05-25 09:25:18] [INFO ] Flow matrix only has 368 transitions (discarded 32 similar events)
[2026-05-25 09:25:18] [INFO ] Invariant cache hit.
[2026-05-25 09:25:18] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 367/448 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 78/180 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/449 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 183 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 367/448 variables, 81/108 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 78/186 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 391/577 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SMT process timed out in 60204ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/197 places, 400/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60667 ms. Remains : 81/197 places, 400/421 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 59 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-14
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-14 finished in 60783 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((X(X(X(X(F(p1)))))||p0)))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 421/421 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 191 transition count 410
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 191 transition count 410
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 189 transition count 406
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 189 transition count 406
Applied a total of 16 rules in 5 ms. Remains 189 /197 variables (removed 8) and now considering 406/421 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17372966690929301043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3964970471857341108.kers'
[2026-05-25 09:26:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17372966690929301043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3964970471857341108.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 189 cols 1794 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:26:18] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3964970471857341108.kers
Total runtime 3 ms.
[2026-05-25 09:26:18] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:26:18] [INFO ] Invariant cache hit.
[2026-05-25 09:26:19] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-05-25 09:26:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/238 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/595 variables, and 238 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 9 (OVERLAPS) 406/595 variables, 189/252 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 405/657 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 657 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 189/197 places, 406/421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 189/197 places, 406/421 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((X(X(X(X(F(p1)))))||p0)))'
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-15
Stuttering criterion allowed to conclude after 2939 steps with 182 reset in 6 ms.
FORMULA MedleyA-PT-17-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-15 finished in 60830 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(G(p0))))'
Spot run failed in 63 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 09:27:19] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9671321855642952597
[2026-05-25 09:27:19] [INFO ] Computing symmetric may disable matrix : 421 transitions.
[2026-05-25 09:27:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:27:19] [INFO ] Computing symmetric may enable matrix : 421 transitions.
[2026-05-25 09:27:19] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:27:19] [INFO ] Applying decomposition
[2026-05-25 09:27:19] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:27:19] [INFO ] Computing Do-Not-Accords matrix : 421 transitions.
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/graph16829518628638052680.txt' '-o' '/tmp/graph16829518628638052680.bin' '-w' '/tmp/graph16829518628638052680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16829518628638052680.bin' '-l' '-1' '-v' '-w' '/tmp/graph16829518628638052680.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:27:19] [INFO ] Decomposing Gal with order
[2026-05-25 09:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:27:19] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:27:19] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9671321855642952597
Running compilation step : cd /tmp/ltsmin9671321855642952597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-25 09:27:20] [INFO ] Removed a total of 921 redundant transitions.
[2026-05-25 09:27:20] [INFO ] Flatten gal took : 56 ms
[2026-05-25 09:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 26 ms.
[2026-05-25 09:27:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality9220428822476480099.gal : 3 ms
[2026-05-25 09:27:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality18058064176427395164.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/LTLCardinality9220428822476480099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18058064176427395164.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i10.i0.u16.p57!=1)")))))
Formula 0 simplified : XXF!"(i10.i0.u16.p57!=1)"
Compilation finished in 1121 ms.
Running link step : cd /tmp/ltsmin9671321855642952597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin9671321855642952597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t106, t114, t146, t173, t179, t181, t189, t195, t197, t223, t231, t255, t263, t268,...1176
Computing Next relation with stutter on 33170 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2224 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,22.297,656476,1,0,865323,2033,6831,5.16632e+06,535,7503,1713968
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-17-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 564665 ms.

BK_STOP 1779701266719

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
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-17, 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-177969020000227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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