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

About the Execution of ITS-Tools for AutoFlight-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
789.228 556709.00 716346.00 1324.40 FFFFFFFFFFFFTFFF 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-177944366400500.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-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Mar 5 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 5 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 5 16:41 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.7K Mar 15 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 5 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 5 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:13 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 91K 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-04b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779491524274

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:12:05] [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:12:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:12:06] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2026-05-22 23:12:06] [INFO ] Transformed 390 places.
[2026-05-22 23:12:06] [INFO ] Transformed 388 transitions.
[2026-05-22 23:12:06] [INFO ] Found NUPN structural information;
[2026-05-22 23:12:06] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-04b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 342 transition count 340
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 342 transition count 340
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 342 transition count 334
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 121 place count 323 transition count 315
Iterating global reduction 1 with 19 rules applied. Total rules applied 140 place count 323 transition count 315
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 320 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 320 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 317 transition count 309
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 317 transition count 309
Applied a total of 152 rules in 97 ms. Remains 317 /390 variables (removed 73) and now considering 309/388 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17565080189205283482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4793812649080870623.kers'
[2026-05-22 23:12:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17565080189205283482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4793812649080870623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 317 cols 748 entries
Finished phase 1 with 283 SingleSign rule and 6 generalized
[2026-05-22 23:12:06] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4793812649080870623.kers
Total runtime 4 ms.
[2026-05-22 23:12:06] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-22 23:12:06] [INFO ] Invariant cache hit.
[2026-05-22 23:12:06] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-22 23:12:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/626 variables, and 100 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 16/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 309/626 variables, 317/440 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 308/748 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/626 variables, and 748 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 317/390 places, 309/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60887 ms. Remains : 317/390 places, 309/388 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Applied a total of 0 rules in 13 ms. Remains 317 /317 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2026-05-22 23:13:07] [INFO ] Invariant cache hit.
[2026-05-22 23:13:07] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-22 23:13:07] [INFO ] Invariant cache hit.
[2026-05-22 23:13:07] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 317/317 places, 309/309 transitions.
Support contains 40 out of 317 places after structural reductions.
[2026-05-22 23:13:07] [INFO ] Flatten gal took : 42 ms
[2026-05-22 23:13:07] [INFO ] Flatten gal took : 19 ms
[2026-05-22 23:13:07] [INFO ] Input system was already deterministic with 309 transitions.
RANDOM walk for 40000 steps (195 resets) in 1613 ms. (24 steps per ms) remains 3/40 properties
BEST_FIRST walk for 40004 steps (17 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
[2026-05-22 23:13:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 132/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 180/315 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 309/626 variables, 317/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/626 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 626/626 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 132/135 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 180/315 variables, 23/29 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 2/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 309/626 variables, 317/349 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 2/351 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/626 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 626/626 variables, and 351 constraints, problems are : Problem set: 1 solved, 2 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 872ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=72 )
Parikh walk visited 2 properties in 5 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 83 stabilizing places and 83 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)&&(p0||(F(p2) U X(p1)))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 301
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 309 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 306 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 305 transition count 295
Applied a total of 26 rules in 38 ms. Remains 305 /317 variables (removed 12) and now considering 295/309 (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-11957094376303861507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2679728717317947032.kers'
[2026-05-22 23:13:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11957094376303861507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2679728717317947032.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 305 cols 720 entries
Finished phase 1 with 271 SingleSign rule and 6 generalized
[2026-05-22 23:13:09] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2679728717317947032.kers
Total runtime 10 ms.
[2026-05-22 23:13:10] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-22 23:13:10] [INFO ] Invariant cache hit.
[2026-05-22 23:13:10] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-22 23:13:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 90 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 62/90 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 295/600 variables, 305/398 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 294/692 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 8/700 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 703 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 305/317 places, 295/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60594 ms. Remains : 305/317 places, 295/309 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(((p0 U p1)&&((F(p2) U X(p1))||p0)))))'
Stuttering acceptance computed with spot in 525 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-00 finished in 61257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(X(X(G(p1)))))))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 300
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 308 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 305 transition count 295
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 304 transition count 294
Applied a total of 28 rules in 33 ms. Remains 304 /317 variables (removed 13) and now considering 294/309 (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-6939815784263795549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5520288164975657379.kers'
[2026-05-22 23:14:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6939815784263795549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5520288164975657379.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 304 cols 718 entries
Finished phase 1 with 270 SingleSign rule and 6 generalized
[2026-05-22 23:14:11] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5520288164975657379.kers
Total runtime 4 ms.
[2026-05-22 23:14:11] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 23:14:11] [INFO ] Invariant cache hit.
[2026-05-22 23:14:11] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2026-05-22 23:14:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 95 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/598 variables, 304/406 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 293/699 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 11/710 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 710 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 294/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60426 ms. Remains : 304/317 places, 294/309 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(X(X(G(p0))))))||p1)))'
Stuttering acceptance computed with spot in 409 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 60889 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)||G(p1)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 300
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 308 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 305 transition count 295
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 304 transition count 294
Applied a total of 28 rules in 37 ms. Remains 304 /317 variables (removed 13) and now considering 294/309 (removed 15) transitions.
[2026-05-22 23:15:12] [INFO ] Invariant cache hit.
[2026-05-22 23:15:12] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-22 23:15:12] [INFO ] Invariant cache hit.
[2026-05-22 23:15:12] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 294/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 304/317 places, 294/309 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)||G(p1)))'
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-02 finished in 674 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 (F(p1)&&G(p2))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 301
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 309 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 307 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 307 transition count 297
Applied a total of 22 rules in 28 ms. Remains 307 /317 variables (removed 10) and now considering 297/309 (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-7956361943137075148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1985834875507796071.kers'
[2026-05-22 23:15:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7956361943137075148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1985834875507796071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 307 cols 724 entries
Finished phase 1 with 273 SingleSign rule and 6 generalized
[2026-05-22 23:15:12] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1985834875507796071.kers
Total runtime 3 ms.
[2026-05-22 23:15:12] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-22 23:15:12] [INFO ] Invariant cache hit.
[2026-05-22 23:15:13] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2026-05-22 23:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 296 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 297/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30617 ms. Remains : 307/317 places, 297/309 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 (F(p1)&&G(p2))))'
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-03 finished in 31015 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) U (p1 U X(X(X(p2))))) U G(p3)))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 301
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 309 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 306 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 306 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 305 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 305 transition count 296
Applied a total of 25 rules in 46 ms. Remains 305 /317 variables (removed 12) and now considering 296/309 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8725111943954051316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11928161647800920806.kers'
[2026-05-22 23:15:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8725111943954051316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11928161647800920806.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 305 cols 722 entries
Finished phase 1 with 271 SingleSign rule and 6 generalized
[2026-05-22 23:15:43] [INFO ] Computed 28 invariants in 3 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11928161647800920806.kers
Total runtime 4 ms.
[2026-05-22 23:15:44] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-22 23:15:44] [INFO ] Invariant cache hit.
[2026-05-22 23:15:44] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2026-05-22 23:15:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/601 variables, and 98 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/601 variables, 305/407 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 295/702 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 13/715 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 718 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 305/317 places, 296/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 305/317 places, 296/309 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1 U X(X(X(p2))))) U G(p3)))'
Stuttering acceptance computed with spot in 1395 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-04
Product exploration explored 100000 steps with 19992 reset in 291 ms.
Product exploration explored 100000 steps with 19977 reset in 155 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge based reduction with 41 factoid took 2196 ms. Reduced automaton from 38 states, 108 edges and 4 AP (stutter sensitive) to 38 states, 108 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (193 resets) in 847 ms. (47 steps per ms) remains 6/38 properties
BEST_FIRST walk for 40003 steps (19 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (18 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (20 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (19 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
[2026-05-22 23:16:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 214/303 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 296/601 variables, 305/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/601 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 336 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 214/303 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/305 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 296/601 variables, 305/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/601 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 342 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2527ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 338 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=67 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 282 ms.
Knowledge based reduction with 41 factoid took 2907 ms. Reduced automaton from 38 states, 108 edges and 4 AP (stutter sensitive) to 38 states, 108 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1793 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
[2026-05-22 23:16:56] [INFO ] Invariant cache hit.
[2026-05-22 23:16:56] [INFO ] [Real]Absence check using 27 positive place invariants in 24 ms returned sat
[2026-05-22 23:16:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2026-05-22 23:16:57] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2026-05-22 23:16:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:16:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2026-05-22 23:16:57] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:16:57] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2026-05-22 23:16:57] [INFO ] Computed and/alt/rep : 295/422/295 causal constraints (skipped 0 transitions) in 20 ms.
[2026-05-22 23:16:59] [INFO ] Added : 265 causal constraints over 53 iterations in 1958 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 13015 ms.
Stuttering acceptance computed with spot in 1750 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 305 /305 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2026-05-22 23:17:01] [INFO ] Invariant cache hit.
[2026-05-22 23:17:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-22 23:17:01] [INFO ] Invariant cache hit.
[2026-05-22 23:17:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 305/305 places, 296/296 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge based reduction with 41 factoid took 2181 ms. Reduced automaton from 38 states, 108 edges and 4 AP (stutter sensitive) to 38 states, 108 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (196 resets) in 361 ms. (110 steps per ms) remains 10/38 properties
BEST_FIRST walk for 40004 steps (19 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (19 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 34 ms. (1142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 36 ms. (1081 steps per ms) remains 1/10 properties
[2026-05-22 23:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/303 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/601 variables, 305/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/601 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/303 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/305 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 296/601 variables, 305/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/601 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 155 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=155 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 41 factoid took 2709 ms. Reduced automaton from 38 states, 108 edges and 4 AP (stutter sensitive) to 38 states, 108 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1415 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
[2026-05-22 23:17:08] [INFO ] Invariant cache hit.
[2026-05-22 23:17:08] [INFO ] [Real]Absence check using 27 positive place invariants in 29 ms returned sat
[2026-05-22 23:17:08] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-22 23:17:09] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2026-05-22 23:17:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:17:09] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2026-05-22 23:17:09] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-22 23:17:09] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2026-05-22 23:17:09] [INFO ] Computed and/alt/rep : 295/422/295 causal constraints (skipped 0 transitions) in 25 ms.
[2026-05-22 23:17:11] [INFO ] Added : 265 causal constraints over 53 iterations in 1854 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 9993 ms.
Stuttering acceptance computed with spot in 1279 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1283 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 20013 reset in 163 ms.
Product exploration explored 100000 steps with 19953 reset in 144 ms.
Spot run failed in 90 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/ltsmin2582262001760209349
[2026-05-22 23:17:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2582262001760209349
Running compilation step : cd /tmp/ltsmin2582262001760209349;'/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 637 ms.
Running link step : cd /tmp/ltsmin2582262001760209349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin2582262001760209349;'/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/stateBased2555223560808921466.hoa' '--buchi-type=spotba'
LTSmin run took 328 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-04b-LTLFireability-04 finished in 91907 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 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 316 transition count 203
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 119 rules applied. Total rules applied 224 place count 211 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 232 place count 203 transition count 189
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 232 place count 203 transition count 149
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 312 place count 163 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 317 place count 158 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 322 place count 158 transition count 144
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 322 place count 158 transition count 140
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 330 place count 154 transition count 140
Performed 60 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 450 place count 94 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 451 place count 93 transition count 71
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 458 place count 87 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 459 place count 86 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 459 place count 86 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 467 place count 82 transition count 66
Applied a total of 467 rules in 77 ms. Remains 82 /317 variables (removed 235) and now considering 66/309 (removed 243) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17662414470941837325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3618963506782091857.kers'
[2026-05-22 23:17:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17662414470941837325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3618963506782091857.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 66 rows 71 cols 162 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-22 23:17:15] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3618963506782091857.kers
Total runtime 0 ms.
[2026-05-22 23:17:15] [INFO ] Implicit Places using invariants in 94 ms returned [32, 46, 60, 65, 70, 76, 81]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 117 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/317 places, 66/309 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 69 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 69 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 68 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 68 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 67 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 67 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 66 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 66 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 65 transition count 56
Applied a total of 20 rules in 6 ms. Remains 65 /75 variables (removed 10) and now considering 56/66 (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-7017677348229937007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12905220597110006024.kers'
[2026-05-22 23:17:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7017677348229937007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12905220597110006024.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 56 rows 55 cols 130 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-22 23:17:15] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12905220597110006024.kers
Total runtime 0 ms.
[2026-05-22 23:17:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-22 23:17:15] [INFO ] Invariant cache hit.
[2026-05-22 23:17:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:17:15] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/317 places, 56/309 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 65/317 places, 56/309 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 29 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-05 finished in 429 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||(p1 U p2)||F(p3))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 301
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 309 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 307 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 306 transition count 296
Applied a total of 24 rules in 22 ms. Remains 306 /317 variables (removed 11) and now considering 296/309 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9563560753916609451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4519350074106594171.kers'
[2026-05-22 23:17:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9563560753916609451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4519350074106594171.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 306 cols 722 entries
Finished phase 1 with 272 SingleSign rule and 6 generalized
[2026-05-22 23:17:16] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4519350074106594171.kers
Total runtime 1 ms.
[2026-05-22 23:17:16] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-22 23:17:16] [INFO ] Invariant cache hit.
[2026-05-22 23:17:16] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2026-05-22 23:17:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 94 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 11 (OVERLAPS) 296/602 variables, 306/417 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 295/712 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 712 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 306/317 places, 296/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 306/317 places, 296/309 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||(p1 U p2)||F(p3))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-06
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-06 finished in 60717 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 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 316 transition count 208
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 114 rules applied. Total rules applied 214 place count 216 transition count 194
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 224 place count 208 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 226 place count 206 transition count 192
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 226 place count 206 transition count 149
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 312 place count 163 transition count 149
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 317 place count 158 transition count 144
Iterating global reduction 4 with 5 rules applied. Total rules applied 322 place count 158 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 322 place count 158 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 328 place count 155 transition count 141
Performed 59 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 446 place count 96 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 95 transition count 73
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 455 place count 89 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 457 place count 87 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 457 place count 87 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 465 place count 83 transition count 67
Applied a total of 465 rules in 22 ms. Remains 83 /317 variables (removed 234) and now considering 67/309 (removed 242) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10084061856031404912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9742795043592762032.kers'
[2026-05-22 23:18:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10084061856031404912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9742795043592762032.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 67 rows 72 cols 168 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-22 23:18:16] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9742795043592762032.kers
Total runtime 0 ms.
[2026-05-22 23:18:16] [INFO ] Implicit Places using invariants in 59 ms returned [33, 47, 61, 66, 77, 82]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/317 places, 67/309 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 73 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 73 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 72 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 69 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 67 transition count 57
Applied a total of 20 rules in 6 ms. Remains 67 /77 variables (removed 10) and now considering 57/67 (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-3954059668261896469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15907745920907614993.kers'
[2026-05-22 23:18:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3954059668261896469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15907745920907614993.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 57 rows 57 cols 136 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-22 23:18:16] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15907745920907614993.kers
Total runtime 0 ms.
[2026-05-22 23:18:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-22 23:18:16] [INFO ] Invariant cache hit.
[2026-05-22 23:18:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:18:16] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/317 places, 57/309 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 67/317 places, 57/309 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 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-07 finished in 385 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||(p1&&G(F(p2)))))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 316 transition count 206
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 112 rules applied. Total rules applied 214 place count 214 transition count 196
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 221 place count 208 transition count 195
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 224 place count 207 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 206 transition count 193
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 225 place count 206 transition count 152
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 307 place count 165 transition count 152
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 312 place count 160 transition count 147
Iterating global reduction 5 with 5 rules applied. Total rules applied 317 place count 160 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 317 place count 160 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 325 place count 156 transition count 143
Performed 60 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 445 place count 96 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 446 place count 95 transition count 74
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 452 place count 90 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 453 place count 89 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 453 place count 89 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 461 place count 85 transition count 69
Applied a total of 461 rules in 44 ms. Remains 85 /317 variables (removed 232) and now considering 69/309 (removed 240) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6162059600403400170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6322985403868190146.kers'
[2026-05-22 23:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6162059600403400170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6322985403868190146.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 69 rows 75 cols 172 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-22 23:18:17] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6322985403868190146.kers
Total runtime 1 ms.
[2026-05-22 23:18:17] [INFO ] Implicit Places using invariants in 140 ms returned [36, 50, 64, 69, 74, 79, 84]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 167 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/317 places, 69/309 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 73 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 73 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 72 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 72 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 71 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 71 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 70 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 70 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 69 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 69 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 59
Applied a total of 20 rules in 6 ms. Remains 68 /78 variables (removed 10) and now considering 59/69 (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-5849713292426969876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11401323392183597529.kers'
[2026-05-22 23:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5849713292426969876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11401323392183597529.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 59 rows 59 cols 140 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 23:18:17] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11401323392183597529.kers
Total runtime 0 ms.
[2026-05-22 23:18:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-22 23:18:17] [INFO ] Invariant cache hit.
[2026-05-22 23:18:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:18:17] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/317 places, 59/309 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 68/317 places, 59/309 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(F(p2)))))))'
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-09
Product exploration explored 100000 steps with 5197 reset in 225 ms.
Stack based approach found an accepted trace after 21443 steps with 1124 reset with depth 8 and stack size 8 in 42 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-09 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U p1))) U (G(X(p2)) U p3))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 302
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 310 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 308 transition count 299
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 308 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 307 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 307 transition count 298
Applied a total of 21 rules in 16 ms. Remains 307 /317 variables (removed 10) and now considering 298/309 (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-7990552729186743668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8928336739007614141.kers'
[2026-05-22 23:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7990552729186743668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8928336739007614141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 307 cols 726 entries
Finished phase 1 with 273 SingleSign rule and 6 generalized
[2026-05-22 23:18:17] [INFO ] Computed 28 invariants in 3 ms
Computed 28 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8928336739007614141.kers
Total runtime 4 ms.
[2026-05-22 23:18:18] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-22 23:18:18] [INFO ] Invariant cache hit.
[2026-05-22 23:18:18] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2026-05-22 23:18:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/605 variables, and 96 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 298/605 variables, 307/410 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 297/707 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 9/716 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/605 variables, and 716 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 298/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 307/317 places, 298/309 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U p1))) U (G(X(p2)) U p3))))'
Stuttering acceptance computed with spot in 329 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-11
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-11 finished in 60971 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||G(p1)))||X((p2&&F(p3)))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 302
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 310 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 307 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 306 transition count 296
Applied a total of 24 rules in 28 ms. Remains 306 /317 variables (removed 11) and now considering 296/309 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12056947163552148708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8115121350658276416.kers'
[2026-05-22 23:19:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12056947163552148708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8115121350658276416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 306 cols 722 entries
Finished phase 1 with 272 SingleSign rule and 6 generalized
[2026-05-22 23:19:18] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8115121350658276416.kers
Total runtime 4 ms.
[2026-05-22 23:19:19] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-22 23:19:19] [INFO ] Invariant cache hit.
[2026-05-22 23:19:19] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2026-05-22 23:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 10/103 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 106 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 78/106 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 296/602 variables, 306/421 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 295/716 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 13/729 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 729 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 306/317 places, 296/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60513 ms. Remains : 306/317 places, 296/309 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||G(p1)))||X((p2&&F(p3)))))'
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 76 stabilizing places and 76 stable transitions
Computed a total of 76 stabilizing places and 76 stable transitions
Detected a total of 76/306 stabilizing places and 76/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 19 ms. Proved property starting from automaton with 4 states, 7 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04b-LTLFireability-12 finished in 61088 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)||(X(X(p1))&&(G(!p2) U p3)))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 309/309 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 301
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 309 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 306 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 305 transition count 295
Applied a total of 26 rules in 20 ms. Remains 305 /317 variables (removed 12) and now considering 295/309 (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-14181168441629394030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7260853284425729488.kers'
[2026-05-22 23:20:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14181168441629394030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7260853284425729488.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 305 cols 720 entries
Finished phase 1 with 271 SingleSign rule and 6 generalized
[2026-05-22 23:20:20] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7260853284425729488.kers
Total runtime 2 ms.
[2026-05-22 23:20:20] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-22 23:20:20] [INFO ] Invariant cache hit.
[2026-05-22 23:20:20] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-22 23:20:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 95 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/600 variables, 305/406 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 294/700 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 20/720 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 720 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 305/317 places, 295/309 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60525 ms. Remains : 305/317 places, 295/309 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(p1))&&(G(!p2) U p3)))))'
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-15
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-15 finished in 60928 ms.
All properties solved by simple procedures.
Total runtime 555088 ms.

BK_STOP 1779492080983

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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