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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.9K Mar 8 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 8 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 8 06:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 06:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Mar 8 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 8 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 355K 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 NoC3x3-PT-7A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779763533256

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 02:45:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 02:45:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:45:34] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2026-05-26 02:45:34] [INFO ] Transformed 801 places.
[2026-05-26 02:45:34] [INFO ] Transformed 1544 transitions.
[2026-05-26 02:45:34] [INFO ] Found NUPN structural information;
[2026-05-26 02:45:34] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 169 place count 632 transition count 1190
Ensure Unique test removed 40 places
Iterating global reduction 0 with 209 rules applied. Total rules applied 378 place count 592 transition count 1190
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 412 place count 592 transition count 1156
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 430 place count 592 transition count 1138
Applied a total of 430 rules in 129 ms. Remains 592 /801 variables (removed 209) and now considering 1138/1437 (removed 299) transitions.
[2026-05-26 02:45:34] [INFO ] Flow matrix only has 1134 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7395930364003133556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1272891976316054645.kers'
[2026-05-26 02:45:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7395930364003133556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1272891976316054645.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 1134 rows 583 cols 2961 entries
Finished phase 1 with 511 SingleSign rule and 10 generalized
[2026-05-26 02:45:35] [INFO ] Computed 71 invariants in 3 ms
Computed 71 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1272891976316054645.kers
Total runtime 5 ms.
[2026-05-26 02:45:35] [INFO ] Implicit Places using invariants in 413 ms returned [10, 78, 154, 216, 301, 384, 446, 498, 556]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 444 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 583/801 places, 1138/1437 transitions.
Applied a total of 0 rules in 13 ms. Remains 583 /583 variables (removed 0) and now considering 1138/1138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 602 ms. Remains : 583/801 places, 1138/1437 transitions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Applied a total of 0 rules in 13 ms. Remains 583 /583 variables (removed 0) and now considering 1138/1138 (removed 0) transitions.
[2026-05-26 02:45:35] [INFO ] Flow matrix only has 1134 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4977053259985658828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12527863314659146339.kers'
[2026-05-26 02:45:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4977053259985658828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12527863314659146339.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1134 rows 583 cols 2961 entries
Finished phase 1 with 511 SingleSign rule and 10 generalized
[2026-05-26 02:45:35] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12527863314659146339.kers
Total runtime 8 ms.
[2026-05-26 02:45:35] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-26 02:45:35] [INFO ] Flow matrix only has 1134 transitions (discarded 4 similar events)
[2026-05-26 02:45:35] [INFO ] Invariant cache hit.
[2026-05-26 02:45:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:45:36] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 1137 sub problems to find dead transitions.
[2026-05-26 02:45:36] [INFO ] Flow matrix only has 1134 transitions (discarded 4 similar events)
[2026-05-26 02:45:36] [INFO ] Invariant cache hit.
[2026-05-26 02:45:36] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1717 variables, and 62 constraints, problems are : Problem set: 0 solved, 1137 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/583 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1137/1137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1717 variables, and 62 constraints, problems are : Problem set: 0 solved, 1137 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/583 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 1137 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in LTL mode , in 1 iterations and 61112 ms. Remains : 583/583 places, 1138/1138 transitions.
Support contains 56 out of 583 places after structural reductions.
[2026-05-26 02:46:36] [INFO ] Flatten gal took : 93 ms
[2026-05-26 02:46:36] [INFO ] Flatten gal took : 52 ms
[2026-05-26 02:46:36] [INFO ] Input system was already deterministic with 1138 transitions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (8 resets) in 2698 ms. (14 steps per ms) remains 3/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
[2026-05-26 02:46:37] [INFO ] Flow matrix only has 1134 transitions (discarded 4 similar events)
[2026-05-26 02:46:37] [INFO ] Invariant cache hit.
[2026-05-26 02:46:37] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 87/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 450/545 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 38/583 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1134/1717 variables, 583/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1717 variables, 14/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1717 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1717 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1717/1717 variables, and 662 constraints, problems are : Problem set: 0 solved, 3 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 583/583 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 87/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 450/545 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 38/583 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1134/1717 variables, 583/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1717 variables, 14/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1717 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1717 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1717 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1717/1717 variables, and 667 constraints, problems are : Problem set: 0 solved, 3 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 583/583 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1717ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 26733 steps, including 104 resets, run visited all 3 properties in 123 ms. (steps per millisecond=217 )
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 133 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Graph (trivial) has 723 edges and 583 vertex of which 106 / 583 are part of one of the 9 SCC in 3 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 485 transition count 896
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 471 transition count 895
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 42 place count 457 transition count 875
Ensure Unique test removed 4 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 60 place count 453 transition count 875
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 453 transition count 868
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 71 place count 450 transition count 867
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 365 place count 303 transition count 678
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 447 place count 303 transition count 596
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 477 place count 288 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 488 place count 288 transition count 564
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 516 place count 274 transition count 572
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 521 place count 274 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 592 place count 274 transition count 496
Applied a total of 592 rules in 158 ms. Remains 274 /583 variables (removed 309) and now considering 496/1138 (removed 642) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3705833166642358061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9631403840523119828.kers'
[2026-05-26 02:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3705833166642358061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9631403840523119828.kers]
Normalized transition count is 495 out of 496 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 495 rows 261 cols 1418 entries
Finished phase 1 with 217 SingleSign rule and 2 generalized
[2026-05-26 02:46:40] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9631403840523119828.kers
Total runtime 2 ms.
[2026-05-26 02:46:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-26 02:46:40] [INFO ] Invariant cache hit.
[2026-05-26 02:46:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:46:40] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2026-05-26 02:46:40] [INFO ] Redundant transitions in 132 ms returned [382, 388, 390, 391, 398, 404, 406, 410, 414, 416, 417, 419, 420, 426, 428, 430, 435, 437, 438]
Found 19 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
Running 442 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11208346131720558047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11024867853729277562.kers'
[2026-05-26 02:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11208346131720558047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11024867853729277562.kers]
Normalized transition count is 476 out of 477 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 476 rows 261 cols 1355 entries
Finished phase 1 with 217 SingleSign rule and 2 generalized
[2026-05-26 02:46:40] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11024867853729277562.kers
Total runtime 2 ms.
[2026-05-26 02:46:40] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 476/750 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (OVERLAPS) 0/750 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 750/751 variables, and 343 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 476/750 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 442/785 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 8 (OVERLAPS) 0/750 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/751 variables, and 787 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/583 places, 477/1138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 274 transition count 472
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 269 transition count 472
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 264 transition count 467
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 262 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 262 transition count 465
Applied a total of 26 rules in 28 ms. Remains 262 /274 variables (removed 12) and now considering 465/477 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12075867167763989722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12482390743804713181.kers'
[2026-05-26 02:47:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12075867167763989722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12482390743804713181.kers]
Normalized transition count is 464 out of 465 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 464 rows 247 cols 1323 entries
Finished phase 1 with 205 SingleSign rule and 2 generalized
[2026-05-26 02:47:41] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12482390743804713181.kers
Total runtime 2 ms.
[2026-05-26 02:47:41] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-26 02:47:41] [INFO ] Invariant cache hit.
[2026-05-26 02:47:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:47:41] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 262/583 places, 465/1138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61121 ms. Remains : 262/583 places, 465/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-00 finished in 61396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(X(p2)&&p1))))'
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 568 transition count 1117
Ensure Unique test removed 5 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 35 place count 563 transition count 1117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 38 place count 563 transition count 1114
Applied a total of 38 rules in 20 ms. Remains 563 /583 variables (removed 20) and now considering 1114/1138 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10533188055870849110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7897039269965824971.kers'
[2026-05-26 02:47:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10533188055870849110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7897039269965824971.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1114 rows 563 cols 2875 entries
Finished phase 1 with 506 SingleSign rule and 0 generalized
[2026-05-26 02:47:41] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7897039269965824971.kers
Total runtime 4 ms.
[2026-05-26 02:47:41] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-26 02:47:41] [INFO ] Invariant cache hit.
[2026-05-26 02:47:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:47:42] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 1113 sub problems to find dead transitions.
[2026-05-26 02:47:42] [INFO ] Invariant cache hit.
[2026-05-26 02:47:42] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
At refinement iteration 1 (OVERLAPS) 1/563 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/1677 variables, and 57 constraints, problems are : Problem set: 0 solved, 1113 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/563 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1113/1113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
At refinement iteration 1 (OVERLAPS) 1/563 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/1677 variables, and 57 constraints, problems are : Problem set: 0 solved, 1113 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/563 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 1113 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 563/583 places, 1114/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60797 ms. Remains : 563/583 places, 1114/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(X(p2)&&p1))))'
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 476 ms.
Stack based approach found an accepted trace after 11294 steps with 0 reset with depth 11295 and stack size 4724 in 62 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-01 finished in 61561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&(p1 U X(X(X(!p2)))))) U p3))'
Support contains 6 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 571 transition count 1122
Ensure Unique test removed 4 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 28 place count 567 transition count 1122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 567 transition count 1121
Applied a total of 29 rules in 18 ms. Remains 567 /583 variables (removed 16) and now considering 1121/1138 (removed 17) transitions.
[2026-05-26 02:48:43] [INFO ] Flow matrix only has 1120 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2139494261217134087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4521640875255022019.kers'
[2026-05-26 02:48:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2139494261217134087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4521640875255022019.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1120 rows 567 cols 2896 entries
Finished phase 1 with 507 SingleSign rule and 2 generalized
[2026-05-26 02:48:43] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4521640875255022019.kers
Total runtime 6 ms.
[2026-05-26 02:48:43] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-26 02:48:43] [INFO ] Flow matrix only has 1120 transitions (discarded 1 similar events)
[2026-05-26 02:48:43] [INFO ] Invariant cache hit.
[2026-05-26 02:48:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:48:43] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 1120 sub problems to find dead transitions.
[2026-05-26 02:48:43] [INFO ] Flow matrix only has 1120 transitions (discarded 1 similar events)
[2026-05-26 02:48:43] [INFO ] Invariant cache hit.
[2026-05-26 02:48:43] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (OVERLAPS) 1/567 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/1687 variables, and 58 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/567 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (OVERLAPS) 1/567 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/1687 variables, and 58 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/567 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Starting structural reductions in LTL mode, iteration 1 : 567/583 places, 1121/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 567/583 places, 1121/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&(p1 U X(X(X(!p2)))))) U p3))'
Stuttering acceptance computed with spot in 559 ms :[(NOT p3), (NOT p0), p2, (OR (NOT p0) p2), p2, p2, p2, true, p2, p2, p2, p2, p2]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-02
Product exploration explored 100000 steps with 2 reset in 385 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-02 finished in 61831 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&&(p0 U (!p1||G(p0)))))))'
Support contains 1 out of 583 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Graph (trivial) has 704 edges and 583 vertex of which 101 / 583 are part of one of the 9 SCC in 2 ms
Free SCC test removed 92 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 491 transition count 912
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 480 transition count 912
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 37 place count 466 transition count 892
Ensure Unique test removed 5 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 56 place count 461 transition count 892
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 63 place count 461 transition count 885
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 459 transition count 885
Performed 141 Post agglomeration using F-continuation condition with reduction of 41 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 4 with 282 rules applied. Total rules applied 347 place count 318 transition count 703
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 4 with 76 rules applied. Total rules applied 423 place count 318 transition count 627
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 441 place count 309 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 450 place count 309 transition count 609
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 486 place count 291 transition count 626
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 490 place count 291 transition count 622
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 7 with 85 rules applied. Total rules applied 575 place count 291 transition count 537
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 577 place count 291 transition count 535
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 579 place count 289 transition count 535
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 583 place count 287 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 584 place count 287 transition count 532
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 594 place count 287 transition count 522
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 595 place count 287 transition count 521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 596 place count 286 transition count 521
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 596 place count 286 transition count 520
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 598 place count 285 transition count 520
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 600 place count 285 transition count 518
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 600 place count 285 transition count 517
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 602 place count 284 transition count 517
Applied a total of 602 rules in 96 ms. Remains 284 /583 variables (removed 299) and now considering 517/1138 (removed 621) transitions.
[2026-05-26 02:49:45] [INFO ] Flow matrix only has 509 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15169396357994009702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3198716961890274270.kers'
[2026-05-26 02:49:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15169396357994009702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3198716961890274270.kers]
Normalized transition count is 508 out of 509 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 508 rows 281 cols 1594 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-26 02:49:45] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3198716961890274270.kers
Total runtime 2 ms.
[2026-05-26 02:49:45] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-26 02:49:45] [INFO ] Flow matrix only has 509 transitions (discarded 8 similar events)
[2026-05-26 02:49:45] [INFO ] Invariant cache hit.
[2026-05-26 02:49:45] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-26 02:49:45] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2026-05-26 02:49:45] [INFO ] Redundant transitions in 3 ms returned []
Running 516 sub problems to find dead transitions.
[2026-05-26 02:49:45] [INFO ] Flow matrix only has 509 transitions (discarded 8 similar events)
[2026-05-26 02:49:45] [INFO ] Invariant cache hit.
[2026-05-26 02:49:45] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (OVERLAPS) 508/792 variables, 284/341 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 50/391 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (OVERLAPS) 1/793 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/793 variables, and 392 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 284/284 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (OVERLAPS) 508/792 variables, 284/341 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 50/391 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 516/907 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/793 variables, and 908 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 284/284 constraints, ReadFeed: 50/51 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 284/583 places, 517/1138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60576 ms. Remains : 284/583 places, 517/1138 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&&(p0 U (!p1||G(p0)))))))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-03
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-03 finished in 60660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 6 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Graph (trivial) has 716 edges and 583 vertex of which 105 / 583 are part of one of the 9 SCC in 1 ms
Free SCC test removed 96 places
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 486 transition count 898
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 472 transition count 897
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 41 place count 459 transition count 878
Ensure Unique test removed 3 places
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 456 transition count 878
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 62 place count 456 transition count 873
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 454 transition count 872
Performed 146 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 357 place count 308 transition count 684
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 438 place count 308 transition count 603
Performed 14 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 466 place count 294 transition count 584
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 477 place count 294 transition count 573
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 503 place count 281 transition count 581
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 507 place count 281 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 7 with 72 rules applied. Total rules applied 579 place count 281 transition count 505
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 579 place count 281 transition count 504
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 581 place count 280 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 582 place count 280 transition count 503
Applied a total of 582 rules in 103 ms. Remains 280 /583 variables (removed 303) and now considering 503/1138 (removed 635) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13886555453280469737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3941355500189823665.kers'
[2026-05-26 02:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13886555453280469737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3941355500189823665.kers]
Normalized transition count is 502 out of 503 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 502 rows 268 cols 1449 entries
Finished phase 1 with 220 SingleSign rule and 4 generalized
[2026-05-26 02:50:45] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3941355500189823665.kers
Total runtime 3 ms.
[2026-05-26 02:50:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-26 02:50:45] [INFO ] Invariant cache hit.
[2026-05-26 02:50:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:50:46] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2026-05-26 02:50:46] [INFO ] Redundant transitions in 109 ms returned [389, 395, 397, 398, 405, 411, 413, 417, 421, 423, 424, 426, 427, 433, 435, 437, 442, 444, 445]
Found 19 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
Running 447 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17201011566168176170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14978400563634188219.kers'
[2026-05-26 02:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17201011566168176170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14978400563634188219.kers]
Normalized transition count is 483 out of 484 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 1 ms.
// Phase 1: matrix 483 rows 268 cols 1386 entries
Finished phase 1 with 220 SingleSign rule and 4 generalized
[2026-05-26 02:50:46] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14978400563634188219.kers
Total runtime 6 ms.
[2026-05-26 02:50:46] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 483/763 variables, 280/336 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 14/350 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/763 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/764 variables, and 350 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 483/763 variables, 280/336 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 14/350 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 447/797 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 8/805 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 805 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 280/583 places, 484/1138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 479
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 479
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 270 transition count 474
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 268 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 268 transition count 472
Applied a total of 26 rules in 19 ms. Remains 268 /280 variables (removed 12) and now considering 472/484 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3834081608436781453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12299582090629156721.kers'
[2026-05-26 02:51:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3834081608436781453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12299582090629156721.kers]
Normalized transition count is 471 out of 472 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 471 rows 254 cols 1354 entries
Finished phase 1 with 208 SingleSign rule and 4 generalized
[2026-05-26 02:51:46] [INFO ] Computed 56 invariants in 1 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12299582090629156721.kers
Total runtime 3 ms.
[2026-05-26 02:51:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-26 02:51:46] [INFO ] Invariant cache hit.
[2026-05-26 02:51:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:51:46] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 268/583 places, 472/1138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61027 ms. Remains : 268/583 places, 472/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-04
Stuttering criterion allowed to conclude after 785 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-04 finished in 61196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(G(p1)))) U (!p2&&X(!p3)))))'
Support contains 6 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 569 transition count 1119
Ensure Unique test removed 5 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 33 place count 564 transition count 1119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 564 transition count 1116
Applied a total of 36 rules in 18 ms. Remains 564 /583 variables (removed 19) and now considering 1116/1138 (removed 22) transitions.
[2026-05-26 02:51:46] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9314682257415454067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9123987110188039363.kers'
[2026-05-26 02:51:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9314682257415454067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9123987110188039363.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1115 rows 564 cols 2879 entries
Finished phase 1 with 507 SingleSign rule and 0 generalized
[2026-05-26 02:51:46] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9123987110188039363.kers
Total runtime 5 ms.
[2026-05-26 02:51:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 02:51:47] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2026-05-26 02:51:47] [INFO ] Invariant cache hit.
[2026-05-26 02:51:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:51:47] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2026-05-26 02:51:47] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2026-05-26 02:51:47] [INFO ] Invariant cache hit.
[2026-05-26 02:51:47] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 564/583 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 564/583 places, 1116/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(G(p1)))) U (!p2&&X(!p3)))))'
Stuttering acceptance computed with spot in 256 ms :[(OR p2 p3), (OR p2 p3), (OR (NOT p0) (NOT p1)), p3, true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 795 ms.
Product exploration explored 100000 steps with 33333 reset in 844 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 9 factoid took 20 ms. Proved property starting from automaton with 6 states, 14 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7A-LTLFireability-07 finished in 62724 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(F(X(G((p0 U (X(X(X(p0)))&&F(G(p1))))))))))'
Support contains 3 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 569 transition count 1119
Ensure Unique test removed 5 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 33 place count 564 transition count 1119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 564 transition count 1117
Applied a total of 35 rules in 21 ms. Remains 564 /583 variables (removed 19) and now considering 1117/1138 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-358871318724524767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9417956278461690327.kers'
[2026-05-26 02:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-358871318724524767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9417956278461690327.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1117 rows 564 cols 2881 entries
Finished phase 1 with 507 SingleSign rule and 0 generalized
[2026-05-26 02:52:49] [INFO ] Computed 57 invariants in 10 ms
Computed 57 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9417956278461690327.kers
Total runtime 12 ms.
[2026-05-26 02:52:49] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-26 02:52:49] [INFO ] Invariant cache hit.
[2026-05-26 02:52:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:52:50] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2026-05-26 02:52:50] [INFO ] Invariant cache hit.
[2026-05-26 02:52:50] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/1681 variables, and 57 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/1681 variables, and 57 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 564/583 places, 1117/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 564/583 places, 1117/1138 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(F(X(G((p0 U (X(X(X(p0)))&&F(G(p1))))))))))'
Stuttering acceptance computed with spot in 593 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 347 ms.
Stack based approach found an accepted trace after 347 steps with 0 reset with depth 348 and stack size 348 in 2 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-08 finished in 61782 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)&&G(p1)&&(p2 U p3))))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 570 transition count 1121
Ensure Unique test removed 5 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 565 transition count 1121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 565 transition count 1118
Applied a total of 34 rules in 18 ms. Remains 565 /583 variables (removed 18) and now considering 1118/1138 (removed 20) transitions.
[2026-05-26 02:53:51] [INFO ] Flow matrix only has 1116 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6614619169057609664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2246664419409381848.kers'
[2026-05-26 02:53:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6614619169057609664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2246664419409381848.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1116 rows 565 cols 2883 entries
Finished phase 1 with 508 SingleSign rule and 0 generalized
[2026-05-26 02:53:51] [INFO ] Computed 57 invariants in 6 ms
Computed 57 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2246664419409381848.kers
Total runtime 7 ms.
[2026-05-26 02:53:51] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-26 02:53:51] [INFO ] Flow matrix only has 1116 transitions (discarded 2 similar events)
[2026-05-26 02:53:51] [INFO ] Invariant cache hit.
[2026-05-26 02:53:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:53:52] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2026-05-26 02:53:52] [INFO ] Flow matrix only has 1116 transitions (discarded 2 similar events)
[2026-05-26 02:53:52] [INFO ] Invariant cache hit.
[2026-05-26 02:53:52] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/565 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1681 variables, and 57 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/565 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/565 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/1681 variables, and 57 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/565 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 565/583 places, 1118/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 565/583 places, 1118/1138 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)&&G(p1)&&(p2 U p3))))'
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p3) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-09 finished in 61088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0||G(!p1)))) U ((X(X((p0||G(!p1))))&&(p2 U p3))||X(X(G((p0||G(!p1)))))))))'
Support contains 7 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 571 transition count 1121
Ensure Unique test removed 5 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 29 place count 566 transition count 1121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 32 place count 566 transition count 1118
Applied a total of 32 rules in 11 ms. Remains 566 /583 variables (removed 17) and now considering 1118/1138 (removed 20) transitions.
[2026-05-26 02:54:52] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-942311369320896020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15499659378098999016.kers'
[2026-05-26 02:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-942311369320896020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15499659378098999016.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1117 rows 566 cols 2887 entries
Finished phase 1 with 509 SingleSign rule and 0 generalized
[2026-05-26 02:54:52] [INFO ] Computed 57 invariants in 9 ms
Computed 57 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15499659378098999016.kers
Total runtime 12 ms.
[2026-05-26 02:54:52] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-26 02:54:52] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:54:52] [INFO ] Invariant cache hit.
[2026-05-26 02:54:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:54:53] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2026-05-26 02:54:53] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:54:53] [INFO ] Invariant cache hit.
[2026-05-26 02:54:53] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/566 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1683 variables, and 57 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/566 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/566 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1683 variables, and 57 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/566 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 566/583 places, 1118/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60797 ms. Remains : 566/583 places, 1118/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0||G(!p1)))) U (X(X(G((p0||G(!p1)))))||(X(X((p0||G(!p1))))&&(p2 U p3))))))'
Stuttering acceptance computed with spot in 582 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), true, p1, (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-11
Product exploration explored 100000 steps with 20020 reset in 664 ms.
Product exploration explored 100000 steps with 19985 reset in 670 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 27 factoid took 219 ms. Reduced automaton from 13 states, 53 edges and 4 AP (stutter sensitive) to 13 states, 53 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 479 ms. (83 steps per ms) remains 6/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
[2026-05-26 02:55:55] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:55:55] [INFO ] Invariant cache hit.
[2026-05-26 02:55:55] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 493/566 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1117/1683 variables, 566/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1683 variables, 14/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1683 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1683 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 637 constraints, problems are : Problem set: 0 solved, 4 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 566/566 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 493/566 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1117/1683 variables, 566/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1683 variables, 14/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1683 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1683 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1683 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 641 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 566/566 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1574ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1398 steps, including 6 resets, run visited all 4 properties in 27 ms. (steps per millisecond=51 )
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 4 properties in 28 ms.
Knowledge based reduction with 27 factoid took 579 ms. Reduced automaton from 13 states, 53 edges and 4 AP (stutter sensitive) to 13 states, 53 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 568 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), true, p1, (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3))]
Knowledge-based reduction took 3364 ms.
Stuttering acceptance computed with spot in 578 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), true, p1, (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3))]
Support contains 7 out of 566 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 566/566 places, 1118/1118 transitions.
Applied a total of 0 rules in 11 ms. Remains 566 /566 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
[2026-05-26 02:55:59] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:55:59] [INFO ] Invariant cache hit.
[2026-05-26 02:55:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-26 02:55:59] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:55:59] [INFO ] Invariant cache hit.
[2026-05-26 02:55:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:55:59] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 566/566 places, 1118/1118 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 27 factoid took 212 ms. Reduced automaton from 13 states, 53 edges and 4 AP (stutter sensitive) to 13 states, 53 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 303 ms. (131 steps per ms) remains 6/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
[2026-05-26 02:56:00] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:56:00] [INFO ] Invariant cache hit.
[2026-05-26 02:56:00] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 493/566 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1117/1683 variables, 566/623 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1683 variables, 14/637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1683 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1683 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 637 constraints, problems are : Problem set: 0 solved, 5 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 566/566 constraints, ReadFeed: 14/14 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 493/566 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1117/1683 variables, 566/625 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1683 variables, 14/639 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1683 variables, 5/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1683 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1683 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 644 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 566/566 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 13068 steps, including 78 resets, run visited all 5 properties in 62 ms. (steps per millisecond=210 )
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 )
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 5 properties in 65 ms.
Knowledge based reduction with 27 factoid took 565 ms. Reduced automaton from 13 states, 53 edges and 4 AP (stutter sensitive) to 13 states, 53 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 556 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), true, p1, (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3))]
Knowledge-based reduction took 3678 ms.
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), true, p1, (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 565 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), true, p1, (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 19975 reset in 617 ms.
Product exploration explored 100000 steps with 20031 reset in 635 ms.
Spot run failed in 80 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/ltsmin17959144824406131389
[2026-05-26 02:56:06] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17959144824406131389
Running compilation step : cd /tmp/ltsmin17959144824406131389;'/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 1801 ms.
Running link step : cd /tmp/ltsmin17959144824406131389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17959144824406131389;'/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/stateBased10856923397634391567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 566 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 566/566 places, 1118/1118 transitions.
Applied a total of 0 rules in 6 ms. Remains 566 /566 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
[2026-05-26 02:56:21] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:56:21] [INFO ] Invariant cache hit.
[2026-05-26 02:56:21] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 02:56:21] [INFO ] Flow matrix only has 1117 transitions (discarded 1 similar events)
[2026-05-26 02:56:21] [INFO ] Invariant cache hit.
[2026-05-26 02:56:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:56:21] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 566/566 places, 1118/1118 transitions.
Built C files in :
/tmp/ltsmin14582591299746797446
[2026-05-26 02:56:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14582591299746797446
Running compilation step : cd /tmp/ltsmin14582591299746797446;'/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 1740 ms.
Running link step : cd /tmp/ltsmin14582591299746797446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14582591299746797446;'/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/stateBased9967848438418553707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:56:36] [INFO ] Flatten gal took : 37 ms
[2026-05-26 02:56:36] [INFO ] Flatten gal took : 35 ms
[2026-05-26 02:56:36] [INFO ] Time to serialize gal into /tmp/LTL13979682762543752714.gal : 9 ms
[2026-05-26 02:56:36] [INFO ] Time to serialize properties into /tmp/LTL16130923494312190876.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13979682762543752714.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8362829483360001819.hoa' '-atoms' '/tmp/LTL16130923494312190876.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16130923494312190876.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8362829483360001819.hoa
Detected timeout of ITS tools.
[2026-05-26 02:56:51] [INFO ] Flatten gal took : 30 ms
[2026-05-26 02:56:51] [INFO ] Flatten gal took : 28 ms
[2026-05-26 02:56:51] [INFO ] Time to serialize gal into /tmp/LTL2692223214926284327.gal : 6 ms
[2026-05-26 02:56:51] [INFO ] Time to serialize properties into /tmp/LTL4748662856131606759.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/LTL2692223214926284327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4748662856131606759.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("(p223!=1)")||(G(!("((p679==1)&&(p741==1))"))))))U((X(X(G(("(p223!=1)")||(G(!("((p679==1)&&(p741==1))")))))))||((X(X(("(p22...261
Formula 0 simplified : X(XX(!"(p223!=1)" & F"((p679==1)&&(p741==1))") R (XXF(!"(p223!=1)" & F"((p679==1)&&(p741==1))") & (XX(!"(p223!=1)" & F"((p679==1)&&(...227
Detected timeout of ITS tools.
[2026-05-26 02:57:07] [INFO ] Flatten gal took : 32 ms
[2026-05-26 02:57:07] [INFO ] Applying decomposition
[2026-05-26 02:57:07] [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/graph14853183696094245852.txt' '-o' '/tmp/graph14853183696094245852.bin' '-w' '/tmp/graph14853183696094245852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14853183696094245852.bin' '-l' '-1' '-v' '-w' '/tmp/graph14853183696094245852.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:57:07] [INFO ] Decomposing Gal with order
[2026-05-26 02:57:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:57:07] [INFO ] Removed a total of 570 redundant transitions.
[2026-05-26 02:57:07] [INFO ] Flatten gal took : 108 ms
[2026-05-26 02:57:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 27 ms.
[2026-05-26 02:57:07] [INFO ] Time to serialize gal into /tmp/LTL5973862357907792060.gal : 13 ms
[2026-05-26 02:57:07] [INFO ] Time to serialize properties into /tmp/LTL4857609489311867680.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5973862357907792060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4857609489311867680.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("(i5.i1.u38.p223!=1)")||(G(!("((i11.i0.u104.p679==1)&&(i12.i0.u114.p741==1))"))))))U((X(X(G(("(i5.i1.u38.p223!=1)")||(G(!("...406
Formula 0 simplified : X(XX(!"(i5.i1.u38.p223!=1)" & F"((i11.i0.u104.p679==1)&&(i12.i0.u114.p741==1))") R (XXF(!"(i5.i1.u38.p223!=1)" & F"((i11.i0.u104.p67...372
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-7A-LTLFireability-11 finished in 149914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U p1))'
Support contains 3 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 568 transition count 1117
Ensure Unique test removed 5 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 35 place count 563 transition count 1117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 38 place count 563 transition count 1114
Applied a total of 38 rules in 11 ms. Remains 563 /583 variables (removed 20) and now considering 1114/1138 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1751452812396652658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10628300821204110470.kers'
[2026-05-26 02:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1751452812396652658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10628300821204110470.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1114 rows 563 cols 2875 entries
Finished phase 1 with 506 SingleSign rule and 0 generalized
[2026-05-26 02:57:22] [INFO ] Computed 57 invariants in 10 ms
Computed 57 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10628300821204110470.kers
Total runtime 12 ms.
[2026-05-26 02:57:22] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-26 02:57:22] [INFO ] Invariant cache hit.
[2026-05-26 02:57:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:57:23] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 1113 sub problems to find dead transitions.
[2026-05-26 02:57:23] [INFO ] Invariant cache hit.
[2026-05-26 02:57:23] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
At refinement iteration 1 (OVERLAPS) 1/563 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/1677 variables, and 57 constraints, problems are : Problem set: 0 solved, 1113 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/563 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1113/1113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
At refinement iteration 1 (OVERLAPS) 1/563 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/1677 variables, and 57 constraints, problems are : Problem set: 0 solved, 1113 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/563 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 1113 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 563/583 places, 1114/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60820 ms. Remains : 563/583 places, 1114/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))||p1) U p0))'
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-12 finished in 61008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X((X(p1) U ((p1&&X(p1))||X(G(p1))))))))))'
Support contains 3 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 568 transition count 1117
Ensure Unique test removed 5 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 35 place count 563 transition count 1117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 38 place count 563 transition count 1114
Applied a total of 38 rules in 20 ms. Remains 563 /583 variables (removed 20) and now considering 1114/1138 (removed 24) transitions.
[2026-05-26 02:58:23] [INFO ] Invariant cache hit.
[2026-05-26 02:58:23] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 02:58:23] [INFO ] Invariant cache hit.
[2026-05-26 02:58:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:58:24] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 563/583 places, 1114/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 563/583 places, 1114/1138 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X((X(p1) U ((p1&&X(p1))||X(G(p1))))))))))'
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-13
Product exploration explored 100000 steps with 16666 reset in 622 ms.
Product exploration explored 100000 steps with 16666 reset in 580 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 1 factoid took 52 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
[2026-05-26 02:58:25] [INFO ] Invariant cache hit.
[2026-05-26 02:58:25] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/563 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1677 variables, 563/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1677 variables, 14/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1677 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1677 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1677/1677 variables, and 634 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 563/563 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/563 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1114/1677 variables, 563/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1677 variables, 14/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1677 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1677 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1677 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 563/563 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1448 ms.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 1114/1114 transitions.
Applied a total of 0 rules in 12 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2026-05-26 02:58:27] [INFO ] Invariant cache hit.
[2026-05-26 02:58:27] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-26 02:58:27] [INFO ] Invariant cache hit.
[2026-05-26 02:58:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:58:27] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 563/563 places, 1114/1114 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 1 factoid took 55 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2026-05-26 02:58:28] [INFO ] Invariant cache hit.
[2026-05-26 02:58:28] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/563 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1677 variables, 563/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1677 variables, 14/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1677 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1677 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1677/1677 variables, and 634 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 563/563 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/563 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1114/1677 variables, 563/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1677 variables, 14/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1677 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1677 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1677 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 563/563 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1385 ms.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16666 reset in 546 ms.
Product exploration explored 100000 steps with 16666 reset in 588 ms.
Spot run failed in 47 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/ltsmin4698347827535166218
[2026-05-26 02:58:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4698347827535166218
Running compilation step : cd /tmp/ltsmin4698347827535166218;'/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 1703 ms.
Running link step : cd /tmp/ltsmin4698347827535166218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4698347827535166218;'/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/stateBased2754216058617013242.hoa' '--buchi-type=spotba'
LTSmin run took 393 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-7A-LTLFireability-13 finished in 9789 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 p2)&&F((X(G(p4))&&p3)))))'
Support contains 8 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 569 transition count 1118
Ensure Unique test removed 4 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 32 place count 565 transition count 1118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 565 transition count 1115
Applied a total of 35 rules in 16 ms. Remains 565 /583 variables (removed 18) and now considering 1115/1138 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12157974779660510135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4481132929624247539.kers'
[2026-05-26 02:58:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12157974779660510135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4481132929624247539.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1115 rows 565 cols 2883 entries
Finished phase 1 with 505 SingleSign rule and 2 generalized
[2026-05-26 02:58:33] [INFO ] Computed 58 invariants in 6 ms
Computed 58 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4481132929624247539.kers
Total runtime 9 ms.
[2026-05-26 02:58:33] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-26 02:58:33] [INFO ] Invariant cache hit.
[2026-05-26 02:58:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:58:33] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 1114 sub problems to find dead transitions.
[2026-05-26 02:58:33] [INFO ] Invariant cache hit.
[2026-05-26 02:58:33] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
At refinement iteration 2 (OVERLAPS) 1/565 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1680 variables, and 58 constraints, problems are : Problem set: 0 solved, 1114 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/565 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1114/1114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
At refinement iteration 2 (OVERLAPS) 1/565 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/1680 variables, and 58 constraints, problems are : Problem set: 0 solved, 1114 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/565 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 1114 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 565/583 places, 1115/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 565/583 places, 1115/1138 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 p2)&&F((X(G(p4))&&p3)))))'
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p3) (NOT p4) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p3) (NOT p4)), (NOT p4), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 332 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-14 finished in 61631 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)))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1138/1138 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 569 transition count 1118
Ensure Unique test removed 5 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 33 place count 564 transition count 1118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 564 transition count 1115
Applied a total of 36 rules in 18 ms. Remains 564 /583 variables (removed 19) and now considering 1115/1138 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16012744561758481596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2650270735813295397.kers'
[2026-05-26 02:59:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16012744561758481596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2650270735813295397.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1115 rows 564 cols 2879 entries
Finished phase 1 with 507 SingleSign rule and 0 generalized
[2026-05-26 02:59:34] [INFO ] Computed 57 invariants in 6 ms
Computed 57 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2650270735813295397.kers
Total runtime 9 ms.
[2026-05-26 02:59:35] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 02:59:35] [INFO ] Invariant cache hit.
[2026-05-26 02:59:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 02:59:35] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 1114 sub problems to find dead transitions.
[2026-05-26 02:59:35] [INFO ] Invariant cache hit.
[2026-05-26 02:59:35] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1114 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1114/1114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1114 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/1679 variables, and 57 constraints, problems are : Problem set: 0 solved, 1114 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/564 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 1114 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 564/583 places, 1115/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 564/583 places, 1115/1138 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)))'
Stuttering acceptance computed with spot in 165 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-15 finished in 60997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0||G(!p1)))) U ((X(X((p0||G(!p1))))&&(p2 U p3))||X(X(G((p0||G(!p1)))))))))'
Spot run failed in 38 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 03:00:35] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2632001490030723789
[2026-05-26 03:00:36] [INFO ] Applying decomposition
[2026-05-26 03:00:36] [INFO ] Computing symmetric may disable matrix : 1138 transitions.
[2026-05-26 03:00:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:00:36] [INFO ] Computing symmetric may enable matrix : 1138 transitions.
[2026-05-26 03:00:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:00:36] [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/graph11239729875119530490.txt' '-o' '/tmp/graph11239729875119530490.bin' '-w' '/tmp/graph11239729875119530490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11239729875119530490.bin' '-l' '-1' '-v' '-w' '/tmp/graph11239729875119530490.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:00:36] [INFO ] Decomposing Gal with order
[2026-05-26 03:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:00:36] [INFO ] Removed a total of 595 redundant transitions.
[2026-05-26 03:00:36] [INFO ] Flatten gal took : 45 ms
[2026-05-26 03:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 18 ms.
[2026-05-26 03:00:36] [INFO ] Time to serialize gal into /tmp/LTLFireability13255121684001759608.gal : 18 ms
[2026-05-26 03:00:36] [INFO ] Time to serialize properties into /tmp/LTLFireability6568401601140687385.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/LTLFireability13255121684001759608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6568401601140687385.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2026-05-26 03:00:36] [INFO ] Computing Do-Not-Accords matrix : 1138 transitions.
Checking formula 0 : !((X((X(X(("(i3.u41.p223!=1)")||(G(!("((i9.u107.p679==1)&&(i10.u123.p741==1))"))))))U(((X(X(("(i3.u41.p223!=1)")||(G(!("((i9.u107.p679...374
Formula 0 simplified : X(XX(!"(i3.u41.p223!=1)" & F"((i9.u107.p679==1)&&(i10.u123.p741==1))") R (XXF(!"(i3.u41.p223!=1)" & F"((i9.u107.p679==1)&&(i10.u123....340
[2026-05-26 03:00:36] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:00:36] [INFO ] Built C files in 348ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2632001490030723789
Running compilation step : cd /tmp/ltsmin2632001490030723789;'/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'
Compilation finished in 3373 ms.
Running link step : cd /tmp/ltsmin2632001490030723789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2632001490030723789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((X(X(((LTLAPp0==true)||[](!(LTLAPp1==true))))) U ((X(X(((LTLAPp0==true)||[](!(LTLAPp1==true)))))&&((LTLAPp2==true) U (LTLAPp3==true)))||X(X([](((LTLAPp0==true)||[](!(LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i0.u4.t423, i0.u4.t780, i1.u8.t388, i5.t934, i5.t931, i5.t929, i5.t653, i5.t229, i5.t228, i5....332
Detected timeout of ITS tools.
[2026-05-26 03:25:38] [INFO ] Applying decomposition
[2026-05-26 03:25:39] [INFO ] Flatten gal took : 381 ms
[2026-05-26 03:25:39] [INFO ] Decomposing Gal with order
[2026-05-26 03:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:25:39] [INFO ] Removed a total of 279 redundant transitions.
[2026-05-26 03:25:39] [INFO ] Flatten gal took : 293 ms
[2026-05-26 03:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 51 ms.
[2026-05-26 03:25:39] [INFO ] Time to serialize gal into /tmp/LTLFireability6836265601423385111.gal : 27 ms
[2026-05-26 03:25:39] [INFO ] Time to serialize properties into /tmp/LTLFireability640499187771367195.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6836265601423385111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability640499187771367195.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("(u19.p223!=1)")||(G(!("((u57.p679==1)&&(u61.p741==1))"))))))U(((X(X(("(u19.p223!=1)")||(G(!("((u57.p679==1)&&(u61.p741==1)...313
Formula 0 simplified : X(XX(!"(u19.p223!=1)" & F"((u57.p679==1)&&(u61.p741==1))") R (XXF(!"(u19.p223!=1)" & F"((u57.p679==1)&&(u61.p741==1))") & (XX(!"(u19...279
Reverse transition relation is NOT exact ! Due to transitions t927, t934, u4.t423, u4.t780, u5.t388, u26.t232, u26.t234, u27.t215, u27.t227, u27.t228, u27....291
9 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 items max in DFS search stack
27856 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,278.676,5925924,1,0,9.76661e+06,12275,2820,2.59935e+07,1446,81065,489832
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NoC3x3-PT-7A-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2685668 ms.

BK_STOP 1779766221120

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-7A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-7A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914000356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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