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-177946787900060.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-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 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 110K 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-04b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779478017220

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 19:26:59] [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 19:26:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:26:59] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2026-05-22 19:26:59] [INFO ] Transformed 221 places.
[2026-05-22 19:26:59] [INFO ] Transformed 368 transitions.
[2026-05-22 19:26:59] [INFO ] Found NUPN structural information;
[2026-05-22 19:26:59] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-04b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 191 transition count 338
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 191 transition count 338
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 124 place count 191 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 186 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 186 transition count 269
Applied a total of 134 rules in 119 ms. Remains 186 /221 variables (removed 35) and now considering 269/368 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1922754178220058388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12523738336487436209.kers'
[2026-05-22 19:27:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1922754178220058388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12523738336487436209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 186 cols 1076 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-22 19:27:00] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12523738336487436209.kers
Total runtime 5 ms.
[2026-05-22 19:27:00] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-22 19:27:00] [INFO ] Invariant cache hit.
[2026-05-22 19:27:00] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-22 19:27:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 7 (OVERLAPS) 269/455 variables, 186/241 constraints. Problems are: Problem set: 2 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 241 constraints, problems are : Problem set: 2 solved, 266 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 2/186 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 46/55 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 269/455 variables, 186/241 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 266/507 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 2/509 constraints. Problems are: Problem set: 2 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 515 constraints, problems are : Problem set: 2 solved, 266 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 266/268 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60471ms problems are : Problem set: 2 solved, 266 unsolved
Search for dead transitions found 2 dead transitions in 60502ms
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 : 186/221 places, 267/368 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 267
Applied a total of 1 rules in 11 ms. Remains 185 /186 variables (removed 1) and now considering 267/267 (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-13285871022099257996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16058551997157789457.kers'
[2026-05-22 19:28:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13285871022099257996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16058551997157789457.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 185 cols 1070 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-22 19:28:01] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16058551997157789457.kers
Total runtime 2 ms.
[2026-05-22 19:28:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-22 19:28:01] [INFO ] Invariant cache hit.
[2026-05-22 19:28:01] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/221 places, 267/368 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61819 ms. Remains : 185/221 places, 267/368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 185 /185 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-22 19:28:01] [INFO ] Invariant cache hit.
[2026-05-22 19:28:01] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-22 19:28:01] [INFO ] Invariant cache hit.
[2026-05-22 19:28:01] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-22 19:28:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 267/452 variables, 185/236 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 236 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 267/452 variables, 185/238 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 266/504 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 510 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 185/185 places, 267/267 transitions.
Support contains 38 out of 185 places after structural reductions.
[2026-05-22 19:29:02] [INFO ] Flatten gal took : 148 ms
[2026-05-22 19:29:02] [INFO ] Flatten gal took : 59 ms
[2026-05-22 19:29:02] [INFO ] Input system was already deterministic with 267 transitions.
RANDOM walk for 40000 steps (63 resets) in 2280 ms. (17 steps per ms) remains 6/29 properties
BEST_FIRST walk for 40003 steps (84 resets) in 323 ms. (123 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (101 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2026-05-22 19:29:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 74/452 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 4/9 constraints, State Equation: 0/185 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 33 stabilizing places and 33 stable transitions
FORMULA AutonomousCar-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X(G(!p2)))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 260
Applied a total of 14 rules in 23 ms. Remains 178 /185 variables (removed 7) and now considering 260/267 (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-3439934864121616345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14631601871865353896.kers'
[2026-05-22 19:29:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3439934864121616345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14631601871865353896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:29:04] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14631601871865353896.kers
Total runtime 3 ms.
[2026-05-22 19:29:04] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-22 19:29:04] [INFO ] Invariant cache hit.
[2026-05-22 19:29:04] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 19:29:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 226 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/225 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/484 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 489 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 260/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 178/185 places, 260/267 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) U X(X(G(!p2)))))'
Stuttering acceptance computed with spot in 611 ms :[p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 24984 reset in 700 ms.
Product exploration explored 100000 steps with 24940 reset in 424 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 17 factoid took 163 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (131 resets) in 409 ms. (97 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (65 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
[2026-05-22 19:30:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/178 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/438 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/438 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1539ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 126 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 10 ms.
Knowledge based reduction with 17 factoid took 260 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), p2, (NOT p1)]
Knowledge-based reduction took 2532 ms.
Stuttering acceptance computed with spot in 318 ms :[p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 6 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-22 19:30:09] [INFO ] Invariant cache hit.
[2026-05-22 19:30:09] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-22 19:30:09] [INFO ] Invariant cache hit.
[2026-05-22 19:30:10] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 178/178 places, 260/260 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 17 factoid took 111 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (34 resets) in 505 ms. (79 steps per ms) remains 1/9 properties
BEST_FIRST walk for 3501 steps (7 resets) in 13 ms. (250 steps per ms) remains 0/1 properties
Knowledge based reduction with 17 factoid took 256 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), p2, (NOT p1)]
Knowledge-based reduction took 946 ms.
Stuttering acceptance computed with spot in 344 ms :[p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 340 ms :[p2, (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), p2, (NOT p1)]
Product exploration explored 100000 steps with 25020 reset in 209 ms.
Product exploration explored 100000 steps with 25051 reset in 445 ms.
Spot run failed in 176 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/ltsmin11791254925447332932
[2026-05-22 19:30:12] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11791254925447332932
Running compilation step : cd /tmp/ltsmin11791254925447332932;'/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 1322 ms.
Running link step : cd /tmp/ltsmin11791254925447332932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin11791254925447332932;'/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/stateBased501161719506359610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-22 19:30:27] [INFO ] Invariant cache hit.
[2026-05-22 19:30:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 19:30:27] [INFO ] Invariant cache hit.
[2026-05-22 19:30:28] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 178/178 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin17259101724641845524
[2026-05-22 19:30:28] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17259101724641845524
Running compilation step : cd /tmp/ltsmin17259101724641845524;'/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 829 ms.
Running link step : cd /tmp/ltsmin17259101724641845524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17259101724641845524;'/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/stateBased12273110136701342807.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 19:30:43] [INFO ] Flatten gal took : 36 ms
[2026-05-22 19:30:43] [INFO ] Flatten gal took : 35 ms
[2026-05-22 19:30:43] [INFO ] Time to serialize gal into /tmp/LTL12859073716314925538.gal : 9 ms
[2026-05-22 19:30:43] [INFO ] Time to serialize properties into /tmp/LTL7298165865064640617.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12859073716314925538.gal' '-t' 'CGAL' '-hoa' '/tmp/aut782474140663920533.hoa' '-atoms' '/tmp/LTL7298165865064640617.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7298165865064640617.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut782474140663920533.hoa
Detected timeout of ITS tools.
[2026-05-22 19:30:58] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:30:58] [INFO ] Flatten gal took : 19 ms
[2026-05-22 19:30:58] [INFO ] Time to serialize gal into /tmp/LTL3501227485930891566.gal : 19 ms
[2026-05-22 19:30:58] [INFO ] Time to serialize properties into /tmp/LTL7259371072720261477.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3501227485930891566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7259371072720261477.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(p37!=1)")U("(p139==1)"))U(X(X(G(!("(((p6==1)&&(p9==1))&&((p107==1)&&(p178==1)))")))))))
Formula 0 simplified : (!"(p37!=1)" R !"(p139==1)") R XXF"(((p6==1)&&(p9==1))&&((p107==1)&&(p178==1)))"
Detected timeout of ITS tools.
[2026-05-22 19:31:13] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:31:13] [INFO ] Applying decomposition
[2026-05-22 19:31:13] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10552960676269632599.txt' '-o' '/tmp/graph10552960676269632599.bin' '-w' '/tmp/graph10552960676269632599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10552960676269632599.bin' '-l' '-1' '-v' '-w' '/tmp/graph10552960676269632599.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:31:13] [INFO ] Decomposing Gal with order
[2026-05-22 19:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:31:13] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-22 19:31:14] [INFO ] Flatten gal took : 197 ms
[2026-05-22 19:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 20 ms.
[2026-05-22 19:31:14] [INFO ] Time to serialize gal into /tmp/LTL16972324068632853855.gal : 10 ms
[2026-05-22 19:31:14] [INFO ] Time to serialize properties into /tmp/LTL11347349887496661938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16972324068632853855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11347349887496661938.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((("(i2.i0.u12.p37!=1)")U("(i8.i1.u37.p139==1)"))U(X(X(G(!("(((i11.u2.p6==1)&&(i11.u2.p9==1))&&((i6.i1.u33.p107==1)&&(i11.u2.p178==1...166
Formula 0 simplified : (!"(i2.i0.u12.p37!=1)" R !"(i8.i1.u37.p139==1)") R XXF"(((i11.u2.p6==1)&&(i11.u2.p9==1))&&((i6.i1.u33.p107==1)&&(i11.u2.p178==1)))"
Reverse transition relation is NOT exact ! Due to transitions t173, t179, t195, t207, t231, t264, i0.u46.t34, i0.u46.t39, i0.u46.t40, i0.u46.t41, i2.i1.t16...603
Computing Next relation with stutter on 3616 deadlock states
178 unique states visited
178 strongly connected components in search stack
179 transitions explored
178 items max in DFS search stack
455 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.60597,115296,1,0,214653,2493,2619,304597,390,21978,317955
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-04b-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-04b-LTLFireability-01 finished in 135105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 169 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 6 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 182 transition count 190
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 99 rules applied. Total rules applied 174 place count 108 transition count 165
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 94 transition count 165
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 188 place count 94 transition count 159
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 200 place count 88 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 202 place count 86 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 86 transition count 157
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 276 place count 50 transition count 120
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 283 place count 43 transition count 93
Iterating global reduction 3 with 7 rules applied. Total rules applied 290 place count 43 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 294 place count 43 transition count 89
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 4 with 2 rules applied. Total rules applied 296 place count 42 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 41 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 300 place count 39 transition count 99
Applied a total of 300 rules in 97 ms. Remains 39 /185 variables (removed 146) and now considering 99/267 (removed 168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14951776088494703112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8264599498142685297.kers'
[2026-05-22 19:31:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14951776088494703112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8264599498142685297.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 98 rows 37 cols 647 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 19:31:19] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8264599498142685297.kers
Total runtime 2 ms.
[2026-05-22 19:31:19] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 19:31:19] [INFO ] Invariant cache hit.
[2026-05-22 19:31:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:31:19] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [35, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 267 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/185 places, 99/267 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 35 transition count 97
Applied a total of 4 rules in 15 ms. Remains 35 /37 variables (removed 2) and now considering 97/99 (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-12403171052476675595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13970645857976322945.kers'
[2026-05-22 19:31:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12403171052476675595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13970645857976322945.kers]
Normalized transition count is 96 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 96 rows 34 cols 647 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 19:31:19] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13970645857976322945.kers
Total runtime 1 ms.
[2026-05-22 19:31:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-22 19:31:19] [INFO ] Invariant cache hit.
[2026-05-22 19:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:31:20] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/185 places, 97/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 602 ms. Remains : 35/185 places, 97/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-02 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&G((!p1 U (F(!p2) U p3)))))'
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 260
Applied a total of 14 rules in 19 ms. Remains 178 /185 variables (removed 7) and now considering 260/267 (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-11864082229537898781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-515617703675586668.kers'
[2026-05-22 19:31:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11864082229537898781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-515617703675586668.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:31:20] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-515617703675586668.kers
Total runtime 3 ms.
[2026-05-22 19:31:20] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-22 19:31:20] [INFO ] Invariant cache hit.
[2026-05-22 19:31:20] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 260/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 178/185 places, 260/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&G((!p1 U (F(!p2) U p3)))))'
Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), p2, (NOT p3), (NOT p3), (NOT p3), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-04 finished in 1067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1 U G(p2)) U (!p0&&X(p2)))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 261
Applied a total of 12 rules in 17 ms. Remains 179 /185 variables (removed 6) and now considering 261/267 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10792153010841874984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4983200797503883158.kers'
[2026-05-22 19:31:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10792153010841874984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4983200797503883158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 179 cols 1058 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-22 19:31:21] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4983200797503883158.kers
Total runtime 3 ms.
[2026-05-22 19:31:21] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-22 19:31:21] [INFO ] Invariant cache hit.
[2026-05-22 19:31:21] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-22 19:31:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/440 variables, 179/228 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 229 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/491 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 7/498 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 498 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 261/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 179/185 places, 261/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1 U G(p2)) U (!p0&&X(p2)))))'
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p2) p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-07 finished in 61355 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 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 172 edges and 185 vertex of which 4 / 185 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 182 transition count 189
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 102 rules applied. Total rules applied 178 place count 107 transition count 162
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 193 place count 92 transition count 162
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 193 place count 92 transition count 156
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 205 place count 86 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 84 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 84 transition count 154
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 281 place count 48 transition count 117
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 289 place count 40 transition count 85
Iterating global reduction 3 with 8 rules applied. Total rules applied 297 place count 40 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 301 place count 40 transition count 81
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 4 with 2 rules applied. Total rules applied 303 place count 39 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 38 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 37 transition count 92
Applied a total of 306 rules in 45 ms. Remains 37 /185 variables (removed 148) and now considering 92/267 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2606723005726504064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11426039642557994897.kers'
[2026-05-22 19:32:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2606723005726504064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11426039642557994897.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 36 cols 653 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 19:32:22] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11426039642557994897.kers
Total runtime 1 ms.
[2026-05-22 19:32:22] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 19:32:22] [INFO ] Invariant cache hit.
[2026-05-22 19:32:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:32:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [33, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 147 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/185 places, 92/267 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 33 transition count 90
Applied a total of 4 rules in 6 ms. Remains 33 /35 variables (removed 2) and now considering 90/92 (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-11979819379380532103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2943579782738324528.kers'
[2026-05-22 19:32:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11979819379380532103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2943579782738324528.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 33 cols 655 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-22 19:32:22] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2943579782738324528.kers
Total runtime 0 ms.
[2026-05-22 19:32:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-22 19:32:22] [INFO ] Invariant cache hit.
[2026-05-22 19:32:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:32:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/185 places, 90/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 33/185 places, 90/267 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-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-08 finished in 413 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)||X(p1)))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 260
Applied a total of 14 rules in 6 ms. Remains 178 /185 variables (removed 7) and now considering 260/267 (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-7943744160875856935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15707965735666921036.kers'
[2026-05-22 19:32:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7943744160875856935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15707965735666921036.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:32:23] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15707965735666921036.kers
Total runtime 2 ms.
[2026-05-22 19:32:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 19:32:23] [INFO ] Invariant cache hit.
[2026-05-22 19:32:23] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 19:32:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 226 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/225 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/484 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 489 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 260/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 178/185 places, 260/267 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)||X(p1)))))'
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 260 ms.
Product exploration explored 100000 steps with 35 reset in 387 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 30968 steps (124 resets) in 131 ms. (234 steps per ms) remains 0/4 properties
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 564 ms.
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-22 19:33:25] [INFO ] Invariant cache hit.
[2026-05-22 19:33:25] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-22 19:33:25] [INFO ] Invariant cache hit.
[2026-05-22 19:33:25] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 178/178 places, 260/260 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 33683 steps (120 resets) in 189 ms. (177 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 548 ms.
Stuttering acceptance computed with spot in 271 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 275 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22 reset in 147 ms.
Product exploration explored 100000 steps with 14 reset in 168 ms.
Spot run failed in 85 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/ltsmin8869998614560514995
[2026-05-22 19:33:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8869998614560514995
Running compilation step : cd /tmp/ltsmin8869998614560514995;'/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 962 ms.
Running link step : cd /tmp/ltsmin8869998614560514995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8869998614560514995;'/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/stateBased16287464738084195969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-22 19:33:42] [INFO ] Invariant cache hit.
[2026-05-22 19:33:42] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-22 19:33:42] [INFO ] Invariant cache hit.
[2026-05-22 19:33:42] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 178/178 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin807890566754028694
[2026-05-22 19:33:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin807890566754028694
Running compilation step : cd /tmp/ltsmin807890566754028694;'/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 891 ms.
Running link step : cd /tmp/ltsmin807890566754028694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin807890566754028694;'/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/stateBased4384021113240728011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 19:33:57] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:33:57] [INFO ] Flatten gal took : 18 ms
[2026-05-22 19:33:57] [INFO ] Time to serialize gal into /tmp/LTL30821678953535822.gal : 4 ms
[2026-05-22 19:33:57] [INFO ] Time to serialize properties into /tmp/LTL17993025912861573661.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL30821678953535822.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4924591367618513845.hoa' '-atoms' '/tmp/LTL17993025912861573661.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL17993025912861573661.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4924591367618513845.hoa
Detected timeout of ITS tools.
[2026-05-22 19:34:12] [INFO ] Flatten gal took : 23 ms
[2026-05-22 19:34:12] [INFO ] Flatten gal took : 24 ms
[2026-05-22 19:34:12] [INFO ] Time to serialize gal into /tmp/LTL574885404607566120.gal : 12 ms
[2026-05-22 19:34:12] [INFO ] Time to serialize properties into /tmp/LTL15376299901355372004.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL574885404607566120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15376299901355372004.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((p50==0)||(p81==0))||((p118==0)||(p149==0)))||(p179==0))"))||(X("(p148==1)"))))))
Formula 0 simplified : XX(F!"((((p50==0)||(p81==0))||((p118==0)||(p149==0)))||(p179==0))" & X!"(p148==1)")
Detected timeout of ITS tools.
[2026-05-22 19:34:27] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:34:27] [INFO ] Applying decomposition
[2026-05-22 19:34:27] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8253689023258427574.txt' '-o' '/tmp/graph8253689023258427574.bin' '-w' '/tmp/graph8253689023258427574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8253689023258427574.bin' '-l' '-1' '-v' '-w' '/tmp/graph8253689023258427574.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:34:27] [INFO ] Decomposing Gal with order
[2026-05-22 19:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:34:27] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-22 19:34:27] [INFO ] Flatten gal took : 36 ms
[2026-05-22 19:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2026-05-22 19:34:28] [INFO ] Time to serialize gal into /tmp/LTL5741004690505466956.gal : 4 ms
[2026-05-22 19:34:28] [INFO ] Time to serialize properties into /tmp/LTL9830055204018214262.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5741004690505466956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9830055204018214262.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((i3.u13.p50==0)||(i5.u22.p81==0))||((i7.i1.u33.p118==0)||(i8.i1.u43.p149==0)))||(i12.i0.u51.p179==0))"))||(X("(i8.i1.u43...171
Formula 0 simplified : XX(F!"((((i3.u13.p50==0)||(i5.u22.p81==0))||((i7.i1.u33.p118==0)||(i8.i1.u43.p149==0)))||(i12.i0.u51.p179==0))" & X!"(i8.i1.u43.p148...161
Reverse transition relation is NOT exact ! Due to transitions t177, t197, t213, t233, t264, i0.t173, i0.t171, i2.i1.t164, i2.i1.u8.t142, i2.i1.u15.t143, i3...647
Computing Next relation with stutter on 3616 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
172 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.75835,69380,1,0,128090,2141,2826,126237,389,7746,208389
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-04b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-04b-LTLFireability-09 finished in 127086 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(!p1)||p0)) U p2))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 169 edges and 185 vertex of which 4 / 185 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 182 transition count 189
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 100 rules applied. Total rules applied 176 place count 107 transition count 164
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 191 place count 93 transition count 163
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 194 place count 92 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 91 transition count 161
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 195 place count 91 transition count 156
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 205 place count 86 transition count 156
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 207 place count 84 transition count 154
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 84 transition count 154
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 277 place count 50 transition count 119
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 285 place count 42 transition count 86
Iterating global reduction 5 with 8 rules applied. Total rules applied 293 place count 42 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 296 place count 42 transition count 83
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 6 with 2 rules applied. Total rules applied 298 place count 41 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 40 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 302 place count 38 transition count 93
Applied a total of 302 rules in 73 ms. Remains 38 /185 variables (removed 147) and now considering 93/267 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14311740035013042401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-362382933013853679.kers'
[2026-05-22 19:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14311740035013042401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-362382933013853679.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 92 rows 36 cols 617 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 19:34:30] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-362382933013853679.kers
Total runtime 8 ms.
[2026-05-22 19:34:30] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 19:34:30] [INFO ] Invariant cache hit.
[2026-05-22 19:34:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-22 19:34:30] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [34, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 215 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/185 places, 93/267 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 34 transition count 91
Applied a total of 4 rules in 10 ms. Remains 34 /36 variables (removed 2) and now considering 91/93 (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-18446229177764702032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-894967382250769228.kers'
[2026-05-22 19:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18446229177764702032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-894967382250769228.kers]
Normalized transition count is 90 out of 91 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 90 rows 33 cols 617 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:34:30] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-894967382250769228.kers
Total runtime 0 ms.
[2026-05-22 19:34:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 19:34:30] [INFO ] Invariant cache hit.
[2026-05-22 19:34:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 19:34:30] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/185 places, 91/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 465 ms. Remains : 34/185 places, 91/267 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(!p1)||p0)) U p2))'
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-10
Product exploration explored 100000 steps with 40005 reset in 185 ms.
Product exploration explored 100000 steps with 39962 reset in 343 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/34 stabilizing places and 5/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 25726 steps (1456 resets) in 896 ms. (28 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p0) p1)]
[2026-05-22 19:34:32] [INFO ] Invariant cache hit.
[2026-05-22 19:34:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-22 19:34:32] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-22 19:34:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:34:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-22 19:34:32] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-22 19:34:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 19:34:32] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2026-05-22 19:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2026-05-22 19:34:32] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 85 transitions) in 23 ms.
[2026-05-22 19:34:32] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1551 ms.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (AND (NOT p0) p1)]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-22 19:34:32] [INFO ] Invariant cache hit.
[2026-05-22 19:34:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 19:34:32] [INFO ] Invariant cache hit.
[2026-05-22 19:34:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 19:34:33] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2026-05-22 19:34:33] [INFO ] Redundant transitions in 24 ms returned []
Running 89 sub problems to find dead transitions.
[2026-05-22 19:34:33] [INFO ] Invariant cache hit.
[2026-05-22 19:34:33] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/124 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 52 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/124 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 89/140 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/125 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 147 constraints, problems are : Problem set: 0 solved, 89 unsolved in 11341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 16822ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 16823ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17041 ms. Remains : 34/34 places, 91/91 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/34 stabilizing places and 5/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 32351 steps (1884 resets) in 195 ms. (165 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 430 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) p1)]
[2026-05-22 19:34:50] [INFO ] Invariant cache hit.
[2026-05-22 19:34:50] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-22 19:34:51] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-22 19:34:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:34:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-22 19:34:51] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2026-05-22 19:34:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 19:34:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2026-05-22 19:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2026-05-22 19:34:51] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 85 transitions) in 22 ms.
[2026-05-22 19:34:51] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1429 ms.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 40001 reset in 278 ms.
Product exploration explored 100000 steps with 40029 reset in 327 ms.
Built C files in :
/tmp/ltsmin12503914712836949566
[2026-05-22 19:34:52] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2026-05-22 19:34:52] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:52] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2026-05-22 19:34:52] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:52] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2026-05-22 19:34:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:52] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12503914712836949566
Running compilation step : cd /tmp/ltsmin12503914712836949566;'/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 383 ms.
Running link step : cd /tmp/ltsmin12503914712836949566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12503914712836949566;'/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/stateBased6855251332968509773.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLFireability-10 finished in 22616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 171 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 183 transition count 190
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 100 rules applied. Total rules applied 176 place count 108 transition count 165
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 190 place count 94 transition count 165
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 190 place count 94 transition count 159
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 202 place count 88 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 203 place count 87 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 87 transition count 158
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 278 place count 50 transition count 120
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 287 place count 41 transition count 83
Iterating global reduction 3 with 9 rules applied. Total rules applied 296 place count 41 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 300 place count 41 transition count 79
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 4 with 2 rules applied. Total rules applied 302 place count 40 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 304 place count 39 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 37 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 36 transition count 89
Applied a total of 307 rules in 38 ms. Remains 36 /185 variables (removed 149) and now considering 89/267 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5144039227126059329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10886345021980876570.kers'
[2026-05-22 19:34:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5144039227126059329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10886345021980876570.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 88 rows 35 cols 554 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:34:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10886345021980876570.kers
Total runtime 1 ms.
[2026-05-22 19:34:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-22 19:34:52] [INFO ] Invariant cache hit.
[2026-05-22 19:34:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:34:52] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [30, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 220 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/185 places, 89/267 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 32 transition count 87
Applied a total of 4 rules in 4 ms. Remains 32 /34 variables (removed 2) and now considering 87/89 (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-4684306662780417898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12576015468887565992.kers'
[2026-05-22 19:34:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4684306662780417898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12576015468887565992.kers]
Normalized transition count is 86 out of 87 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 32 cols 552 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-22 19:34:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12576015468887565992.kers
Total runtime 1 ms.
[2026-05-22 19:34:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 19:34:53] [INFO ] Invariant cache hit.
[2026-05-22 19:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:34:53] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/185 places, 87/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 32/185 places, 87/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-11
Product exploration explored 100000 steps with 27 reset in 202 ms.
Product exploration explored 100000 steps with 28 reset in 256 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 11 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 1552 steps (87 resets) in 21 ms. (70 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 356 ms.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2026-05-22 19:34:54] [INFO ] Invariant cache hit.
[2026-05-22 19:34:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-22 19:34:54] [INFO ] Invariant cache hit.
[2026-05-22 19:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:34:54] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2026-05-22 19:34:54] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2026-05-22 19:34:54] [INFO ] Invariant cache hit.
[2026-05-22 19:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 86/118 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 44 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5852 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 86/118 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 130 constraints, problems are : Problem set: 0 solved, 84 unsolved in 8689 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 14604ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 14604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14797 ms. Remains : 32/32 places, 87/87 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 11 factoid took 64 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 21879 steps (137 resets) in 39 ms. (546 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 276 ms.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6 reset in 62 ms.
Product exploration explored 100000 steps with 42 reset in 73 ms.
Built C files in :
/tmp/ltsmin16392000694101065285
[2026-05-22 19:35:09] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2026-05-22 19:35:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:09] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2026-05-22 19:35:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:09] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2026-05-22 19:35:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16392000694101065285
Running compilation step : cd /tmp/ltsmin16392000694101065285;'/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 484 ms.
Running link step : cd /tmp/ltsmin16392000694101065285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16392000694101065285;'/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/stateBased4095470959730514214.hoa' '--buchi-type=spotba'
LTSmin run took 70 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLFireability-11 finished in 17540 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) U X(p1)))&&X(F((!p0&&X((G(!p0)||F(!p1))))))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 260
Applied a total of 14 rules in 8 ms. Remains 178 /185 variables (removed 7) and now considering 260/267 (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-5204426335470998943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12138758899082481197.kers'
[2026-05-22 19:35:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5204426335470998943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12138758899082481197.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:35:10] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12138758899082481197.kers
Total runtime 3 ms.
[2026-05-22 19:35:10] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-22 19:35:10] [INFO ] Invariant cache hit.
[2026-05-22 19:35:10] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 19:35:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 224 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/225 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/484 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 487 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 260/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 178/185 places, 260/267 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) U X(p1)))&&X(F((!p0&&X((G(!p0)||F(!p1))))))))'
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p1) p0), false, p0, (AND (NOT p0) (NOT p1)), (NOT p1), (AND p0 p1), (NOT p0), (AND p0 p1)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-12
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-12 finished in 61104 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 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 172 edges and 185 vertex of which 4 / 185 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 182 transition count 189
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 102 rules applied. Total rules applied 178 place count 107 transition count 162
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 193 place count 92 transition count 162
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 193 place count 92 transition count 156
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 205 place count 86 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 84 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 84 transition count 154
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 279 place count 49 transition count 118
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 287 place count 41 transition count 85
Iterating global reduction 3 with 8 rules applied. Total rules applied 295 place count 41 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 298 place count 41 transition count 82
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 4 with 2 rules applied. Total rules applied 300 place count 40 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 39 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 38 transition count 93
Applied a total of 303 rules in 31 ms. Remains 38 /185 variables (removed 147) and now considering 93/267 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5143436501636417325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7024684134036335728.kers'
[2026-05-22 19:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5143436501636417325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7024684134036335728.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 37 cols 655 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 19:36:11] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7024684134036335728.kers
Total runtime 1 ms.
[2026-05-22 19:36:11] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-22 19:36:11] [INFO ] Invariant cache hit.
[2026-05-22 19:36:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:36:11] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [34, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/185 places, 93/267 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 34 transition count 91
Applied a total of 4 rules in 8 ms. Remains 34 /36 variables (removed 2) and now considering 91/93 (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-4352403605687800714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18045230153123279575.kers'
[2026-05-22 19:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4352403605687800714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18045230153123279575.kers]
Normalized transition count is 90 out of 91 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 34 cols 657 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:36:11] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18045230153123279575.kers
Total runtime 1 ms.
[2026-05-22 19:36:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 19:36:11] [INFO ] Invariant cache hit.
[2026-05-22 19:36:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:36:11] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/185 places, 91/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 441 ms. Remains : 34/185 places, 91/267 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-04b-LTLFireability-13
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-13 finished in 579 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(G(p0)))&&(F(p1)||X(p2)))))'
Support contains 10 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 261
Applied a total of 12 rules in 9 ms. Remains 179 /185 variables (removed 6) and now considering 261/267 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13495916069938200018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13504052043383398396.kers'
[2026-05-22 19:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13495916069938200018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13504052043383398396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 179 cols 1058 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-22 19:36:11] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13504052043383398396.kers
Total runtime 3 ms.
[2026-05-22 19:36:12] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 19:36:12] [INFO ] Invariant cache hit.
[2026-05-22 19:36:12] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-22 19:36:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 261/440 variables, 179/225 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 225 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/227 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/487 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 7/494 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 494 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 261/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60532 ms. Remains : 179/185 places, 261/267 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(G(p0)))&&(F(p1)||X(p2)))))'
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-15 finished in 60919 ms.
All properties solved by simple procedures.
Total runtime 613588 ms.

BK_STOP 1779478632883

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946787900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;