About the Execution of ITS-Tools for AutonomousCar-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.859 | 3600000.00 | 5945434.00 | 142726.50 | TFFFFFFFFF?FFFFF | normal |
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-177946788000108.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-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.8K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:21 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 334K 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-07b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779493194448
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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 23:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:39:57] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2026-05-22 23:39:57] [INFO ] Transformed 323 places.
[2026-05-22 23:39:57] [INFO ] Transformed 846 transitions.
[2026-05-22 23:39:57] [INFO ] Found NUPN structural information;
[2026-05-22 23:39:57] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 544 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 277 transition count 800
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 277 transition count 800
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 288 place count 277 transition count 604
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 297 place count 268 transition count 595
Iterating global reduction 1 with 9 rules applied. Total rules applied 306 place count 268 transition count 595
Applied a total of 306 rules in 174 ms. Remains 268 /323 variables (removed 55) and now considering 595/846 (removed 251) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2500331575860179432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4019792421700700299.kers'
[2026-05-22 23:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2500331575860179432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4019792421700700299.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 595 rows 268 cols 4187 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-22 23:39:58] [INFO ] Computed 12 invariants in 8 ms
Computed 12 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4019792421700700299.kers
Total runtime 11 ms.
[2026-05-22 23:39:59] [INFO ] Implicit Places using invariants in 718 ms returned []
[2026-05-22 23:39:59] [INFO ] Invariant cache hit.
[2026-05-22 23:39:59] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
Running 594 sub problems to find dead transitions.
[2026-05-22 23:39:59] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/863 variables, and 36 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 594/396 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/863 variables, and 67 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 198/396 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61741ms problems are : Problem set: 0 solved, 594 unsolved
Search for dead transitions found 0 dead transitions in 61790ms
Starting structural reductions in LTL mode, iteration 1 : 268/323 places, 595/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63570 ms. Remains : 268/323 places, 595/846 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 268 /268 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2026-05-22 23:41:01] [INFO ] Invariant cache hit.
[2026-05-22 23:41:01] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-22 23:41:01] [INFO ] Invariant cache hit.
[2026-05-22 23:41:02] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 268/268 places, 595/595 transitions.
Support contains 51 out of 268 places after structural reductions.
[2026-05-22 23:41:02] [INFO ] Flatten gal took : 211 ms
[2026-05-22 23:41:03] [INFO ] Flatten gal took : 98 ms
[2026-05-22 23:41:03] [INFO ] Input system was already deterministic with 595 transitions.
Reduction of identical properties reduced properties to check from 34 to 32
RANDOM walk for 40000 steps (215 resets) in 2796 ms. (14 steps per ms) remains 12/32 properties
BEST_FIRST walk for 40002 steps (77 resets) in 220 ms. (181 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 131 ms. (303 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (65 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (66 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (65 resets) in 103 ms. (384 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (81 resets) in 86 ms. (459 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (81 resets) in 134 ms. (296 steps per ms) remains 3/5 properties
[2026-05-22 23:41:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 159/268 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 595/863 variables, 268/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/863 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/863 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/863 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 863/863 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 159/268 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 595/863 variables, 268/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/863 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/863 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/863 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 863/863 variables, and 283 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2558ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1136 ms.
Support contains 7 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 251 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1087 edges and 266 vertex of which 263 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 263 transition count 488
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 163 transition count 443
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 275 place count 137 transition count 443
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 275 place count 137 transition count 438
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 285 place count 132 transition count 438
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 287 place count 130 transition count 436
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 130 transition count 436
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 405 place count 72 transition count 378
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 418 place count 59 transition count 286
Iterating global reduction 3 with 13 rules applied. Total rules applied 431 place count 59 transition count 286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 436 place count 59 transition count 281
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 445 place count 59 transition count 272
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 454 place count 50 transition count 272
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 455 place count 50 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 456 place count 49 transition count 271
Applied a total of 456 rules in 202 ms. Remains 49 /268 variables (removed 219) and now considering 271/595 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 49/268 places, 271/595 transitions.
RANDOM walk for 40000 steps (903 resets) in 425 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (83 resets) in 125 ms. (317 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (81 resets) in 106 ms. (373 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3280 steps (3 resets) in 10 ms. (298 steps per ms) remains 0/1 properties
Computed a total of 43 stabilizing places and 44 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 7 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Applied a total of 8 rules in 30 ms. Remains 264 /268 variables (removed 4) and now considering 591/595 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15585106876713799927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17679570738448739255.kers'
[2026-05-22 23:41:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15585106876713799927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17679570738448739255.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 591 rows 264 cols 4179 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-22 23:41:09] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17679570738448739255.kers
Total runtime 7 ms.
[2026-05-22 23:41:09] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-22 23:41:09] [INFO ] Invariant cache hit.
[2026-05-22 23:41:10] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2026-05-22 23:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
SMT process timed out in 31141ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 31151ms
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 591/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32062 ms. Remains : 264/268 places, 591/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Stuttering acceptance computed with spot in 509 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 21 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 47 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-00 finished in 33577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p2)&&p1))))'
Support contains 9 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 237 edges and 268 vertex of which 4 / 268 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 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 265 transition count 492
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 144 rules applied. Total rules applied 245 place count 165 transition count 448
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 271 place count 139 transition count 448
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 271 place count 139 transition count 443
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 134 transition count 443
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 132 transition count 441
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 132 transition count 441
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 387 place count 81 transition count 389
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 397 place count 71 transition count 323
Iterating global reduction 3 with 10 rules applied. Total rules applied 407 place count 71 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 414 place count 71 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 416 place count 70 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 418 place count 68 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 419 place count 67 transition count 313
Applied a total of 419 rules in 140 ms. Remains 67 /268 variables (removed 201) and now considering 313/595 (removed 282) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8218127867402825541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9437308170971118971.kers'
[2026-05-22 23:41:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8218127867402825541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9437308170971118971.kers]
Normalized transition count is 312 out of 313 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 312 rows 66 cols 2959 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-22 23:41:42] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9437308170971118971.kers
Total runtime 3 ms.
[2026-05-22 23:41:43] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-22 23:41:43] [INFO ] Invariant cache hit.
[2026-05-22 23:41:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:41:43] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 350 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/268 places, 313/595 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 312
Applied a total of 2 rules in 25 ms. Remains 64 /65 variables (removed 1) and now considering 312/313 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7733032894887369552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1210336573569741234.kers'
[2026-05-22 23:41:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7733032894887369552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1210336573569741234.kers]
Normalized transition count is 311 out of 312 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 64 cols 2953 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-22 23:41:43] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1210336573569741234.kers
Total runtime 3 ms.
[2026-05-22 23:41:43] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-22 23:41:43] [INFO ] Invariant cache hit.
[2026-05-22 23:41:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:41:43] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/268 places, 312/595 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 854 ms. Remains : 64/268 places, 312/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p2)&&p1))))'
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-01
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-01 finished in 1015 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 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 253 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 2 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 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 265 transition count 492
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 143 rules applied. Total rules applied 244 place count 165 transition count 449
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 269 place count 140 transition count 449
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 269 place count 140 transition count 444
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 279 place count 135 transition count 444
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 282 place count 132 transition count 441
Iterating global reduction 3 with 3 rules applied. Total rules applied 285 place count 132 transition count 441
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 403 place count 73 transition count 381
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 417 place count 59 transition count 282
Iterating global reduction 3 with 14 rules applied. Total rules applied 431 place count 59 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 437 place count 59 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 439 place count 58 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 441 place count 56 transition count 273
Applied a total of 441 rules in 124 ms. Remains 56 /268 variables (removed 212) and now considering 273/595 (removed 322) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4489207944793338260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10198837011024463338.kers'
[2026-05-22 23:41:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4489207944793338260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10198837011024463338.kers]
Normalized transition count is 272 out of 273 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 54 cols 2873 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-22 23:41:43] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10198837011024463338.kers
Total runtime 4 ms.
[2026-05-22 23:41:44] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-22 23:41:44] [INFO ] Invariant cache hit.
[2026-05-22 23:41:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:41:44] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 396 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/268 places, 273/595 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 272
Applied a total of 2 rules in 29 ms. Remains 53 /54 variables (removed 1) and now considering 272/273 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7521106175982050700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1607338919519093604.kers'
[2026-05-22 23:41:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7521106175982050700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1607338919519093604.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 52 cols 2867 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 23:41:44] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1607338919519093604.kers
Total runtime 3 ms.
[2026-05-22 23:41:44] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-22 23:41:44] [INFO ] Invariant cache hit.
[2026-05-22 23:41:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:41:44] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/268 places, 272/595 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 989 ms. Remains : 53/268 places, 272/595 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 60 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-02
Product exploration explored 100000 steps with 66 reset in 347 ms.
Product exploration explored 100000 steps with 119 reset in 155 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2260 resets) in 1811 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (191 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1331708 steps, run visited all 1 properties in 2293 ms. (steps per millisecond=580 )
Probabilistic random walk after 1331708 steps, saw 197880 distinct states, run finished after 2299 ms. (steps per millisecond=579 ) properties seen :1
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 3032 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 272/272 transitions.
Applied a total of 0 rules in 14 ms. Remains 53 /53 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2026-05-22 23:41:48] [INFO ] Invariant cache hit.
[2026-05-22 23:41:48] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-22 23:41:48] [INFO ] Invariant cache hit.
[2026-05-22 23:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:41:48] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2026-05-22 23:41:48] [INFO ] Redundant transitions in 49 ms returned [269]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 268 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6116894200466046721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8143397210184967819.kers'
[2026-05-22 23:41:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6116894200466046721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8143397210184967819.kers]
Normalized transition count is 270 out of 271 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 270 rows 52 cols 2864 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 23:41:48] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8143397210184967819.kers
Total runtime 4 ms.
[2026-05-22 23:41:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 270/322 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/324 variables, and 67 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 268/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 270/322 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 141/203 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/324 variables, and 208 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/53 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 268/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60756ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60759ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 271/272 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 269
Applied a total of 2 rules in 24 ms. Remains 51 /53 variables (removed 2) and now considering 269/271 (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-3104589100636640579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14265583227674657024.kers'
[2026-05-22 23:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3104589100636640579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14265583227674657024.kers]
Normalized transition count is 268 out of 269 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 268 rows 50 cols 2868 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-22 23:42:49] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14265583227674657024.kers
Total runtime 5 ms.
[2026-05-22 23:42:49] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-22 23:42:49] [INFO ] Invariant cache hit.
[2026-05-22 23:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:50] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 269/272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61815 ms. Remains : 51/53 places, 269/272 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 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2375 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (212 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1790175 steps, run timeout after 3001 ms. (steps per millisecond=596 ) properties seen :0 out of 1
Probabilistic random walk after 1790175 steps, saw 267957 distinct states, run finished after 3005 ms. (steps per millisecond=595 ) properties seen :0
[2026-05-22 23:42:53] [INFO ] Invariant cache hit.
[2026-05-22 23:42:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/319 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/319 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/320 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/320 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1741ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 269/269 transitions.
Graph (complete) has 562 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 267
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 50 transition count 259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 42 transition count 259
Applied a total of 18 rules in 39 ms. Remains 42 /51 variables (removed 9) and now considering 259/269 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 42/51 places, 259/269 transitions.
RANDOM walk for 40000 steps (557 resets) in 425 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2448 steps (0 resets) in 9 ms. (244 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Knowledge-based reduction took 5338 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17 reset in 134 ms.
Product exploration explored 100000 steps with 42 reset in 401 ms.
Built C files in :
/tmp/ltsmin5384312310421611436
[2026-05-22 23:42:56] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2026-05-22 23:42:56] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:56] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2026-05-22 23:42:56] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:56] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
[2026-05-22 23:42:56] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:56] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5384312310421611436
Running compilation step : cd /tmp/ltsmin5384312310421611436;'/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 2113 ms.
Running link step : cd /tmp/ltsmin5384312310421611436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin5384312310421611436;'/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/stateBased9386062943941549931.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 269/269 transitions.
Applied a total of 0 rules in 12 ms. Remains 51 /51 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2026-05-22 23:43:11] [INFO ] Invariant cache hit.
[2026-05-22 23:43:11] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 23:43:11] [INFO ] Invariant cache hit.
[2026-05-22 23:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:43:11] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2026-05-22 23:43:11] [INFO ] Redundant transitions in 23 ms returned []
Running 267 sub problems to find dead transitions.
[2026-05-22 23:43:11] [INFO ] Invariant cache hit.
[2026-05-22 23:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/319 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/320 variables, and 65 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/140 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/319 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 140/201 constraints. Problems are: Problem set: 0 solved, 267 unsolved
SMT process timed out in 60581ms, After SMT, problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60960 ms. Remains : 51/51 places, 269/269 transitions.
Built C files in :
/tmp/ltsmin7677122120382720475
[2026-05-22 23:44:12] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2026-05-22 23:44:12] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:44:12] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2026-05-22 23:44:12] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:44:12] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
[2026-05-22 23:44:12] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:44:12] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7677122120382720475
Running compilation step : cd /tmp/ltsmin7677122120382720475;'/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 1637 ms.
Running link step : cd /tmp/ltsmin7677122120382720475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7677122120382720475;'/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/stateBased17840597092789478889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:44:27] [INFO ] Flatten gal took : 59 ms
[2026-05-22 23:44:27] [INFO ] Flatten gal took : 64 ms
[2026-05-22 23:44:27] [INFO ] Time to serialize gal into /tmp/LTL15458305151295992194.gal : 15 ms
[2026-05-22 23:44:27] [INFO ] Time to serialize properties into /tmp/LTL13429942001233708807.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/LTL15458305151295992194.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11370201050038594045.hoa' '-atoms' '/tmp/LTL13429942001233708807.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...320
Loading property file /tmp/LTL13429942001233708807.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11370201050038594045.hoa
Detected timeout of ITS tools.
[2026-05-22 23:44:42] [INFO ] Flatten gal took : 57 ms
[2026-05-22 23:44:42] [INFO ] Flatten gal took : 56 ms
[2026-05-22 23:44:42] [INFO ] Time to serialize gal into /tmp/LTL13245671222359187822.gal : 18 ms
[2026-05-22 23:44:42] [INFO ] Time to serialize properties into /tmp/LTL2064098182431452601.ltl : 5 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/LTL13245671222359187822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2064098182431452601.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p6!=1)||(p14!=1))||((p42!=1)||(p280!=1)))"))))
Formula 0 simplified : GF!"(((p6!=1)||(p14!=1))||((p42!=1)||(p280!=1)))"
Detected timeout of ITS tools.
[2026-05-22 23:44:57] [INFO ] Flatten gal took : 28 ms
[2026-05-22 23:44:57] [INFO ] Applying decomposition
[2026-05-22 23:44:57] [INFO ] Flatten gal took : 28 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/graph4341936969632639183.txt' '-o' '/tmp/graph4341936969632639183.bin' '-w' '/tmp/graph4341936969632639183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4341936969632639183.bin' '-l' '-1' '-v' '-w' '/tmp/graph4341936969632639183.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:44:58] [INFO ] Decomposing Gal with order
[2026-05-22 23:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:44:58] [INFO ] Removed a total of 1312 redundant transitions.
[2026-05-22 23:44:58] [INFO ] Flatten gal took : 144 ms
[2026-05-22 23:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 26 ms.
[2026-05-22 23:44:58] [INFO ] Time to serialize gal into /tmp/LTL11673432862098405248.gal : 6 ms
[2026-05-22 23:44:58] [INFO ] Time to serialize properties into /tmp/LTL733469845149626543.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/LTL11673432862098405248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL733469845149626543.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 : !((F(G("(((i8.u0.p6!=1)||(i8.u0.p14!=1))||((i0.u1.p42!=1)||(i8.u16.p280!=1)))"))))
Formula 0 simplified : GF!"(((i8.u0.p6!=1)||(i8.u0.p14!=1))||((i0.u1.p42!=1)||(i8.u16.p280!=1)))"
Reverse transition relation is NOT exact ! Due to transitions u5.t200, u7.t173, u9.t146, u11.t120, u13.t94, u15.t68, i0.u3.t225, i1.u2.t229, i1.u4.t204, i1...472
Computing Next relation with stutter on 49288 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
369 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,3.71271,133408,1,0,197046,4014,4210,644878,345,31615,352028
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-07b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-07b-LTLFireability-02 finished in 198937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (((p1||X(!p2)) U p0)&&X(p1))))'
Support contains 8 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 263 transition count 590
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 9 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13392613708077842694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9828666752413615544.kers'
[2026-05-22 23:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13392613708077842694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9828666752413615544.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 590 rows 263 cols 4177 entries
Finished phase 1 with 251 SingleSign rule and 0 generalized
[2026-05-22 23:45:02] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9828666752413615544.kers
Total runtime 7 ms.
[2026-05-22 23:45:03] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-22 23:45:03] [INFO ] Invariant cache hit.
[2026-05-22 23:45:03] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2026-05-22 23:45:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
SMT process timed out in 31069ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 31073ms
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32034 ms. Remains : 263/268 places, 590/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (((p1||X(!p2)) U p0)&&X(p1))))'
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) p2) (AND p0 p2)), (NOT p0), (NOT p1), p0]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-03
Product exploration explored 100000 steps with 28587 reset in 325 ms.
Product exploration explored 100000 steps with 28455 reset in 378 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge based reduction with 13 factoid took 63 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (265 resets) in 211 ms. (188 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (64 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 123 ms. (322 steps per ms) remains 2/3 properties
[2026-05-22 23:45:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 100/106 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 157/263 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 590/853 variables, 263/275 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/853 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/853 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 276 constraints, problems are : Problem set: 1 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 182/263 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 590/853 variables, 263/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/853 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 278 constraints, problems are : Problem set: 1 solved, 1 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1739ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 248 edges and 263 vertex of which 4 / 263 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1082 edges and 261 vertex of which 259 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 259 transition count 488
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 140 rules applied. Total rules applied 240 place count 163 transition count 444
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 266 place count 137 transition count 444
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 266 place count 137 transition count 438
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 278 place count 131 transition count 438
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 398 place count 71 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 71 transition count 377
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 57 transition count 278
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 57 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 433 place count 57 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 435 place count 56 transition count 271
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 443 place count 56 transition count 263
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 451 place count 48 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 48 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 47 transition count 262
Applied a total of 453 rules in 101 ms. Remains 47 /263 variables (removed 216) and now considering 262/590 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 47/263 places, 262/590 transitions.
RANDOM walk for 32535 steps (379 resets) in 277 ms. (117 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 144 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), p0]
[2026-05-22 23:45:38] [INFO ] Invariant cache hit.
[2026-05-22 23:45:39] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2026-05-22 23:45:39] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2026-05-22 23:45:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:45:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2026-05-22 23:45:40] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2026-05-22 23:45:40] [INFO ] Computed and/alt/rep : 232/461/232 causal constraints (skipped 357 transitions) in 212 ms.
[2026-05-22 23:45:43] [INFO ] Added : 216 causal constraints over 44 iterations in 2931 ms. Result :sat
Could not prove EG (NOT p0)
[2026-05-22 23:45:43] [INFO ] Invariant cache hit.
[2026-05-22 23:45:44] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2026-05-22 23:45:44] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2026-05-22 23:45:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:45:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2026-05-22 23:45:45] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2026-05-22 23:45:45] [INFO ] Computed and/alt/rep : 232/461/232 causal constraints (skipped 357 transitions) in 93 ms.
[2026-05-22 23:45:48] [INFO ] Added : 195 causal constraints over 39 iterations in 2600 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 12309 ms.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), p0]
Support contains 8 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 590/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2026-05-22 23:45:48] [INFO ] Invariant cache hit.
[2026-05-22 23:45:48] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-22 23:45:48] [INFO ] Invariant cache hit.
[2026-05-22 23:45:48] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 263/263 places, 590/590 transitions.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge based reduction with 10 factoid took 78 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (367 resets) in 254 ms. (156 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (68 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (62 resets) in 53 ms. (740 steps per ms) remains 1/2 properties
[2026-05-22 23:45:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 182/263 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 590/853 variables, 263/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 182/263 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 590/853 variables, 263/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/853 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/853 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 248 edges and 263 vertex of which 4 / 263 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1082 edges and 261 vertex of which 259 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 259 transition count 488
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 140 rules applied. Total rules applied 240 place count 163 transition count 444
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 266 place count 137 transition count 444
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 266 place count 137 transition count 438
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 278 place count 131 transition count 438
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 398 place count 71 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 71 transition count 377
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 57 transition count 278
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 57 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 433 place count 57 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 435 place count 56 transition count 271
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 443 place count 56 transition count 263
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 451 place count 48 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 48 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 47 transition count 262
Applied a total of 453 rules in 93 ms. Remains 47 /263 variables (removed 216) and now considering 262/590 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 47/263 places, 262/590 transitions.
RANDOM walk for 25552 steps (304 resets) in 138 ms. (183 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 153 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), p0]
[2026-05-22 23:45:52] [INFO ] Invariant cache hit.
[2026-05-22 23:45:52] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2026-05-22 23:45:53] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2026-05-22 23:45:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:45:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2026-05-22 23:45:54] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2026-05-22 23:45:54] [INFO ] Computed and/alt/rep : 232/461/232 causal constraints (skipped 357 transitions) in 66 ms.
[2026-05-22 23:45:57] [INFO ] Added : 216 causal constraints over 44 iterations in 3135 ms. Result :sat
Could not prove EG (NOT p0)
[2026-05-22 23:45:57] [INFO ] Invariant cache hit.
[2026-05-22 23:45:57] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2026-05-22 23:45:58] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2026-05-22 23:45:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:45:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2026-05-22 23:45:59] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2026-05-22 23:45:59] [INFO ] Computed and/alt/rep : 232/461/232 causal constraints (skipped 357 transitions) in 88 ms.
[2026-05-22 23:46:01] [INFO ] Added : 195 causal constraints over 39 iterations in 2400 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 12767 ms.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), p0]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), p0]
Product exploration explored 100000 steps with 23464 reset in 214 ms.
Product exploration explored 100000 steps with 23490 reset in 253 ms.
Spot run failed in 155 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9674501517635425809
[2026-05-22 23:46:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9674501517635425809
Running compilation step : cd /tmp/ltsmin9674501517635425809;'/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 2113 ms.
Running link step : cd /tmp/ltsmin9674501517635425809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9674501517635425809;'/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/stateBased14878635658844087119.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLFireability-03 finished in 62469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p0)))&&((F(p1) U p2)||X(p3)))))'
Support contains 13 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 263 transition count 590
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 8 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
[2026-05-22 23:46:05] [INFO ] Invariant cache hit.
[2026-05-22 23:46:05] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-22 23:46:05] [INFO ] Invariant cache hit.
[2026-05-22 23:46:05] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 263/268 places, 590/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p0)))&&((F(p1) U p2)||X(p3)))))'
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND p2 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-04 finished in 1069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&(G(!p2) U X(!p3))))'
Support contains 15 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Applied a total of 8 rules in 7 ms. Remains 264 /268 variables (removed 4) and now considering 591/595 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2981514049544649140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13991009955646160552.kers'
[2026-05-22 23:46:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2981514049544649140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13991009955646160552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 591 rows 264 cols 4179 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-22 23:46:06] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13991009955646160552.kers
Total runtime 5 ms.
[2026-05-22 23:46:06] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-22 23:46:06] [INFO ] Invariant cache hit.
[2026-05-22 23:46:06] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2026-05-22 23:46:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/392 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/855 variables, and 90 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 198/392 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60792ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 591/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61399 ms. Remains : 264/268 places, 591/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&(G(!p2) U X(!p3))))'
Stuttering acceptance computed with spot in 248 ms :[(OR p3 (AND (NOT p0) (NOT p1))), p3, (AND (NOT p0) (NOT p1)), p3, true, p2]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-05
Stuttering criterion allowed to conclude after 109 steps with 1 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-05 finished in 61722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 251 edges and 268 vertex of which 4 / 268 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 265 transition count 495
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 238 place count 168 transition count 452
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 264 place count 143 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 142 transition count 451
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 265 place count 142 transition count 446
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 275 place count 137 transition count 446
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 278 place count 134 transition count 443
Iterating global reduction 4 with 3 rules applied. Total rules applied 281 place count 134 transition count 443
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 399 place count 75 transition count 383
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 61 transition count 284
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 61 transition count 284
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 432 place count 61 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 434 place count 60 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 436 place count 58 transition count 276
Applied a total of 436 rules in 83 ms. Remains 58 /268 variables (removed 210) and now considering 276/595 (removed 319) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-931608064326776526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10319780962134423137.kers'
[2026-05-22 23:47:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-931608064326776526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10319780962134423137.kers]
Normalized transition count is 275 out of 276 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 275 rows 56 cols 2879 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-22 23:47:08] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10319780962134423137.kers
Total runtime 4 ms.
[2026-05-22 23:47:08] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-22 23:47:08] [INFO ] Invariant cache hit.
[2026-05-22 23:47:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:47:08] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [53, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 489 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/268 places, 276/595 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 275
Applied a total of 2 rules in 20 ms. Remains 55 /56 variables (removed 1) and now considering 275/276 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15984942885309855850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5572205907965792457.kers'
[2026-05-22 23:47:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15984942885309855850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5572205907965792457.kers]
Normalized transition count is 274 out of 275 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 274 rows 54 cols 2873 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-22 23:47:08] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5572205907965792457.kers
Total runtime 3 ms.
[2026-05-22 23:47:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-22 23:47:08] [INFO ] Invariant cache hit.
[2026-05-22 23:47:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:47:08] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/268 places, 275/595 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 983 ms. Remains : 55/268 places, 275/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-06
Product exploration explored 100000 steps with 115 reset in 145 ms.
Product exploration explored 100000 steps with 88 reset in 258 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 5 factoid took 63 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2300 resets) in 207 ms. (192 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (184 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2026-05-22 23:47:09] [INFO ] Invariant cache hit.
[2026-05-22 23:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/260 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/325 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/327 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/329 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/330 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/330 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/260 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/325 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/327 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/329 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/330 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/330 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 275/275 transitions.
Graph (complete) has 572 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 54 transition count 270
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 52 transition count 269
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 52 transition count 261
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 24 place count 44 transition count 261
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 44 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 43 transition count 262
Applied a total of 26 rules in 45 ms. Remains 43 /55 variables (removed 12) and now considering 262/275 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 43/55 places, 262/275 transitions.
RANDOM walk for 40000 steps (555 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2495 steps (0 resets) in 5 ms. (415 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 2119 ms.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 275/275 transitions.
Applied a total of 0 rules in 16 ms. Remains 55 /55 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-22 23:47:11] [INFO ] Invariant cache hit.
[2026-05-22 23:47:11] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-22 23:47:11] [INFO ] Invariant cache hit.
[2026-05-22 23:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:47:12] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2026-05-22 23:47:12] [INFO ] Redundant transitions in 25 ms returned [272]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 271 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15595679192144368817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18261503926617171714.kers'
[2026-05-22 23:47:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15595679192144368817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18261503926617171714.kers]
Normalized transition count is 273 out of 274 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 273 rows 54 cols 2870 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-22 23:47:12] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18261503926617171714.kers
Total runtime 5 ms.
[2026-05-22 23:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 273/327 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 1/329 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 329/329 variables, and 70 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 271/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 273/327 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 144/208 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/329 variables, and 214 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/55 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 271/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60721ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/55 places, 274/275 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 272
Applied a total of 2 rules in 14 ms. Remains 53 /55 variables (removed 2) and now considering 272/274 (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-7259668757249201197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14476882815227988970.kers'
[2026-05-22 23:48:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7259668757249201197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14476882815227988970.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 52 cols 2874 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 23:48:13] [INFO ] Computed 9 invariants in 4 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14476882815227988970.kers
Total runtime 5 ms.
[2026-05-22 23:48:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-22 23:48:13] [INFO ] Invariant cache hit.
[2026-05-22 23:48:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:48:13] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/55 places, 272/275 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61618 ms. Remains : 53/55 places, 272/275 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 5 factoid took 58 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2427 resets) in 238 ms. (167 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (208 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
[2026-05-22 23:48:13] [INFO ] Invariant cache hit.
[2026-05-22 23:48:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 59/321 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/323 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/324 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/325 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 59/321 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/323 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/324 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/325 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/325 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/325 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 272/272 transitions.
Graph (complete) has 565 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 52 transition count 268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 50 transition count 267
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 50 transition count 259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 23 place count 42 transition count 259
Applied a total of 23 rules in 32 ms. Remains 42 /53 variables (removed 11) and now considering 259/272 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 42/53 places, 259/272 transitions.
RANDOM walk for 40000 steps (584 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2420 steps (0 resets) in 6 ms. (345 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 1708 ms.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 214 reset in 163 ms.
Product exploration explored 100000 steps with 45 reset in 184 ms.
Built C files in :
/tmp/ltsmin2295646753829692264
[2026-05-22 23:48:15] [INFO ] Computing symmetric may disable matrix : 272 transitions.
[2026-05-22 23:48:15] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:48:15] [INFO ] Computing symmetric may enable matrix : 272 transitions.
[2026-05-22 23:48:15] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:48:15] [INFO ] Computing Do-Not-Accords matrix : 272 transitions.
[2026-05-22 23:48:15] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:48:15] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2295646753829692264
Running compilation step : cd /tmp/ltsmin2295646753829692264;'/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 1426 ms.
Running link step : cd /tmp/ltsmin2295646753829692264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin2295646753829692264;'/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/stateBased8811079264365722671.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 272/272 transitions.
Applied a total of 0 rules in 19 ms. Remains 53 /53 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2026-05-22 23:48:30] [INFO ] Invariant cache hit.
[2026-05-22 23:48:30] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-22 23:48:30] [INFO ] Invariant cache hit.
[2026-05-22 23:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:48:31] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2026-05-22 23:48:31] [INFO ] Redundant transitions in 22 ms returned []
Running 270 sub problems to find dead transitions.
[2026-05-22 23:48:31] [INFO ] Invariant cache hit.
[2026-05-22 23:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/324 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 1/325 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/325 variables, and 69 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 271/324 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 143/206 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/325 variables, and 212 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 270/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60746ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61218 ms. Remains : 53/53 places, 272/272 transitions.
Built C files in :
/tmp/ltsmin5416579927141865574
[2026-05-22 23:49:32] [INFO ] Computing symmetric may disable matrix : 272 transitions.
[2026-05-22 23:49:32] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:49:32] [INFO ] Computing symmetric may enable matrix : 272 transitions.
[2026-05-22 23:49:32] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:49:32] [INFO ] Computing Do-Not-Accords matrix : 272 transitions.
[2026-05-22 23:49:32] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:49:32] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5416579927141865574
Running compilation step : cd /tmp/ltsmin5416579927141865574;'/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 1461 ms.
Running link step : cd /tmp/ltsmin5416579927141865574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin5416579927141865574;'/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/stateBased7707895164919685456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:49:47] [INFO ] Flatten gal took : 27 ms
[2026-05-22 23:49:47] [INFO ] Flatten gal took : 26 ms
[2026-05-22 23:49:47] [INFO ] Time to serialize gal into /tmp/LTL13112097658537601971.gal : 6 ms
[2026-05-22 23:49:47] [INFO ] Time to serialize properties into /tmp/LTL14498305736704984484.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/LTL13112097658537601971.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14726019351831995908.hoa' '-atoms' '/tmp/LTL14498305736704984484.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...320
Loading property file /tmp/LTL14498305736704984484.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14726019351831995908.hoa
Detected timeout of ITS tools.
[2026-05-22 23:50:02] [INFO ] Flatten gal took : 21 ms
[2026-05-22 23:50:02] [INFO ] Flatten gal took : 21 ms
[2026-05-22 23:50:02] [INFO ] Time to serialize gal into /tmp/LTL7968877864941212723.gal : 4 ms
[2026-05-22 23:50:02] [INFO ] Time to serialize properties into /tmp/LTL5178650045051229186.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/LTL7968877864941212723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5178650045051229186.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 : !((G((F("(p204==0)"))&&(F(G("(((p6==0)||(p14==0))||((p166==0)||(p280==0)))"))))))
Formula 0 simplified : F(G!"(p204==0)" | GF!"(((p6==0)||(p14==0))||((p166==0)||(p280==0)))")
Detected timeout of ITS tools.
[2026-05-22 23:50:17] [INFO ] Flatten gal took : 36 ms
[2026-05-22 23:50:17] [INFO ] Applying decomposition
[2026-05-22 23:50:17] [INFO ] Flatten gal took : 34 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/graph13799570514222878710.txt' '-o' '/tmp/graph13799570514222878710.bin' '-w' '/tmp/graph13799570514222878710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13799570514222878710.bin' '-l' '-1' '-v' '-w' '/tmp/graph13799570514222878710.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:50:17] [INFO ] Decomposing Gal with order
[2026-05-22 23:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:50:17] [INFO ] Removed a total of 1313 redundant transitions.
[2026-05-22 23:50:17] [INFO ] Flatten gal took : 80 ms
[2026-05-22 23:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 25 ms.
[2026-05-22 23:50:17] [INFO ] Time to serialize gal into /tmp/LTL14709406214320554300.gal : 4 ms
[2026-05-22 23:50:17] [INFO ] Time to serialize properties into /tmp/LTL3167150811923941599.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/LTL14709406214320554300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3167150811923941599.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...255
Read 1 LTL properties
Checking formula 0 : !((G((F("(i7.u12.p204==0)"))&&(F(G("(((i0.u0.p6==0)||(i0.u0.p14==0))||((i6.u9.p166==0)||(i0.u17.p280==0)))"))))))
Formula 0 simplified : F(G!"(i7.u12.p204==0)" | GF!"(((i0.u0.p6==0)||(i0.u0.p14==0))||((i6.u9.p166==0)||(i0.u17.p280==0)))")
Reverse transition relation is NOT exact ! Due to transitions u2.t225, u4.t200, u6.t173, u8.t146, u16.t68, i0.t23_t15_t16_t452_t251_t454_t252_t17_t18_t45_t...475
Computing Next relation with stutter on 49288 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
488 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.91884,127000,1,0,254563,3219,4704,333639,351,24291,443136
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-07b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-07b-LTLFireability-06 finished in 195188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 263 transition count 590
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 11 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5467670257086245593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7615986672850068165.kers'
[2026-05-22 23:50:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5467670257086245593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7615986672850068165.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 590 rows 263 cols 4177 entries
Finished phase 1 with 251 SingleSign rule and 0 generalized
[2026-05-22 23:50:23] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7615986672850068165.kers
Total runtime 5 ms.
[2026-05-22 23:50:23] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-22 23:50:23] [INFO ] Invariant cache hit.
[2026-05-22 23:50:24] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2026-05-22 23:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 100 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 198/391 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60787ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60790ms
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61707 ms. Remains : 263/268 places, 590/595 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(F(p0)))))'
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-08
Stuttering criterion allowed to conclude after 207 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-08 finished in 61933 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)))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 263 transition count 590
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 12 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
[2026-05-22 23:51:25] [INFO ] Invariant cache hit.
[2026-05-22 23:51:25] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-22 23:51:25] [INFO ] Invariant cache hit.
[2026-05-22 23:51:25] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 263/268 places, 590/595 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)))))'
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-10
Product exploration explored 100000 steps with 239 reset in 233 ms.
Product exploration explored 100000 steps with 209 reset in 252 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (226 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (62 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 796750 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 796750 steps, saw 133309 distinct states, run finished after 3005 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-22 23:51:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/263 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 590/853 variables, 263/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/853 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/853 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/263 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 590/853 variables, 263/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/853 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 247 edges and 263 vertex of which 4 / 263 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1082 edges and 261 vertex of which 259 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 259 transition count 489
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 139 rules applied. Total rules applied 238 place count 164 transition count 445
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 264 place count 138 transition count 445
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 264 place count 138 transition count 439
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 276 place count 132 transition count 439
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 398 place count 71 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 71 transition count 377
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 57 transition count 279
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 57 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 434 place count 57 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 436 place count 56 transition count 271
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 444 place count 56 transition count 263
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 452 place count 48 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 48 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 47 transition count 262
Applied a total of 454 rules in 90 ms. Remains 47 /263 variables (removed 216) and now considering 262/590 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 47/263 places, 262/590 transitions.
RANDOM walk for 37898 steps (259 resets) in 252 ms. (149 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5400 ms.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 263 /263 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2026-05-22 23:51:32] [INFO ] Invariant cache hit.
[2026-05-22 23:51:32] [INFO ] Implicit Places using invariants in 221 ms returned []
[2026-05-22 23:51:32] [INFO ] Invariant cache hit.
[2026-05-22 23:51:32] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 263/263 places, 590/590 transitions.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (327 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (63 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 728075 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 728075 steps, saw 123145 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2026-05-22 23:51:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/263 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 590/853 variables, 263/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/853 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/853 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/263 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 590/853 variables, 263/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/853 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 247 edges and 263 vertex of which 4 / 263 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1082 edges and 261 vertex of which 259 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 259 transition count 489
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 139 rules applied. Total rules applied 238 place count 164 transition count 445
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 264 place count 138 transition count 445
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 264 place count 138 transition count 439
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 276 place count 132 transition count 439
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 398 place count 71 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 71 transition count 377
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 57 transition count 279
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 57 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 434 place count 57 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 436 place count 56 transition count 271
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 444 place count 56 transition count 263
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 452 place count 48 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 48 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 47 transition count 262
Applied a total of 454 rules in 62 ms. Remains 47 /263 variables (removed 216) and now considering 262/590 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 47/263 places, 262/590 transitions.
RANDOM walk for 33991 steps (230 resets) in 223 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5014 ms.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 349 reset in 246 ms.
Product exploration explored 100000 steps with 138 reset in 238 ms.
Spot run failed in 86 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4429309511408398897
[2026-05-22 23:51:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4429309511408398897
Running compilation step : cd /tmp/ltsmin4429309511408398897;'/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 2167 ms.
Running link step : cd /tmp/ltsmin4429309511408398897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4429309511408398897;'/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/stateBased4495418672691709084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 590/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2026-05-22 23:51:53] [INFO ] Invariant cache hit.
[2026-05-22 23:51:54] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-22 23:51:54] [INFO ] Invariant cache hit.
[2026-05-22 23:51:54] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 758 ms. Remains : 263/263 places, 590/590 transitions.
Built C files in :
/tmp/ltsmin13547007099565301516
[2026-05-22 23:51:54] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13547007099565301516
Running compilation step : cd /tmp/ltsmin13547007099565301516;'/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 1972 ms.
Running link step : cd /tmp/ltsmin13547007099565301516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13547007099565301516;'/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/stateBased3560934084708019021.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:52:09] [INFO ] Flatten gal took : 34 ms
[2026-05-22 23:52:09] [INFO ] Flatten gal took : 34 ms
[2026-05-22 23:52:09] [INFO ] Time to serialize gal into /tmp/LTL4665462122260888758.gal : 11 ms
[2026-05-22 23:52:09] [INFO ] Time to serialize properties into /tmp/LTL10098357637555799207.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/LTL4665462122260888758.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9805560897381480647.hoa' '-atoms' '/tmp/LTL10098357637555799207.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10098357637555799207.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9805560897381480647.hoa
Detected timeout of ITS tools.
[2026-05-22 23:52:24] [INFO ] Flatten gal took : 18 ms
[2026-05-22 23:52:24] [INFO ] Flatten gal took : 18 ms
[2026-05-22 23:52:24] [INFO ] Time to serialize gal into /tmp/LTL11652386814275437808.gal : 10 ms
[2026-05-22 23:52:24] [INFO ] Time to serialize properties into /tmp/LTL11396401438035956553.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/LTL11652386814275437808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11396401438035956553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((p6!=1)||(p16!=1))||((p185!=1)||(p280!=1)))"))))))
Formula 0 simplified : XXXF!"(((p6!=1)||(p16!=1))||((p185!=1)||(p280!=1)))"
Detected timeout of ITS tools.
[2026-05-22 23:52:39] [INFO ] Flatten gal took : 17 ms
[2026-05-22 23:52:39] [INFO ] Applying decomposition
[2026-05-22 23:52:39] [INFO ] Flatten gal took : 17 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/graph15421911270671836375.txt' '-o' '/tmp/graph15421911270671836375.bin' '-w' '/tmp/graph15421911270671836375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15421911270671836375.bin' '-l' '-1' '-v' '-w' '/tmp/graph15421911270671836375.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:52:40] [INFO ] Decomposing Gal with order
[2026-05-22 23:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:52:40] [INFO ] Removed a total of 1619 redundant transitions.
[2026-05-22 23:52:40] [INFO ] Flatten gal took : 70 ms
[2026-05-22 23:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 14 ms.
[2026-05-22 23:52:40] [INFO ] Time to serialize gal into /tmp/LTL12289278592834340399.gal : 4 ms
[2026-05-22 23:52:40] [INFO ] Time to serialize properties into /tmp/LTL7239993695653646182.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/LTL12289278592834340399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7239993695653646182.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i3.u1.p6!=1)||(i3.u1.p16!=1))||((i5.u56.p185!=1)||(i3.u1.p280!=1)))"))))))
Formula 0 simplified : XXXF!"(((i3.u1.p6!=1)||(i3.u1.p16!=1))||((i5.u56.p185!=1)||(i3.u1.p280!=1)))"
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-07b-LTLFireability-10 finished in 90200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((p0||(p1 U p2)) U X(p2)) U (G(((p0||(p1 U p2)) U X(p2)))||(((p0||(p1 U p2)) U X(p2))&&p3))))))'
Support contains 8 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Applied a total of 8 rules in 8 ms. Remains 264 /268 variables (removed 4) and now considering 591/595 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15471804962831130349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12149091096550114951.kers'
[2026-05-22 23:52:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15471804962831130349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12149091096550114951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 591 rows 264 cols 4179 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-22 23:52:55] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12149091096550114951.kers
Total runtime 5 ms.
[2026-05-22 23:52:55] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-22 23:52:55] [INFO ] Invariant cache hit.
[2026-05-22 23:52:56] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2026-05-22 23:52:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
SMT process timed out in 31189ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 31194ms
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 591/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31922 ms. Remains : 264/268 places, 591/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((p0||(p1 U p2)) U X(p2)) U (G(((p0||(p1 U p2)) U X(p2)))||(((p0||(p1 U p2)) U X(p2))&&p3))))))'
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-11
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-11 finished in 32262 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 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 252 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 0 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 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 265 transition count 493
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 143 rules applied. Total rules applied 243 place count 166 transition count 449
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 269 place count 140 transition count 449
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 269 place count 140 transition count 444
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 279 place count 135 transition count 444
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 282 place count 132 transition count 441
Iterating global reduction 3 with 3 rules applied. Total rules applied 285 place count 132 transition count 441
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 403 place count 73 transition count 381
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 417 place count 59 transition count 283
Iterating global reduction 3 with 14 rules applied. Total rules applied 431 place count 59 transition count 283
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 438 place count 59 transition count 276
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 440 place count 58 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 56 transition count 273
Applied a total of 442 rules in 44 ms. Remains 56 /268 variables (removed 212) and now considering 273/595 (removed 322) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17047151452704151669.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9570760591393874121.kers'
[2026-05-22 23:53:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17047151452704151669.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9570760591393874121.kers]
Normalized transition count is 272 out of 273 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 54 cols 2873 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-22 23:53:27] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9570760591393874121.kers
Total runtime 3 ms.
[2026-05-22 23:53:27] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-22 23:53:27] [INFO ] Invariant cache hit.
[2026-05-22 23:53:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:53:27] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 344 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/268 places, 273/595 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 272
Applied a total of 2 rules in 17 ms. Remains 53 /54 variables (removed 1) and now considering 272/273 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15357417566768714362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15244289384187423423.kers'
[2026-05-22 23:53:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15357417566768714362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15244289384187423423.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 52 cols 2867 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 23:53:27] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15244289384187423423.kers
Total runtime 3 ms.
[2026-05-22 23:53:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-22 23:53:28] [INFO ] Invariant cache hit.
[2026-05-22 23:53:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:53:28] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/268 places, 272/595 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 769 ms. Remains : 53/268 places, 272/595 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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-12
Product exploration explored 100000 steps with 27 reset in 70 ms.
Product exploration explored 100000 steps with 22 reset in 88 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 20259 steps (1090 resets) in 138 ms. (145 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 334 ms.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 272/272 transitions.
Applied a total of 0 rules in 15 ms. Remains 53 /53 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2026-05-22 23:53:29] [INFO ] Invariant cache hit.
[2026-05-22 23:53:29] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-22 23:53:29] [INFO ] Invariant cache hit.
[2026-05-22 23:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:53:29] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2026-05-22 23:53:29] [INFO ] Redundant transitions in 17 ms returned [269]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 268 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-914382014636365147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1550236711554904894.kers'
[2026-05-22 23:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-914382014636365147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1550236711554904894.kers]
Normalized transition count is 270 out of 271 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 270 rows 52 cols 2864 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 23:53:29] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1550236711554904894.kers
Total runtime 3 ms.
[2026-05-22 23:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 270/322 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 1/324 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/324 variables, and 69 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 268/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 270/322 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 141/203 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/324 variables, and 210 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/53 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 268/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 271/272 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 269
Applied a total of 2 rules in 11 ms. Remains 51 /53 variables (removed 2) and now considering 269/271 (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-4356621825285497108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17567295413344928043.kers'
[2026-05-22 23:54:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4356621825285497108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17567295413344928043.kers]
Normalized transition count is 268 out of 269 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 268 rows 50 cols 2868 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-22 23:54:30] [INFO ] Computed 9 invariants in 4 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17567295413344928043.kers
Total runtime 5 ms.
[2026-05-22 23:54:30] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-22 23:54:30] [INFO ] Invariant cache hit.
[2026-05-22 23:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:54:30] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 269/272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61727 ms. Remains : 51/53 places, 269/272 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 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 8184 steps (481 resets) in 34 ms. (233 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 258 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 187 reset in 134 ms.
Product exploration explored 100000 steps with 146 reset in 168 ms.
Built C files in :
/tmp/ltsmin8898119589698896777
[2026-05-22 23:54:31] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2026-05-22 23:54:31] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:54:31] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2026-05-22 23:54:31] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:54:31] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
[2026-05-22 23:54:31] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:54:31] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8898119589698896777
Running compilation step : cd /tmp/ltsmin8898119589698896777;'/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 1762 ms.
Running link step : cd /tmp/ltsmin8898119589698896777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8898119589698896777;'/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/stateBased299431456192638822.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 269/269 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2026-05-22 23:54:46] [INFO ] Invariant cache hit.
[2026-05-22 23:54:46] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-22 23:54:46] [INFO ] Invariant cache hit.
[2026-05-22 23:54:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:54:46] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2026-05-22 23:54:46] [INFO ] Redundant transitions in 18 ms returned []
Running 267 sub problems to find dead transitions.
[2026-05-22 23:54:46] [INFO ] Invariant cache hit.
[2026-05-22 23:54:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/319 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 66 constraints, problems are : Problem set: 0 solved, 267 unsolved in 26808 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/140 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/319 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 140/201 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/320 variables, and 208 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 267/140 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 57302ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 57303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57647 ms. Remains : 51/51 places, 269/269 transitions.
Built C files in :
/tmp/ltsmin12302131628171087262
[2026-05-22 23:55:44] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2026-05-22 23:55:44] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:55:44] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2026-05-22 23:55:44] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:55:44] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
[2026-05-22 23:55:44] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:55:44] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12302131628171087262
Running compilation step : cd /tmp/ltsmin12302131628171087262;'/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 1334 ms.
Running link step : cd /tmp/ltsmin12302131628171087262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12302131628171087262;'/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/stateBased2784381896578588690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:55:59] [INFO ] Flatten gal took : 17 ms
[2026-05-22 23:55:59] [INFO ] Flatten gal took : 16 ms
[2026-05-22 23:55:59] [INFO ] Time to serialize gal into /tmp/LTL12053456342519887802.gal : 6 ms
[2026-05-22 23:55:59] [INFO ] Time to serialize properties into /tmp/LTL4771741802502629704.prop : 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/LTL12053456342519887802.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3909030380003353524.hoa' '-atoms' '/tmp/LTL4771741802502629704.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4771741802502629704.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3909030380003353524.hoa
Detected timeout of ITS tools.
[2026-05-22 23:56:14] [INFO ] Flatten gal took : 17 ms
[2026-05-22 23:56:14] [INFO ] Flatten gal took : 17 ms
[2026-05-22 23:56:14] [INFO ] Time to serialize gal into /tmp/LTL11160178808791807930.gal : 3 ms
[2026-05-22 23:56:14] [INFO ] Time to serialize properties into /tmp/LTL5649882431878149354.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/LTL11160178808791807930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5649882431878149354.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p6==0)||(p19==0))||((p61==0)||(p280==0)))"))))
Formula 0 simplified : FG!"(((p6==0)||(p19==0))||((p61==0)||(p280==0)))"
Detected timeout of ITS tools.
[2026-05-22 23:56:29] [INFO ] Flatten gal took : 18 ms
[2026-05-22 23:56:29] [INFO ] Applying decomposition
[2026-05-22 23:56:29] [INFO ] Flatten gal took : 16 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/graph9989284703396585982.txt' '-o' '/tmp/graph9989284703396585982.bin' '-w' '/tmp/graph9989284703396585982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9989284703396585982.bin' '-l' '-1' '-v' '-w' '/tmp/graph9989284703396585982.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:56:29] [INFO ] Decomposing Gal with order
[2026-05-22 23:56:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:56:29] [INFO ] Removed a total of 1305 redundant transitions.
[2026-05-22 23:56:29] [INFO ] Flatten gal took : 49 ms
[2026-05-22 23:56:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 14 ms.
[2026-05-22 23:56:29] [INFO ] Time to serialize gal into /tmp/LTL6938870402806925610.gal : 4 ms
[2026-05-22 23:56:29] [INFO ] Time to serialize properties into /tmp/LTL12341445342687569206.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/LTL6938870402806925610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12341445342687569206.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i0.u0.p6==0)||(i0.u0.p19==0))||((u1.p61==0)||(i0.u15.p280==0)))"))))
Formula 0 simplified : FG!"(((i0.u0.p6==0)||(i0.u0.p19==0))||((u1.p61==0)||(i0.u15.p280==0)))"
Reverse transition relation is NOT exact ! Due to transitions u1.t229, u1.t228.t230, u2.t225, u4.t200, u6.t173, u8.t146, u10.t120, u12.t94, u14.t68, i0.t23...479
Computing Next relation with stutter on 36909 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
400 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.03126,84636,1,0,178349,1939,4177,173701,377,13354,359369
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-07b-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutonomousCar-PT-07b-LTLFireability-12 finished in 186520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 253 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 0 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 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 265 transition count 492
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 144 rules applied. Total rules applied 245 place count 165 transition count 448
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 271 place count 139 transition count 448
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 271 place count 139 transition count 443
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 134 transition count 443
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 284 place count 131 transition count 440
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 131 transition count 440
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 405 place count 72 transition count 380
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 419 place count 58 transition count 282
Iterating global reduction 3 with 14 rules applied. Total rules applied 433 place count 58 transition count 282
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 440 place count 58 transition count 275
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 442 place count 57 transition count 274
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 444 place count 55 transition count 272
Applied a total of 444 rules in 82 ms. Remains 55 /268 variables (removed 213) and now considering 272/595 (removed 323) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5526533970619853607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11747759130241748190.kers'
[2026-05-22 23:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5526533970619853607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11747759130241748190.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 271 rows 53 cols 2871 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 23:56:34] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11747759130241748190.kers
Total runtime 3 ms.
[2026-05-22 23:56:34] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-22 23:56:34] [INFO ] Invariant cache hit.
[2026-05-22 23:56:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:56:34] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 385 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/268 places, 272/595 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 271
Applied a total of 2 rules in 12 ms. Remains 52 /53 variables (removed 1) and now considering 271/272 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16052035995943425892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16667655625761971355.kers'
[2026-05-22 23:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16052035995943425892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16667655625761971355.kers]
Normalized transition count is 270 out of 271 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 270 rows 51 cols 2865 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-22 23:56:34] [INFO ] Computed 9 invariants in 4 ms
Computed 9 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16667655625761971355.kers
Total runtime 6 ms.
[2026-05-22 23:56:34] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-22 23:56:34] [INFO ] Invariant cache hit.
[2026-05-22 23:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:56:35] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/268 places, 271/595 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 918 ms. Remains : 52/268 places, 271/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Stuttering acceptance computed with spot in 113 ms :[p0, true, p0]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 944 steps with 50 reset in 5 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-13 finished in 1076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(((X(X(X(p0)))&&p1) U (p2||G(p0)))))))'
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 263 transition count 590
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 7 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2186932368971366280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5336286316395888205.kers'
[2026-05-22 23:56:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2186932368971366280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5336286316395888205.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 590 rows 263 cols 4177 entries
Finished phase 1 with 251 SingleSign rule and 0 generalized
[2026-05-22 23:56:35] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5336286316395888205.kers
Total runtime 5 ms.
[2026-05-22 23:56:35] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-22 23:56:35] [INFO ] Invariant cache hit.
[2026-05-22 23:56:35] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2026-05-22 23:56:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 100 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 198/391 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61148ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61150ms
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61844 ms. Remains : 263/268 places, 590/595 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 X(X(((X(X(X(p0)))&&p1) U (p2||G(p0)))))))'
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-14 finished in 62376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&((F(p1) U p2) U (p3||F(!p0))))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Applied a total of 8 rules in 12 ms. Remains 264 /268 variables (removed 4) and now considering 591/595 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13523199241879291338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7426394909334895574.kers'
[2026-05-22 23:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13523199241879291338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7426394909334895574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 591 rows 264 cols 4179 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-22 23:57:37] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7426394909334895574.kers
Total runtime 6 ms.
[2026-05-22 23:57:37] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-22 23:57:37] [INFO ] Invariant cache hit.
[2026-05-22 23:57:38] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2026-05-22 23:57:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
SMT process timed out in 31235ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 31238ms
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 591/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32067 ms. Remains : 264/268 places, 591/595 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&((F(p1) U p2) U (p3||F(!p0))))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-15 finished in 32424 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)))))'
Spot run failed in 56 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 23:58:10] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6772856557762528951
[2026-05-22 23:58:10] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2026-05-22 23:58:10] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:58:10] [INFO ] Applying decomposition
[2026-05-22 23:58:10] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2026-05-22 23:58:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:58:10] [INFO ] Flatten gal took : 29 ms
[2026-05-22 23:58:10] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2026-05-22 23:58:10] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:58:10] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6772856557762528951
Running compilation step : cd /tmp/ltsmin6772856557762528951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
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/graph2529611000714393473.txt' '-o' '/tmp/graph2529611000714393473.bin' '-w' '/tmp/graph2529611000714393473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2529611000714393473.bin' '-l' '-1' '-v' '-w' '/tmp/graph2529611000714393473.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:58:10] [INFO ] Decomposing Gal with order
[2026-05-22 23:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:58:10] [INFO ] Removed a total of 1609 redundant transitions.
[2026-05-22 23:58:10] [INFO ] Flatten gal took : 80 ms
[2026-05-22 23:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 12 ms.
[2026-05-22 23:58:10] [INFO ] Time to serialize gal into /tmp/LTLFireability16920614009291776403.gal : 6 ms
[2026-05-22 23:58:10] [INFO ] Time to serialize properties into /tmp/LTLFireability9291520002712441365.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/LTLFireability16920614009291776403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9291520002712441365.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u2.p6!=1)||(i0.u2.p16!=1))||((i5.u57.p185!=1)||(i0.u2.p280!=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u2.p6!=1)||(i0.u2.p16!=1))||((i5.u57.p185!=1)||(i0.u2.p280!=1)))"
Compilation finished in 2977 ms.
Running link step : cd /tmp/ltsmin6772856557762528951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6772856557762528951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t35, t87, t113, t139, t166, t193, t219, t245, t252, t254, t261, t317, t450, t592, i2.u21.t199...789
Computing Next relation with stutter on 390272 deadlock states
Detected timeout of ITS tools.
[2026-05-23 00:24:18] [INFO ] Applying decomposition
[2026-05-23 00:24:19] [INFO ] Flatten gal took : 431 ms
[2026-05-23 00:24:19] [INFO ] Decomposing Gal with order
[2026-05-23 00:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:24:22] [INFO ] Removed a total of 1761 redundant transitions.
[2026-05-23 00:24:22] [INFO ] Flatten gal took : 1954 ms
[2026-05-23 00:24:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 382 ms.
[2026-05-23 00:24:23] [INFO ] Time to serialize gal into /tmp/LTLFireability250288603667365492.gal : 48 ms
[2026-05-23 00:24:23] [INFO ] Time to serialize properties into /tmp/LTLFireability6653575592960531188.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/LTLFireability250288603667365492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6653575592960531188.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u2.p6!=1)||(i0.u3.p16!=1))||((i1.i0.i0.i0.i0.u16.p185!=1)||(i1.i0.u19.p280!=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u2.p6!=1)||(i0.u3.p16!=1))||((i1.i0.i0.i0.i0.u16.p185!=1)||(i1.i0.u19.p280!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t270, i0.u2.t254, i0.u3.t252, i1.t592, i1.i0.u19.t35, i1.i0.u19.t39, i1.i0.u19.t40, i1.i0.i0....1482
Computing Next relation with stutter on 390272 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-07b"
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-07b, 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-177946788000108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b 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 '
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 ;