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-177969914200539.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200539
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME Parking-PT-832-LTLCardinality-01
FORMULA_NAME Parking-PT-832-LTLCardinality-02
FORMULA_NAME Parking-PT-832-LTLCardinality-03
FORMULA_NAME Parking-PT-832-LTLCardinality-04
FORMULA_NAME Parking-PT-832-LTLCardinality-05
FORMULA_NAME Parking-PT-832-LTLCardinality-06
FORMULA_NAME Parking-PT-832-LTLCardinality-07
FORMULA_NAME Parking-PT-832-LTLCardinality-08
FORMULA_NAME Parking-PT-832-LTLCardinality-09
FORMULA_NAME Parking-PT-832-LTLCardinality-10
FORMULA_NAME Parking-PT-832-LTLCardinality-11
FORMULA_NAME Parking-PT-832-LTLCardinality-12
FORMULA_NAME Parking-PT-832-LTLCardinality-13
FORMULA_NAME Parking-PT-832-LTLCardinality-14
FORMULA_NAME Parking-PT-832-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779785714891

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-26 08:55:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 08:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:55:16] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-26 08:55:16] [INFO ] Transformed 737 places.
[2026-05-26 08:55:16] [INFO ] Transformed 993 transitions.
[2026-05-26 08:55:16] [INFO ] Found NUPN structural information;
[2026-05-26 08:55:16] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 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-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 729 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 729 transition count 601
Applied a total of 16 rules in 118 ms. Remains 729 /737 variables (removed 8) and now considering 601/609 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4761469746532083395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1052183581661998324.kers'
[2026-05-26 08:55:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4761469746532083395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1052183581661998324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 729 cols 1873 entries
Finished phase 1 with 505 SingleSign rule and 40 generalized
[2026-05-26 08:55:16] [INFO ] Computed 184 invariants in 3 ms
Computed 184 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1052183581661998324.kers
Total runtime 4 ms.
[2026-05-26 08:55:17] [INFO ] Implicit Places using invariants in 581 ms returned [136, 144, 152, 160, 184, 186, 213, 221, 229, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 444, 452, 460, 468, 492, 494, 521, 529, 537, 545, 569, 571, 606, 614, 622, 646, 648, 675, 683, 691, 699, 725]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 623 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 684/737 places, 601/609 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 657 transition count 574
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 657 transition count 574
Applied a total of 54 rules in 57 ms. Remains 657 /684 variables (removed 27) and now considering 574/601 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17394547283935690934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8197134043162466388.kers'
[2026-05-26 08:55:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17394547283935690934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8197134043162466388.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 574 rows 657 cols 1628 entries
Finished phase 1 with 518 SingleSign rule and 0 generalized
[2026-05-26 08:55:17] [INFO ] Computed 139 invariants in 6 ms
Computed 139 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8197134043162466388.kers
Total runtime 7 ms.
[2026-05-26 08:55:17] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-26 08:55:17] [INFO ] Invariant cache hit.
[2026-05-26 08:55:17] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:55:18] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/737 places, 574/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2457 ms. Remains : 657/737 places, 574/609 transitions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 657 /657 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2026-05-26 08:55:18] [INFO ] Invariant cache hit.
[2026-05-26 08:55:19] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-26 08:55:19] [INFO ] Invariant cache hit.
[2026-05-26 08:55:19] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:55:20] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
Running 573 sub problems to find dead transitions.
[2026-05-26 08:55:20] [INFO ] Invariant cache hit.
[2026-05-26 08:55:20] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (OVERLAPS) 1/657 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/657 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/1231 variables, and 147 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 0/657 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (OVERLAPS) 1/657 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/657 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/657 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (OVERLAPS) 574/1231 variables, 657/804 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 152/956 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 573/1529 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1231 variables, and 1529 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in LTL mode , in 1 iterations and 61888 ms. Remains : 657/657 places, 574/574 transitions.
Support contains 37 out of 657 places after structural reductions.
[2026-05-26 08:56:20] [INFO ] Flatten gal took : 76 ms
[2026-05-26 08:56:21] [INFO ] Flatten gal took : 37 ms
[2026-05-26 08:56:21] [INFO ] Input system was already deterministic with 574 transitions.
RANDOM walk for 40000 steps (201 resets) in 1802 ms. (22 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
[2026-05-26 08:56:21] [INFO ] Invariant cache hit.
[2026-05-26 08:56:21] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 200/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 448/657 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 574/1231 variables, 657/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 152/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1231 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1231/1231 variables, and 948 constraints, problems are : Problem set: 0 solved, 5 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 200/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 448/657 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 574/1231 variables, 657/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 152/949 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1231 variables, 5/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1231 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1231 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1231/1231 variables, and 954 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2334ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 748 ms.
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 623 transition count 540
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 623 transition count 540
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 588 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 140 place count 587 transition count 524
Free-agglomeration rule applied 159 times.
Iterating global reduction 2 with 159 rules applied. Total rules applied 299 place count 587 transition count 365
Reduce places removed 159 places and 0 transitions.
Graph (complete) has 870 edges and 428 vertex of which 120 are kept as prefixes of interest. Removing 308 places using SCC suffix rule.1 ms
Discarding 308 places :
Also discarding 246 output transitions
Drop transitions (Output transitions of discarded places.) removed 246 transitions
Iterating post reduction 2 with 160 rules applied. Total rules applied 459 place count 120 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 491 place count 120 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 492 place count 120 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 493 place count 119 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 494 place count 118 transition count 85
Reduce places removed 43 places and 0 transitions.
Graph (trivial) has 78 edges and 75 vertex of which 24 / 75 are part of one of the 2 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 5 with 86 rules applied. Total rules applied 580 place count 53 transition count 43
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 77 rules applied. Total rules applied 657 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 658 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 658 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 660 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 661 place count 7 transition count 7
Iterating global reduction 8 with 1 rules applied. Total rules applied 662 place count 7 transition count 7
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 8 with 2 rules applied. Total rules applied 664 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 665 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 668 place count 4 transition count 4
Applied a total of 668 rules in 150 ms. Remains 4 /657 variables (removed 653) and now considering 4/574 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 4/657 places, 4/574 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/2 properties
FORMULA Parking-PT-832-LTLCardinality-10 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' '!(F(p0))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 623 transition count 540
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 623 transition count 540
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 589 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 138 place count 588 transition count 525
Applied a total of 138 rules in 91 ms. Remains 588 /657 variables (removed 69) and now considering 525/574 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-722499660766880470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5517041442584389584.kers'
[2026-05-26 08:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-722499660766880470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5517041442584389584.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 525 rows 588 cols 2018 entries
Finished phase 1 with 449 SingleSign rule and 0 generalized
[2026-05-26 08:56:25] [INFO ] Computed 139 invariants in 9 ms
Computed 139 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5517041442584389584.kers
Total runtime 10 ms.
[2026-05-26 08:56:25] [INFO ] Implicit Places using invariants in 272 ms returned [205, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 525/574 transitions.
Applied a total of 0 rules in 23 ms. Remains 586 /586 variables (removed 0) and now considering 525/525 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 586/657 places, 525/574 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 172 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1532 ms.
Product exploration explored 100000 steps with 50000 reset in 1464 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 20 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 30 ms.
FORMULA Parking-PT-832-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLCardinality-01 finished in 3650 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)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 655 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 655 transition count 572
Applied a total of 4 rules in 43 ms. Remains 655 /657 variables (removed 2) and now considering 572/574 (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-9158684705496681396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15256674904913024631.kers'
[2026-05-26 08:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9158684705496681396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15256674904913024631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 572 rows 655 cols 1624 entries
Finished phase 1 with 516 SingleSign rule and 0 generalized
[2026-05-26 08:56:29] [INFO ] Computed 139 invariants in 4 ms
Computed 139 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15256674904913024631.kers
Total runtime 6 ms.
[2026-05-26 08:56:29] [INFO ] Implicit Places using invariants in 281 ms returned [222, 540, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 283 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 572/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 22 ms. Remains 649 /652 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-17132405945713369664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9301915457972784065.kers'
[2026-05-26 08:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17132405945713369664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9301915457972784065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 569 rows 649 cols 1609 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 08:56:29] [INFO ] Computed 136 invariants in 6 ms
Computed 136 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9301915457972784065.kers
Total runtime 7 ms.
[2026-05-26 08:56:29] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-26 08:56:29] [INFO ] Invariant cache hit.
[2026-05-26 08:56:29] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:31] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2139 ms. Remains : 649/657 places, 569/574 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)))'
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 1306 ms.
Product exploration explored 100000 steps with 50000 reset in 1354 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 2 factoid took 16 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA Parking-PT-832-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLCardinality-02 finished in 4918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(!p1))) U (p0&&X(X(p2))))))'
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 655 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 655 transition count 572
Applied a total of 4 rules in 27 ms. Remains 655 /657 variables (removed 2) and now considering 572/574 (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-14853475237532697452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8214304812884523661.kers'
[2026-05-26 08:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14853475237532697452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8214304812884523661.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 572 rows 655 cols 1624 entries
Finished phase 1 with 516 SingleSign rule and 0 generalized
[2026-05-26 08:56:34] [INFO ] Computed 139 invariants in 8 ms
Computed 139 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8214304812884523661.kers
Total runtime 10 ms.
[2026-05-26 08:56:34] [INFO ] Implicit Places using invariants in 279 ms returned [222, 540, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 280 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 572/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 25 ms. Remains 649 /652 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-8501591537080293763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2962007189466219198.kers'
[2026-05-26 08:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8501591537080293763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2962007189466219198.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 569 rows 649 cols 1609 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 08:56:34] [INFO ] Computed 136 invariants in 5 ms
Computed 136 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2962007189466219198.kers
Total runtime 6 ms.
[2026-05-26 08:56:34] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-26 08:56:34] [INFO ] Invariant cache hit.
[2026-05-26 08:56:34] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:36] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2123 ms. Remains : 649/657 places, 569/574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(!p1))) U (X(X(p2))&&p0))))'
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) p1), (NOT p2), p1, true, (NOT p2), (NOT p2), p1, p1]
Running random walk in product with property : Parking-PT-832-LTLCardinality-06
Stuttering criterion allowed to conclude after 295 steps with 27 reset in 7 ms.
FORMULA Parking-PT-832-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-06 finished in 2577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))&&(p2 U X(p2))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 655 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 655 transition count 572
Applied a total of 4 rules in 30 ms. Remains 655 /657 variables (removed 2) and now considering 572/574 (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-8773752239941852740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14522981752209985664.kers'
[2026-05-26 08:56:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8773752239941852740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14522981752209985664.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 572 rows 655 cols 1624 entries
Finished phase 1 with 516 SingleSign rule and 0 generalized
[2026-05-26 08:56:36] [INFO ] Computed 139 invariants in 2 ms
Computed 139 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14522981752209985664.kers
Total runtime 3 ms.
[2026-05-26 08:56:36] [INFO ] Implicit Places using invariants in 250 ms returned [222, 540, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 251 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 572/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 22 ms. Remains 649 /652 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-2919795828446946977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2344748399864849265.kers'
[2026-05-26 08:56:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2919795828446946977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2344748399864849265.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 569 rows 649 cols 1609 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 08:56:36] [INFO ] Computed 136 invariants in 4 ms
Computed 136 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2344748399864849265.kers
Total runtime 6 ms.
[2026-05-26 08:56:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-26 08:56:37] [INFO ] Invariant cache hit.
[2026-05-26 08:56:37] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:38] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2028 ms. Remains : 649/657 places, 569/574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))&&(p2 U X(p2))))'
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-832-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-08 finished in 2312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(!p0)) U p1) U p2)))'
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 656 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 656 transition count 573
Applied a total of 2 rules in 28 ms. Remains 656 /657 variables (removed 1) and now considering 573/574 (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-7422809603132491356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17884447732352825766.kers'
[2026-05-26 08:56:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7422809603132491356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17884447732352825766.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 573 rows 656 cols 1626 entries
Finished phase 1 with 517 SingleSign rule and 0 generalized
[2026-05-26 08:56:38] [INFO ] Computed 139 invariants in 6 ms
Computed 139 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17884447732352825766.kers
Total runtime 8 ms.
[2026-05-26 08:56:39] [INFO ] Implicit Places using invariants in 252 ms returned [222, 651]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 254 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 654/657 places, 573/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 652 transition count 571
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 652 transition count 571
Applied a total of 4 rules in 25 ms. Remains 652 /654 variables (removed 2) and now considering 571/573 (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-15808611417523216036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2024092211133250681.kers'
[2026-05-26 08:56:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15808611417523216036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2024092211133250681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 571 rows 652 cols 1616 entries
Finished phase 1 with 515 SingleSign rule and 0 generalized
[2026-05-26 08:56:39] [INFO ] Computed 137 invariants in 3 ms
Computed 137 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2024092211133250681.kers
Total runtime 4 ms.
[2026-05-26 08:56:39] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-26 08:56:39] [INFO ] Invariant cache hit.
[2026-05-26 08:56:39] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:40] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 652/657 places, 571/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1682 ms. Remains : 652/657 places, 571/574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(!p0)) U p1) U p2)))'
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (OR (NOT p1) p0), (NOT p2), true, p0]
Running random walk in product with property : Parking-PT-832-LTLCardinality-09
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-09 finished in 1896 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)))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 655 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 655 transition count 572
Applied a total of 4 rules in 26 ms. Remains 655 /657 variables (removed 2) and now considering 572/574 (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-12106312945112694571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16307449782462526333.kers'
[2026-05-26 08:56:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12106312945112694571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16307449782462526333.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 572 rows 655 cols 1624 entries
Finished phase 1 with 516 SingleSign rule and 0 generalized
[2026-05-26 08:56:40] [INFO ] Computed 139 invariants in 5 ms
Computed 139 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16307449782462526333.kers
Total runtime 7 ms.
[2026-05-26 08:56:41] [INFO ] Implicit Places using invariants in 251 ms returned [222, 540, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 252 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 572/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 21 ms. Remains 649 /652 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-6926545806053649634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12427511108477137413.kers'
[2026-05-26 08:56:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6926545806053649634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12427511108477137413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 569 rows 649 cols 1609 entries
Finished phase 1 with 513 SingleSign rule and 0 generalized
[2026-05-26 08:56:41] [INFO ] Computed 136 invariants in 4 ms
Computed 136 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12427511108477137413.kers
Total runtime 5 ms.
[2026-05-26 08:56:41] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-26 08:56:41] [INFO ] Invariant cache hit.
[2026-05-26 08:56:41] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:42] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1977 ms. Remains : 649/657 places, 569/574 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)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 1237 ms.
Product exploration explored 100000 steps with 50000 reset in 1288 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 3 factoid took 16 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA Parking-PT-832-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLCardinality-11 finished in 4637 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(F((p0 U (G(p0)||(p0&&G(!p1))))))||(!p1&&F((p0 U (G(p0)||(p0&&G(!p1)))))&&X(p2))))))'
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 656 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 656 transition count 573
Applied a total of 2 rules in 29 ms. Remains 656 /657 variables (removed 1) and now considering 573/574 (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-10780268363566964906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6965117955975708806.kers'
[2026-05-26 08:56:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10780268363566964906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6965117955975708806.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 573 rows 656 cols 1626 entries
Finished phase 1 with 517 SingleSign rule and 0 generalized
[2026-05-26 08:56:45] [INFO ] Computed 139 invariants in 2 ms
Computed 139 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6965117955975708806.kers
Total runtime 3 ms.
[2026-05-26 08:56:45] [INFO ] Implicit Places using invariants in 265 ms returned [223, 541, 651]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 271 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 653/657 places, 573/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 650 transition count 570
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 650 transition count 570
Applied a total of 6 rules in 21 ms. Remains 650 /653 variables (removed 3) and now considering 570/573 (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-18243855439474518147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7752537954041223678.kers'
[2026-05-26 08:56:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18243855439474518147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7752537954041223678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 570 rows 650 cols 1611 entries
Finished phase 1 with 514 SingleSign rule and 0 generalized
[2026-05-26 08:56:45] [INFO ] Computed 136 invariants in 2 ms
Computed 136 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7752537954041223678.kers
Total runtime 3 ms.
[2026-05-26 08:56:46] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-26 08:56:46] [INFO ] Invariant cache hit.
[2026-05-26 08:56:46] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:47] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2213 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 650/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2535 ms. Remains : 650/657 places, 570/574 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(F((p0 U (G(p0)||(p0&&G(!p1))))))||(F((p0 U (G(p0)||(p0&&G(!p1)))))&&X(p3)&&p2)))))'
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLCardinality-13
Product exploration explored 100000 steps with 507 reset in 578 ms.
Product exploration explored 100000 steps with 505 reset in 711 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 14 factoid took 229 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (200 resets) in 645 ms. (61 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
[2026-05-26 08:56:50] [INFO ] Invariant cache hit.
[2026-05-26 08:56:50] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 550/650 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 570/1220 variables, 650/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 152/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 938 constraints, problems are : Problem set: 0 solved, 3 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 550/650 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 570/1220 variables, 650/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 152/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 3/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 941 constraints, problems are : Problem set: 0 solved, 3 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 106 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 13 ms.
Knowledge based reduction with 14 factoid took 434 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Knowledge-based reduction took 2559 ms.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 570/570 transitions.
Applied a total of 0 rules in 10 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2026-05-26 08:56:52] [INFO ] Invariant cache hit.
[2026-05-26 08:56:52] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-26 08:56:52] [INFO ] Invariant cache hit.
[2026-05-26 08:56:52] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:56:54] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2026-05-26 08:56:54] [INFO ] Invariant cache hit.
[2026-05-26 08:56:54] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/650 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/650 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/1220 variables, and 144 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/650 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/650 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/650 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/650 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (OVERLAPS) 570/1220 variables, 650/794 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 152/946 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 569/1515 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1515 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Finished structural reductions in LTL mode , in 1 iterations and 62285 ms. Remains : 650/650 places, 570/570 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 14 factoid took 219 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (200 resets) in 533 ms. (74 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
[2026-05-26 08:57:55] [INFO ] Invariant cache hit.
[2026-05-26 08:57:55] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 550/650 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 570/1220 variables, 650/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 152/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 938 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 550/650 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 570/1220 variables, 650/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 152/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 3/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 941 constraints, problems are : Problem set: 0 solved, 3 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1260ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 105 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=35 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Knowledge based reduction with 14 factoid took 392 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Knowledge-based reduction took 2402 ms.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 508 reset in 539 ms.
Product exploration explored 100000 steps with 506 reset in 623 ms.
Spot run failed in 73 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11921529911439541337
[2026-05-26 08:57:58] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11921529911439541337
Running compilation step : cd /tmp/ltsmin11921529911439541337;'/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 1113 ms.
Running link step : cd /tmp/ltsmin11921529911439541337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11921529911439541337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11632445782011483040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 570/570 transitions.
Applied a total of 0 rules in 10 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2026-05-26 08:58:13] [INFO ] Invariant cache hit.
[2026-05-26 08:58:13] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-26 08:58:13] [INFO ] Invariant cache hit.
[2026-05-26 08:58:14] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-26 08:58:15] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2120 ms. Remains : 650/650 places, 570/570 transitions.
Built C files in :
/tmp/ltsmin4703607702110797487
[2026-05-26 08:58:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4703607702110797487
Running compilation step : cd /tmp/ltsmin4703607702110797487;'/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 883 ms.
Running link step : cd /tmp/ltsmin4703607702110797487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4703607702110797487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5964784339112858837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 08:58:30] [INFO ] Flatten gal took : 33 ms
[2026-05-26 08:58:30] [INFO ] Flatten gal took : 30 ms
[2026-05-26 08:58:30] [INFO ] Time to serialize gal into /tmp/LTL18423848516025603700.gal : 6 ms
[2026-05-26 08:58:30] [INFO ] Time to serialize properties into /tmp/LTL18439991591706625419.prop : 2 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/LTL18423848516025603700.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15197586448395128577.hoa' '-atoms' '/tmp/LTL18439991591706625419.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18439991591706625419.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15197586448395128577.hoa
Detected timeout of ITS tools.
[2026-05-26 08:58:46] [INFO ] Flatten gal took : 24 ms
[2026-05-26 08:58:46] [INFO ] Flatten gal took : 21 ms
[2026-05-26 08:58:46] [INFO ] Time to serialize gal into /tmp/LTL4386094325735934672.gal : 5 ms
[2026-05-26 08:58:46] [INFO ] Time to serialize properties into /tmp/LTL2522500716566151684.ltl : 2 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/LTL4386094325735934672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2522500716566151684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F(("((p215==0)||(p468==1))")U((G("((p215==0)||(p468==1))"))||(("((p215==0)||(p468==1))")&&(G(!("((p63==0)||(p483==1))"))))))...338
Formula 0 simplified : XG(FG(F"((p63==0)||(p483==1))" U !"((p215==0)||(p468==1))") & (!"((p63!=0)&&(p483!=1))" | X!"(p524!=1)" | G(F"((p63==0)||(p483==1))"...186
Detected timeout of ITS tools.
[2026-05-26 08:59:01] [INFO ] Flatten gal took : 20 ms
[2026-05-26 08:59:01] [INFO ] Applying decomposition
[2026-05-26 08:59:01] [INFO ] Flatten gal took : 22 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/graph16037334113414716364.txt' '-o' '/tmp/graph16037334113414716364.bin' '-w' '/tmp/graph16037334113414716364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16037334113414716364.bin' '-l' '-1' '-v' '-w' '/tmp/graph16037334113414716364.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:59:01] [INFO ] Decomposing Gal with order
[2026-05-26 08:59:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:59:01] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-26 08:59:01] [INFO ] Flatten gal took : 102 ms
[2026-05-26 08:59:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2026-05-26 08:59:01] [INFO ] Time to serialize gal into /tmp/LTL15027619684185989517.gal : 9 ms
[2026-05-26 08:59:01] [INFO ] Time to serialize properties into /tmp/LTL1378988565829497826.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/LTL15027619684185989517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1378988565829497826.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F(("((i6.u100.p215==0)||(i13.u160.p468==1))")U((G("((i6.u100.p215==0)||(i13.u160.p468==1))"))||(("((i6.u100.p215==0)||(i13.u...515
Formula 0 simplified : XG(FG(F"((i8.i0.i2.u31.p63==0)||(i12.u165.p483==1))" U !"((i6.u100.p215==0)||(i13.u160.p468==1))") & (!"((i8.i0.i2.u31.p63!=0)&&(i12...295
Reverse transition relation is NOT exact ! Due to transitions i2.u239.t2, i4.u78.t128, i6.u101.t110, i9.u124.t92, i11.u148.t74, i13.u170.t56, i14.u192.t38,...269
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-832-LTLCardinality-13 finished in 151186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 559
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 642 transition count 559
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 642 transition count 544
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 627 transition count 544
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 625 transition count 542
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 625 transition count 542
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 134 place count 590 transition count 507
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 2 with 2 rules applied. Total rules applied 136 place count 589 transition count 526
Applied a total of 136 rules in 73 ms. Remains 589 /657 variables (removed 68) and now considering 526/574 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14423782707658569671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1423902244904241721.kers'
[2026-05-26 08:59:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14423782707658569671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1423902244904241721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 526 rows 589 cols 2020 entries
Finished phase 1 with 450 SingleSign rule and 0 generalized
[2026-05-26 08:59:16] [INFO ] Computed 139 invariants in 2 ms
Computed 139 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1423902244904241721.kers
Total runtime 3 ms.
[2026-05-26 08:59:16] [INFO ] Implicit Places using invariants in 306 ms returned [205, 488, 585]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 307 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 526/574 transitions.
Applied a total of 0 rules in 25 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 586/657 places, 526/574 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 30 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-15
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-15 finished in 473 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(F((p0 U (G(p0)||(p0&&G(!p1))))))||(!p1&&F((p0 U (G(p0)||(p0&&G(!p1)))))&&X(p2))))))'
Spot run failed in 39 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 08:59:17] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5451519980817441107
[2026-05-26 08:59:17] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2026-05-26 08:59:17] [INFO ] Applying decomposition
[2026-05-26 08:59:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:59:17] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2026-05-26 08:59:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:59:17] [INFO ] Flatten gal took : 19 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/graph1936909853412484462.txt' '-o' '/tmp/graph1936909853412484462.bin' '-w' '/tmp/graph1936909853412484462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1936909853412484462.bin' '-l' '-1' '-v' '-w' '/tmp/graph1936909853412484462.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:59:17] [INFO ] Decomposing Gal with order
[2026-05-26 08:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:59:17] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2026-05-26 08:59:17] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:59:17] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5451519980817441107
Running compilation step : cd /tmp/ltsmin5451519980817441107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 08:59:17] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-26 08:59:17] [INFO ] Flatten gal took : 41 ms
[2026-05-26 08:59:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2026-05-26 08:59:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality14144770490145922140.gal : 17 ms
[2026-05-26 08:59:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality18398500703271851239.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/LTLCardinality14144770490145922140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18398500703271851239.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 : !((X(F((G(F(("((i4.i0.i2.u102.p215==0)||(i8.u162.p468==1))")U((G("((i4.i0.i2.u102.p215==0)||(i8.u162.p468==1))"))||(("((i4.i0.i2.u102....547
Formula 0 simplified : XG(FG(F"((i13.i1.i2.u31.p63==0)||(i8.u167.p483==1))" U !"((i4.i0.i2.u102.p215==0)||(i8.u162.p468==1))") & ("((i13.i1.i2.u31.p63==0)|...303
Compilation finished in 1286 ms.
Running link step : cd /tmp/ltsmin5451519980817441107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5451519980817441107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>(([](<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[](!(LTLAPp1==true)))))))||(!(LTLAPp1==true)&&<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[](!(LTLAPp1==true))))))&&X((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i3.u78.t128, i4.i0.i4.u103.t110, i6.u127.t92, i7.u149.t74, i8.u173.t56, i9.u195.t38, i12.u220...279
Computing Next relation with stutter on 7.8311e+10 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
3624 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,36.3301,1112992,1,0,1.86585e+06,3736,9392,6.8887e+06,608,14524,1529754
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 284683 ms.

BK_STOP 1779786000754

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-177969914200539"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;