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.r130-smll-177955809100332.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 FlexibleBarrier-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.7K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779872446225

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 09:00:48] [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-27 09:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 09:00:49] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2026-05-27 09:00:49] [INFO ] Transformed 542 places.
[2026-05-27 09:00:49] [INFO ] Transformed 621 transitions.
[2026-05-27 09:00:49] [INFO ] Found NUPN structural information;
[2026-05-27 09:00:49] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 177 places :
Symmetric choice reduction at 0 with 177 rule applications. Total rules 177 place count 365 transition count 444
Iterating global reduction 0 with 177 rules applied. Total rules applied 354 place count 365 transition count 444
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 426 place count 293 transition count 372
Iterating global reduction 0 with 72 rules applied. Total rules applied 498 place count 293 transition count 372
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 538 place count 253 transition count 332
Iterating global reduction 0 with 40 rules applied. Total rules applied 578 place count 253 transition count 332
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 595 place count 253 transition count 315
Applied a total of 595 rules in 211 ms. Remains 253 /542 variables (removed 289) and now considering 315/621 (removed 306) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1935731414442090844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6496938617377942496.kers'
[2026-05-27 09:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1935731414442090844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6496938617377942496.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 253 cols 853 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-27 09:00:49] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6496938617377942496.kers
Total runtime 4 ms.
[2026-05-27 09:00:50] [INFO ] Implicit Places using invariants in 589 ms returned []
[2026-05-27 09:00:50] [INFO ] Invariant cache hit.
[2026-05-27 09:00:51] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2026-05-27 09:00:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/568 variables, 253/267 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 270 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 315/568 variables, 253/272 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 314/586 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 10/596 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 596 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Starting structural reductions in LTL mode, iteration 1 : 253/542 places, 315/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61896 ms. Remains : 253/542 places, 315/621 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Applied a total of 0 rules in 12 ms. Remains 253 /253 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2026-05-27 09:01:51] [INFO ] Invariant cache hit.
[2026-05-27 09:01:51] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-27 09:01:51] [INFO ] Invariant cache hit.
[2026-05-27 09:01:52] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 253/253 places, 315/315 transitions.
Support contains 42 out of 253 places after structural reductions.
[2026-05-27 09:01:52] [INFO ] Flatten gal took : 84 ms
[2026-05-27 09:01:52] [INFO ] Flatten gal took : 46 ms
[2026-05-27 09:01:52] [INFO ] Input system was already deterministic with 315 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (740 resets) in 3201 ms. (12 steps per ms) remains 8/31 properties
BEST_FIRST walk for 40004 steps (111 resets) in 276 ms. (144 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (114 resets) in 131 ms. (303 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (113 resets) in 107 ms. (370 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (113 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
[2026-05-27 09:01:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/221 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/253 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 315/568 variables, 253/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/568 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 253/253 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/221 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/253 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 315/568 variables, 253/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/568 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 611 ms.
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 315/315 transitions.
Graph (trivial) has 225 edges and 253 vertex of which 37 / 253 are part of one of the 6 SCC in 14 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 222 transition count 241
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 186 transition count 241
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 73 place count 186 transition count 226
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 103 place count 171 transition count 226
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 127 place count 147 transition count 202
Iterating global reduction 2 with 24 rules applied. Total rules applied 151 place count 147 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 153 place count 147 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 143 transition count 196
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 143 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 165 place count 143 transition count 192
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 239 place count 106 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 245 place count 106 transition count 149
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 105 transition count 148
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 105 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 248 place count 105 transition count 147
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 307 place count 105 transition count 88
Reduce places removed 59 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 79 rules applied. Total rules applied 386 place count 46 transition count 68
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 46 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 388 place count 45 transition count 67
Applied a total of 388 rules in 159 ms. Remains 45 /253 variables (removed 208) and now considering 67/315 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 45/253 places, 67/315 transitions.
RANDOM walk for 6211 steps (48 resets) in 140 ms. (44 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(F(p2))||p1)))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Graph (trivial) has 229 edges and 253 vertex of which 37 / 253 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 221 transition count 246
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 185 transition count 246
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 73 place count 185 transition count 231
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 103 place count 170 transition count 231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 127 place count 146 transition count 207
Iterating global reduction 2 with 24 rules applied. Total rules applied 151 place count 146 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 153 place count 146 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 146 transition count 204
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 145 transition count 204
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 159 place count 141 transition count 200
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 141 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 167 place count 141 transition count 196
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 239 place count 105 transition count 160
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 240 place count 104 transition count 159
Iterating global reduction 4 with 1 rules applied. Total rules applied 241 place count 104 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 242 place count 104 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 248 place count 104 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 102 transition count 150
Applied a total of 250 rules in 153 ms. Remains 102 /253 variables (removed 151) and now considering 150/315 (removed 165) transitions.
[2026-05-27 09:01:57] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15307543479629737626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2095477730036932035.kers'
[2026-05-27 09:01:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15307543479629737626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2095477730036932035.kers]
Normalized transition count is 138 out of 139 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 138 rows 101 cols 391 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-27 09:01:57] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2095477730036932035.kers
Total runtime 1 ms.
[2026-05-27 09:01:58] [INFO ] Implicit Places using invariants in 828 ms returned []
[2026-05-27 09:01:58] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2026-05-27 09:01:58] [INFO ] Invariant cache hit.
[2026-05-27 09:01:58] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2026-05-27 09:01:58] [INFO ] Redundant transitions in 4 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-27 09:01:58] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2026-05-27 09:01:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 138/240 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/241 variables, and 110 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4607 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 138/240 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 81/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/241 variables, and 191 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9997ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10000ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/253 places, 150/315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11214 ms. Remains : 102/253 places, 150/315 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&&(G(F(p2))||p1)))))'
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 56563 steps with 4401 reset in 515 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-01 finished in 12143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||G((p2||G(!p0)))) U X(p1)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 236 transition count 298
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 236 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 236 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 227 transition count 287
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 227 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 227 transition count 283
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 225 transition count 281
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 225 transition count 279
Applied a total of 64 rules in 32 ms. Remains 225 /253 variables (removed 28) and now considering 279/315 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9591744889712574409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-617132704429545734.kers'
[2026-05-27 09:02:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9591744889712574409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-617132704429545734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 225 cols 749 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-27 09:02:09] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-617132704429545734.kers
Total runtime 3 ms.
[2026-05-27 09:02:09] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-27 09:02:09] [INFO ] Invariant cache hit.
[2026-05-27 09:02:09] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-27 09:02:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 225/253 places, 279/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60761 ms. Remains : 225/253 places, 279/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||G((p2||G(!p0)))) U X(p1)))'
Stuttering acceptance computed with spot in 419 ms :[(NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (NOT p1), (NOT p1), false, true, p0, (AND p0 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 1833 reset in 368 ms.
Product exploration explored 100000 steps with 1828 reset in 642 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 25 factoid took 132 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (736 resets) in 485 ms. (82 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 162 ms. (245 steps per ms) remains 1/3 properties
[2026-05-27 09:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/225 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/225 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 8 ms.
Negative knowledge disproves property using: (G (OR (NOT p0) p2))
Knowledge based reduction with 25 factoid took 156 ms. Proved property starting from automaton with 7 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1237 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-02 finished in 63497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&(F(p1)||G(p0))) U X(p2)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 239 transition count 301
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 239 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 239 transition count 299
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 233 transition count 293
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 233 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 233 transition count 291
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 231 transition count 289
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 231 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 231 transition count 287
Applied a total of 50 rules in 24 ms. Remains 231 /253 variables (removed 22) and now considering 287/315 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13668992656080349486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11398958653111941677.kers'
[2026-05-27 09:03:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13668992656080349486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11398958653111941677.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 231 cols 773 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-27 09:03:12] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11398958653111941677.kers
Total runtime 4 ms.
[2026-05-27 09:03:13] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-27 09:03:13] [INFO ] Invariant cache hit.
[2026-05-27 09:03:13] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-27 09:03:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 287/518 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/518 variables, and 239 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 287/518 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 286/525 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 286 unsolved
SMT process timed out in 60206ms, After SMT, problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 231/253 places, 287/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60916 ms. Remains : 231/253 places, 287/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&(F(p1)||G(p0))) U X(p2)))'
Stuttering acceptance computed with spot in 439 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 17 ms. Proved property starting from automaton with 8 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 61858 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(X(X(G(p0)))))))'
Support contains 1 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 236 transition count 298
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 236 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 236 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 227 transition count 287
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 227 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 227 transition count 283
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 225 transition count 281
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 225 transition count 279
Applied a total of 64 rules in 22 ms. Remains 225 /253 variables (removed 28) and now considering 279/315 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6399979732028466408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9344390928160134146.kers'
[2026-05-27 09:04:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6399979732028466408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9344390928160134146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 225 cols 749 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-27 09:04:14] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9344390928160134146.kers
Total runtime 3 ms.
[2026-05-27 09:04:14] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-27 09:04:14] [INFO ] Invariant cache hit.
[2026-05-27 09:04:15] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-27 09:04:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 29099 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59149ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 59151ms
Starting structural reductions in LTL mode, iteration 1 : 225/253 places, 279/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59795 ms. Remains : 225/253 places, 279/315 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(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 60047 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 U p1)))&&X(X(p0))) U X(p2)))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 237 transition count 299
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 237 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 237 transition count 297
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 228 transition count 288
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 228 transition count 288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 228 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 226 transition count 282
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 226 transition count 280
Applied a total of 62 rules in 17 ms. Remains 226 /253 variables (removed 27) and now considering 280/315 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6176347422612260079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13631156260794556695.kers'
[2026-05-27 09:05:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6176347422612260079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13631156260794556695.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 226 cols 751 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-27 09:05:14] [INFO ] Computed 8 invariants in 9 ms
Computed 8 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-13631156260794556695.kers
Total runtime 18 ms.
[2026-05-27 09:05:14] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-27 09:05:14] [INFO ] Invariant cache hit.
[2026-05-27 09:05:15] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-27 09:05:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 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 506/506 variables, and 234 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 279/513 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 7/520 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 5/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/506 variables, and 529 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 226/253 places, 280/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60694 ms. Remains : 226/253 places, 280/315 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 U p1)))&&X(X(p0))) U X(p2)))'
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p0), true, p1]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-07 finished in 61044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Graph (trivial) has 231 edges and 253 vertex of which 37 / 253 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 221 transition count 247
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 186 transition count 247
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 71 place count 186 transition count 233
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 99 place count 172 transition count 233
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 122 place count 149 transition count 210
Iterating global reduction 2 with 23 rules applied. Total rules applied 145 place count 149 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 147 place count 149 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 149 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 148 transition count 207
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 154 place count 143 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 159 place count 143 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 163 place count 143 transition count 198
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 237 place count 106 transition count 161
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 105 transition count 160
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 105 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 105 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 246 place count 105 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 103 transition count 151
Applied a total of 248 rules in 95 ms. Remains 103 /253 variables (removed 150) and now considering 151/315 (removed 164) transitions.
[2026-05-27 09:06:15] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-175653869969226665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1042959417463481350.kers'
[2026-05-27 09:06:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-175653869969226665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1042959417463481350.kers]
Normalized transition count is 139 out of 140 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 139 rows 102 cols 393 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-27 09:06:15] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1042959417463481350.kers
Total runtime 2 ms.
[2026-05-27 09:06:16] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-27 09:06:16] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2026-05-27 09:06:16] [INFO ] Invariant cache hit.
[2026-05-27 09:06:16] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2026-05-27 09:06:16] [INFO ] Redundant transitions in 8 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-27 09:06:16] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2026-05-27 09:06:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/243 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/243 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10587ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 10588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/253 places, 151/315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11153 ms. Remains : 103/253 places, 151/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 7780 reset in 483 ms.
Stuttering criterion allowed to conclude after 73195 steps with 5693 reset in 338 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-09 finished in 12060 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(X(F(!(!X(p0) U X(p1)))))||!(!p0 U p2)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 238 transition count 300
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 238 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 238 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 232 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 232 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 232 transition count 288
Applied a total of 48 rules in 9 ms. Remains 232 /253 variables (removed 21) and now considering 288/315 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1097531371557259173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11316281750799651285.kers'
[2026-05-27 09:06:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1097531371557259173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11316281750799651285.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 232 cols 775 entries
Finished phase 1 with 224 SingleSign rule and 0 generalized
[2026-05-27 09:06:27] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11316281750799651285.kers
Total runtime 1 ms.
[2026-05-27 09:06:27] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-27 09:06:27] [INFO ] Invariant cache hit.
[2026-05-27 09:06:28] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-27 09:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/520 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/520 variables, and 242 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/520 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 287/529 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 7/536 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 5/541 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 541 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 232/253 places, 288/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60496 ms. Remains : 232/253 places, 288/315 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(X(F(!(!X(p0) U X(p1)))))||!(!p0 U p2)))'
Stuttering acceptance computed with spot in 263 ms :[(AND p1 p2), p1, (AND p1 p2), p1, (AND p1 p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-10
Product exploration explored 100000 steps with 1864 reset in 252 ms.
Product exploration explored 100000 steps with 1849 reset in 273 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge based reduction with 10 factoid took 80 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 33746 steps (617 resets) in 389 ms. (86 steps per ms) remains 0/6 properties
Knowledge based reduction with 10 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2)]
Knowledge-based reduction took 543 ms.
Stuttering acceptance computed with spot in 195 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2)]
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2026-05-27 09:07:29] [INFO ] Invariant cache hit.
[2026-05-27 09:07:30] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-27 09:07:30] [INFO ] Invariant cache hit.
[2026-05-27 09:07:30] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 232/232 places, 288/288 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge based reduction with 6 factoid took 75 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (738 resets) in 248 ms. (160 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2026-05-27 09:07:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/232 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 288/520 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/520 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 232/232 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/232 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 288/520 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2)]
Knowledge-based reduction took 1104 ms.
Stuttering acceptance computed with spot in 197 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 191 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2)]
Product exploration explored 100000 steps with 1851 reset in 248 ms.
Product exploration explored 100000 steps with 1839 reset in 266 ms.
Spot run failed in 137 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/ltsmin13099113203480110258
[2026-05-27 09:07:32] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13099113203480110258
Running compilation step : cd /tmp/ltsmin13099113203480110258;'/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 1130 ms.
Running link step : cd /tmp/ltsmin13099113203480110258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13099113203480110258;'/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/stateBased17904625352877362398.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2026-05-27 09:07:47] [INFO ] Invariant cache hit.
[2026-05-27 09:07:47] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-27 09:07:47] [INFO ] Invariant cache hit.
[2026-05-27 09:07:48] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 232/232 places, 288/288 transitions.
Built C files in :
/tmp/ltsmin2930456395753120101
[2026-05-27 09:07:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2930456395753120101
Running compilation step : cd /tmp/ltsmin2930456395753120101;'/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 964 ms.
Running link step : cd /tmp/ltsmin2930456395753120101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2930456395753120101;'/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/stateBased13380516051538289014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 09:08:03] [INFO ] Flatten gal took : 23 ms
[2026-05-27 09:08:03] [INFO ] Flatten gal took : 18 ms
[2026-05-27 09:08:03] [INFO ] Time to serialize gal into /tmp/LTL4957981126057226422.gal : 19 ms
[2026-05-27 09:08:03] [INFO ] Time to serialize properties into /tmp/LTL3397219620070556238.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/LTL4957981126057226422.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17578144639245975391.hoa' '-atoms' '/tmp/LTL3397219620070556238.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3397219620070556238.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17578144639245975391.hoa
Detected timeout of ITS tools.
[2026-05-27 09:08:18] [INFO ] Flatten gal took : 17 ms
[2026-05-27 09:08:18] [INFO ] Flatten gal took : 16 ms
[2026-05-27 09:08:18] [INFO ] Time to serialize gal into /tmp/LTL5963371105806095406.gal : 4 ms
[2026-05-27 09:08:18] [INFO ] Time to serialize properties into /tmp/LTL2321409452048472682.ltl : 3 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/LTL5963371105806095406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2321409452048472682.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(!((!(X("(p117==1)")))U(X("(p293==1)")))))))||(!(("(p117!=1)")U("(p272==1)")))))
Formula 0 simplified : ("(p117!=1)" U "(p272==1)") & XXG(!"(p117==1)" U "(p293==1)")
Detected timeout of ITS tools.
[2026-05-27 09:08:33] [INFO ] Flatten gal took : 16 ms
[2026-05-27 09:08:33] [INFO ] Applying decomposition
[2026-05-27 09:08:33] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5133145102270847492.txt' '-o' '/tmp/graph5133145102270847492.bin' '-w' '/tmp/graph5133145102270847492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5133145102270847492.bin' '-l' '-1' '-v' '-w' '/tmp/graph5133145102270847492.weights' '-q' '0' '-e' '0.001'
[2026-05-27 09:08:33] [INFO ] Decomposing Gal with order
[2026-05-27 09:08:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 09:08:33] [INFO ] Removed a total of 115 redundant transitions.
[2026-05-27 09:08:33] [INFO ] Flatten gal took : 162 ms
[2026-05-27 09:08:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 20 ms.
[2026-05-27 09:08:33] [INFO ] Time to serialize gal into /tmp/LTL4451654736286255665.gal : 13 ms
[2026-05-27 09:08:33] [INFO ] Time to serialize properties into /tmp/LTL10379153924672262991.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/LTL4451654736286255665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10379153924672262991.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(!((!(X("(i3.i1.u17.p117==1)")))U(X("(i9.i0.u47.p293==1)")))))))||(!(("(i3.i1.u17.p117!=1)")U("(i6.i1.u44.p272==1)")))))
Formula 0 simplified : ("(i3.i1.u17.p117!=1)" U "(i6.i1.u44.p272==1)") & XXG(!"(i3.i1.u17.p117==1)" U "(i9.i0.u47.p293==1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t40, t72, t73, t105, t106, t141, t170, t204, t257, t258, t260, t261, t262, u65.t7, u65.t3...754
Computing Next relation with stutter on 2.99418e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-10 finished in 141248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F((!p0&&F(G(p1)))) U (G((F((!p0&&F(G(p1))))||G(p2)))||(p3&&(F((!p0&&F(G(p1))))||G(p2)))))))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 239 transition count 301
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 239 transition count 301
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 239 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 232 transition count 293
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 232 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 232 transition count 290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 231 transition count 289
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 231 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 231 transition count 288
Applied a total of 49 rules in 12 ms. Remains 231 /253 variables (removed 22) and now considering 288/315 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15153814023370024335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17140746402543972797.kers'
[2026-05-27 09:08:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15153814023370024335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17140746402543972797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 231 cols 779 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-27 09:08:49] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17140746402543972797.kers
Total runtime 2 ms.
[2026-05-27 09:08:49] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-27 09:08:49] [INFO ] Invariant cache hit.
[2026-05-27 09:08:49] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-27 09:08:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 239 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 287/526 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 7/533 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 534 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 231/253 places, 288/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 231/253 places, 288/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F((!p0&&F(G(p1)))) U (G((F((!p0&&F(G(p1))))||G(p2)))||(p3&&(F((!p0&&F(G(p1))))||G(p2)))))))'
Stuttering acceptance computed with spot in 728 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 24938 reset in 229 ms.
Product exploration explored 100000 steps with 24989 reset in 255 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 43 factoid took 262 ms. Reduced automaton from 13 states, 45 edges and 4 AP (stutter sensitive) to 11 states, 46 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (736 resets) in 602 ms. (66 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40004 steps (111 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (113 resets) in 159 ms. (250 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (112 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (108 resets) in 300 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (109 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
[2026-05-27 09:09:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 158/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 67/231 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 239 constraints, problems are : Problem set: 0 solved, 7 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 158/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 67/231 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/519 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 246 constraints, problems are : Problem set: 0 solved, 7 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1504ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 394 ms.
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 288/288 transitions.
Graph (trivial) has 203 edges and 231 vertex of which 37 / 231 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 200 transition count 224
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 174 transition count 224
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 53 place count 174 transition count 210
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 81 place count 160 transition count 210
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 149 transition count 199
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 149 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 148 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 148 transition count 198
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 185 place count 108 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 197 place count 108 transition count 146
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 203 place count 102 transition count 140
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 102 transition count 140
Free-agglomeration rule applied 62 times.
Iterating global reduction 3 with 62 rules applied. Total rules applied 271 place count 102 transition count 78
Reduce places removed 62 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 82 rules applied. Total rules applied 353 place count 40 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 39 transition count 57
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 38 vertex of which 12 / 38 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 357 place count 32 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 370 place count 31 transition count 44
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 370 place count 31 transition count 38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 382 place count 25 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 387 place count 25 transition count 33
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 7 with 10 rules applied. Total rules applied 397 place count 20 transition count 28
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 398 place count 20 transition count 27
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 404 place count 20 transition count 21
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 418 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 420 place count 12 transition count 13
Applied a total of 420 rules in 53 ms. Remains 12 /231 variables (removed 219) and now considering 13/288 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 12/231 places, 13/288 transitions.
RANDOM walk for 1658 steps (0 resets) in 6 ms. (236 steps per ms) remains 0/2 properties
Knowledge based reduction with 43 factoid took 726 ms. Reduced automaton from 11 states, 46 edges and 4 AP (stutter insensitive) to 6 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Knowledge-based reduction took 3902 ms.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 288/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2026-05-27 09:09:55] [INFO ] Invariant cache hit.
[2026-05-27 09:09:55] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-27 09:09:55] [INFO ] Invariant cache hit.
[2026-05-27 09:09:55] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 231/231 places, 288/288 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 27 factoid took 246 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter sensitive) to 6 states, 24 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (732 resets) in 271 ms. (147 steps per ms) remains 9/16 properties
BEST_FIRST walk for 40002 steps (109 resets) in 88 ms. (449 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (111 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (116 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (117 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (111 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (111 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
[2026-05-27 09:09:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 158/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 67/231 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 239 constraints, problems are : Problem set: 0 solved, 7 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 158/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 67/231 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/519 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 246 constraints, problems are : Problem set: 0 solved, 7 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1699ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 645 ms.
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 288/288 transitions.
Graph (trivial) has 203 edges and 231 vertex of which 37 / 231 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 200 transition count 224
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 174 transition count 224
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 53 place count 174 transition count 210
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 81 place count 160 transition count 210
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 149 transition count 199
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 149 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 148 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 148 transition count 198
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 185 place count 108 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 197 place count 108 transition count 146
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 203 place count 102 transition count 140
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 102 transition count 140
Free-agglomeration rule applied 62 times.
Iterating global reduction 3 with 62 rules applied. Total rules applied 271 place count 102 transition count 78
Reduce places removed 62 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 82 rules applied. Total rules applied 353 place count 40 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 39 transition count 57
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 38 vertex of which 12 / 38 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 357 place count 32 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 370 place count 31 transition count 44
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 370 place count 31 transition count 38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 382 place count 25 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 387 place count 25 transition count 33
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 7 with 10 rules applied. Total rules applied 397 place count 20 transition count 28
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 398 place count 20 transition count 27
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 404 place count 20 transition count 21
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 418 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 420 place count 12 transition count 13
Applied a total of 420 rules in 32 ms. Remains 12 /231 variables (removed 219) and now considering 13/288 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 12/231 places, 13/288 transitions.
RANDOM walk for 979 steps (0 resets) in 5 ms. (163 steps per ms) remains 0/2 properties
Knowledge based reduction with 27 factoid took 370 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter sensitive) to 6 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Knowledge-based reduction took 3508 ms.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 24893 reset in 217 ms.
Product exploration explored 100000 steps with 24939 reset in 237 ms.
Spot run failed in 82 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/ltsmin18121300138193861992
[2026-05-27 09:10:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18121300138193861992
Running compilation step : cd /tmp/ltsmin18121300138193861992;'/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 816 ms.
Running link step : cd /tmp/ltsmin18121300138193861992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin18121300138193861992;'/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/stateBased13998790575895479394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 231 /231 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2026-05-27 09:10:15] [INFO ] Invariant cache hit.
[2026-05-27 09:10:15] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-27 09:10:15] [INFO ] Invariant cache hit.
[2026-05-27 09:10:16] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 231/231 places, 288/288 transitions.
Built C files in :
/tmp/ltsmin12373437116045950450
[2026-05-27 09:10:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12373437116045950450
Running compilation step : cd /tmp/ltsmin12373437116045950450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 891 ms.
Running link step : cd /tmp/ltsmin12373437116045950450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12373437116045950450;'/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/stateBased14865407077888853473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 09:10:31] [INFO ] Flatten gal took : 12 ms
[2026-05-27 09:10:31] [INFO ] Flatten gal took : 11 ms
[2026-05-27 09:10:31] [INFO ] Time to serialize gal into /tmp/LTL12271683177863159993.gal : 2 ms
[2026-05-27 09:10:31] [INFO ] Time to serialize properties into /tmp/LTL9919635675845287035.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/LTL12271683177863159993.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13624799303282259277.hoa' '-atoms' '/tmp/LTL9919635675845287035.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/LTL9919635675845287035.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13624799303282259277.hoa
Detected timeout of ITS tools.
[2026-05-27 09:10:46] [INFO ] Flatten gal took : 12 ms
[2026-05-27 09:10:46] [INFO ] Flatten gal took : 12 ms
[2026-05-27 09:10:46] [INFO ] Time to serialize gal into /tmp/LTL16421960591076123842.gal : 2 ms
[2026-05-27 09:10:46] [INFO ] Time to serialize properties into /tmp/LTL5950150713695253936.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/LTL16421960591076123842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5950150713695253936.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("(((p70==1)&&(p301==1))&&(p483==1))"))U((F((!("(((p70==1)&&(p301==1))&&(p483==1))"))&&(F(G("(p380!=1)")))))U((G((F((!("(((p70==1...336
Formula 0 simplified : X!"(((p70==1)&&(p301==1))&&(p483==1))" R ((GF!"(p380!=1)" | G"(((p70==1)&&(p301==1))&&(p483==1))") R (F(F!"(p227!=1)" & (GF!"(p380!=...296
Detected timeout of ITS tools.
[2026-05-27 09:11:01] [INFO ] Flatten gal took : 12 ms
[2026-05-27 09:11:01] [INFO ] Applying decomposition
[2026-05-27 09:11:01] [INFO ] Flatten gal took : 12 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/graph7115739610524486629.txt' '-o' '/tmp/graph7115739610524486629.bin' '-w' '/tmp/graph7115739610524486629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7115739610524486629.bin' '-l' '-1' '-v' '-w' '/tmp/graph7115739610524486629.weights' '-q' '0' '-e' '0.001'
[2026-05-27 09:11:01] [INFO ] Decomposing Gal with order
[2026-05-27 09:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 09:11:01] [INFO ] Removed a total of 124 redundant transitions.
[2026-05-27 09:11:01] [INFO ] Flatten gal took : 41 ms
[2026-05-27 09:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2026-05-27 09:11:01] [INFO ] Time to serialize gal into /tmp/LTL14743844936612472480.gal : 4 ms
[2026-05-27 09:11:01] [INFO ] Time to serialize properties into /tmp/LTL7365093658915933595.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/LTL14743844936612472480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7365093658915933595.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X("(((i1.i0.u13.p70==1)&&(i8.i1.u53.p301==1))&&(u65.p483==1))"))U((F((!("(((i1.i0.u13.p70==1)&&(i8.i1.u53.p301==1))&&(u65.p483==1)...495
Formula 0 simplified : X!"(((i1.i0.u13.p70==1)&&(i8.i1.u53.p301==1))&&(u65.p483==1))" R ((GF!"(i11.i1.u61.p380!=1)" | G"(((i1.i0.u13.p70==1)&&(i8.i1.u53.p3...455
Reverse transition relation is NOT exact ! Due to transitions t1, t40, t72, t73, t105, t106, t140, t141, t170, t171, t204, t257, t258, t259, t261, t262, u6...741
Computing Next relation with stutter on 3.26616e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 147615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 236 transition count 298
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 236 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 236 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 227 transition count 287
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 227 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 227 transition count 283
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 225 transition count 281
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 225 transition count 279
Applied a total of 64 rules in 12 ms. Remains 225 /253 variables (removed 28) and now considering 279/315 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11108108221116996811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7183039671181721323.kers'
[2026-05-27 09:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11108108221116996811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7183039671181721323.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 225 cols 749 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-27 09:11:16] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7183039671181721323.kers
Total runtime 2 ms.
[2026-05-27 09:11:16] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-27 09:11:16] [INFO ] Invariant cache hit.
[2026-05-27 09:11:17] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-27 09:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 29160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59209ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 59211ms
Starting structural reductions in LTL mode, iteration 1 : 225/253 places, 279/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59748 ms. Remains : 225/253 places, 279/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2399 steps with 40 reset in 3 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-12 finished in 59901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Graph (trivial) has 230 edges and 253 vertex of which 37 / 253 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 221 transition count 248
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 187 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 186 transition count 247
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 71 place count 186 transition count 232
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 101 place count 171 transition count 232
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 124 place count 148 transition count 209
Iterating global reduction 3 with 23 rules applied. Total rules applied 147 place count 148 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 148 transition count 207
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 143 transition count 202
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 143 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 164 place count 143 transition count 197
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 240 place count 105 transition count 159
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 241 place count 104 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 104 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 243 place count 104 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 249 place count 104 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 102 transition count 149
Applied a total of 251 rules in 39 ms. Remains 102 /253 variables (removed 151) and now considering 149/315 (removed 166) transitions.
[2026-05-27 09:12:16] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17845307884081809044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4048200991324019654.kers'
[2026-05-27 09:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17845307884081809044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4048200991324019654.kers]
Normalized transition count is 138 out of 139 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 102 cols 412 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-27 09:12:16] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4048200991324019654.kers
Total runtime 7 ms.
[2026-05-27 09:12:16] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-27 09:12:16] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2026-05-27 09:12:16] [INFO ] Invariant cache hit.
[2026-05-27 09:12:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 09:12:16] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2026-05-27 09:12:17] [INFO ] Redundant transitions in 8 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-27 09:12:17] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2026-05-27 09:12:17] [INFO ] Invariant cache hit.
[2026-05-27 09:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 138/240 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/241 variables, and 111 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5274 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 138/240 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 81/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/241 variables, and 192 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11078ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 11079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/253 places, 149/315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11538 ms. Remains : 102/253 places, 149/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-13 finished in 11618 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&&F(p1)) U X(X(p1)))||F(p2)))'
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 238 transition count 300
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 238 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 238 transition count 299
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 229 transition count 290
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 229 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 53 place count 229 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 228 transition count 285
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 228 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 228 transition count 284
Applied a total of 56 rules in 18 ms. Remains 228 /253 variables (removed 25) and now considering 284/315 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7758400131028326080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4884087179807000440.kers'
[2026-05-27 09:12:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7758400131028326080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4884087179807000440.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 228 cols 767 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-27 09:12:28] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4884087179807000440.kers
Total runtime 3 ms.
[2026-05-27 09:12:28] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-27 09:12:28] [INFO ] Invariant cache hit.
[2026-05-27 09:12:28] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-27 09:12:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/512 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 236 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/512 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 283/519 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 7/526 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 531 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 228/253 places, 284/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 228/253 places, 284/315 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0&&F(p1)) U X(X(p1)))||F(p2)))'
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-14
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-14 finished in 61079 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(X(p0)) U (F(p1) U p2)))&&F(p3))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 315/315 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 238 transition count 300
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 238 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 238 transition count 298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 40 place count 230 transition count 290
Iterating global reduction 1 with 8 rules applied. Total rules applied 48 place count 230 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 230 transition count 287
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 228 transition count 285
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 228 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 228 transition count 283
Applied a total of 57 rules in 17 ms. Remains 228 /253 variables (removed 25) and now considering 283/315 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3388975702310304436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2441448792298547296.kers'
[2026-05-27 09:13:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3388975702310304436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2441448792298547296.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 228 cols 761 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-27 09:13:29] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2441448792298547296.kers
Total runtime 3 ms.
[2026-05-27 09:13:29] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-27 09:13:29] [INFO ] Invariant cache hit.
[2026-05-27 09:13:29] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-27 09:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 283/511 variables, 228/250 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 250 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/511 variables, 228/250 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 282/532 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 10/542 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 545 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 228/253 places, 283/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 228/253 places, 283/315 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(X(p0)) U (F(p1) U p2)))&&F(p3))))'
Stuttering acceptance computed with spot in 549 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-15
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-15 finished in 61368 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(X(F(!(!X(p0) U X(p1)))))||!(!p0 U p2)))'
Spot run failed in 84 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F((!p0&&F(G(p1)))) U (G((F((!p0&&F(G(p1))))||G(p2)))||(p3&&(F((!p0&&F(G(p1))))||G(p2)))))))'
Spot run failed in 77 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-27 09:14:30] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5294479439791114348
[2026-05-27 09:14:30] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2026-05-27 09:14:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:14:30] [INFO ] Applying decomposition
[2026-05-27 09:14:30] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2026-05-27 09:14:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:14:30] [INFO ] Flatten gal took : 17 ms
[2026-05-27 09:14:30] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
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/graph14287805278739758045.txt' '-o' '/tmp/graph14287805278739758045.bin' '-w' '/tmp/graph14287805278739758045.weights'
[2026-05-27 09:14:31] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14287805278739758045.bin' '-l' '-1' '-v' '-w' '/tmp/graph14287805278739758045.weights' '-q' '0' '-e' '0.001'
[2026-05-27 09:14:31] [INFO ] Decomposing Gal with order
[2026-05-27 09:14:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 09:14:31] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5294479439791114348
Running compilation step : cd /tmp/ltsmin5294479439791114348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 09:14:31] [INFO ] Removed a total of 136 redundant transitions.
[2026-05-27 09:14:31] [INFO ] Flatten gal took : 30 ms
[2026-05-27 09:14:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2026-05-27 09:14:31] [INFO ] Time to serialize gal into /tmp/LTLFireability6152781566249585717.gal : 5 ms
[2026-05-27 09:14:31] [INFO ] Time to serialize properties into /tmp/LTLFireability17560621808311541944.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/LTLFireability6152781566249585717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17560621808311541944.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 2 LTL properties
Checking formula 0 : !(((F(X(F(!((!(X("(i3.i0.u16.p117==1)")))U(X("(i8.i1.u50.p293==1)")))))))||(!(("(i3.i0.u16.p117!=1)")U("(i7.i1.u46.p272==1)")))))
Formula 0 simplified : ("(i3.i0.u16.p117!=1)" U "(i7.i1.u46.p272==1)") & XXG(!"(i3.i0.u16.p117==1)" U "(i8.i1.u50.p293==1)")
Compilation finished in 1306 ms.
Running link step : cd /tmp/ltsmin5294479439791114348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5294479439791114348;'/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((LTLAPp0==true)) U X((LTLAPp1==true))))))||!(!(LTLAPp0==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t39, t40, t72, t73, t105, t106, t141, t170, t181, t204, t258, t260, t261, t262, i0.t216, i0.i...1016
Computing Next relation with stutter on 5.17295e+07 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
42303 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,423.092,3604032,1,0,5.87223e+06,55479,1765,1.14033e+07,591,333406,9772036
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("(((i1.i0.u13.p70==1)&&(i8.i1.u51.p301==1))&&(i12.u70.p483==1))"))U((F((!("(((i1.i0.u13.p70==1)&&(i8.i1.u51.p301==1))&&(i12.u70....511
Formula 1 simplified : X!"(((i1.i0.u13.p70==1)&&(i8.i1.u51.p301==1))&&(i12.u70.p483==1))" R ((GF!"(i10.i1.u62.p380!=1)" | G"(((i1.i0.u13.p70==1)&&(i8.i1.u5...471
Computing Next relation with stutter on 5.17295e+07 deadlock states
10 unique states visited
6 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
31231 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,735.42,4173516,1,0,6.6192e+06,55479,1774,1.23672e+07,588,333406,7078410
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1571425 ms.

BK_STOP 1779874020203

--------------------
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r130-smll-177955809100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b 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 ;