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.r194-tall-177969914200540.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 Parking-PT-832, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 6.2K Mar 8 08:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 8 08:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 8 08:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 08:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 8 08:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 8 08:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 8 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 8 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:25 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 251K 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 Parking-PT-832-LTLFireability-00
FORMULA_NAME Parking-PT-832-LTLFireability-01
FORMULA_NAME Parking-PT-832-LTLFireability-02
FORMULA_NAME Parking-PT-832-LTLFireability-03
FORMULA_NAME Parking-PT-832-LTLFireability-04
FORMULA_NAME Parking-PT-832-LTLFireability-05
FORMULA_NAME Parking-PT-832-LTLFireability-06
FORMULA_NAME Parking-PT-832-LTLFireability-07
FORMULA_NAME Parking-PT-832-LTLFireability-08
FORMULA_NAME Parking-PT-832-LTLFireability-09
FORMULA_NAME Parking-PT-832-LTLFireability-10
FORMULA_NAME Parking-PT-832-LTLFireability-11
FORMULA_NAME Parking-PT-832-LTLFireability-12
FORMULA_NAME Parking-PT-832-LTLFireability-13
FORMULA_NAME Parking-PT-832-LTLFireability-14
FORMULA_NAME Parking-PT-832-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779786010148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 09:00:11] [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-26 09:00:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:00:11] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2026-05-26 09:00:11] [INFO ] Transformed 737 places.
[2026-05-26 09:00:11] [INFO ] Transformed 993 transitions.
[2026-05-26 09:00:11] [INFO ] Found NUPN structural information;
[2026-05-26 09:00:11] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 731 transition count 603
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 731 transition count 603
Applied a total of 12 rules in 128 ms. Remains 731 /737 variables (removed 6) and now considering 603/609 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5677519118610940327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14338621743540521788.kers'
[2026-05-26 09:00:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5677519118610940327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14338621743540521788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 731 cols 1877 entries
Finished phase 1 with 507 SingleSign rule and 40 generalized
[2026-05-26 09:00:11] [INFO ] Computed 184 invariants in 2 ms
Computed 184 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14338621743540521788.kers
Total runtime 4 ms.
[2026-05-26 09:00:12] [INFO ] Implicit Places using invariants in 605 ms returned [136, 144, 152, 160, 184, 214, 222, 230, 238, 262, 264, 291, 299, 307, 315, 339, 341, 368, 376, 384, 392, 416, 418, 445, 453, 461, 469, 493, 495, 523, 531, 539, 547, 571, 573, 600, 608, 616, 624, 648, 650, 677, 685, 693, 701, 725, 727]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 639 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 684/737 places, 603/609 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 653 transition count 572
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 653 transition count 572
Applied a total of 62 rules in 51 ms. Remains 653 /684 variables (removed 31) and now considering 572/603 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14251812479935288154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15286624890045848763.kers'
[2026-05-26 09:00:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14251812479935288154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15286624890045848763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 572 rows 653 cols 1622 entries
Finished phase 1 with 516 SingleSign rule and 0 generalized
[2026-05-26 09:00:12] [INFO ] Computed 137 invariants in 6 ms
Computed 137 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15286624890045848763.kers
Total runtime 7 ms.
[2026-05-26 09:00:12] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-26 09:00:12] [INFO ] Invariant cache hit.
[2026-05-26 09:00:13] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 09:00:14] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 653/737 places, 572/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3054 ms. Remains : 653/737 places, 572/609 transitions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Applied a total of 0 rules in 16 ms. Remains 653 /653 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2026-05-26 09:00:14] [INFO ] Invariant cache hit.
[2026-05-26 09:00:14] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-26 09:00:14] [INFO ] Invariant cache hit.
[2026-05-26 09:00:15] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 09:00:16] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Running 571 sub problems to find dead transitions.
[2026-05-26 09:00:16] [INFO ] Invariant cache hit.
[2026-05-26 09:00:16] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/652 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (OVERLAPS) 1/653 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1225 variables, and 147 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 0/653 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/652 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (OVERLAPS) 1/653 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/653 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 572/1225 variables, 653/800 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1225 variables, 152/952 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1225 variables, 571/1523 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/1225 variables, and 1523 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 653/653 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in LTL mode , in 1 iterations and 62516 ms. Remains : 653/653 places, 572/572 transitions.
Support contains 42 out of 653 places after structural reductions.
[2026-05-26 09:01:17] [INFO ] Flatten gal took : 96 ms
[2026-05-26 09:01:17] [INFO ] Flatten gal took : 37 ms
[2026-05-26 09:01:17] [INFO ] Input system was already deterministic with 572 transitions.
Support contains 40 out of 653 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (198 resets) in 1817 ms. (22 steps per ms) remains 3/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
[2026-05-26 09:01:18] [INFO ] Invariant cache hit.
[2026-05-26 09:01:18] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 548/653 variables, 132/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/653 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 572/1225 variables, 653/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1225 variables, 152/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1225 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1225 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1225/1225 variables, and 943 constraints, problems are : Problem set: 0 solved, 3 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 653/653 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/3 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 548/653 variables, 132/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/653 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 572/1225 variables, 653/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1225 variables, 152/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1225 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1225 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1225/1225 variables, and 947 constraints, problems are : Problem set: 0 solved, 3 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 653/653 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1934ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 436 ms.
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 653 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 556
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 637 transition count 540
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 621 transition count 540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 619 transition count 538
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 619 transition count 538
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 130 place count 588 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 587 transition count 510
Free-agglomeration rule applied 163 times.
Iterating global reduction 2 with 163 rules applied. Total rules applied 295 place count 587 transition count 347
Reduce places removed 163 places and 0 transitions.
Graph (complete) has 827 edges and 424 vertex of which 67 are kept as prefixes of interest. Removing 357 places using SCC suffix rule.2 ms
Discarding 357 places :
Also discarding 280 output transitions
Drop transitions (Output transitions of discarded places.) removed 280 transitions
Iterating post reduction 2 with 164 rules applied. Total rules applied 459 place count 67 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 473 place count 67 transition count 53
Applied a total of 473 rules in 147 ms. Remains 67 /653 variables (removed 586) and now considering 53/572 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 67/653 places, 53/572 transitions.
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA Parking-PT-832-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 653 transition count 558
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 639 transition count 558
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 28 place count 639 transition count 543
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 58 place count 624 transition count 543
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 621 transition count 540
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 621 transition count 540
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 124 place count 591 transition count 510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 590 transition count 513
Applied a total of 126 rules in 118 ms. Remains 590 /653 variables (removed 63) and now considering 513/572 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9216431629193563071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2201402751801535018.kers'
[2026-05-26 09:01:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9216431629193563071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2201402751801535018.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 513 rows 589 cols 1985 entries
Finished phase 1 with 453 SingleSign rule and 0 generalized
[2026-05-26 09:01:21] [INFO ] Computed 137 invariants in 2 ms
Computed 137 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2201402751801535018.kers
Total runtime 3 ms.
[2026-05-26 09:01:22] [INFO ] Implicit Places using invariants in 308 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/653 places, 513/572 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 588 transition count 528
Applied a total of 2 rules in 40 ms. Remains 588 /589 variables (removed 1) and now considering 528/513 (removed -15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10411837025445251343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1193614583329627526.kers'
[2026-05-26 09:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10411837025445251343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1193614583329627526.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 528 rows 588 cols 2015 entries
Finished phase 1 with 452 SingleSign rule and 0 generalized
[2026-05-26 09:01:22] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1193614583329627526.kers
Total runtime 3 ms.
[2026-05-26 09:01:22] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-26 09:01:22] [INFO ] Invariant cache hit.
[2026-05-26 09:01:22] [INFO ] State equation strengthened by 214 read => feed constraints.
[2026-05-26 09:01:24] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 588/653 places, 528/572 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2432 ms. Remains : 588/653 places, 528/572 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(G(p0))&&F((!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-02
Product exploration explored 100000 steps with 512 reset in 648 ms.
Product exploration explored 100000 steps with 509 reset in 646 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge based reduction with 11 factoid took 58 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (203 resets) in 621 ms. (64 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 96 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Knowledge-based reduction took 492 ms.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 3 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 528/528 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2026-05-26 09:01:26] [INFO ] Invariant cache hit.
[2026-05-26 09:01:26] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-26 09:01:26] [INFO ] Invariant cache hit.
[2026-05-26 09:01:26] [INFO ] State equation strengthened by 214 read => feed constraints.
[2026-05-26 09:01:28] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
[2026-05-26 09:01:28] [INFO ] Redundant transitions in 35 ms returned []
Running 523 sub problems to find dead transitions.
[2026-05-26 09:01:28] [INFO ] Invariant cache hit.
[2026-05-26 09:01:28] [INFO ] State equation strengthened by 214 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32207 ms. Remains : 588/588 places, 528/528 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge based reduction with 11 factoid took 46 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 30305 steps (152 resets) in 266 ms. (113 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Knowledge-based reduction took 405 ms.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 515 reset in 499 ms.
Product exploration explored 100000 steps with 515 reset in 575 ms.
Built C files in :
/tmp/ltsmin11667096205824760706
[2026-05-26 09:02:00] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2026-05-26 09:02:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:02:00] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2026-05-26 09:02:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:02:00] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2026-05-26 09:02:00] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:02:00] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11667096205824760706
Running compilation step : cd /tmp/ltsmin11667096205824760706;'/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 1329 ms.
Running link step : cd /tmp/ltsmin11667096205824760706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11667096205824760706;'/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/stateBased17814224778659246187.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 528/528 transitions.
Applied a total of 0 rules in 19 ms. Remains 588 /588 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2026-05-26 09:02:15] [INFO ] Invariant cache hit.
[2026-05-26 09:02:15] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-26 09:02:15] [INFO ] Invariant cache hit.
[2026-05-26 09:02:15] [INFO ] State equation strengthened by 214 read => feed constraints.
[2026-05-26 09:02:17] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2026-05-26 09:02:17] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1991 ms. Remains : 588/588 places, 528/528 transitions.
Built C files in :
/tmp/ltsmin685256955085092638
[2026-05-26 09:02:17] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2026-05-26 09:02:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:02:17] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2026-05-26 09:02:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:02:17] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2026-05-26 09:02:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:02:17] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin685256955085092638
Running compilation step : cd /tmp/ltsmin685256955085092638;'/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 1194 ms.
Running link step : cd /tmp/ltsmin685256955085092638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin685256955085092638;'/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/stateBased16648509662717946031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 09:02:32] [INFO ] Flatten gal took : 49 ms
[2026-05-26 09:02:32] [INFO ] Flatten gal took : 34 ms
[2026-05-26 09:02:32] [INFO ] Time to serialize gal into /tmp/LTL15669811234387126928.gal : 9 ms
[2026-05-26 09:02:32] [INFO ] Time to serialize properties into /tmp/LTL1096052235412407198.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/LTL15669811234387126928.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2372397203681629615.hoa' '-atoms' '/tmp/LTL1096052235412407198.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/LTL1096052235412407198.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2372397203681629615.hoa
Reverse transition relation is NOT exact ! Due to transitions t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2026-05-26 09:02:47] [INFO ] Flatten gal took : 29 ms
[2026-05-26 09:02:47] [INFO ] Flatten gal took : 33 ms
[2026-05-26 09:02:47] [INFO ] Time to serialize gal into /tmp/LTL11203665169181646540.gal : 13 ms
[2026-05-26 09:02:47] [INFO ] Time to serialize properties into /tmp/LTL12681933274852165533.ltl : 7 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/LTL11203665169181646540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12681933274852165533.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 : !((G((F(G("(p624!=1)")))&&(F((!("((p545==1)&&(p580==1))"))U(("((p624!=1)&&(!((p545==1)&&(p580==1))))")||(G(!("((p545==1)&&(p580==1))")...163
Formula 0 simplified : F(GF!"(p624!=1)" | G("((p545==1)&&(p580==1))" M !"((p624!=1)&&(!((p545==1)&&(p580==1))))"))
Reverse transition relation is NOT exact ! Due to transitions t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2026-05-26 09:03:02] [INFO ] Flatten gal took : 36 ms
[2026-05-26 09:03:02] [INFO ] Applying decomposition
[2026-05-26 09:03:02] [INFO ] Flatten gal took : 26 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/graph11838669371289307677.txt' '-o' '/tmp/graph11838669371289307677.bin' '-w' '/tmp/graph11838669371289307677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11838669371289307677.bin' '-l' '-1' '-v' '-w' '/tmp/graph11838669371289307677.weights' '-q' '0' '-e' '0.001'
[2026-05-26 09:03:02] [INFO ] Decomposing Gal with order
[2026-05-26 09:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:03:02] [INFO ] Removed a total of 700 redundant transitions.
[2026-05-26 09:03:03] [INFO ] Flatten gal took : 305 ms
[2026-05-26 09:03:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 61 ms.
[2026-05-26 09:03:03] [INFO ] Time to serialize gal into /tmp/LTL13894842627376003128.gal : 13 ms
[2026-05-26 09:03:03] [INFO ] Time to serialize properties into /tmp/LTL798810000284524390.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/LTL13894842627376003128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL798810000284524390.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 : !((G((F(G("(i12.u202.p624!=1)")))&&(F((!("((i11.u180.p545==1)&&(i11.u190.p580==1))"))U(("((i12.u202.p624!=1)&&(!((i11.u180.p545==1)&&(...235
Formula 0 simplified : F(GF!"(i12.u202.p624!=1)" | G("((i11.u180.p545==1)&&(i11.u190.p580==1))" M !"((i12.u202.p624!=1)&&(!((i11.u180.p545==1)&&(i11.u190.p...168
Reverse transition relation is NOT exact ! Due to transitions i11.u190.t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...175
Computing Next relation with stutter on 7.8311e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1072 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,10.7901,411860,1,0,860331,1947,9227,2.03318e+06,478,7846,918578
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLFireability-02 finished in 114734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(((p1 U p2)&&F(p3)))))'
Support contains 6 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 653 transition count 557
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 638 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 637 transition count 556
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 32 place count 637 transition count 541
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 62 place count 622 transition count 541
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 620 transition count 539
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 620 transition count 539
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 128 place count 589 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 588 transition count 527
Applied a total of 130 rules in 69 ms. Remains 588 /653 variables (removed 65) and now considering 527/572 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7716960640532578009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12796673936776791274.kers'
[2026-05-26 09:03:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7716960640532578009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12796673936776791274.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 527 rows 588 cols 2008 entries
Finished phase 1 with 451 SingleSign rule and 0 generalized
[2026-05-26 09:03:16] [INFO ] Computed 137 invariants in 6 ms
Computed 137 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12796673936776791274.kers
Total runtime 7 ms.
[2026-05-26 09:03:16] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-26 09:03:16] [INFO ] Invariant cache hit.
[2026-05-26 09:03:16] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:03:18] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
[2026-05-26 09:03:18] [INFO ] Redundant transitions in 5 ms returned []
Running 522 sub problems to find dead transitions.
[2026-05-26 09:03:18] [INFO ] Invariant cache hit.
[2026-05-26 09:03:18] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 527/1115 variables, 588/725 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1115 variables, 220/945 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1115/1115 variables, and 945 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 588/588 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 527/1115 variables, 588/725 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1115 variables, 220/945 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1115 variables, 522/1467 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1115 variables, and 1467 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 588/588 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 588/653 places, 527/572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62375 ms. Remains : 588/653 places, 527/572 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(((p1 U p2)&&F(p3)))))'
Stuttering acceptance computed with spot in 231 ms :[(NOT p3), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Parking-PT-832-LTLFireability-03
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 62642 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(p1))))'
Support contains 3 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 653 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 556
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 637 transition count 540
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 621 transition count 540
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 618 transition count 537
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 618 transition count 537
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 588 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 587 transition count 510
Applied a total of 132 rules in 64 ms. Remains 587 /653 variables (removed 66) and now considering 510/572 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4929844011467303675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4467468915958976211.kers'
[2026-05-26 09:04:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4929844011467303675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4467468915958976211.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 510 rows 586 cols 1979 entries
Finished phase 1 with 450 SingleSign rule and 0 generalized
[2026-05-26 09:04:19] [INFO ] Computed 137 invariants in 2 ms
Computed 137 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4467468915958976211.kers
Total runtime 6 ms.
[2026-05-26 09:04:19] [INFO ] Implicit Places using invariants in 348 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/653 places, 510/572 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 585 transition count 525
Applied a total of 2 rules in 41 ms. Remains 585 /586 variables (removed 1) and now considering 525/510 (removed -15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14283050874813512516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14687964630536689257.kers'
[2026-05-26 09:04:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14283050874813512516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14687964630536689257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 525 rows 585 cols 2009 entries
Finished phase 1 with 449 SingleSign rule and 0 generalized
[2026-05-26 09:04:19] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14687964630536689257.kers
Total runtime 3 ms.
[2026-05-26 09:04:19] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-26 09:04:19] [INFO ] Invariant cache hit.
[2026-05-26 09:04:19] [INFO ] State equation strengthened by 214 read => feed constraints.
[2026-05-26 09:04:21] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/653 places, 525/572 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2387 ms. Remains : 585/653 places, 525/572 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(p1))))'
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-04
Stuttering criterion allowed to conclude after 314 steps with 1 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-04 finished in 2510 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(X((X(p0)||!F(p1))))) U p2)))'
Support contains 5 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 651 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 651 transition count 570
Applied a total of 4 rules in 23 ms. Remains 651 /653 variables (removed 2) and now considering 570/572 (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-5450154483757402138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8615140200842839142.kers'
[2026-05-26 09:04:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5450154483757402138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8615140200842839142.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 570 rows 651 cols 1617 entries
Finished phase 1 with 514 SingleSign rule and 0 generalized
[2026-05-26 09:04:21] [INFO ] Computed 137 invariants in 4 ms
Computed 137 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8615140200842839142.kers
Total runtime 5 ms.
[2026-05-26 09:04:21] [INFO ] Implicit Places using invariants in 247 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 248 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/653 places, 570/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 650/653 places, 570/572 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(X((X(p0)||!F(p1))))) U p2)))'
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), true]
Running random walk in product with property : Parking-PT-832-LTLFireability-05
Stuttering criterion allowed to conclude after 241 steps with 1 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-05 finished in 568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(X(G(p1)) U (p2||X(p3))))))'
Support contains 3 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 650 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 650 transition count 569
Applied a total of 6 rules in 22 ms. Remains 650 /653 variables (removed 3) and now considering 569/572 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-578348949723697289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14223068153221106925.kers'
[2026-05-26 09:04:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-578348949723697289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14223068153221106925.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 569 rows 650 cols 1615 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 09:04:22] [INFO ] Computed 137 invariants in 7 ms
Computed 137 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14223068153221106925.kers
Total runtime 8 ms.
[2026-05-26 09:04:22] [INFO ] Implicit Places using invariants in 253 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/653 places, 569/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 649/653 places, 569/572 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(X(G(p1)) U (p2||X(p3))))))'
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 1270 ms.
Product exploration explored 100000 steps with 50000 reset in 1293 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 8 states, 20 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA Parking-PT-832-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-07 finished in 3204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 651 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 651 transition count 570
Applied a total of 4 rules in 23 ms. Remains 651 /653 variables (removed 2) and now considering 570/572 (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-16200669789980725317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10869899575296893199.kers'
[2026-05-26 09:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16200669789980725317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10869899575296893199.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 570 rows 651 cols 1617 entries
Finished phase 1 with 514 SingleSign rule and 0 generalized
[2026-05-26 09:04:25] [INFO ] Computed 137 invariants in 5 ms
Computed 137 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10869899575296893199.kers
Total runtime 6 ms.
[2026-05-26 09:04:25] [INFO ] Implicit Places using invariants in 253 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/653 places, 570/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 650/653 places, 570/572 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1742 steps with 8 reset in 14 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 652 transition count 556
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 637 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 636 transition count 555
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 32 place count 636 transition count 540
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 62 place count 621 transition count 540
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 618 transition count 537
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 618 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 130 place count 587 transition count 506
Applied a total of 130 rules in 56 ms. Remains 587 /653 variables (removed 66) and now considering 506/572 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7691223954353905796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12158913683588530803.kers'
[2026-05-26 09:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7691223954353905796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12158913683588530803.kers]
Culling duplicate invariants (modulo rational): removing 129 columns.
Culled 129 columns in 0 ms.
// Phase 1: matrix 506 rows 458 cols 1020 entries
Finished phase 1 with 450 SingleSign rule and 0 generalized
[2026-05-26 09:04:25] [INFO ] Computed 137 invariants in 2 ms
Computed 137 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12158913683588530803.kers
Total runtime 3 ms.
[2026-05-26 09:04:26] [INFO ] Implicit Places using invariants in 297 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/653 places, 506/572 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 585 transition count 505
Applied a total of 2 rules in 20 ms. Remains 585 /586 variables (removed 1) and now considering 505/506 (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-7566778482484688130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4154954416000976167.kers'
[2026-05-26 09:04:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7566778482484688130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4154954416000976167.kers]
Culling duplicate invariants (modulo rational): removing 128 columns.
Culled 128 columns in 0 ms.
// Phase 1: matrix 505 rows 457 cols 1018 entries
Finished phase 1 with 449 SingleSign rule and 0 generalized
[2026-05-26 09:04:26] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4154954416000976167.kers
Total runtime 3 ms.
[2026-05-26 09:04:26] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-26 09:04:26] [INFO ] Invariant cache hit.
[2026-05-26 09:04:26] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/653 places, 505/572 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 999 ms. Remains : 585/653 places, 505/572 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 36 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-09
Product exploration explored 100000 steps with 512 reset in 483 ms.
Product exploration explored 100000 steps with 511 reset in 562 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 44 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 26586 steps (134 resets) in 163 ms. (162 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 43 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 32 ms :[(NOT p0)]
Knowledge-based reduction took 254 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 15 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2026-05-26 09:04:28] [INFO ] Invariant cache hit.
[2026-05-26 09:04:28] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-26 09:04:28] [INFO ] Invariant cache hit.
[2026-05-26 09:04:28] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2026-05-26 09:04:28] [INFO ] Redundant transitions in 2 ms returned []
Running 337 sub problems to find dead transitions.
[2026-05-26 09:04:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60713 ms. Remains : 585/585 places, 505/505 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 46 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 34344 steps (173 resets) in 225 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 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 42 ms :[(NOT p0)]
Knowledge-based reduction took 273 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 515 reset in 490 ms.
Product exploration explored 100000 steps with 509 reset in 555 ms.
Built C files in :
/tmp/ltsmin16999222429594037020
[2026-05-26 09:05:30] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2026-05-26 09:05:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:05:30] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2026-05-26 09:05:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:05:30] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2026-05-26 09:05:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:05:30] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16999222429594037020
Running compilation step : cd /tmp/ltsmin16999222429594037020;'/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 1128 ms.
Running link step : cd /tmp/ltsmin16999222429594037020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16999222429594037020;'/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/stateBased10836383422348115872.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2026-05-26 09:05:45] [INFO ] Invariant cache hit.
[2026-05-26 09:05:45] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-26 09:05:45] [INFO ] Invariant cache hit.
[2026-05-26 09:05:45] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2026-05-26 09:05:45] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 641 ms. Remains : 585/585 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin12445125804717921822
[2026-05-26 09:05:45] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2026-05-26 09:05:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:05:45] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2026-05-26 09:05:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:05:45] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2026-05-26 09:05:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:05:45] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12445125804717921822
Running compilation step : cd /tmp/ltsmin12445125804717921822;'/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 1104 ms.
Running link step : cd /tmp/ltsmin12445125804717921822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12445125804717921822;'/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/stateBased97416998981272559.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 09:06:00] [INFO ] Flatten gal took : 12 ms
[2026-05-26 09:06:00] [INFO ] Flatten gal took : 11 ms
[2026-05-26 09:06:00] [INFO ] Time to serialize gal into /tmp/LTL9989359680161873178.gal : 6 ms
[2026-05-26 09:06:01] [INFO ] Time to serialize properties into /tmp/LTL16148995344047330166.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/LTL9989359680161873178.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3414196263062959995.hoa' '-atoms' '/tmp/LTL16148995344047330166.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/LTL16148995344047330166.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3414196263062959995.hoa
Detected timeout of ITS tools.
[2026-05-26 09:06:16] [INFO ] Flatten gal took : 10 ms
[2026-05-26 09:06:16] [INFO ] Flatten gal took : 11 ms
[2026-05-26 09:06:16] [INFO ] Time to serialize gal into /tmp/LTL2441922518010592980.gal : 2 ms
[2026-05-26 09:06:16] [INFO ] Time to serialize properties into /tmp/LTL8866752889099810065.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/LTL2441922518010592980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8866752889099810065.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 : !((F(G("(p157!=1)"))))
Formula 0 simplified : GF!"(p157!=1)"
Detected timeout of ITS tools.
[2026-05-26 09:06:31] [INFO ] Flatten gal took : 8 ms
[2026-05-26 09:06:31] [INFO ] Applying decomposition
[2026-05-26 09:06:31] [INFO ] Flatten gal took : 8 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/graph10222534215491728802.txt' '-o' '/tmp/graph10222534215491728802.bin' '-w' '/tmp/graph10222534215491728802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10222534215491728802.bin' '-l' '-1' '-v' '-w' '/tmp/graph10222534215491728802.weights' '-q' '0' '-e' '0.001'
[2026-05-26 09:06:31] [INFO ] Decomposing Gal with order
[2026-05-26 09:06:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:06:31] [INFO ] Removed a total of 112 redundant transitions.
[2026-05-26 09:06:31] [INFO ] Flatten gal took : 30 ms
[2026-05-26 09:06:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 7 ms.
[2026-05-26 09:06:31] [INFO ] Time to serialize gal into /tmp/LTL7879193617035013081.gal : 7 ms
[2026-05-26 09:06:31] [INFO ] Time to serialize properties into /tmp/LTL13016968466803129392.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/LTL7879193617035013081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13016968466803129392.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 : !((F(G("(i5.u68.p157!=1)"))))
Formula 0 simplified : GF!"(i5.u68.p157!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-832-LTLFireability-09 finished in 140586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((p0&&F(p1)))))&&(p0 U X(p2))))'
Support contains 5 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 650 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 650 transition count 569
Applied a total of 6 rules in 28 ms. Remains 650 /653 variables (removed 3) and now considering 569/572 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11087372060399800011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12974905369719178790.kers'
[2026-05-26 09:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11087372060399800011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12974905369719178790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 569 rows 650 cols 1615 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 09:06:46] [INFO ] Computed 137 invariants in 2 ms
Computed 137 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12974905369719178790.kers
Total runtime 3 ms.
[2026-05-26 09:06:46] [INFO ] Implicit Places using invariants in 258 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/653 places, 569/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 649/653 places, 569/572 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((p0&&F(p1)))))&&(p0 U X(p2))))'
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-832-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-10 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p0)))'
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 650 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 650 transition count 569
Applied a total of 6 rules in 25 ms. Remains 650 /653 variables (removed 3) and now considering 569/572 (removed 3) transitions.
[2026-05-26 09:06:46] [INFO ] Invariant cache hit.
[2026-05-26 09:06:47] [INFO ] Implicit Places using invariants in 239 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/653 places, 569/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 649/653 places, 569/572 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p0)))'
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-12
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-12 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 652 transition count 555
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 636 transition count 555
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 636 transition count 539
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 620 transition count 539
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 617 transition count 536
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 617 transition count 536
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 132 place count 586 transition count 505
Applied a total of 132 rules in 47 ms. Remains 586 /653 variables (removed 67) and now considering 505/572 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13941730365113713580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6128739091054277392.kers'
[2026-05-26 09:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13941730365113713580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6128739091054277392.kers]
Culling duplicate invariants (modulo rational): removing 129 columns.
Culled 129 columns in 0 ms.
// Phase 1: matrix 505 rows 457 cols 1018 entries
Finished phase 1 with 449 SingleSign rule and 0 generalized
[2026-05-26 09:06:47] [INFO ] Computed 137 invariants in 2 ms
Computed 137 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6128739091054277392.kers
Total runtime 3 ms.
[2026-05-26 09:06:47] [INFO ] Implicit Places using invariants in 233 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 234 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/653 places, 505/572 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 584 transition count 504
Applied a total of 2 rules in 20 ms. Remains 584 /585 variables (removed 1) and now considering 504/505 (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-14362458640528143254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16319314814908781614.kers'
[2026-05-26 09:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14362458640528143254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16319314814908781614.kers]
Culling duplicate invariants (modulo rational): removing 128 columns.
Culled 128 columns in 0 ms.
// Phase 1: matrix 504 rows 456 cols 1016 entries
Finished phase 1 with 448 SingleSign rule and 0 generalized
[2026-05-26 09:06:47] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16319314814908781614.kers
Total runtime 3 ms.
[2026-05-26 09:06:47] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-26 09:06:47] [INFO ] Invariant cache hit.
[2026-05-26 09:06:48] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/653 places, 504/572 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 909 ms. Remains : 584/653 places, 504/572 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-13
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 972 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(F((G(p0)||(p0&&F(G(p1))))))||(!p2&&F(p3)&&F((G(p0)||(p0&&F(G(p1)))))))))'
Support contains 5 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 653 transition count 558
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 639 transition count 558
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 639 transition count 544
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 625 transition count 544
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 622 transition count 541
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 622 transition count 541
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 591 transition count 510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 590 transition count 513
Applied a total of 126 rules in 54 ms. Remains 590 /653 variables (removed 63) and now considering 513/572 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-429016202838932867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3549930396621624221.kers'
[2026-05-26 09:06:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-429016202838932867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3549930396621624221.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 513 rows 589 cols 1973 entries
Finished phase 1 with 453 SingleSign rule and 0 generalized
[2026-05-26 09:06:48] [INFO ] Computed 137 invariants in 6 ms
Computed 137 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3549930396621624221.kers
Total runtime 7 ms.
[2026-05-26 09:06:48] [INFO ] Implicit Places using invariants in 249 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/653 places, 513/572 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 588 transition count 528
Applied a total of 2 rules in 23 ms. Remains 588 /589 variables (removed 1) and now considering 528/513 (removed -15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-878841151220514504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13995397743930793360.kers'
[2026-05-26 09:06:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-878841151220514504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13995397743930793360.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 528 rows 588 cols 2003 entries
Finished phase 1 with 452 SingleSign rule and 0 generalized
[2026-05-26 09:06:48] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13995397743930793360.kers
Total runtime 3 ms.
[2026-05-26 09:06:48] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-26 09:06:48] [INFO ] Invariant cache hit.
[2026-05-26 09:06:49] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:06:50] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 588/653 places, 528/572 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2293 ms. Remains : 588/653 places, 528/572 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(F((G(p0)||(p0&&F(G(p1))))))||(F(p2)&&F((G(p0)||(p0&&F(G(p1)))))&&p3))))'
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-832-LTLFireability-14
Product exploration explored 100000 steps with 513 reset in 530 ms.
Product exploration explored 100000 steps with 519 reset in 609 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge based reduction with 36 factoid took 120 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (205 resets) in 299 ms. (133 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2026-05-26 09:06:52] [INFO ] Invariant cache hit.
[2026-05-26 09:06:52] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/588 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 528/1116 variables, 588/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 220/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1116 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 944 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 588/588 constraints, ReadFeed: 220/220 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/588 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 528/1116 variables, 588/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 220/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 1/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1116 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1116 variables, and 945 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 588/588 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4337 steps, including 30 resets, run visited all 1 properties in 31 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 35 ms.
Knowledge based reduction with 36 factoid took 207 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1364 ms.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 528/528 transitions.
Applied a total of 0 rules in 30 ms. Remains 588 /588 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2026-05-26 09:06:53] [INFO ] Invariant cache hit.
[2026-05-26 09:06:53] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-26 09:06:53] [INFO ] Invariant cache hit.
[2026-05-26 09:06:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:06:55] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2026-05-26 09:06:55] [INFO ] Redundant transitions in 4 ms returned []
Running 523 sub problems to find dead transitions.
[2026-05-26 09:06:55] [INFO ] Invariant cache hit.
[2026-05-26 09:06:55] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (OVERLAPS) 528/1116 variables, 588/724 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1116 variables, 220/944 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 944 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 588/588 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (OVERLAPS) 528/1116 variables, 588/724 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1116 variables, 220/944 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 523/1467 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1116/1116 variables, and 1467 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 588/588 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62220 ms. Remains : 588/588 places, 528/528 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge based reduction with 10 factoid took 105 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (199 resets) in 334 ms. (119 steps per ms) remains 0/6 properties
Knowledge based reduction with 10 factoid took 160 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 431 ms.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 514 reset in 527 ms.
Product exploration explored 100000 steps with 511 reset in 593 ms.
Built C files in :
/tmp/ltsmin18437047126702002383
[2026-05-26 09:07:57] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2026-05-26 09:07:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:07:57] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2026-05-26 09:07:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:07:57] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2026-05-26 09:07:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:07:57] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18437047126702002383
Running compilation step : cd /tmp/ltsmin18437047126702002383;'/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 1216 ms.
Running link step : cd /tmp/ltsmin18437047126702002383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18437047126702002383;'/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/stateBased1498581266197979318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 528/528 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 587 transition count 527
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 587 transition count 526
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 586 transition count 526
Applied a total of 4 rules in 27 ms. Remains 586 /588 variables (removed 2) and now considering 526/528 (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-8433963154350547388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8887947928378668838.kers'
[2026-05-26 09:08:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8433963154350547388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8887947928378668838.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 526 rows 586 cols 1999 entries
Finished phase 1 with 450 SingleSign rule and 0 generalized
[2026-05-26 09:08:12] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8887947928378668838.kers
Total runtime 3 ms.
[2026-05-26 09:08:12] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-26 09:08:12] [INFO ] Invariant cache hit.
[2026-05-26 09:08:12] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:08:14] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned []
Implicit Place search using SMT with State Equation took 1928 ms to find 0 implicit places.
[2026-05-26 09:08:14] [INFO ] Redundant transitions in 2 ms returned []
Running 521 sub problems to find dead transitions.
[2026-05-26 09:08:14] [INFO ] Invariant cache hit.
[2026-05-26 09:08:14] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 526/1112 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 220/942 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1112/1112 variables, and 942 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 526/1112 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 220/942 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 521/1463 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1112/1112 variables, and 1463 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 586/588 places, 526/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62137 ms. Remains : 586/588 places, 526/528 transitions.
Built C files in :
/tmp/ltsmin11345805073309593030
[2026-05-26 09:09:14] [INFO ] Computing symmetric may disable matrix : 526 transitions.
[2026-05-26 09:09:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:09:14] [INFO ] Computing symmetric may enable matrix : 526 transitions.
[2026-05-26 09:09:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:09:14] [INFO ] Computing Do-Not-Accords matrix : 526 transitions.
[2026-05-26 09:09:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:09:14] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11345805073309593030
Running compilation step : cd /tmp/ltsmin11345805073309593030;'/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 1228 ms.
Running link step : cd /tmp/ltsmin11345805073309593030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11345805073309593030;'/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/stateBased13637774877474506785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 09:09:29] [INFO ] Flatten gal took : 17 ms
[2026-05-26 09:09:29] [INFO ] Flatten gal took : 17 ms
[2026-05-26 09:09:29] [INFO ] Time to serialize gal into /tmp/LTL14092944998540490528.gal : 3 ms
[2026-05-26 09:09:29] [INFO ] Time to serialize properties into /tmp/LTL7159621457309486751.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/LTL14092944998540490528.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17073790683738506550.hoa' '-atoms' '/tmp/LTL7159621457309486751.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...319
Loading property file /tmp/LTL7159621457309486751.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17073790683738506550.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2026-05-26 09:09:44] [INFO ] Flatten gal took : 15 ms
[2026-05-26 09:09:44] [INFO ] Flatten gal took : 15 ms
[2026-05-26 09:09:44] [INFO ] Time to serialize gal into /tmp/LTL11530414521682191041.gal : 2 ms
[2026-05-26 09:09:44] [INFO ] Time to serialize properties into /tmp/LTL6653382284665078405.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/LTL11530414521682191041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6653382284665078405.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(F((G("(p616!=1)"))||(("(p616!=1)")&&(F(G("(p280!=1)")))))))||(((F((G("(p616!=1)"))||(("(p616!=1)")&&(F(G("(p280!=1)"))))))&&(F...202
Formula 0 simplified : G(F!"(p616!=1)" & (!"((p435!=1)||(p463!=1))" | G(F!"(p616!=1)" & (!"(p616!=1)" | GF!"(p280!=1)")) | G!"(p148!=1)") & F(GF!"(p280!=1)...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2026-05-26 09:09:59] [INFO ] Flatten gal took : 17 ms
[2026-05-26 09:09:59] [INFO ] Applying decomposition
[2026-05-26 09:09:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14551561498182382277.txt' '-o' '/tmp/graph14551561498182382277.bin' '-w' '/tmp/graph14551561498182382277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14551561498182382277.bin' '-l' '-1' '-v' '-w' '/tmp/graph14551561498182382277.weights' '-q' '0' '-e' '0.001'
[2026-05-26 09:09:59] [INFO ] Decomposing Gal with order
[2026-05-26 09:09:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:09:59] [INFO ] Removed a total of 708 redundant transitions.
[2026-05-26 09:09:59] [INFO ] Flatten gal took : 25 ms
[2026-05-26 09:09:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 18 ms.
[2026-05-26 09:09:59] [INFO ] Time to serialize gal into /tmp/LTL9760364469585252171.gal : 5 ms
[2026-05-26 09:09:59] [INFO ] Time to serialize properties into /tmp/LTL16497499667284292373.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/LTL9760364469585252171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16497499667284292373.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 : !((F((G(F((G("(i14.u202.p616!=1)"))||(("(i14.u202.p616!=1)")&&(F(G("(i7.u105.p280!=1)")))))))||(((F((G("(i14.u202.p616!=1)"))||(("(i14...279
Formula 0 simplified : G(F!"(i14.u202.p616!=1)" & (!"((i10.u151.p435!=1)||(i10.u155.p463!=1))" | G(F!"(i14.u202.p616!=1)" & (!"(i14.u202.p616!=1)" | GF!"(i...251
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-832-LTLFireability-14 finished in 206622 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&&F(p1)))&&G((p2||X((X(p2) U (p2&&X(p2)))))))))'
Support contains 3 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 650 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 650 transition count 569
Applied a total of 6 rules in 25 ms. Remains 650 /653 variables (removed 3) and now considering 569/572 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-602414912484079815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1402863759763215927.kers'
[2026-05-26 09:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-602414912484079815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1402863759763215927.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 569 rows 650 cols 1615 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 09:10:14] [INFO ] Computed 137 invariants in 2 ms
Computed 137 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1402863759763215927.kers
Total runtime 3 ms.
[2026-05-26 09:10:15] [INFO ] Implicit Places using invariants in 245 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/653 places, 569/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 282 ms. Remains : 649/653 places, 569/572 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&&F(p1)))&&G((p2||X((X(p2) U (p2&&X(p2)))))))))'
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : Parking-PT-832-LTLFireability-15
Stuttering criterion allowed to conclude after 218 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 624 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)))'
Spot run failed in 70 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.
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(F((G(p0)||(p0&&F(G(p1))))))||(!p2&&F(p3)&&F((G(p0)||(p0&&F(G(p1)))))))))'
Spot run failed in 45 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-26 09:10:15] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9086921884685463291
[2026-05-26 09:10:15] [INFO ] Applying decomposition
[2026-05-26 09:10:15] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2026-05-26 09:10:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:10:15] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2026-05-26 09:10:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:10:15] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11508422276999582007.txt' '-o' '/tmp/graph11508422276999582007.bin' '-w' '/tmp/graph11508422276999582007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11508422276999582007.bin' '-l' '-1' '-v' '-w' '/tmp/graph11508422276999582007.weights' '-q' '0' '-e' '0.001'
[2026-05-26 09:10:15] [INFO ] Decomposing Gal with order
[2026-05-26 09:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:10:15] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2026-05-26 09:10:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:10:15] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9086921884685463291
Running compilation step : cd /tmp/ltsmin9086921884685463291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
[2026-05-26 09:10:15] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-26 09:10:15] [INFO ] Flatten gal took : 20 ms
[2026-05-26 09:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-26 09:10:15] [INFO ] Time to serialize gal into /tmp/LTLFireability856734622419253341.gal : 5 ms
[2026-05-26 09:10:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14986225352134424684.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/LTLFireability856734622419253341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14986225352134424684.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...276
Read 2 LTL properties
Checking formula 0 : !((F(G("(i1.i0.i1.u68.p157!=1)"))))
Formula 0 simplified : GF!"(i1.i0.i1.u68.p157!=1)"
Compilation finished in 1330 ms.
Running link step : cd /tmp/ltsmin9086921884685463291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9086921884685463291;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i1.i0.t570, i1.i0.i1.t555, i1.i0.i1.t554, i1.i0.i1.t548, i1.i0.i1.u78.t129, i1.i0.i1.u78.t130...400
Computing Next relation with stutter on 7.8311e+10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12008 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,120.159,2205500,1,0,5.5037e+06,3091,2690,7.15538e+06,229,11057,1040061
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G(F((G("(i13.u208.p616!=1)"))||(("(i13.u208.p616!=1)")&&(F(G("(i5.u108.p280!=1)")))))))||(((!("((i9.u155.p435==1)&&(i9.u172.p463...286
Formula 1 simplified : G(F!"(i13.u208.p616!=1)" & ("((i9.u155.p435==1)&&(i9.u172.p463==1))" | G(F!"(i13.u208.p616!=1)" & (!"(i13.u208.p616!=1)" | GF!"(i5.u...254
Computing Next relation with stutter on 7.8311e+10 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9086921884685463291;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9086921884685463291;'/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' '--ltl' '<>(([](<>(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))||(!(LTLAPp3==true)&&<>((LTLAPp4==true))&&<>(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 09:33:37] [INFO ] Applying decomposition
[2026-05-26 09:33:37] [INFO ] Flatten gal took : 19 ms
[2026-05-26 09:33:37] [INFO ] Decomposing Gal with order
[2026-05-26 09:33:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:33:37] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-26 09:33:37] [INFO ] Flatten gal took : 23 ms
[2026-05-26 09:33:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2026-05-26 09:33:37] [INFO ] Time to serialize gal into /tmp/LTLFireability14397185502073996834.gal : 4 ms
[2026-05-26 09:33:37] [INFO ] Time to serialize properties into /tmp/LTLFireability15482375324654883160.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/LTLFireability14397185502073996834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15482375324654883160.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...278
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(u157.p616!=1)"))||(("(u157.p616!=1)")&&(F(G("(u92.p280!=1)")))))))||(((!("((u122.p435==1)&&(u127.p463==1))"))&&(F("(u67...247
Formula 0 simplified : G(F!"(u157.p616!=1)" & ("((u122.p435==1)&&(u127.p463==1))" | G(F!"(u157.p616!=1)" & (!"(u157.p616!=1)" | GF!"(u92.p280!=1)")) | G!"(...215
Reverse transition relation is NOT exact ! Due to transitions t452, t455, t458, t459, t548, t553, t555, t570, u71.t129, u71.t130, u86.t111, u101.t93, u116....309
Computing Next relation with stutter on 7.8311e+10 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9086921884685463291;'/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' '--ltl' '<>(([](<>(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))||(!(LTLAPp3==true)&&<>((LTLAPp4==true))&&<>(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin9086921884685463291;'/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' '--ltl' '<>(([](<>(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))||(!(LTLAPp3==true)&&<>((LTLAPp4==true))&&<>(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
87819 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,878.264,4442740,1,0,1.08413e+07,116192,3347,1.29843e+07,322,479909,11450511
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2908640 ms.

BK_STOP 1779788919952

--------------------
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="Parking-PT-832"
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 Parking-PT-832, 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 r194-tall-177969914200540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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