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.r354-tall-178024402800188.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 SupplyChain-PT-00020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 27 07:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 07:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 07:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 07:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 27 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 27 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 81K May 26 18:17 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 SupplyChain-PT-00020-LTLFireability-00
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-01
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-02
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-03
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-04
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-05
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-06
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-07
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-08
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-09
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-10
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-11
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-12
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-13
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-14
FORMULA_NAME SupplyChain-PT-00020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780250782057

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 18:06:23] [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-31 18:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:06:23] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-31 18:06:23] [INFO ] Transformed 264 places.
[2026-05-31 18:06:23] [INFO ] Transformed 163 transitions.
[2026-05-31 18:06:23] [INFO ] Parsed PT model containing 264 places and 163 transitions and 726 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SupplyChain-PT-00020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 163/163 transitions.
Ensure Unique test removed 65 places
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 199 transition count 163
Applied a total of 65 rules in 33 ms. Remains 199 /264 variables (removed 65) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9274190732725844275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1806561318904427526.kers'
[2026-05-31 18:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9274190732725844275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1806561318904427526.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 162 rows 184 cols 524 entries
Finished phase 1 with 102 SingleSign rule and 20 generalized
[2026-05-31 18:06:23] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1806561318904427526.kers
Total runtime 2 ms.
[2026-05-31 18:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/196 variables, 40/74 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 3/199 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/361 variables, 199/277 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 278 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11795 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/196 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 3/199 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/361 variables, 199/277 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 143/420 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 421 constraints, problems are : Problem set: 0 solved, 143 unsolved in 15818 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27747ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 27766ms
[2026-05-31 18:06:51] [INFO ] Invariant cache hit.
[2026-05-31 18:06:51] [INFO ] Implicit Places using invariants in 130 ms returned [0, 69, 70, 72, 73, 76, 77, 78, 79, 80, 81, 83, 85, 88, 96, 180, 181, 182, 184, 185, 186, 187, 189, 190, 191, 192, 196, 197]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 138 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/264 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28001 ms. Remains : 171/264 places, 163/163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1446264212709841304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16886966666547992934.kers'
[2026-05-31 18:06:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1446264212709841304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16886966666547992934.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:06:51] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16886966666547992934.kers
Total runtime 1 ms.
[2026-05-31 18:06:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/168 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/333 variables, 171/221 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 222 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9855 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/168 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/333 variables, 171/221 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 143/364 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 1/334 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/334 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 365 constraints, problems are : Problem set: 0 solved, 143 unsolved in 13561 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23445ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 23448ms
[2026-05-31 18:07:15] [INFO ] Invariant cache hit.
[2026-05-31 18:07:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-31 18:07:15] [INFO ] Invariant cache hit.
[2026-05-31 18:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:07:15] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 23643 ms. Remains : 171/171 places, 163/163 transitions.
Support contains 59 out of 171 places after structural reductions.
[2026-05-31 18:07:15] [INFO ] Flatten gal took : 38 ms
[2026-05-31 18:07:15] [INFO ] Flatten gal took : 14 ms
[2026-05-31 18:07:15] [INFO ] Input system was already deterministic with 163 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 3382 steps (31 resets) in 205 ms. (16 steps per ms) remains 0/29 properties
Computed a total of 171 stabilizing places and 162 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 156 transition count 163
Applied a total of 15 rules in 7 ms. Remains 156 /171 variables (removed 15) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18300427769585415447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3380641800500518405.kers'
[2026-05-31 18:07:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18300427769585415447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3380641800500518405.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:07:16] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3380641800500518405.kers
Total runtime 1 ms.
[2026-05-31 18:07:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/156 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/318 variables, 156/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 192 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7907 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/156 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/318 variables, 156/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 143/334 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/319 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 335 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11711 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19650ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19650ms
[2026-05-31 18:07:35] [INFO ] Invariant cache hit.
[2026-05-31 18:07:36] [INFO ] Implicit Places using invariants in 92 ms returned [0, 62, 63, 64, 66, 68, 150, 152, 153, 154, 155]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 97 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/171 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19760 ms. Remains : 145/171 places, 163/163 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((F(G(p0))||p1))))'
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 172 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Computed a total of 145 stabilizing places and 162 stable transitions
Computed a total of 145 stabilizing places and 162 stable transitions
Detected a total of 145/145 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 136 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 379 ms.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 163/163 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1605384796175985952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16960616794343459880.kers'
[2026-05-31 18:07:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1605384796175985952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16960616794343459880.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 145 cols 389 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:07:37] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16960616794343459880.kers
Total runtime 1 ms.
[2026-05-31 18:07:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 20/145 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 162/307 variables, 145/169 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/308 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 170 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7377 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/145 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 162/307 variables, 145/169 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 143/312 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/308 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/308 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 313 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9717 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17119ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 17121ms
[2026-05-31 18:07:54] [INFO ] Invariant cache hit.
[2026-05-31 18:07:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-31 18:07:54] [INFO ] Invariant cache hit.
[2026-05-31 18:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:07:54] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 17335 ms. Remains : 145/145 places, 163/163 transitions.
Computed a total of 145 stabilizing places and 162 stable transitions
Computed a total of 145 stabilizing places and 162 stable transitions
Detected a total of 145/145 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 96 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 380 ms.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Spot run failed in 85 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/ltsmin16824416773041560736
[2026-05-31 18:07:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16824416773041560736
Running compilation step : cd /tmp/ltsmin16824416773041560736;'/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 437 ms.
Running link step : cd /tmp/ltsmin16824416773041560736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16824416773041560736;'/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/stateBased5062289401492268738.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:08:10] [INFO ] Invariant cache hit.
[2026-05-31 18:08:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-31 18:08:10] [INFO ] Invariant cache hit.
[2026-05-31 18:08:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:08:10] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 145/145 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin9865907078591052610
[2026-05-31 18:08:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9865907078591052610
Running compilation step : cd /tmp/ltsmin9865907078591052610;'/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 256 ms.
Running link step : cd /tmp/ltsmin9865907078591052610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9865907078591052610;'/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/stateBased9779090973238393098.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 18:08:26] [INFO ] Flatten gal took : 41 ms
[2026-05-31 18:08:26] [INFO ] Flatten gal took : 8 ms
[2026-05-31 18:08:26] [INFO ] Time to serialize gal into /tmp/LTL17581710345393721233.gal : 3 ms
[2026-05-31 18:08:26] [INFO ] Time to serialize properties into /tmp/LTL8374149117721805560.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17581710345393721233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15734776719072992090.hoa' '-atoms' '/tmp/LTL8374149117721805560.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/LTL8374149117721805560.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15734776719072992090.hoa
Detected timeout of ITS tools.
[2026-05-31 18:08:41] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:08:41] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:08:41] [INFO ] Time to serialize gal into /tmp/LTL15556189313894858125.gal : 2 ms
[2026-05-31 18:08:41] [INFO ] Time to serialize properties into /tmp/LTL10782198829721527871.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15556189313894858125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10782198829721527871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((p179<1)||(p196<1))")))||("((p163>=1)&&(p200>=1))")))))
Formula 0 simplified : XX(!"((p163>=1)&&(p200>=1))" & GF!"((p179<1)||(p196<1))")
Detected timeout of ITS tools.
[2026-05-31 18:08:56] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:08:56] [INFO ] Applying decomposition
[2026-05-31 18:08:56] [INFO ] Flatten gal took : 7 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/graph6463035188862220522.txt' '-o' '/tmp/graph6463035188862220522.bin' '-w' '/tmp/graph6463035188862220522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6463035188862220522.bin' '-l' '-1' '-v' '-w' '/tmp/graph6463035188862220522.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:08:56] [INFO ] Decomposing Gal with order
[2026-05-31 18:08:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:08:56] [INFO ] Removed a total of 27 redundant transitions.
[2026-05-31 18:08:56] [INFO ] Flatten gal took : 65 ms
[2026-05-31 18:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2026-05-31 18:08:56] [INFO ] Time to serialize gal into /tmp/LTL17562028019409410922.gal : 3 ms
[2026-05-31 18:08:56] [INFO ] Time to serialize properties into /tmp/LTL8239998415136676128.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/LTL17562028019409410922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8239998415136676128.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i15.u16.p179<1)||(i15.u18.p196<1))")))||("((i7.u9.p163>=1)&&(i7.u19.p200>=1))")))))
Formula 0 simplified : XX(!"((i7.u9.p163>=1)&&(i7.u19.p200>=1))" & GF!"((i15.u16.p179<1)||(i15.u18.p196<1))")
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00020-LTLFireability-00 finished in 115260 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(p2)||G(p3)||p1)))&&p0)))'
Support contains 11 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 160 transition count 163
Applied a total of 11 rules in 6 ms. Remains 160 /171 variables (removed 11) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1109742373695049065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-321364697071905587.kers'
[2026-05-31 18:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1109742373695049065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-321364697071905587.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:09:11] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-321364697071905587.kers
Total runtime 2 ms.
[2026-05-31 18:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/160 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/322 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 200 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7979 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/160 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/322 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 143/342 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/323 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 343 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11994 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19995ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19997ms
[2026-05-31 18:09:31] [INFO ] Invariant cache hit.
[2026-05-31 18:09:31] [INFO ] Implicit Places using invariants in 87 ms returned [0, 64, 65, 66, 67, 68, 69, 70, 156, 157, 158]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 89 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/171 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20110 ms. Remains : 149/171 places, 163/163 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(p2)||G(p3)||p1)))&&p0)))'
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p1) (NOT p3))]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-01 finished in 20490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 15 places
Reduce places removed 32 places and 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 114
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 98 rules applied. Total rules applied 130 place count 102 transition count 53
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 30 rules applied. Total rules applied 160 place count 73 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 72 transition count 52
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 161 place count 72 transition count 31
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 55 rules applied. Total rules applied 216 place count 38 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 38 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 217 place count 38 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 37 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 35 transition count 27
Applied a total of 221 rules in 27 ms. Remains 35 /171 variables (removed 136) and now considering 27/163 (removed 136) transitions.
Running 13 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18026843860005753731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7398210658233222142.kers'
[2026-05-31 18:09:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18026843860005753731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7398210658233222142.kers]
Normalized transition count is 26 out of 27 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 26 rows 35 cols 75 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-31 18:09:32] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7398210658233222142.kers
Total runtime 1 ms.
[2026-05-31 18:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 8/35 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 26/61 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 52 constraints, problems are : Problem set: 0 solved, 13 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 8/35 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 26/61 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/62 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 65 constraints, problems are : Problem set: 0 solved, 13 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 487ms
[2026-05-31 18:09:32] [INFO ] Invariant cache hit.
[2026-05-31 18:09:32] [INFO ] Implicit Places using invariants in 36 ms returned [15, 16, 17, 19, 20, 21, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 37 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/171 places, 27/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 28 transition count 21
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 22 transition count 15
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 22 transition count 9
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 35 place count 11 transition count 9
Applied a total of 35 rules in 2 ms. Remains 11 /28 variables (removed 17) and now considering 9/27 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13001175148812880314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9242843071766768355.kers'
[2026-05-31 18:09:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13001175148812880314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9242843071766768355.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 11 cols 21 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-31 18:09:32] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9242843071766768355.kers
Total runtime 0 ms.
[2026-05-31 18:09:32] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/171 places, 9/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 580 ms. Remains : 10/171 places, 9/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 105 ms.
Product exploration explored 100000 steps with 8 reset in 99 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Computed a total of 10 stabilizing places and 8 stable transitions
Detected a total of 10/10 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 411 ms.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 7 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16803951765240174916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18175858673845118661.kers'
[2026-05-31 18:09:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16803951765240174916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18175858673845118661.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 10 cols 20 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-31 18:09:33] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18175858673845118661.kers
Total runtime 1 ms.
[2026-05-31 18:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 186ms
[2026-05-31 18:09:33] [INFO ] Invariant cache hit.
[2026-05-31 18:09:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-31 18:09:33] [INFO ] Invariant cache hit.
[2026-05-31 18:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:09:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-31 18:09:33] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Computed a total of 10 stabilizing places and 8 stable transitions
Detected a total of 10/10 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 67 steps (8 resets) in 6 ms. (9 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 470 ms.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Built C files in :
/tmp/ltsmin7244019423959311623
[2026-05-31 18:09:34] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2026-05-31 18:09:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:09:34] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2026-05-31 18:09:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:09:34] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2026-05-31 18:09:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:09:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7244019423959311623
Running compilation step : cd /tmp/ltsmin7244019423959311623;'/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 79 ms.
Running link step : cd /tmp/ltsmin7244019423959311623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7244019423959311623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9135433950018776016.hoa' '--buchi-type=spotba'
LTSmin run took 24 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SupplyChain-PT-00020-LTLFireability-02 finished in 2769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 15 places
Reduce places removed 32 places and 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 139 transition count 134
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 33 rules applied. Total rules applied 45 place count 127 transition count 113
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 118 transition count 113
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 54 place count 118 transition count 94
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 97 place count 94 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 97 place count 94 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 91 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 91 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 91 transition count 89
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 106 place count 90 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 87
Applied a total of 108 rules in 33 ms. Remains 88 /171 variables (removed 83) and now considering 87/163 (removed 76) transitions.
Running 49 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14513413466337513655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11134742867599448156.kers'
[2026-05-31 18:09:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14513413466337513655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11134742867599448156.kers]
Normalized transition count is 86 out of 87 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 88 cols 249 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-31 18:09:34] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11134742867599448156.kers
Total runtime 2 ms.
[2026-05-31 18:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 20/88 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 86/174 variables, 88/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 119 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 20/88 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 86/174 variables, 88/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 49/167 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/175 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 168 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2454 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4164ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4165ms
[2026-05-31 18:09:38] [INFO ] Invariant cache hit.
[2026-05-31 18:09:39] [INFO ] Implicit Places using invariants in 63 ms returned [29, 30, 31, 32, 33, 34]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 65 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/171 places, 87/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 82 transition count 81
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 76 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 76 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 70 transition count 69
Applied a total of 30 rules in 10 ms. Remains 70 /82 variables (removed 12) and now considering 69/87 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14039533069376990899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9167350729652217746.kers'
[2026-05-31 18:09:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14039533069376990899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9167350729652217746.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 70 cols 201 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-31 18:09:39] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9167350729652217746.kers
Total runtime 1 ms.
[2026-05-31 18:09:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-31 18:09:39] [INFO ] Invariant cache hit.
[2026-05-31 18:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:09:39] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/171 places, 69/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4385 ms. Remains : 70/171 places, 69/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-03
Stuttering criterion allowed to conclude after 56 steps with 1 reset in 1 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-03 finished in 4563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U p2)))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 12 places
Reduce places removed 29 places and 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 142 transition count 133
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 35 rules applied. Total rules applied 48 place count 129 transition count 111
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 57 place count 120 transition count 111
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 57 place count 120 transition count 92
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 100 place count 96 transition count 92
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 100 place count 96 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 92 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 90 transition count 86
Applied a total of 110 rules in 15 ms. Remains 90 /171 variables (removed 81) and now considering 86/163 (removed 77) transitions.
Running 47 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-335908716302505474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16724030277099205502.kers'
[2026-05-31 18:09:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-335908716302505474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16724030277099205502.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 85 rows 87 cols 248 entries
Finished phase 1 with 57 SingleSign rule and 1 generalized
[2026-05-31 18:09:39] [INFO ] Computed 32 invariants in 0 ms
Computed 32 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16724030277099205502.kers
Total runtime 1 ms.
[2026-05-31 18:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 20/89 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 85/175 variables, 90/123 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 1/176 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/176 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 124 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1955 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 20/89 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 85/175 variables, 90/123 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 47/170 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 1/176 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/176 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 171 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4441ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 4442ms
[2026-05-31 18:09:43] [INFO ] Invariant cache hit.
[2026-05-31 18:09:43] [INFO ] Implicit Places using invariants in 76 ms returned [29, 30, 31, 32, 33, 34, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 78 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/171 places, 86/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 80
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 19 place count 77 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 76 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 76 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 71 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 71 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 31 place count 71 transition count 66
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 33 place count 70 transition count 66
Applied a total of 33 rules in 9 ms. Remains 70 /83 variables (removed 13) and now considering 66/86 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14528526008840876224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4556638859392864748.kers'
[2026-05-31 18:09:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14528526008840876224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4556638859392864748.kers]
Normalized transition count is 65 out of 66 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 65 rows 67 cols 192 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-31 18:09:43] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4556638859392864748.kers
Total runtime 0 ms.
[2026-05-31 18:09:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-31 18:09:43] [INFO ] Invariant cache hit.
[2026-05-31 18:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:09:43] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/171 places, 66/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4664 ms. Remains : 70/171 places, 66/163 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 U p1)||p2))))'
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-05
Stuttering criterion allowed to conclude after 76 steps with 2 reset in 1 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-05 finished in 4779 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&&G(p1)))||X(X(F(p2))))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 13 places
Reduce places removed 29 places and 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 142 transition count 116
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 70 rules applied. Total rules applied 101 place count 111 transition count 77
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 103 transition count 77
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 109 place count 103 transition count 58
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 153 place count 78 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 153 place count 78 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 161 place count 74 transition count 54
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 71 transition count 51
Applied a total of 164 rules in 13 ms. Remains 71 /171 variables (removed 100) and now considering 51/163 (removed 112) transitions.
Running 24 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2193587333637812481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10459449622763437210.kers'
[2026-05-31 18:09:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2193587333637812481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10459449622763437210.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 50 rows 68 cols 133 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-31 18:09:44] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10459449622763437210.kers
Total runtime 2 ms.
[2026-05-31 18:09:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 20/71 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 50/121 variables, 71/102 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 103 constraints, problems are : Problem set: 0 solved, 24 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 20/71 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 50/121 variables, 71/102 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 127 constraints, problems are : Problem set: 0 solved, 24 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1408ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1409ms
[2026-05-31 18:09:45] [INFO ] Invariant cache hit.
[2026-05-31 18:09:45] [INFO ] Implicit Places using invariants in 62 ms returned [29, 30, 31, 32, 33, 34, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 63 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/171 places, 51/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 64 transition count 44
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 57 transition count 37
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 57 transition count 30
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 50 transition count 30
Applied a total of 35 rules in 3 ms. Remains 50 /64 variables (removed 14) and now considering 30/51 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-806586147233869748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11990218374893362068.kers'
[2026-05-31 18:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-806586147233869748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11990218374893362068.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 29 rows 47 cols 77 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-31 18:09:45] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11990218374893362068.kers
Total runtime 0 ms.
[2026-05-31 18:09:45] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-31 18:09:45] [INFO ] Invariant cache hit.
[2026-05-31 18:09:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:09:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/171 places, 30/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1594 ms. Remains : 50/171 places, 30/163 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&&G(p1)))||X(X(F(p2))))))'
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-06
Product exploration explored 100000 steps with 24062 reset in 209 ms.
Product exploration explored 100000 steps with 24198 reset in 218 ms.
Computed a total of 50 stabilizing places and 29 stable transitions
Computed a total of 50 stabilizing places and 29 stable transitions
Detected a total of 50/50 stabilizing places and 29/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 8 factoid took 512 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 377 steps (12 resets) in 14 ms. (25 steps per ms) remains 0/7 properties
Knowledge based reduction with 8 factoid took 700 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 1352 ms.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Running 9 sub problems to find dead transitions.
[2026-05-31 18:09:47] [INFO ] Invariant cache hit.
[2026-05-31 18:09:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 20/50 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 29/79 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/80 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 75 constraints, problems are : Problem set: 0 solved, 9 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 20/50 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 29/79 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/80 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 84 constraints, problems are : Problem set: 0 solved, 9 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 491ms
[2026-05-31 18:09:48] [INFO ] Invariant cache hit.
[2026-05-31 18:09:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-31 18:09:48] [INFO ] Invariant cache hit.
[2026-05-31 18:09:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:09:48] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-31 18:09:48] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 601 ms. Remains : 50/50 places, 30/30 transitions.
Computed a total of 50 stabilizing places and 29 stable transitions
Computed a total of 50 stabilizing places and 29 stable transitions
Detected a total of 50/50 stabilizing places and 29/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 7 factoid took 624 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 433 steps (15 resets) in 15 ms. (27 steps per ms) remains 0/7 properties
Knowledge based reduction with 7 factoid took 926 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 1700 ms.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Built C files in :
/tmp/ltsmin13909342740836805069
[2026-05-31 18:09:50] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2026-05-31 18:09:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:09:50] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2026-05-31 18:09:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:09:50] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2026-05-31 18:09:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:09:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13909342740836805069
Running compilation step : cd /tmp/ltsmin13909342740836805069;'/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 122 ms.
Running link step : cd /tmp/ltsmin13909342740836805069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13909342740836805069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1376494935230227535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:10:05] [INFO ] Invariant cache hit.
[2026-05-31 18:10:05] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-31 18:10:05] [INFO ] Invariant cache hit.
[2026-05-31 18:10:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:10:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2026-05-31 18:10:05] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 50/50 places, 30/30 transitions.
Built C files in :
/tmp/ltsmin11435157126907696387
[2026-05-31 18:10:05] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2026-05-31 18:10:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:10:05] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2026-05-31 18:10:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:10:05] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2026-05-31 18:10:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:10:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11435157126907696387
Running compilation step : cd /tmp/ltsmin11435157126907696387;'/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 109 ms.
Running link step : cd /tmp/ltsmin11435157126907696387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11435157126907696387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9477955493429274643.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 18:10:20] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:10:20] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:10:20] [INFO ] Time to serialize gal into /tmp/LTL16494152649422069486.gal : 1 ms
[2026-05-31 18:10:20] [INFO ] Time to serialize properties into /tmp/LTL11282664977713901281.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/LTL16494152649422069486.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17552218353183694947.hoa' '-atoms' '/tmp/LTL11282664977713901281.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11282664977713901281.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17552218353183694947.hoa
Reverse transition relation is NOT exact ! Due to transitions t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
128 unique states visited
0 strongly connected components in search stack
170 transitions explored
28 items max in DFS search stack
65 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,0.661568,39532,1,0,302,114274,103,88,1273,90098,1103
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00020-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SupplyChain-PT-00020-LTLFireability-06 finished in 37474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 158 transition count 163
Applied a total of 13 rules in 1 ms. Remains 158 /171 variables (removed 13) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9158612874813993585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5096626263800369607.kers'
[2026-05-31 18:10:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9158612874813993585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5096626263800369607.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:10:21] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5096626263800369607.kers
Total runtime 2 ms.
[2026-05-31 18:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/158 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/320 variables, 158/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/321 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 196 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8176 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/158 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/320 variables, 158/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 143/338 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 339 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11271 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19472ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19472ms
[2026-05-31 18:10:41] [INFO ] Invariant cache hit.
[2026-05-31 18:10:41] [INFO ] Implicit Places using invariants in 88 ms returned [0, 63, 64, 65, 66, 67, 68, 69, 152, 154, 155, 156, 157]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 89 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/171 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19566 ms. Remains : 145/171 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-07 finished in 19755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0) U p1)&&X(p2)))||(F(!p1)&&G(p0))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 157 transition count 163
Applied a total of 14 rules in 4 ms. Remains 157 /171 variables (removed 14) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4222068441614912678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-114936254327592138.kers'
[2026-05-31 18:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4222068441614912678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-114936254327592138.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:10:41] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-114936254327592138.kers
Total runtime 3 ms.
[2026-05-31 18:10:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/156 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/319 variables, 157/193 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 1/320 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 0/320 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 194 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9131 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/156 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/319 variables, 157/193 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 143/336 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 1/320 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/320 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 337 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12308 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21459ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 21460ms
[2026-05-31 18:11:02] [INFO ] Invariant cache hit.
[2026-05-31 18:11:02] [INFO ] Implicit Places using invariants in 119 ms returned [0, 62, 64, 65, 66, 67, 68, 151, 153, 154, 155, 156]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 121 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/171 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21589 ms. Remains : 145/171 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0) U p1)&&X(p2)))||(F(!p1)&&G(p0))))'
Stuttering acceptance computed with spot in 524 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND p1 (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (NOT p0), p1]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-08 finished in 22157 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((F((p1&&F(p2)))||p0))))'
Support contains 9 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 156 transition count 163
Applied a total of 15 rules in 1 ms. Remains 156 /171 variables (removed 15) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17008521549606916065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9801788007052600887.kers'
[2026-05-31 18:11:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17008521549606916065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9801788007052600887.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:11:03] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9801788007052600887.kers
Total runtime 2 ms.
[2026-05-31 18:11:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/156 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/318 variables, 156/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 192 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7720 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/156 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/318 variables, 156/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 143/334 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/319 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 335 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11420 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19162ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19163ms
[2026-05-31 18:11:22] [INFO ] Invariant cache hit.
[2026-05-31 18:11:22] [INFO ] Implicit Places using invariants in 83 ms returned [62, 63, 64, 65, 67, 68, 150, 152, 153, 155]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 84 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/171 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19250 ms. Remains : 146/171 places, 163/163 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((F((p1&&F(p2)))||p0))))'
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-09
Product exploration explored 100000 steps with 2341 reset in 270 ms.
Product exploration explored 100000 steps with 2339 reset in 276 ms.
Computed a total of 146 stabilizing places and 162 stable transitions
Computed a total of 146 stabilizing places and 162 stable transitions
Detected a total of 146/146 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 1856 steps (16 resets) in 29 ms. (61 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2047623098685817432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17150820317867894146.kers'
[2026-05-31 18:11:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2047623098685817432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17150820317867894146.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 146 cols 394 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:11:24] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17150820317867894146.kers
Total runtime 1 ms.
[2026-05-31 18:11:24] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2026-05-31 18:11:24] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-31 18:11:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:11:24] [INFO ] [Nat]Absence check using 24 positive place invariants in 8 ms returned sat
[2026-05-31 18:11:24] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-31 18:11:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:11:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-31 18:11:24] [INFO ] Computed and/alt/rep : 142/172/142 causal constraints (skipped 1 transitions) in 12 ms.
[2026-05-31 18:11:24] [INFO ] Added : 86 causal constraints over 18 iterations in 247 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1326 ms.
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
[2026-05-31 18:11:25] [INFO ] Invariant cache hit.
[2026-05-31 18:11:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 20/146 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 162/308 variables, 146/171 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/309 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 172 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7531 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/146 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 162/308 variables, 146/171 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 143/314 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/309 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 315 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10807 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18354ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 18355ms
[2026-05-31 18:11:43] [INFO ] Invariant cache hit.
[2026-05-31 18:11:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-31 18:11:43] [INFO ] Invariant cache hit.
[2026-05-31 18:11:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:11:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 18559 ms. Remains : 146/146 places, 163/163 transitions.
Computed a total of 146 stabilizing places and 162 stable transitions
Computed a total of 146 stabilizing places and 162 stable transitions
Detected a total of 146/146 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 1147 steps (9 resets) in 20 ms. (54 steps per ms) remains 0/5 properties
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-31 18:11:44] [INFO ] Invariant cache hit.
[2026-05-31 18:11:44] [INFO ] [Real]Absence check using 24 positive place invariants in 7 ms returned sat
[2026-05-31 18:11:44] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-31 18:11:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:11:44] [INFO ] [Nat]Absence check using 24 positive place invariants in 8 ms returned sat
[2026-05-31 18:11:44] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-31 18:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:11:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-31 18:11:44] [INFO ] Computed and/alt/rep : 142/172/142 causal constraints (skipped 1 transitions) in 10 ms.
[2026-05-31 18:11:44] [INFO ] Added : 86 causal constraints over 18 iterations in 242 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1211 ms.
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2349 reset in 253 ms.
Product exploration explored 100000 steps with 2416 reset in 271 ms.
Spot run failed in 38 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/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/ltsmin4898251247071144497
[2026-05-31 18:11:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4898251247071144497
Running compilation step : cd /tmp/ltsmin4898251247071144497;'/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 240 ms.
Running link step : cd /tmp/ltsmin4898251247071144497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4898251247071144497;'/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/stateBased8904443657671896621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:12:00] [INFO ] Invariant cache hit.
[2026-05-31 18:12:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-31 18:12:00] [INFO ] Invariant cache hit.
[2026-05-31 18:12:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:12:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 146/146 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin9556251162719242788
[2026-05-31 18:12:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9556251162719242788
Running compilation step : cd /tmp/ltsmin9556251162719242788;'/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 261 ms.
Running link step : cd /tmp/ltsmin9556251162719242788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9556251162719242788;'/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/stateBased818699184602159551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 18:12:16] [INFO ] Flatten gal took : 12 ms
[2026-05-31 18:12:16] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:12:16] [INFO ] Time to serialize gal into /tmp/LTL3041165081464014218.gal : 1 ms
[2026-05-31 18:12:16] [INFO ] Time to serialize properties into /tmp/LTL2112318441160395817.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3041165081464014218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1896370817663394317.hoa' '-atoms' '/tmp/LTL2112318441160395817.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...317
Loading property file /tmp/LTL2112318441160395817.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1896370817663394317.hoa
Detected timeout of ITS tools.
[2026-05-31 18:12:31] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:12:31] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:12:31] [INFO ] Time to serialize gal into /tmp/LTL9558590619767149090.gal : 1 ms
[2026-05-31 18:12:31] [INFO ] Time to serialize properties into /tmp/LTL9689426426170561850.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/LTL9558590619767149090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9689426426170561850.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((("(p224>=2)")||(F(("(p150>=1)")&&(F("(((p119<1)||(p21<1))||(p96<1))")))))||("((((p101>=1)&&(p104>=1))&&(p21>=1))||((p198>=1)&&...171
Formula 0 simplified : XX(!"((((p101>=1)&&(p104>=1))&&(p21>=1))||((p198>=1)&&(p80>=1)))" & !"(p224>=2)" & G(!"(p150>=1)" | G!"(((p119<1)||(p21<1))||(p96<1)...159
Detected timeout of ITS tools.
[2026-05-31 18:12:46] [INFO ] Flatten gal took : 8 ms
[2026-05-31 18:12:46] [INFO ] Applying decomposition
[2026-05-31 18:12:46] [INFO ] Flatten gal took : 6 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/graph8603046917639690695.txt' '-o' '/tmp/graph8603046917639690695.bin' '-w' '/tmp/graph8603046917639690695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8603046917639690695.bin' '-l' '-1' '-v' '-w' '/tmp/graph8603046917639690695.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:12:46] [INFO ] Decomposing Gal with order
[2026-05-31 18:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:12:46] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-31 18:12:46] [INFO ] Flatten gal took : 16 ms
[2026-05-31 18:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 3 ms.
[2026-05-31 18:12:46] [INFO ] Time to serialize gal into /tmp/LTL10476097983934503769.gal : 2 ms
[2026-05-31 18:12:46] [INFO ] Time to serialize properties into /tmp/LTL12248974125085250674.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/LTL10476097983934503769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12248974125085250674.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X((("(i1.u4.p224>=2)")||(F(("(i17.u24.p150>=1)")&&(F("(((i13.u10.p119<1)||(i1.u21.p21<1))||(i13.u19.p96<1))")))))||("((((i6.u12.p...244
Formula 0 simplified : XX(!"((((i6.u12.p101>=1)&&(i6.u0.p104>=1))&&(i1.u21.p21>=1))||((i20.u11.p198>=1)&&(i20.u27.p80>=1)))" & !"(i1.u4.p224>=2)" & G(!"(i1...232
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00020-LTLFireability-09 finished in 117866 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) U X(p2)) U (X(X(X(p3)))&&G(p4))))'
Support contains 10 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 158 transition count 163
Applied a total of 13 rules in 3 ms. Remains 158 /171 variables (removed 13) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10321113512832646759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9106607947419294257.kers'
[2026-05-31 18:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10321113512832646759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9106607947419294257.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:13:01] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9106607947419294257.kers
Total runtime 1 ms.
[2026-05-31 18:13:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/158 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/320 variables, 158/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/321 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 196 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7871 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/158 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/320 variables, 158/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 143/338 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 339 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10928 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18818ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 18819ms
[2026-05-31 18:13:20] [INFO ] Invariant cache hit.
[2026-05-31 18:13:20] [INFO ] Implicit Places using invariants in 83 ms returned [0, 64, 65, 66, 67, 68, 69, 152, 154, 156, 157]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 85 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/171 places, 163/163 transitions.
Applied a total of 0 rules in 0 ms. Remains 147 /147 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18908 ms. Remains : 147/171 places, 163/163 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) U X(p2)) U (X(X(X(p3)))&&G(p4))))'
Stuttering acceptance computed with spot in 2694 ms :[(OR (NOT p4) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p4) (NOT p2)), (NOT p4), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p4), (AND (NOT p1) (NOT p2) (NOT p4)), true, (NOT p1), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) p4), (NOT p4), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p4)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p4) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3) p4), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) p4), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-12
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-12 finished in 21825 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||X(X(p0))||(X(p1)&&F(p2))))))'
Support contains 8 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 163/163 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 159 transition count 163
Applied a total of 12 rules in 4 ms. Remains 159 /171 variables (removed 12) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17970863799336267597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-777229933343509124.kers'
[2026-05-31 18:13:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17970863799336267597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-777229933343509124.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 162 rows 156 cols 428 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 18:13:23] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-777229933343509124.kers
Total runtime 1 ms.
[2026-05-31 18:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/158 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/321 variables, 159/197 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 198 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9061 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/158 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/321 variables, 159/197 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 143/340 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 1/322 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 341 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12593 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21673ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 21674ms
[2026-05-31 18:13:44] [INFO ] Invariant cache hit.
[2026-05-31 18:13:44] [INFO ] Implicit Places using invariants in 76 ms returned [0, 63, 64, 65, 66, 67, 68, 69, 153, 156, 157, 158]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 77 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/171 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21758 ms. Remains : 147/171 places, 163/163 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((X(X(p0))||p0||(X(p1)&&F(p2))))))'
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SupplyChain-PT-00020-LTLFireability-14
Product exploration explored 100000 steps with 7499 reset in 245 ms.
Product exploration explored 100000 steps with 7550 reset in 265 ms.
Computed a total of 147 stabilizing places and 162 stable transitions
Computed a total of 147 stabilizing places and 162 stable transitions
Detected a total of 147/147 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 1010 steps (7 resets) in 13 ms. (72 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 530 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14628511625335673665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17526163882660366115.kers'
[2026-05-31 18:13:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14628511625335673665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17526163882660366115.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 162 rows 144 cols 387 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:13:46] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17526163882660366115.kers
Total runtime 1 ms.
[2026-05-31 18:13:47] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2026-05-31 18:13:47] [INFO ] [Real]Absence check using 22 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-31 18:13:47] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-31 18:13:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:13:47] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:13:47] [INFO ] Computed and/alt/rep : 142/168/142 causal constraints (skipped 1 transitions) in 9 ms.
[2026-05-31 18:13:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:13:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2026-05-31 18:13:47] [INFO ] [Nat]Absence check using 22 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-31 18:13:47] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-31 18:13:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:13:47] [INFO ] Computed and/alt/rep : 142/168/142 causal constraints (skipped 1 transitions) in 9 ms.
[2026-05-31 18:13:47] [INFO ] Added : 83 causal constraints over 17 iterations in 203 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge-based reduction took 1860 ms.
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
[2026-05-31 18:13:47] [INFO ] Invariant cache hit.
[2026-05-31 18:13:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/146 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/309 variables, 147/173 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 1/310 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 0/310 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 174 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8630 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/146 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 162/309 variables, 147/173 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 143/316 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 1/310 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/310 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 317 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10790 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19437ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19438ms
[2026-05-31 18:14:07] [INFO ] Invariant cache hit.
[2026-05-31 18:14:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-31 18:14:07] [INFO ] Invariant cache hit.
[2026-05-31 18:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:14:07] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19620 ms. Remains : 147/147 places, 163/163 transitions.
Computed a total of 147 stabilizing places and 162 stable transitions
Computed a total of 147 stabilizing places and 162 stable transitions
Detected a total of 147/147 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 7 factoid took 401 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 366 steps (0 resets) in 10 ms. (33 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 593 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
[2026-05-31 18:14:08] [INFO ] Invariant cache hit.
[2026-05-31 18:14:08] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2026-05-31 18:14:08] [INFO ] [Real]Absence check using 22 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-31 18:14:09] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-31 18:14:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:14:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:14:09] [INFO ] Computed and/alt/rep : 142/168/142 causal constraints (skipped 1 transitions) in 9 ms.
[2026-05-31 18:14:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:14:09] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2026-05-31 18:14:09] [INFO ] [Nat]Absence check using 22 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-31 18:14:09] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-31 18:14:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-31 18:14:09] [INFO ] Computed and/alt/rep : 142/168/142 causal constraints (skipped 1 transitions) in 9 ms.
[2026-05-31 18:14:09] [INFO ] Added : 83 causal constraints over 17 iterations in 203 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge-based reduction took 1959 ms.
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Product exploration explored 100000 steps with 7251 reset in 233 ms.
Entered a terminal (fully accepting) state of product in 41918 steps with 3175 reset in 105 ms.
FORMULA SupplyChain-PT-00020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLFireability-14 finished in 47376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Spot run failed in 48 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(X((F((p1&&F(p2)))||p0))))'
Spot run failed in 39 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-31 18:14:10] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7075381421894572177
[2026-05-31 18:14:10] [INFO ] Applying decomposition
[2026-05-31 18:14:10] [INFO ] Computing symmetric may disable matrix : 163 transitions.
[2026-05-31 18:14:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:14:10] [INFO ] Computing symmetric may enable matrix : 163 transitions.
[2026-05-31 18:14:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:14:10] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:14:10] [INFO ] Computing Do-Not-Accords matrix : 163 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/graph15180222155309598942.txt' '-o' '/tmp/graph15180222155309598942.bin' '-w' '/tmp/graph15180222155309598942.weights'
[2026-05-31 18:14:10] [INFO ] Computation of Completed DNA matrix. took 2 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/graph15180222155309598942.bin' '-l' '-1' '-v' '-w' '/tmp/graph15180222155309598942.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:14:10] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7075381421894572177
Running compilation step : cd /tmp/ltsmin7075381421894572177;'/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-31 18:14:10] [INFO ] Decomposing Gal with order
[2026-05-31 18:14:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:14:10] [INFO ] Removed a total of 53 redundant transitions.
[2026-05-31 18:14:10] [INFO ] Flatten gal took : 11 ms
[2026-05-31 18:14:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2026-05-31 18:14:10] [INFO ] Time to serialize gal into /tmp/LTLFireability5784627834974147344.gal : 2 ms
[2026-05-31 18:14:10] [INFO ] Time to serialize properties into /tmp/LTLFireability4116164049076328795.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/LTLFireability5784627834974147344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4116164049076328795.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(("((i19.u36.p163>=1)&&(i19.u35.p200>=1))")||(F(G("((i21.u39.p179<1)||(i21.u27.p196<1))")))))))
Formula 0 simplified : XX(!"((i19.u36.p163>=1)&&(i19.u35.p200>=1))" & GF!"((i21.u39.p179<1)||(i21.u27.p196<1))")
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin7075381421894572177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7075381421894572177;'/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)||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
34137 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,341.4,2487808,1,0,6.12509e+06,1.52472e+06,607,7.32132e+06,556,1.46526e+07,2036635
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00020-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(("((u6.p224>=2)||(((i1.u18.p101>=1)&&(i1.u2.p104>=1))&&(u29.p21>=1)))")||(("((i11.u17.p198>=1)&&(i11.u24.p80>=1))")||(F(("(i5.u...230
Formula 1 simplified : XX(!"((i11.u17.p198>=1)&&(i11.u24.p80>=1))" & !"((u6.p224>=2)||(((i1.u18.p101>=1)&&(i1.u2.p104>=1))&&(u29.p21>=1)))" & G(!"(i5.u9.p1...218
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7075381421894572177;'/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)||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7075381421894572177;'/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((<>(((LTLAPp3==true)&&<>((LTLAPp4==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-31 18:36:46] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:36:46] [INFO ] Time to serialize gal into /tmp/LTLFireability12343524024262848359.gal : 2 ms
[2026-05-31 18:36:46] [INFO ] Time to serialize properties into /tmp/LTLFireability6954428342495916802.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/LTLFireability12343524024262848359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6954428342495916802.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...298
Read 1 LTL properties
Checking formula 0 : !((X(X(("((p224>=2)||(((p101>=1)&&(p104>=1))&&(p21>=1)))")||(("((p198>=1)&&(p80>=1))")||(F(("(p150>=1)")&&(F("(((p119<1)||(p21<1))||(p...171
Formula 0 simplified : XX(!"((p198>=1)&&(p80>=1))" & !"((p224>=2)||(((p101>=1)&&(p104>=1))&&(p21>=1)))" & G(!"(p150>=1)" | G!"(((p119<1)||(p21<1))||(p96<1)...159
Reverse transition relation is NOT exact ! Due to transitions t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7075381421894572177;'/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((<>(((LTLAPp3==true)&&<>((LTLAPp4==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7075381421894572177;'/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((<>(((LTLAPp3==true)&&<>((LTLAPp4==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
226 unique states visited
0 strongly connected components in search stack
230 transitions explored
118 items max in DFS search stack
114444 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,1144.46,4871320,1,0,798,2.77041e+07,24,165,2389,2.96299e+07,1764
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00020-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3011250 ms.

BK_STOP 1780253794715

--------------------
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="SupplyChain-PT-00020"
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 SupplyChain-PT-00020, 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 r354-tall-178024402800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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