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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 90K 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-08-LTLFireability-00
FORMULA_NAME MedleyA-PT-08-LTLFireability-01
FORMULA_NAME MedleyA-PT-08-LTLFireability-02
FORMULA_NAME MedleyA-PT-08-LTLFireability-03
FORMULA_NAME MedleyA-PT-08-LTLFireability-04
FORMULA_NAME MedleyA-PT-08-LTLFireability-05
FORMULA_NAME MedleyA-PT-08-LTLFireability-06
FORMULA_NAME MedleyA-PT-08-LTLFireability-07
FORMULA_NAME MedleyA-PT-08-LTLFireability-08
FORMULA_NAME MedleyA-PT-08-LTLFireability-09
FORMULA_NAME MedleyA-PT-08-LTLFireability-10
FORMULA_NAME MedleyA-PT-08-LTLFireability-11
FORMULA_NAME MedleyA-PT-08-LTLFireability-12
FORMULA_NAME MedleyA-PT-08-LTLFireability-13
FORMULA_NAME MedleyA-PT-08-LTLFireability-14
FORMULA_NAME MedleyA-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779699492446

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 08:58:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:58:14] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-25 08:58:14] [INFO ] Transformed 147 places.
[2026-05-25 08:58:14] [INFO ] Transformed 312 transitions.
[2026-05-25 08:58:14] [INFO ] Found NUPN structural information;
[2026-05-25 08:58:14] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 115 transition count 279
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 115 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 115 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 109 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 109 transition count 270
Applied a total of 77 rules in 31 ms. Remains 109 /147 variables (removed 38) and now considering 270/312 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7483454967485024355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16787763075881041467.kers'
[2026-05-25 08:58:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7483454967485024355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16787763075881041467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 109 cols 1280 entries
Finished phase 1 with 95 SingleSign rule and 4 generalized
[2026-05-25 08:58:14] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16787763075881041467.kers
Total runtime 3 ms.
[2026-05-25 08:58:15] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 08:58:15] [INFO ] Invariant cache hit.
[2026-05-25 08:58:15] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2026-05-25 08:58:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 6/16 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 270/379 variables, 109/125 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 2/127 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 1/128 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/128 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/128 constraints. Problems are: Problem set: 48 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 128 constraints, problems are : Problem set: 48 solved, 221 unsolved in 29195 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 48 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 6/16 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 270/379 variables, 109/125 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 221/346 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 1/347 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 1/348 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 3/351 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/352 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 353 constraints, problems are : Problem set: 48 solved, 221 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 221/269 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 59577ms problems are : Problem set: 48 solved, 221 unsolved
Search for dead transitions found 48 dead transitions in 59595ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/147 places, 222/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60248 ms. Remains : 109/147 places, 222/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 222/222 (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-9136087062925125446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12952935675994865853.kers'
[2026-05-25 08:59:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9136087062925125446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12952935675994865853.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 109 cols 928 entries
Finished phase 1 with 95 SingleSign rule and 4 generalized
[2026-05-25 08:59:15] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12952935675994865853.kers
Total runtime 4 ms.
[2026-05-25 08:59:15] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 08:59:15] [INFO ] Invariant cache hit.
[2026-05-25 08:59:15] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 08:59:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/331 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 128 constraints, problems are : Problem set: 0 solved, 221 unsolved in 18793 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/331 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 221/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 354 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48893ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 48896ms
Finished structural reductions in LTL mode , in 1 iterations and 49101 ms. Remains : 109/109 places, 222/222 transitions.
Support contains 37 out of 109 places after structural reductions.
[2026-05-25 09:00:04] [INFO ] Flatten gal took : 45 ms
[2026-05-25 09:00:04] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:00:04] [INFO ] Input system was already deterministic with 222 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (1989 resets) in 1698 ms. (23 steps per ms) remains 21/38 properties
BEST_FIRST walk for 4003 steps (58 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (60 resets) in 107 ms. (37 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (52 resets) in 90 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (54 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (58 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (49 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (54 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (56 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (48 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (59 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (57 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (59 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (57 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (52 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
[2026-05-25 09:00:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/89 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 17 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/100 variables, 4/10 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 212/312 variables, 100/110 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/111 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/111 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 13/325 variables, 6/117 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/117 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 5/330 variables, 2/119 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/119 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/331 variables, 1/120 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 1/121 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 1/122 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/331 variables, 0/122 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/331 variables, 0/122 constraints. Problems are: Problem set: 7 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 122 constraints, problems are : Problem set: 7 solved, 14 unsolved in 2349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 7 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/85 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/88 variables, 2/10 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/11 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 198/286 variables, 88/99 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 9/108 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 2/110 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 2/112 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 1/113 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/113 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 23/309 variables, 9/122 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/309 variables, 5/127 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 2/129 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/129 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 4/313 variables, 2/131 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/313 variables, 0/131 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 15/328 variables, 10/141 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 0/141 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 3/331 variables, 2/143 constraints. Problems are: Problem set: 7 solved, 14 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 143 constraints, problems are : Problem set: 7 solved, 14 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 14/21 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7407ms problems are : Problem set: 7 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 222/222 transitions.
Graph (complete) has 401 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 104 transition count 199
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 30 place count 95 transition count 199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 30 place count 95 transition count 196
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 90 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 90 transition count 193
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 83 transition count 186
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 76 transition count 239
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 76 place count 76 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 136 place count 76 transition count 171
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 136 place count 76 transition count 167
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 72 transition count 167
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 72 transition count 163
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 152 place count 68 transition count 163
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 68 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 68 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 67 transition count 161
Applied a total of 156 rules in 91 ms. Remains 67 /109 variables (removed 42) and now considering 161/222 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 67/109 places, 161/222 transitions.
RANDOM walk for 40000 steps (285 resets) in 378 ms. (105 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (190 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (441 resets) in 133 ms. (298 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (218 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (286 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (233 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (269 resets) in 99 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (264 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (157 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (195 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (566 resets) in 78 ms. (506 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (291 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (135 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18111109605140364994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7811706490663900341.kers'
[2026-05-25 09:00:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18111109605140364994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7811706490663900341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 67 cols 830 entries
Finished phase 1 with 53 SingleSign rule and 3 generalized
[2026-05-25 09:00:13] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7811706490663900341.kers
Total runtime 2 ms.
[2026-05-25 09:00:13] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 38/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 159/218 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 10/228 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 81 constraints, problems are : Problem set: 0 solved, 10 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 38/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 159/218 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 10/228 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/228 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 94 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3797ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 8 properties in 3771 ms.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 161/161 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 160
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 59 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 59 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 59 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 58 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 56 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 56 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 54 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 54 transition count 131
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 37 place count 48 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 47 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 47 transition count 125
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 44 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 44 transition count 144
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 44 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 42 transition count 143
Applied a total of 50 rules in 22 ms. Remains 42 /67 variables (removed 25) and now considering 143/161 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 42/67 places, 143/161 transitions.
RANDOM walk for 40000 steps (158 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (124 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21112 steps, run visited all 2 properties in 70 ms. (steps per millisecond=301 )
Probabilistic random walk after 21112 steps, saw 5866 distinct states, run finished after 76 ms. (steps per millisecond=277 ) properties seen :2
FORMULA MedleyA-PT-08-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 401 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
FORMULA MedleyA-PT-08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Graph (complete) has 401 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 103 transition count 206
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 91 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 91 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 89 transition count 202
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 42 place count 78 transition count 182
Iterating global reduction 2 with 11 rules applied. Total rules applied 53 place count 78 transition count 182
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 74 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 74 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 72 transition count 161
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 72 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 70 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 70 transition count 155
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 97 place count 55 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 55 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 52 transition count 134
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 52 transition count 134
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 46 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 136 place count 46 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 45 transition count 151
Applied a total of 138 rules in 23 ms. Remains 45 /109 variables (removed 64) and now considering 151/222 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6496692019159872344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12649227490724589857.kers'
[2026-05-25 09:00:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6496692019159872344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12649227490724589857.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 45 cols 787 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-25 09:00:21] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12649227490724589857.kers
Total runtime 0 ms.
[2026-05-25 09:00:21] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 09:00:21] [INFO ] Invariant cache hit.
[2026-05-25 09:00:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 09:00:21] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2026-05-25 09:00:21] [INFO ] Redundant transitions in 23 ms returned []
Running 147 sub problems to find dead transitions.
[2026-05-25 09:00:21] [INFO ] Invariant cache hit.
[2026-05-25 09:00:21] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 150/194 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/196 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 65 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4923 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 150/194 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 144/208 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 2/196 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 212 constraints, problems are : Problem set: 0 solved, 147 unsolved in 15498 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20516ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 20516ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/109 places, 151/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20686 ms. Remains : 45/109 places, 151/222 transitions.
Initial state reduction rules removed 1 formulas.
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' '!(true)'
Stuttering acceptance computed with spot in 68 ms :[false]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-00
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-00 TRUE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-00 finished in 20835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 99 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 96 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 96 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 94 transition count 186
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 94 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 92 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 92 transition count 180
Applied a total of 35 rules in 16 ms. Remains 92 /109 variables (removed 17) and now considering 180/222 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3701620475198686683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12597495643951178948.kers'
[2026-05-25 09:00:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3701620475198686683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12597495643951178948.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 92 cols 788 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:00:42] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12597495643951178948.kers
Total runtime 1 ms.
[2026-05-25 09:00:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:00:42] [INFO ] Invariant cache hit.
[2026-05-25 09:00:42] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-25 09:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/272 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 107 constraints, problems are : Problem set: 0 solved, 179 unsolved in 14001 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/272 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 179/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 293 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44083ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 44084ms
Starting structural reductions in LTL mode, iteration 1 : 92/109 places, 180/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44267 ms. Remains : 92/109 places, 180/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 8300 reset in 223 ms.
Product exploration explored 100000 steps with 8304 reset in 154 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 332 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1975 resets) in 300 ms. (132 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (523 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2026-05-25 09:01:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 158/230 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/253 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/257 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/269 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/272 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/272 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 158/230 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/253 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/257 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/269 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/272 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/272 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/272 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 180/180 transitions.
Graph (complete) has 332 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 87 transition count 155
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 37 place count 75 transition count 153
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 37 place count 75 transition count 149
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 71 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 70 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 70 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 69 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 69 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 68 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 68 transition count 140
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 84 place count 51 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 51 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 49 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 49 transition count 120
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 102 place count 43 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 112 place count 43 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 41 transition count 157
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 41 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 37 transition count 153
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 37 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 35 transition count 151
Applied a total of 128 rules in 48 ms. Remains 35 /92 variables (removed 57) and now considering 151/180 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 35/92 places, 151/180 transitions.
RANDOM walk for 20163 steps (47 resets) in 42 ms. (468 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 1088 ms.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-25 09:01:28] [INFO ] Invariant cache hit.
[2026-05-25 09:01:29] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:01:29] [INFO ] Invariant cache hit.
[2026-05-25 09:01:29] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 92/92 places, 180/180 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 332 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1995 resets) in 94 ms. (421 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (551 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2026-05-25 09:01:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 158/230 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/253 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/257 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/269 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/272 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/272 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 158/230 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/253 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/257 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/269 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/272 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/272 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/272 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 180/180 transitions.
Graph (complete) has 332 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 87 transition count 155
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 37 place count 75 transition count 153
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 37 place count 75 transition count 149
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 71 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 70 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 70 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 69 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 69 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 68 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 68 transition count 140
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 84 place count 51 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 51 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 49 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 49 transition count 120
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 102 place count 43 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 112 place count 43 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 41 transition count 157
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 41 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 37 transition count 153
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 37 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 35 transition count 151
Applied a total of 128 rules in 25 ms. Remains 35 /92 variables (removed 57) and now considering 151/180 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 35/92 places, 151/180 transitions.
RANDOM walk for 40000 steps (28 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30701 steps (79 resets) in 49 ms. (614 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 929 ms.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 8114 reset in 121 ms.
Product exploration explored 100000 steps with 8274 reset in 121 ms.
Spot run failed in 106 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/ltsmin15117404616757116039
[2026-05-25 09:01:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15117404616757116039
Running compilation step : cd /tmp/ltsmin15117404616757116039;'/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 471 ms.
Running link step : cd /tmp/ltsmin15117404616757116039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin15117404616757116039;'/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/stateBased9404349384117267028.hoa' '--buchi-type=spotba'
LTSmin run took 914 ms.
FORMULA MedleyA-PT-08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLFireability-01 finished in 50013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 97 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 94 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 94 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 92 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 92 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 91 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 91 transition count 180
Applied a total of 37 rules in 3 ms. Remains 91 /109 variables (removed 18) and now considering 180/222 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10709428318492473740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10921866089081943961.kers'
[2026-05-25 09:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10709428318492473740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10921866089081943961.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 91 cols 792 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:01:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10921866089081943961.kers
Total runtime 1 ms.
[2026-05-25 09:01:32] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-25 09:01:32] [INFO ] Invariant cache hit.
[2026-05-25 09:01:33] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-25 09:01:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/271 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 106 constraints, problems are : Problem set: 0 solved, 179 unsolved in 13188 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/271 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 179/283 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 288 constraints, problems are : Problem set: 0 solved, 179 unsolved in 25501 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38758ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 38758ms
Starting structural reductions in LTL mode, iteration 1 : 91/109 places, 180/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39275 ms. Remains : 91/109 places, 180/222 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||X(X(p1)))))'
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-02 finished in 39569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(X((!p2&&F((p3 U ((p3&&G(!p0))||G(p3)))))))&&(p0 U (p1||G(p0)))))))'
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 99 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 97 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 97 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 96 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 96 transition count 194
Applied a total of 27 rules in 9 ms. Remains 96 /109 variables (removed 13) and now considering 194/222 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9313087572308303180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11115146574647978109.kers'
[2026-05-25 09:02:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9313087572308303180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11115146574647978109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 96 cols 840 entries
Finished phase 1 with 82 SingleSign rule and 4 generalized
[2026-05-25 09:02:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11115146574647978109.kers
Total runtime 2 ms.
[2026-05-25 09:02:12] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:02:12] [INFO ] Invariant cache hit.
[2026-05-25 09:02:12] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-25 09:02:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/290 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/290 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 112 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11766 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/290 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 193/303 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 311 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41874ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 41874ms
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 194/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42123 ms. Remains : 96/109 places, 194/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(X((!p2&&F((p3 U ((p3&&G(!p0))||G(p3)))))))&&(p0 U (p1||G(p0)))))))'
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (OR (NOT p3) p2), (AND (NOT p1) (NOT p0) p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), false]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 4955 reset in 208 ms.
Product exploration explored 100000 steps with 4952 reset in 181 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 354 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 21 factoid took 91 ms. Reduced automaton from 11 states, 35 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 13 to 9
RANDOM walk for 40000 steps (1986 resets) in 301 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (528 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (527 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (531 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (543 resets) in 63 ms. (625 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (523 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (532 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (534 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
[2026-05-25 09:02:55] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/72 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/76 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 172/248 variables, 76/84 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 1/85 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 23/271 variables, 9/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/275 variables, 2/96 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 12/287 variables, 9/105 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/290 variables, 2/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/290 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/290 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 107 constraints, problems are : Problem set: 2 solved, 4 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/72 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/76 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 172/248 variables, 76/86 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 4/90 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 23/271 variables, 9/99 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/275 variables, 2/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/275 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 12/287 variables, 9/110 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/287 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/290 variables, 2/112 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/290 variables, 1/113 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/290 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 113 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1544ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2335 steps, including 60 resets, run visited all 4 properties in 4 ms. (steps per millisecond=583 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 8 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 23 factoid took 209 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p3))]
Knowledge-based reduction took 2548 ms.
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-25 09:02:58] [INFO ] Invariant cache hit.
[2026-05-25 09:02:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:02:58] [INFO ] Invariant cache hit.
[2026-05-25 09:02:58] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 96/96 places, 194/194 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 354 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1980 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (531 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (532 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (519 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (517 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (521 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (538 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 670924 steps, run visited all 6 properties in 1687 ms. (steps per millisecond=397 )
Probabilistic random walk after 670924 steps, saw 117766 distinct states, run finished after 1687 ms. (steps per millisecond=397 ) properties seen :6
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p3))]
Knowledge-based reduction took 2416 ms.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 4960 reset in 122 ms.
Product exploration explored 100000 steps with 4967 reset in 161 ms.
Spot run failed in 61 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/ltsmin14429184349042203225
[2026-05-25 09:03:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14429184349042203225
Running compilation step : cd /tmp/ltsmin14429184349042203225;'/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 397 ms.
Running link step : cd /tmp/ltsmin14429184349042203225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14429184349042203225;'/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/stateBased10395918545011831376.hoa' '--buchi-type=spotba'
LTSmin run took 6364 ms.
FORMULA MedleyA-PT-08-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLFireability-03 finished in 56286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((X(p2)||p1)))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 202
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 94 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 94 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 92 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 92 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 90 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 90 transition count 175
Applied a total of 38 rules in 8 ms. Remains 90 /109 variables (removed 19) and now considering 175/222 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2138588328457365031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9312877725094178676.kers'
[2026-05-25 09:03:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2138588328457365031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9312877725094178676.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 90 cols 762 entries
Finished phase 1 with 76 SingleSign rule and 4 generalized
[2026-05-25 09:03:08] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9312877725094178676.kers
Total runtime 2 ms.
[2026-05-25 09:03:08] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:03:08] [INFO ] Invariant cache hit.
[2026-05-25 09:03:08] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2026-05-25 09:03:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 107 constraints, problems are : Problem set: 0 solved, 174 unsolved in 13507 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 174/279 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 284 constraints, problems are : Problem set: 0 solved, 174 unsolved in 29138 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42682ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 42704ms
Starting structural reductions in LTL mode, iteration 1 : 90/109 places, 175/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42891 ms. Remains : 90/109 places, 175/222 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)||X(F((X(p2)||p1)))))'
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 321 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 21 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA MedleyA-PT-08-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLFireability-05 finished in 43419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&((F(p1) U X(p2))||G(p3))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 202
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 95 transition count 189
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 95 transition count 189
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 94 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 94 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 93 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 93 transition count 184
Applied a total of 33 rules in 10 ms. Remains 93 /109 variables (removed 16) and now considering 184/222 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12777244455244118365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10322348816317044859.kers'
[2026-05-25 09:03:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12777244455244118365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10322348816317044859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 93 cols 800 entries
Finished phase 1 with 79 SingleSign rule and 4 generalized
[2026-05-25 09:03:51] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10322348816317044859.kers
Total runtime 16 ms.
[2026-05-25 09:03:51] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 09:03:51] [INFO ] Invariant cache hit.
[2026-05-25 09:03:52] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2026-05-25 09:03:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/277 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 108 constraints, problems are : Problem set: 0 solved, 183 unsolved in 11151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/277 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 183/289 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 291 constraints, problems are : Problem set: 0 solved, 183 unsolved in 28350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39573ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 39574ms
Starting structural reductions in LTL mode, iteration 1 : 93/109 places, 184/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39824 ms. Remains : 93/109 places, 184/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&((F(p1) U X(p2))||G(p3))))'
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 78 steps with 3 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-06 finished in 40230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U (G(!p1)||(G(p3)&&p2)))))'
Support contains 9 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 96 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 96 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 94 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 94 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 92 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 92 transition count 182
Applied a total of 35 rules in 3 ms. Remains 92 /109 variables (removed 17) and now considering 182/222 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11408810562694956444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13276514045244799316.kers'
[2026-05-25 09:04:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11408810562694956444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13276514045244799316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 92 cols 792 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:04:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-13276514045244799316.kers
Total runtime 14 ms.
[2026-05-25 09:04:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:04:32] [INFO ] Invariant cache hit.
[2026-05-25 09:04:32] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-25 09:04:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/274 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 107 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14909 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/274 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 181/286 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 293 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44976ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 44978ms
Starting structural reductions in LTL mode, iteration 1 : 92/109 places, 182/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45212 ms. Remains : 92/109 places, 182/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U (G(!p1)||(G(p3)&&p2)))))'
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p0) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p0) (AND p1 (NOT p3))), (OR (NOT p0) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (NOT p0) (NOT p3))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 4972 reset in 189 ms.
Product exploration explored 100000 steps with 4973 reset in 189 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 334 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 29 factoid took 95 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (1999 resets) in 202 ms. (197 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40001 steps (539 resets) in 1007 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (549 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (530 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (528 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (618 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (531 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
[2026-05-25 09:05:18] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Problem apf10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/68 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/72 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 160/232 variables, 72/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 23/255 variables, 9/89 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 4/259 variables, 2/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/271 variables, 9/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/274 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/274 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 102 constraints, problems are : Problem set: 1 solved, 5 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/68 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/72 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 160/232 variables, 72/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 23/255 variables, 9/90 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 4/94 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/259 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/271 variables, 9/107 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 3/274 variables, 2/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/274 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/274 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 109 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2378 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2832ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 2 ms.
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (AND p0 (OR (NOT p1) p3)))
Knowledge based reduction with 30 factoid took 182 ms. Proved property starting from automaton with 4 states, 11 edges and 4 AP (stutter insensitive
Knowledge-based reduction took 3505 ms.
FORMULA MedleyA-PT-08-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLFireability-07 finished in 49303 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(p0) U G(p1)) U X(p2))||F(p3))))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 94 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 94 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 91 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 91 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 89 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 89 transition count 172
Applied a total of 41 rules in 3 ms. Remains 89 /109 variables (removed 20) and now considering 172/222 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13965234588009948541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1583561202942571477.kers'
[2026-05-25 09:05:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13965234588009948541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1583561202942571477.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 89 cols 756 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:05:21] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1583561202942571477.kers
Total runtime 2 ms.
[2026-05-25 09:05:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:05:21] [INFO ] Invariant cache hit.
[2026-05-25 09:05:21] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2026-05-25 09:05:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/261 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 102 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/261 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 171/272 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 0/261 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 278 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38527ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 38528ms
Starting structural reductions in LTL mode, iteration 1 : 89/109 places, 172/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38717 ms. Remains : 89/109 places, 172/222 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(p0) U G(p1)) U X(p2))||F(p3))))'
Stuttering acceptance computed with spot in 613 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-08 finished in 39418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Graph (complete) has 401 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 103 transition count 206
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 91 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 26 place count 91 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 88 transition count 202
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 41 place count 79 transition count 187
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 79 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 76 transition count 173
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 76 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 74 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 74 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 73 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 73 transition count 166
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 90 place count 58 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 58 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 54 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 54 transition count 142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 109 place count 50 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 137 place count 50 transition count 135
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 137 place count 50 transition count 133
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 48 transition count 133
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 45 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 45 transition count 162
Applied a total of 149 rules in 60 ms. Remains 45 /109 variables (removed 64) and now considering 162/222 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8233647372972324310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9740787324848050828.kers'
[2026-05-25 09:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8233647372972324310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9740787324848050828.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 45 cols 785 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-25 09:06:00] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9740787324848050828.kers
Total runtime 2 ms.
[2026-05-25 09:06:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:06:00] [INFO ] Invariant cache hit.
[2026-05-25 09:06:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 09:06:01] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-25 09:06:01] [INFO ] Redundant transitions in 28 ms returned []
Running 156 sub problems to find dead transitions.
[2026-05-25 09:06:01] [INFO ] Invariant cache hit.
[2026-05-25 09:06:01] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 161/205 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 2/207 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 100 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6836 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 161/205 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 153/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 2/207 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 256 constraints, problems are : Problem set: 0 solved, 156 unsolved in 14246 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21217ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 21217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/109 places, 162/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21555 ms. Remains : 45/109 places, 162/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-09 finished in 21655 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 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 222/222 transitions.
Graph (complete) has 401 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 104 transition count 206
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 91 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 29 place count 91 transition count 201
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 88 transition count 201
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 43 place count 80 transition count 186
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 80 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 51 place count 80 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 79 transition count 185
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 75 transition count 168
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 75 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 73 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 73 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 72 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 72 transition count 161
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 99 place count 55 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 55 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 51 transition count 135
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 51 transition count 135
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 124 place count 44 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 44 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 138 place count 44 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 42 transition count 166
Applied a total of 142 rules in 48 ms. Remains 42 /109 variables (removed 67) and now considering 166/222 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17054649494344108369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4916385384921962692.kers'
[2026-05-25 09:06:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17054649494344108369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4916385384921962692.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 42 cols 739 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 09:06:22] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4916385384921962692.kers
Total runtime 2 ms.
[2026-05-25 09:06:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 09:06:22] [INFO ] Invariant cache hit.
[2026-05-25 09:06:22] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-25 09:06:22] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2026-05-25 09:06:22] [INFO ] Redundant transitions in 21 ms returned [114]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 163 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6229955824595049202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10015268483776114261.kers'
[2026-05-25 09:06:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6229955824595049202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10015268483776114261.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 42 cols 737 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 09:06:22] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10015268483776114261.kers
Total runtime 2 ms.
[2026-05-25 09:06:22] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 165/207 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 82/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 131 constraints, problems are : Problem set: 0 solved, 163 unsolved in 7053 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 165/207 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 82/131 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 163/294 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 294 constraints, problems are : Problem set: 0 solved, 163 unsolved in 10051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17179ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 17179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/109 places, 165/222 transitions.
Applied a total of 0 rules in 14 ms. Remains 42 /42 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17449 ms. Remains : 42/109 places, 165/222 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 61 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 11412 reset in 209 ms.
Product exploration explored 100000 steps with 11433 reset in 211 ms.
Computed a total of 10 stabilizing places and 83 stable transitions
Computed a total of 10 stabilizing places and 83 stable transitions
Detected a total of 10/42 stabilizing places and 83/165 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Knowledge-based reduction took 275 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 165/165 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2026-05-25 09:06:40] [INFO ] Invariant cache hit.
[2026-05-25 09:06:41] [INFO ] Implicit Places using invariants in 373 ms returned []
[2026-05-25 09:06:41] [INFO ] Invariant cache hit.
[2026-05-25 09:06:41] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-25 09:06:41] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2026-05-25 09:06:41] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 546 ms. Remains : 42/42 places, 165/165 transitions.
Computed a total of 10 stabilizing places and 83 stable transitions
Computed a total of 10 stabilizing places and 83 stable transitions
Detected a total of 10/42 stabilizing places and 83/165 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Knowledge-based reduction took 179 ms.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11445 reset in 169 ms.
Product exploration explored 100000 steps with 11459 reset in 228 ms.
Built C files in :
/tmp/ltsmin13030820375111121057
[2026-05-25 09:06:41] [INFO ] Computing symmetric may disable matrix : 165 transitions.
[2026-05-25 09:06:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:06:41] [INFO ] Computing symmetric may enable matrix : 165 transitions.
[2026-05-25 09:06:41] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:06:42] [INFO ] Computing Do-Not-Accords matrix : 165 transitions.
[2026-05-25 09:06:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:06:42] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13030820375111121057
Running compilation step : cd /tmp/ltsmin13030820375111121057;'/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 491 ms.
Running link step : cd /tmp/ltsmin13030820375111121057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13030820375111121057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7844047287496941011.hoa' '--buchi-type=spotba'
LTSmin run took 3172 ms.
FORMULA MedleyA-PT-08-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLFireability-13 finished in 23343 ms.
All properties solved by simple procedures.
Total runtime 511424 ms.

BK_STOP 1779700005786

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-08"
export BK_EXAMINATION="LTLFireability"
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-08, examination is LTLFireability"
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-177969019900156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;