Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946787900012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 AutonomousCar-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.1K Mar 5 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 5 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 5 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:17 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 31K 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 AutonomousCar-PT-01b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779472845029

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 18:00:47] [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 18:00:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:00:47] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-22 18:00:47] [INFO ] Transformed 119 places.
[2026-05-22 18:00:47] [INFO ] Transformed 132 transitions.
[2026-05-22 18:00:47] [INFO ] Found NUPN structural information;
[2026-05-22 18:00:47] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 105 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 105 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 105 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 103 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 103 transition count 112
Applied a total of 36 rules in 75 ms. Remains 103 /119 variables (removed 16) and now considering 112/132 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10644743781847667824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1656402867135399818.kers'
[2026-05-22 18:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10644743781847667824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1656402867135399818.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 103 cols 275 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-22 18:00:48] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1656402867135399818.kers
Total runtime 3 ms.
[2026-05-22 18:00:48] [INFO ] Implicit Places using invariants in 343 ms returned []
[2026-05-22 18:00:48] [INFO ] Invariant cache hit.
[2026-05-22 18:00:48] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-22 18:00:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/215 variables, 103/128 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 129 constraints, problems are : Problem set: 2 solved, 109 unsolved in 11024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 2/103 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 19/25 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/27 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 112/215 variables, 103/130 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 109/239 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/240 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 3/243 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 1/244 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 244 constraints, problems are : Problem set: 2 solved, 109 unsolved in 22450 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 109/111 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 33556ms problems are : Problem set: 2 solved, 109 unsolved
Search for dead transitions found 2 dead transitions in 33576ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/119 places, 110/132 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 110
Applied a total of 1 rules in 12 ms. Remains 102 /103 variables (removed 1) and now considering 110/110 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5306442724531223666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15564223714711686132.kers'
[2026-05-22 18:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5306442724531223666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15564223714711686132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 102 cols 269 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-22 18:01:22] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15564223714711686132.kers
Total runtime 5 ms.
[2026-05-22 18:01:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 18:01:22] [INFO ] Invariant cache hit.
[2026-05-22 18:01:22] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/119 places, 110/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34561 ms. Remains : 102/119 places, 110/132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-22 18:01:22] [INFO ] Invariant cache hit.
[2026-05-22 18:01:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-22 18:01:22] [INFO ] Invariant cache hit.
[2026-05-22 18:01:22] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-22 18:01:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 124 constraints, problems are : Problem set: 0 solved, 109 unsolved in 10751 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/212 variables, 102/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 109/232 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 240 constraints, problems are : Problem set: 0 solved, 109 unsolved in 27268 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 38060ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 38065ms
Finished structural reductions in LTL mode , in 1 iterations and 38279 ms. Remains : 102/102 places, 110/110 transitions.
Support contains 35 out of 102 places after structural reductions.
[2026-05-22 18:02:01] [INFO ] Flatten gal took : 41 ms
[2026-05-22 18:02:01] [INFO ] Flatten gal took : 18 ms
[2026-05-22 18:02:01] [INFO ] Input system was already deterministic with 110 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (11 resets) in 1919 ms. (20 steps per ms) remains 1/31 properties
BEST_FIRST walk for 17702 steps (5 resets) in 118 ms. (148 steps per ms) remains 0/1 properties
Computed a total of 23 stabilizing places and 23 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((F(p0)&&X(X(G((X(p1)||(X(p3)&&p2))))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Applied a total of 16 rules in 32 ms. Remains 94 /102 variables (removed 8) and now considering 102/110 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16535082918754111654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12500544801078272792.kers'
[2026-05-22 18:02:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16535082918754111654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12500544801078272792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 94 cols 253 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-22 18:02:02] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12500544801078272792.kers
Total runtime 1 ms.
[2026-05-22 18:02:02] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 18:02:02] [INFO ] Invariant cache hit.
[2026-05-22 18:02:02] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 18:02:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 101/217 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 39648ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 39654ms
Starting structural reductions in LTL mode, iteration 1 : 94/102 places, 102/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39961 ms. Remains : 94/102 places, 102/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G((X(p1)||(X(p3)&&p2))))))))'
Stuttering acceptance computed with spot in 729 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-01 finished in 40865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G((p1 U X(p2)))) U (p0&&X(p3))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Applied a total of 16 rules in 15 ms. Remains 94 /102 variables (removed 8) and now considering 102/110 (removed 8) transitions.
[2026-05-22 18:02:43] [INFO ] Invariant cache hit.
[2026-05-22 18:02:43] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 18:02:43] [INFO ] Invariant cache hit.
[2026-05-22 18:02:43] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 94/102 places, 102/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 94/102 places, 102/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G((p1 U X(p2)))) U (p0&&X(p3))))'
Stuttering acceptance computed with spot in 520 ms :[(OR (NOT p0) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), (NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-02 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Graph (trivial) has 93 edges and 102 vertex of which 4 / 102 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 99 transition count 63
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 55 rules applied. Total rules applied 100 place count 55 transition count 52
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 49 transition count 52
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 106 place count 49 transition count 46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 43 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 42 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 42 transition count 45
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 158 place count 23 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 23 transition count 24
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 20 transition count 20
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 20 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 20 transition count 19
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 5 with 2 rules applied. Total rules applied 168 place count 19 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 19 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 172 place count 16 transition count 16
Applied a total of 172 rules in 51 ms. Remains 16 /102 variables (removed 86) and now considering 16/110 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7487880902401025387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5684917031059275606.kers'
[2026-05-22 18:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7487880902401025387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5684917031059275606.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 15 rows 14 cols 50 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-22 18:02:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5684917031059275606.kers
Total runtime 1 ms.
[2026-05-22 18:02:44] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 18:02:44] [INFO ] Invariant cache hit.
[2026-05-22 18:02:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:02:44] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [12, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 137 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/102 places, 16/110 transitions.
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 4 place count 12 transition count 14
Applied a total of 4 rules in 4 ms. Remains 12 /14 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5970621531986718505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5501638461404788492.kers'
[2026-05-22 18:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5970621531986718505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5501638461404788492.kers]
Normalized transition count is 13 out of 14 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 13 rows 11 cols 46 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-22 18:02:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5501638461404788492.kers
Total runtime 1 ms.
[2026-05-22 18:02:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-22 18:02:44] [INFO ] Invariant cache hit.
[2026-05-22 18:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:02:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/102 places, 14/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 12/102 places, 14/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 409 ms.
Product exploration explored 100000 steps with 3 reset in 172 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/12 stabilizing places and 5/14 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 111 steps (21 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 279 ms.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-22 18:02:45] [INFO ] Invariant cache hit.
[2026-05-22 18:02:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-22 18:02:45] [INFO ] Invariant cache hit.
[2026-05-22 18:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:02:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-22 18:02:45] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-22 18:02:45] [INFO ] Invariant cache hit.
[2026-05-22 18:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 13/25 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 16 constraints, problems are : Problem set: 0 solved, 11 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 13/25 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/26 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 27 constraints, problems are : Problem set: 0 solved, 11 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 803ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 806ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 12/12 places, 14/14 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/12 stabilizing places and 5/14 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 42 steps (5 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 210 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 139 ms.
Built C files in :
/tmp/ltsmin16166834643387805143
[2026-05-22 18:02:47] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2026-05-22 18:02:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:02:47] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2026-05-22 18:02:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:02:47] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2026-05-22 18:02:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:02:47] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16166834643387805143
Running compilation step : cd /tmp/ltsmin16166834643387805143;'/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 449 ms.
Running link step : cd /tmp/ltsmin16166834643387805143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin16166834643387805143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9228090755265422662.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-03 finished in 3504 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 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Graph (trivial) has 92 edges and 102 vertex of which 4 / 102 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 99 transition count 66
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 52 rules applied. Total rules applied 94 place count 58 transition count 55
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 52 transition count 55
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 100 place count 52 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 114 place count 45 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 44 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 44 transition count 47
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 152 place count 26 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 26 transition count 27
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 23 transition count 23
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 23 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 23 transition count 22
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 5 with 4 rules applied. Total rules applied 164 place count 21 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 18 transition count 18
Applied a total of 167 rules in 28 ms. Remains 18 /102 variables (removed 84) and now considering 18/110 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5050599533072028073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17492640000035259802.kers'
[2026-05-22 18:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5050599533072028073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17492640000035259802.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 17 cols 59 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 18:02:47] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17492640000035259802.kers
Total runtime 0 ms.
[2026-05-22 18:02:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 18:02:47] [INFO ] Invariant cache hit.
[2026-05-22 18:02:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:02:47] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [14, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 145 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/102 places, 18/110 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 17
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 2 with 2 rules applied. Total rules applied 4 place count 14 transition count 16
Applied a total of 4 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 16/18 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12963714378474823855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8546274624712878097.kers'
[2026-05-22 18:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12963714378474823855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8546274624712878097.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 15 rows 13 cols 48 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-22 18:02:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8546274624712878097.kers
Total runtime 1 ms.
[2026-05-22 18:02:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-22 18:02:48] [INFO ] Invariant cache hit.
[2026-05-22 18:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:02:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/102 places, 16/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 293 ms. Remains : 14/102 places, 16/110 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 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-04
Stuttering criterion allowed to conclude after 24 steps with 5 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-04 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&X(X(p0))) U (X(p2)||G(p3))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 105
Applied a total of 10 rules in 5 ms. Remains 97 /102 variables (removed 5) and now considering 105/110 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4992972613427567088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12700208487388523242.kers'
[2026-05-22 18:02:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4992972613427567088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12700208487388523242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 97 cols 259 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-22 18:02:48] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12700208487388523242.kers
Total runtime 1 ms.
[2026-05-22 18:02:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-22 18:02:48] [INFO ] Invariant cache hit.
[2026-05-22 18:02:48] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2026-05-22 18:02:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/202 variables, 97/122 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 123 constraints, problems are : Problem set: 0 solved, 104 unsolved in 11638 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/202 variables, 97/122 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 104/226 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 231 constraints, problems are : Problem set: 0 solved, 104 unsolved in 24548 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 36206ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 36207ms
Starting structural reductions in LTL mode, iteration 1 : 97/102 places, 105/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36445 ms. Remains : 97/102 places, 105/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&X(X(p0))) U (X(p2)||G(p3))))'
Stuttering acceptance computed with spot in 668 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), true, (NOT p1), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-05 finished in 37191 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((G((p0||F(p1))) U X(X((p2&&X(p0)))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 96 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Applied a total of 14 rules in 9 ms. Remains 95 /102 variables (removed 7) and now considering 103/110 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2659425747299472418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8568384833135824621.kers'
[2026-05-22 18:03:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2659425747299472418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8568384833135824621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 95 cols 255 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-22 18:03:25] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8568384833135824621.kers
Total runtime 1 ms.
[2026-05-22 18:03:25] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-22 18:03:25] [INFO ] Invariant cache hit.
[2026-05-22 18:03:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-22 18:03:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 103/198 variables, 95/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 124 constraints, problems are : Problem set: 0 solved, 102 unsolved in 12954 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 231 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 42979ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 42980ms
Starting structural reductions in LTL mode, iteration 1 : 95/102 places, 103/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43194 ms. Remains : 95/102 places, 103/110 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((G((p0||F(p1))) U X(X((X(p0)&&p2))))))'
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (OR (NOT p2) (NOT p0)), (AND p0 (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-06
Stuttering criterion allowed to conclude after 46 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-06 finished in 43778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Applied a total of 16 rules in 8 ms. Remains 94 /102 variables (removed 8) and now considering 102/110 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3353539631571748501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11215422864054255615.kers'
[2026-05-22 18:04:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3353539631571748501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11215422864054255615.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 94 cols 253 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-22 18:04:09] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11215422864054255615.kers
Total runtime 2 ms.
[2026-05-22 18:04:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-22 18:04:09] [INFO ] Invariant cache hit.
[2026-05-22 18:04:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 18:04:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9674 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 101/217 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 39702ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 39702ms
Starting structural reductions in LTL mode, iteration 1 : 94/102 places, 102/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39947 ms. Remains : 94/102 places, 102/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-07
Product exploration explored 100000 steps with 4 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 302 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/94 stabilizing places and 23/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 105 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 464 ms.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2026-05-22 18:04:50] [INFO ] Invariant cache hit.
[2026-05-22 18:04:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 18:04:50] [INFO ] Invariant cache hit.
[2026-05-22 18:04:50] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/94 stabilizing places and 23/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 119 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 438 ms.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Spot run failed in 155 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/ltsmin11509332873121254947
[2026-05-22 18:04:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11509332873121254947
Running compilation step : cd /tmp/ltsmin11509332873121254947;'/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 403 ms.
Running link step : cd /tmp/ltsmin11509332873121254947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11509332873121254947;'/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/stateBased10653931049324639854.hoa' '--buchi-type=spotba'
LTSmin run took 1610 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-07 finished in 44830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Applied a total of 16 rules in 3 ms. Remains 94 /102 variables (removed 8) and now considering 102/110 (removed 8) transitions.
[2026-05-22 18:04:54] [INFO ] Invariant cache hit.
[2026-05-22 18:04:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 18:04:54] [INFO ] Invariant cache hit.
[2026-05-22 18:04:54] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 94/102 places, 102/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 94/102 places, 102/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 111 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-10 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(p1)&&(F(p2)||X((p3||F(p4)))))))'
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 98 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 106
Applied a total of 8 rules in 3 ms. Remains 98 /102 variables (removed 4) and now considering 106/110 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17709543800788323942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17888022865068774306.kers'
[2026-05-22 18:04:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17709543800788323942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17888022865068774306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 106 rows 98 cols 261 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-22 18:04:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17888022865068774306.kers
Total runtime 1 ms.
[2026-05-22 18:04:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 18:04:54] [INFO ] Invariant cache hit.
[2026-05-22 18:04:54] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2026-05-22 18:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/204 variables, 98/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 123 constraints, problems are : Problem set: 0 solved, 105 unsolved in 11706 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 105/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 234 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15179 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 26909ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 26911ms
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27130 ms. Remains : 98/102 places, 106/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(p1)&&(F(p2)||X((p3||F(p4)))))))'
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-12 finished in 27724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0))||(G(p2)&&p1)))))'
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Applied a total of 16 rules in 5 ms. Remains 94 /102 variables (removed 8) and now considering 102/110 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2416217424424228125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3963228211015707366.kers'
[2026-05-22 18:05:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2416217424424228125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3963228211015707366.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 94 cols 253 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-22 18:05:22] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3963228211015707366.kers
Total runtime 2 ms.
[2026-05-22 18:05:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 18:05:22] [INFO ] Invariant cache hit.
[2026-05-22 18:05:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 18:05:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9081 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 101/217 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 39105ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 39107ms
Starting structural reductions in LTL mode, iteration 1 : 94/102 places, 102/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39338 ms. Remains : 94/102 places, 102/110 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(p0))||(G(p2)&&p1)))))'
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 118 ms.
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (30 resets) in 223 ms. (178 steps per ms) remains 1/4 properties
BEST_FIRST walk for 14790 steps (9 resets) in 70 ms. (208 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 693 ms.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2026-05-22 18:06:03] [INFO ] Invariant cache hit.
[2026-05-22 18:06:03] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-22 18:06:03] [INFO ] Invariant cache hit.
[2026-05-22 18:06:03] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (10 resets) in 105 ms. (377 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 97 ms. (408 steps per ms) remains 1/2 properties
BEST_FIRST walk for 18106 steps (7 resets) in 41 ms. (431 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 673 ms.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 20000 reset in 104 ms.
Product exploration explored 100000 steps with 20000 reset in 122 ms.
Spot run failed in 86 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/ltsmin3089117453127861956
[2026-05-22 18:06:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3089117453127861956
Running compilation step : cd /tmp/ltsmin3089117453127861956;'/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 421 ms.
Running link step : cd /tmp/ltsmin3089117453127861956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3089117453127861956;'/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/stateBased98488902588153377.hoa' '--buchi-type=spotba'
LTSmin run took 33 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-13 finished in 43524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(p1))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Applied a total of 16 rules in 4 ms. Remains 94 /102 variables (removed 8) and now considering 102/110 (removed 8) transitions.
[2026-05-22 18:06:05] [INFO ] Invariant cache hit.
[2026-05-22 18:06:05] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 18:06:05] [INFO ] Invariant cache hit.
[2026-05-22 18:06:05] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 94/102 places, 102/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 94/102 places, 102/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(p1))))))'
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-14
Stuttering criterion allowed to conclude after 47 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-14 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Graph (trivial) has 91 edges and 102 vertex of which 4 / 102 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 99 transition count 64
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 94 place count 56 transition count 57
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 52 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 98 place count 52 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 46 transition count 51
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 45 transition count 50
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 45 transition count 50
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 150 place count 26 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 26 transition count 29
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 23 transition count 25
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 23 transition count 25
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 4 with 4 rules applied. Total rules applied 161 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 21 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 18 transition count 20
Applied a total of 166 rules in 28 ms. Remains 18 /102 variables (removed 84) and now considering 20/110 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3739202805593822358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8342043583264447992.kers'
[2026-05-22 18:06:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3739202805593822358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8342043583264447992.kers]
Normalized transition count is 19 out of 20 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 19 rows 16 cols 60 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 18:06:06] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8342043583264447992.kers
Total runtime 0 ms.
[2026-05-22 18:06:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-22 18:06:06] [INFO ] Invariant cache hit.
[2026-05-22 18:06:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:06:06] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [14, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 107 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/102 places, 20/110 transitions.
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 4 place count 14 transition count 18
Applied a total of 4 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16344302391228032009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1682054896858956725.kers'
[2026-05-22 18:06:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16344302391228032009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1682054896858956725.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 13 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-22 18:06:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1682054896858956725.kers
Total runtime 0 ms.
[2026-05-22 18:06:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-22 18:06:06] [INFO ] Invariant cache hit.
[2026-05-22 18:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:06:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/102 places, 18/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 14/102 places, 18/110 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-15 finished in 379 ms.
All properties solved by simple procedures.
Total runtime 319121 ms.

BK_STOP 1779473166638

--------------------
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="AutonomousCar-PT-01b"
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 AutonomousCar-PT-01b, 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 r018-smll-177946787900012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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