fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r002-oct2-177944366400540
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for AutoFlight-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1050.216 243854.00 307444.00 237.30 FFFFFTFFTFFFFFTF normal

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.r002-oct2-177944366400540.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 AutoFlight-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.0K Mar 5 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 5 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 5 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 85K 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 AutoFlight-PT-12a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779493451304

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:44:12] [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-22 23:44:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:44:12] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-22 23:44:12] [INFO ] Transformed 307 places.
[2026-05-22 23:44:12] [INFO ] Transformed 305 transitions.
[2026-05-22 23:44:12] [INFO ] Found NUPN structural information;
[2026-05-22 23:44:12] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Support contains 50 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 36 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (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-2898745947656781072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-52101177388618744.kers'
[2026-05-22 23:44:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2898745947656781072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-52101177388618744.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 245 rows 283 cols 716 entries
Finished phase 1 with 217 SingleSign rule and 14 generalized
[2026-05-22 23:44:13] [INFO ] Computed 76 invariants in 1 ms
Computed 76 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-52101177388618744.kers
Total runtime 2 ms.
[2026-05-22 23:44:15] [INFO ] Implicit Places using invariants in 2672 ms returned [14, 35, 42, 56, 63, 70, 77, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 182, 232, 238, 244, 250, 256, 262, 268, 280, 304, 306]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 2716 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 277/307 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 267 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 266 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 266 transition count 234
Applied a total of 22 rules in 64 ms. Remains 266 /277 variables (removed 11) and now considering 234/245 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18026838198448320169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12327556782567761780.kers'
[2026-05-22 23:44:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18026838198448320169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12327556782567761780.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 234 rows 261 cols 636 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-22 23:44:15] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12327556782567761780.kers
Total runtime 3 ms.
[2026-05-22 23:44:16] [INFO ] Implicit Places using invariants in 278 ms returned []
[2026-05-22 23:44:16] [INFO ] Invariant cache hit.
[2026-05-22 23:44:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-22 23:44:16] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 266/307 places, 234/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3859 ms. Remains : 266/307 places, 234/245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2026-05-22 23:44:16] [INFO ] Invariant cache hit.
[2026-05-22 23:44:17] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-22 23:44:17] [INFO ] Invariant cache hit.
[2026-05-22 23:44:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-22 23:44:17] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-22 23:44:17] [INFO ] Invariant cache hit.
[2026-05-22 23:44:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/500 variables, 266/312 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 19/331 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 331 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 266/266 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/500 variables, 266/312 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 19/331 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 233/564 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 571 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 266/266 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 266/266 places, 234/234 transitions.
Support contains 50 out of 266 places after structural reductions.
[2026-05-22 23:45:18] [INFO ] Flatten gal took : 46 ms
[2026-05-22 23:45:18] [INFO ] Flatten gal took : 15 ms
[2026-05-22 23:45:18] [INFO ] Input system was already deterministic with 234 transitions.
RANDOM walk for 40000 steps (748 resets) in 1582 ms. (25 steps per ms) remains 5/36 properties
BEST_FIRST walk for 40004 steps (44 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (42 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
[2026-05-22 23:45:18] [INFO ] Invariant cache hit.
[2026-05-22 23:45:18] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 166/179 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 87/266 variables, 37/48 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 234/500 variables, 266/319 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 19/338 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/500 variables, 1/339 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 339 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 266/266 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/172 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 94/266 variables, 40/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 6/54 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 234/500 variables, 266/321 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 19/340 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 3/343 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/500 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 343 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 266/266 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2558ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 1 properties in 335 ms.
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 234/234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 266 transition count 175
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 207 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 206 transition count 174
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 120 place count 206 transition count 149
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 170 place count 181 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 180 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 180 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 179 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 179 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 178 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 178 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 177 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 177 transition count 145
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 232 place count 150 transition count 118
Free-agglomeration rule applied 34 times.
Iterating global reduction 3 with 34 rules applied. Total rules applied 266 place count 150 transition count 84
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 300 place count 116 transition count 84
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 304 place count 116 transition count 80
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 308 place count 112 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 309 place count 111 transition count 79
Reduce places removed 39 places and 0 transitions.
Graph (trivial) has 63 edges and 72 vertex of which 15 / 72 are part of one of the 1 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 5 with 80 rules applied. Total rules applied 389 place count 58 transition count 39
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 67 rules applied. Total rules applied 456 place count 15 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 456 place count 15 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 458 place count 14 transition count 14
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 464 place count 11 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 466 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 469 place count 9 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 470 place count 9 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 472 place count 7 transition count 7
Applied a total of 472 rules in 56 ms. Remains 7 /266 variables (removed 259) and now considering 7/234 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 7/266 places, 7/234 transitions.
RANDOM walk for 116 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/2 properties
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA AutoFlight-PT-12a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||(F(p1)&&X(p2))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Applied a total of 22 rules in 46 ms. Remains 255 /266 variables (removed 11) and now considering 223/234 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6994239410634491972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2165683590976021283.kers'
[2026-05-22 23:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6994239410634491972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2165683590976021283.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 223 rows 250 cols 614 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-22 23:45:22] [INFO ] Computed 46 invariants in 1 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2165683590976021283.kers
Total runtime 1 ms.
[2026-05-22 23:45:22] [INFO ] Implicit Places using invariants in 196 ms returned [7, 20, 27, 46, 77, 227, 237, 243, 249]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 197 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/266 places, 223/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 242 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 242 transition count 219
Applied a total of 8 rules in 5 ms. Remains 242 /246 variables (removed 4) and now considering 219/223 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9597337806484587780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3294990328656386558.kers'
[2026-05-22 23:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9597337806484587780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3294990328656386558.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 242 cols 594 entries
Finished phase 1 with 205 SingleSign rule and 0 generalized
[2026-05-22 23:45:22] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3294990328656386558.kers
Total runtime 1 ms.
[2026-05-22 23:45:22] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-22 23:45:22] [INFO ] Invariant cache hit.
[2026-05-22 23:45:23] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 242/266 places, 219/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 725 ms. Remains : 242/266 places, 219/234 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(p1))||(F(p1)&&X(p2))))'
Stuttering acceptance computed with spot in 444 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-00 finished in 1250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 266 transition count 185
Reduce places removed 49 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 62 rules applied. Total rules applied 111 place count 217 transition count 172
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 124 place count 204 transition count 172
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 124 place count 204 transition count 148
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 172 place count 180 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 179 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 179 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 178 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 178 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 177 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 177 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 176 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 176 transition count 144
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 228 place count 152 transition count 120
Applied a total of 228 rules in 29 ms. Remains 152 /266 variables (removed 114) and now considering 120/234 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6010864331637437702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9943772516030154237.kers'
[2026-05-22 23:45:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6010864331637437702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9943772516030154237.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 120 rows 135 cols 324 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-22 23:45:23] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9943772516030154237.kers
Total runtime 2 ms.
[2026-05-22 23:45:23] [INFO ] Implicit Places using invariants in 159 ms returned [5, 14, 19, 32, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 137, 142, 147]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 160 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/266 places, 120/234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 132 transition count 109
Reduce places removed 11 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 23 rules applied. Total rules applied 34 place count 121 transition count 97
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 46 place count 109 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 46 place count 109 transition count 96
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 48 place count 108 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 105 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 105 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 103 transition count 91
Applied a total of 58 rules in 8 ms. Remains 103 /132 variables (removed 29) and now considering 91/120 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8166232195898222240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10483421476272155155.kers'
[2026-05-22 23:45:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8166232195898222240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10483421476272155155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 103 cols 257 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-22 23:45:23] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10483421476272155155.kers
Total runtime 0 ms.
[2026-05-22 23:45:23] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-22 23:45:23] [INFO ] Invariant cache hit.
[2026-05-22 23:45:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-22 23:45:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/266 places, 91/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 103/266 places, 91/234 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-01
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-01 finished in 546 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 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 266 transition count 184
Reduce places removed 50 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 62 rules applied. Total rules applied 112 place count 216 transition count 172
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 124 place count 204 transition count 172
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 124 place count 204 transition count 147
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 174 place count 179 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 178 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 178 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 177 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 177 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 176 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 176 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 175 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 175 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 174 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 174 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 173 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 173 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 172 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 172 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 171 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 171 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 170 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 170 transition count 138
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 240 place count 146 transition count 114
Applied a total of 240 rules in 45 ms. Remains 146 /266 variables (removed 120) and now considering 114/234 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18208459330833285136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11393940475938075572.kers'
[2026-05-22 23:45:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18208459330833285136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11393940475938075572.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 114 rows 129 cols 312 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-22 23:45:24] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11393940475938075572.kers
Total runtime 4 ms.
[2026-05-22 23:45:24] [INFO ] Implicit Places using invariants in 141 ms returned [5, 14, 19, 32, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 123, 131, 136]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 143 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/266 places, 114/234 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 9 rules applied. Total rules applied 9 place count 126 transition count 105
Reduce places removed 9 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 21 rules applied. Total rules applied 30 place count 117 transition count 93
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 42 place count 105 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 102 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 102 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 101 transition count 89
Applied a total of 50 rules in 8 ms. Remains 101 /126 variables (removed 25) and now considering 89/114 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12257786528647871247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13613263002208846384.kers'
[2026-05-22 23:45:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12257786528647871247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13613263002208846384.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 101 cols 253 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-22 23:45:24] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13613263002208846384.kers
Total runtime 0 ms.
[2026-05-22 23:45:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-22 23:45:24] [INFO ] Invariant cache hit.
[2026-05-22 23:45:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-22 23:45:24] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/266 places, 89/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 101/266 places, 89/234 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 27 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-04
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(G(p2)||p1))))'
Support contains 5 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Applied a total of 18 rules in 28 ms. Remains 257 /266 variables (removed 9) and now considering 225/234 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10057136245580544018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16537552365249689493.kers'
[2026-05-22 23:45:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10057136245580544018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16537552365249689493.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 225 rows 252 cols 618 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-22 23:45:24] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16537552365249689493.kers
Total runtime 1 ms.
[2026-05-22 23:45:24] [INFO ] Implicit Places using invariants in 264 ms returned [20, 27, 46, 229, 239, 245, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 265 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/266 places, 225/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 246 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 246 transition count 221
Applied a total of 8 rules in 10 ms. Remains 246 /250 variables (removed 4) and now considering 221/225 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8502308438506885550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1028126177653279348.kers'
[2026-05-22 23:45:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8502308438506885550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1028126177653279348.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 244 cols 598 entries
Finished phase 1 with 207 SingleSign rule and 0 generalized
[2026-05-22 23:45:24] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1028126177653279348.kers
Total runtime 2 ms.
[2026-05-22 23:45:25] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-22 23:45:25] [INFO ] Invariant cache hit.
[2026-05-22 23:45:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 23:45:25] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 246/266 places, 221/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 806 ms. Remains : 246/266 places, 221/234 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(G(p2)||p1))))'
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-06 finished in 1051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 260 transition count 145
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 182 place count 172 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 171 transition count 144
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 183 place count 171 transition count 131
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 221 place count 146 transition count 131
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 3 with 12 rules applied. Total rules applied 233 place count 146 transition count 119
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 245 place count 134 transition count 119
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 307 place count 103 transition count 88
Applied a total of 307 rules in 21 ms. Remains 103 /266 variables (removed 163) and now considering 88/234 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2879584352729689023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4709934431509337217.kers'
[2026-05-22 23:45:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2879584352729689023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4709934431509337217.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 88 rows 79 cols 184 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-22 23:45:25] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4709934431509337217.kers
Total runtime 0 ms.
[2026-05-22 23:45:25] [INFO ] Implicit Places using invariants in 54 ms returned [88, 93, 96, 99]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/266 places, 88/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 99/266 places, 88/234 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 27 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-07
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-07 finished in 126 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) U X((p1||F(p2)))) U X(X(!p3))))'
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 220
Applied a total of 28 rules in 39 ms. Remains 252 /266 variables (removed 14) and now considering 220/234 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11290511207329313288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7630794320272305644.kers'
[2026-05-22 23:45:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11290511207329313288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7630794320272305644.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 220 rows 247 cols 608 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-22 23:45:25] [INFO ] Computed 46 invariants in 1 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7630794320272305644.kers
Total runtime 1 ms.
[2026-05-22 23:45:25] [INFO ] Implicit Places using invariants in 224 ms returned [7, 20, 27, 46, 77, 224, 234, 240]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 225 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 244/266 places, 220/234 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 241 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 241 transition count 217
Applied a total of 6 rules in 20 ms. Remains 241 /244 variables (removed 3) and now considering 217/220 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14692317797201397847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14005872971857562763.kers'
[2026-05-22 23:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14692317797201397847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14005872971857562763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 241 cols 593 entries
Finished phase 1 with 203 SingleSign rule and 0 generalized
[2026-05-22 23:45:26] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14005872971857562763.kers
Total runtime 1 ms.
[2026-05-22 23:45:26] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-22 23:45:26] [INFO ] Invariant cache hit.
[2026-05-22 23:45:26] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 241/266 places, 217/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 692 ms. Remains : 241/266 places, 217/234 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) U X((p1||F(p2)))) U X(X(!p3))))'
Stuttering acceptance computed with spot in 552 ms :[p3, false, p3, (AND (NOT p0) p1 (NOT p2) p3), (AND (NOT p0) (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), false, (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08
Product exploration explored 100000 steps with 37629 reset in 434 ms.
Product exploration explored 100000 steps with 37722 reset in 367 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 14 factoid took 135 ms. Reduced automaton from 12 states, 22 edges and 4 AP (stutter sensitive) to 11 states, 16 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (755 resets) in 402 ms. (99 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (30 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
[2026-05-22 23:45:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 148/458 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/38 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 17 factoid took 210 ms. Reduced automaton from 11 states, 16 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[p3, p3, p3]
Knowledge-based reduction took 753 ms.
Stuttering acceptance computed with spot in 101 ms :[p3, p3, p3]
Support contains 2 out of 241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 217/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 241 /241 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-22 23:45:28] [INFO ] Invariant cache hit.
[2026-05-22 23:45:28] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-22 23:45:28] [INFO ] Invariant cache hit.
[2026-05-22 23:45:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-22 23:45:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/458 variables, 241/279 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 0/458 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 279 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14460 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/458 variables, 241/279 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 216/495 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 516 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44512ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 44513ms
Finished structural reductions in LTL mode , in 1 iterations and 45033 ms. Remains : 241/241 places, 217/217 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p3, p3, p3]
Knowledge-based reduction took 381 ms.
Stuttering acceptance computed with spot in 116 ms :[p3, p3, p3]
Stuttering acceptance computed with spot in 133 ms :[p3, p3, p3]
Product exploration explored 100000 steps with 18720 reset in 279 ms.
Product exploration explored 100000 steps with 18432 reset in 331 ms.
Spot run failed in 96 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/ltsmin16014453638752007827
[2026-05-22 23:46:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16014453638752007827
Running compilation step : cd /tmp/ltsmin16014453638752007827;'/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 543 ms.
Running link step : cd /tmp/ltsmin16014453638752007827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin16014453638752007827;'/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/stateBased6124499106541564948.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 226 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 225 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 225 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 224 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 224 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 223 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 223 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 222 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 222 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 221 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 221 transition count 197
Applied a total of 40 rules in 48 ms. Remains 221 /241 variables (removed 20) and now considering 197/217 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10130078179742064580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3399056726173891345.kers'
[2026-05-22 23:46:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10130078179742064580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3399056726173891345.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 221 cols 553 entries
Finished phase 1 with 183 SingleSign rule and 0 generalized
[2026-05-22 23:46:30] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3399056726173891345.kers
Total runtime 2 ms.
[2026-05-22 23:46:30] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-22 23:46:30] [INFO ] Invariant cache hit.
[2026-05-22 23:46:30] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-22 23:46:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/418 variables, 221/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/418 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 259 constraints, problems are : Problem set: 0 solved, 196 unsolved in 15918 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/418 variables, 221/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 196/455 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 475 constraints, problems are : Problem set: 0 solved, 196 unsolved in 26740 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42702ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 42704ms
Starting structural reductions in LTL mode, iteration 1 : 221/241 places, 197/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43155 ms. Remains : 221/241 places, 197/217 transitions.
Built C files in :
/tmp/ltsmin1852158455166313984
[2026-05-22 23:47:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1852158455166313984
Running compilation step : cd /tmp/ltsmin1852158455166313984;'/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 314 ms.
Running link step : cd /tmp/ltsmin1852158455166313984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1852158455166313984;'/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/stateBased17264523885637923415.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:47:28] [INFO ] Flatten gal took : 17 ms
[2026-05-22 23:47:28] [INFO ] Flatten gal took : 13 ms
[2026-05-22 23:47:28] [INFO ] Time to serialize gal into /tmp/LTL14211173025768993524.gal : 4 ms
[2026-05-22 23:47:28] [INFO ] Time to serialize properties into /tmp/LTL449534276073651077.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14211173025768993524.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12891822654821441813.hoa' '-atoms' '/tmp/LTL449534276073651077.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL449534276073651077.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12891822654821441813.hoa
Detected timeout of ITS tools.
[2026-05-22 23:47:43] [INFO ] Flatten gal took : 8 ms
[2026-05-22 23:47:43] [INFO ] Flatten gal took : 8 ms
[2026-05-22 23:47:43] [INFO ] Time to serialize gal into /tmp/LTL12976103092506445095.gal : 3 ms
[2026-05-22 23:47:43] [INFO ] Time to serialize properties into /tmp/LTL17520098056639164610.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12976103092506445095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17520098056639164610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("((p13==1)&&(p241==1))"))U(X(("(p200==1)")||(F("(p153!=1)")))))U(X(X(!("((p298==1)&&(p305==1))"))))))
Formula 0 simplified : (G!"((p13==1)&&(p241==1))" R X(!"(p200==1)" & G!"(p153!=1)")) R XX"((p298==1)&&(p305==1))"
Detected timeout of ITS tools.
[2026-05-22 23:47:58] [INFO ] Flatten gal took : 13 ms
[2026-05-22 23:47:58] [INFO ] Applying decomposition
[2026-05-22 23:47:58] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph147000834329701573.txt' '-o' '/tmp/graph147000834329701573.bin' '-w' '/tmp/graph147000834329701573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph147000834329701573.bin' '-l' '-1' '-v' '-w' '/tmp/graph147000834329701573.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:47:58] [INFO ] Decomposing Gal with order
[2026-05-22 23:47:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:47:58] [INFO ] Removed a total of 24 redundant transitions.
[2026-05-22 23:47:58] [INFO ] Flatten gal took : 66 ms
[2026-05-22 23:47:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-22 23:47:58] [INFO ] Time to serialize gal into /tmp/LTL108969660392515426.gal : 5 ms
[2026-05-22 23:47:58] [INFO ] Time to serialize properties into /tmp/LTL6054490762216736452.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL108969660392515426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6054490762216736452.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((((F("((i0.i0.u3.p13==1)&&(i0.i0.u74.p241==1))"))U(X(("(i9.i0.u60.p200==1)")||(F("(i6.i0.u48.p153!=1)")))))U(X(X(!("((i14.i1.u92.p29...187
Formula 0 simplified : (G!"((i0.i0.u3.p13==1)&&(i0.i0.u74.p241==1))" R X(!"(i9.i0.u60.p200==1)" & G!"(i6.i0.u48.p153!=1)")) R XX"((i14.i1.u92.p298==1)&&(i1...171
Reverse transition relation is NOT exact ! Due to transitions t183, t207, i0.i0.u3.t53, i0.i1.u5.t49, i1.u7.t45, i2.u8.t43, i2.u9.t41, i3.i0.u13.t33, i3.i1...524
Computing Next relation with stutter on 24 deadlock states
77 unique states visited
0 strongly connected components in search stack
76 transitions explored
39 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.283775,26744,1,0,18507,190,2742,27366,139,309,44997
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-12a-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 153397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 212
Applied a total of 44 rules in 108 ms. Remains 244 /266 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11962172158931329775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13626464949134482416.kers'
[2026-05-22 23:47:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11962172158931329775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13626464949134482416.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 212 rows 239 cols 592 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 23:47:59] [INFO ] Computed 46 invariants in 3 ms
Computed 46 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13626464949134482416.kers
Total runtime 4 ms.
[2026-05-22 23:47:59] [INFO ] Implicit Places using invariants in 253 ms returned [7, 20, 27, 46, 77, 216, 226, 232, 238]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 255 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/266 places, 212/234 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 207
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 219 transition count 196
Applied a total of 32 rules in 54 ms. Remains 219 /235 variables (removed 16) and now considering 196/212 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8672026095773111624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10842136850468020876.kers'
[2026-05-22 23:47:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8672026095773111624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10842136850468020876.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 219 cols 548 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-22 23:47:59] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10842136850468020876.kers
Total runtime 1 ms.
[2026-05-22 23:47:59] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-22 23:47:59] [INFO ] Invariant cache hit.
[2026-05-22 23:47:59] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/266 places, 196/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 754 ms. Remains : 219/266 places, 196/234 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-09
Stuttering criterion allowed to conclude after 451 steps with 82 reset in 4 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 1087 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))&&F(p1)))'
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Applied a total of 2 rules in 18 ms. Remains 265 /266 variables (removed 1) and now considering 233/234 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10058546425386669178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13905909309924899137.kers'
[2026-05-22 23:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10058546425386669178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13905909309924899137.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 233 rows 260 cols 634 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-22 23:48:00] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13905909309924899137.kers
Total runtime 3 ms.
[2026-05-22 23:48:00] [INFO ] Implicit Places using invariants in 254 ms returned [7, 20, 46, 77, 237, 253, 259]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 256 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 233/234 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 255 transition count 230
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 255 transition count 230
Applied a total of 6 rules in 13 ms. Remains 255 /258 variables (removed 3) and now considering 230/233 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7930770832010173199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-235441818546087567.kers'
[2026-05-22 23:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7930770832010173199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-235441818546087567.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 230 rows 254 cols 619 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-22 23:48:00] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-235441818546087567.kers
Total runtime 3 ms.
[2026-05-22 23:48:00] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-22 23:48:00] [INFO ] Invariant cache hit.
[2026-05-22 23:48:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 23:48:01] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 255/266 places, 230/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 255/266 places, 230/234 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))&&F(p1)))'
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 968 steps with 19 reset in 8 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 1162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(F(p0))))&&F(p1))||G(F(p0))))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 212
Applied a total of 44 rules in 99 ms. Remains 244 /266 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8839833891004269916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16001347648095345530.kers'
[2026-05-22 23:48:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8839833891004269916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16001347648095345530.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 212 rows 239 cols 592 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 23:48:01] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16001347648095345530.kers
Total runtime 4 ms.
[2026-05-22 23:48:01] [INFO ] Implicit Places using invariants in 280 ms returned [7, 20, 27, 46, 77, 216, 226, 232, 238]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 281 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/266 places, 212/234 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 207
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 219 transition count 196
Applied a total of 32 rules in 52 ms. Remains 219 /235 variables (removed 16) and now considering 196/212 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16659749195638589223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4687937060275830204.kers'
[2026-05-22 23:48:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16659749195638589223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4687937060275830204.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 219 cols 548 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-22 23:48:01] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4687937060275830204.kers
Total runtime 3 ms.
[2026-05-22 23:48:01] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-22 23:48:01] [INFO ] Invariant cache hit.
[2026-05-22 23:48:02] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/266 places, 196/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 803 ms. Remains : 219/266 places, 196/234 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(X(X(X(F(p0))))&&F(p1))))'
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 1155 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||X((F(p1)&&X(G((p2||X(F((p2&&X(F(p3)))))))))))))'
Support contains 5 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 214
Applied a total of 40 rules in 96 ms. Remains 246 /266 variables (removed 20) and now considering 214/234 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8196326191337166538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12281709512175238571.kers'
[2026-05-22 23:48:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8196326191337166538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12281709512175238571.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 214 rows 241 cols 596 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-22 23:48:02] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12281709512175238571.kers
Total runtime 3 ms.
[2026-05-22 23:48:02] [INFO ] Implicit Places using invariants in 246 ms returned [7, 20, 27, 46, 77, 218, 228, 234, 240]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 248 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/266 places, 214/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 233 transition count 210
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 233 transition count 210
Applied a total of 8 rules in 12 ms. Remains 233 /237 variables (removed 4) and now considering 210/214 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4697862313874350879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11173729000376282805.kers'
[2026-05-22 23:48:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4697862313874350879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11173729000376282805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 233 cols 576 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 23:48:02] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11173729000376282805.kers
Total runtime 3 ms.
[2026-05-22 23:48:03] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-22 23:48:03] [INFO ] Invariant cache hit.
[2026-05-22 23:48:03] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 233/266 places, 210/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 800 ms. Remains : 233/266 places, 210/234 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||X((F(p1)&&X(G((p2||X(F((p2&&X(F(p3)))))))))))))'
Stuttering acceptance computed with spot in 397 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12
Stuttering criterion allowed to conclude after 465 steps with 21 reset in 4 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 1267 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(p1))) U X(X(X(X(G(p2)))))))'
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 212
Applied a total of 44 rules in 73 ms. Remains 244 /266 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17855985621188840325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8835877135409035134.kers'
[2026-05-22 23:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17855985621188840325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8835877135409035134.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 212 rows 239 cols 592 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 23:48:03] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8835877135409035134.kers
Total runtime 3 ms.
[2026-05-22 23:48:04] [INFO ] Implicit Places using invariants in 316 ms returned [7, 20, 27, 46, 77, 216, 226, 238]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 318 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 212/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 232 transition count 208
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 226 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 225 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 225 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 224 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 224 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 223 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 223 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 222 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 222 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 221 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 221 transition count 197
Applied a total of 30 rules in 53 ms. Remains 221 /236 variables (removed 15) and now considering 197/212 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5426643437693991866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5512125969203273756.kers'
[2026-05-22 23:48:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5426643437693991866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5512125969203273756.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 221 cols 553 entries
Finished phase 1 with 183 SingleSign rule and 0 generalized
[2026-05-22 23:48:04] [INFO ] Computed 38 invariants in 2 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5512125969203273756.kers
Total runtime 3 ms.
[2026-05-22 23:48:04] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-22 23:48:04] [INFO ] Invariant cache hit.
[2026-05-22 23:48:04] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 221/266 places, 197/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 887 ms. Remains : 221/266 places, 197/234 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)||p1)) U X(X(X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 846 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), false, (NOT p2), (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-13 finished in 1801 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(((p1 U G(!p2))||p0))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Applied a total of 24 rules in 46 ms. Remains 254 /266 variables (removed 12) and now considering 222/234 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15734333110745351310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18395304898585341437.kers'
[2026-05-22 23:48:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15734333110745351310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18395304898585341437.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 222 rows 249 cols 612 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-22 23:48:05] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-18395304898585341437.kers
Total runtime 11 ms.
[2026-05-22 23:48:05] [INFO ] Implicit Places using invariants in 291 ms returned [20, 27, 46, 77, 226, 236, 242, 248]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 302 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/266 places, 222/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 242 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 242 transition count 218
Applied a total of 8 rules in 9 ms. Remains 242 /246 variables (removed 4) and now considering 218/222 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8971920670687129357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3331041370762028356.kers'
[2026-05-22 23:48:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8971920670687129357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3331041370762028356.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 218 rows 241 cols 592 entries
Finished phase 1 with 204 SingleSign rule and 0 generalized
[2026-05-22 23:48:05] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3331041370762028356.kers
Total runtime 1 ms.
[2026-05-22 23:48:06] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-22 23:48:06] [INFO ] Invariant cache hit.
[2026-05-22 23:48:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 23:48:06] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 242/266 places, 218/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 964 ms. Remains : 242/266 places, 218/234 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(((p1 U G(!p2))||p0))))'
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), true, p2, p2]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 392 ms.
Product exploration explored 100000 steps with 33333 reset in 335 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge based reduction with 7 factoid took 85 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 91 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-14 finished in 2040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0)))) U (p2&&((p2 U p3) U p4))))'
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 212
Applied a total of 44 rules in 93 ms. Remains 244 /266 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14256444849402469554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14658685061163087918.kers'
[2026-05-22 23:48:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14256444849402469554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14658685061163087918.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 212 rows 239 cols 592 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 23:48:07] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14658685061163087918.kers
Total runtime 3 ms.
[2026-05-22 23:48:07] [INFO ] Implicit Places using invariants in 240 ms returned [7, 20, 27, 77, 216, 226, 232, 238]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 241 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 212/234 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 231 transition count 207
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 226 transition count 202
Applied a total of 20 rules in 33 ms. Remains 226 /236 variables (removed 10) and now considering 202/212 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17390962432897123396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6155488260700603524.kers'
[2026-05-22 23:48:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17390962432897123396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6155488260700603524.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 202 rows 225 cols 560 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-22 23:48:08] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6155488260700603524.kers
Total runtime 2 ms.
[2026-05-22 23:48:08] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-22 23:48:08] [INFO ] Invariant cache hit.
[2026-05-22 23:48:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 23:48:08] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 226/266 places, 202/234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 862 ms. Remains : 226/266 places, 202/234 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0)))) U (p2&&((p2 U p3) U p4))))'
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p2) (NOT p4)), p0, p0, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p4), (NOT p4), (AND p0 (NOT p3)), true, (NOT p3), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-15
Product exploration explored 100000 steps with 33322 reset in 303 ms.
Product exploration explored 100000 steps with 33456 reset in 365 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge based reduction with 58 factoid took 297 ms. Reduced automaton from 10 states, 37 edges and 5 AP (stutter sensitive) to 10 states, 37 edges and 5 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (729 resets) in 566 ms. (70 steps per ms) remains 12/27 properties
BEST_FIRST walk for 40004 steps (44 resets) in 105 ms. (377 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (44 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (43 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (44 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
[2026-05-22 23:48:10] [INFO ] Invariant cache hit.
[2026-05-22 23:48:10] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem apf7 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 133/139 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 87/226 variables, 33/38 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/38 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 202/428 variables, 226/264 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 3/267 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/267 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/267 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 267 constraints, problems are : Problem set: 5 solved, 5 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 226/226 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 133/139 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 2/7 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 87/226 variables, 33/40 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 2/42 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/42 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 202/428 variables, 226/268 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 3/271 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 4/275 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/277 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/277 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/277 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 277 constraints, problems are : Problem set: 6 solved, 4 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 226/226 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1821ms problems are : Problem set: 6 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 165 steps, including 3 resets, run visited all 3 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 4 properties in 97 ms.
Found 6 invariant AP formulas.
Knowledge based reduction with 64 factoid took 752 ms. Reduced automaton from 10 states, 37 edges and 5 AP (stutter sensitive) to 8 states, 26 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p2) (NOT p4)), p0, p0, (OR (AND (NOT p2) (NOT p3) p4) (AND p0 (NOT p3) p4)), (OR (NOT p4) (AND p0 p1 (NOT p3))), true, (NOT p3), (AND (NOT p0) (NOT p4))]
[2026-05-22 23:48:13] [INFO ] Invariant cache hit.
[2026-05-22 23:48:13] [INFO ] [Real]Absence check using 38 positive place invariants in 1 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
[2026-05-22 23:48:13] [INFO ] Invariant cache hit.
[2026-05-22 23:48:13] [INFO ] [Real]Absence check using 38 positive place invariants in 10 ms returned sat
[2026-05-22 23:48:13] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-22 23:48:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:48:13] [INFO ] [Nat]Absence check using 38 positive place invariants in 10 ms returned sat
[2026-05-22 23:48:13] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2026-05-22 23:48:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 23:48:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2026-05-22 23:48:14] [INFO ] Computed and/alt/rep : 200/386/200 causal constraints (skipped 1 transitions) in 11 ms.
[2026-05-22 23:48:15] [INFO ] Added : 168 causal constraints over 34 iterations in 1025 ms. Result :sat
Could not prove EG (NOT p4)
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 5362 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-15 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 7462 ms.
All properties solved by simple procedures.
Total runtime 242413 ms.

BK_STOP 1779493695158

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="AutoFlight-PT-12a"
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 AutoFlight-PT-12a, 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 r002-oct2-177944366400540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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