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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.2K May 27 07:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 07:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 27 07:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 27 07:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 27 07:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 27 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 27 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:58 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 202K 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-00050-LTLFireability-00
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-01
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-02
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-03
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-04
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-05
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-06
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-07
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-08
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-09
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-10
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-11
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-12
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-13
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-14
FORMULA_NAME SupplyChain-PT-00050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780252909539

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-00050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 18:41:50] [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:41:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:41:51] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-31 18:41:51] [INFO ] Transformed 654 places.
[2026-05-31 18:41:51] [INFO ] Transformed 403 transitions.
[2026-05-31 18:41:51] [INFO ] Parsed PT model containing 654 places and 403 transitions and 1806 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SupplyChain-PT-00050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 403/403 transitions.
Ensure Unique test removed 184 places
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 470 transition count 403
Applied a total of 184 rules in 56 ms. Remains 470 /654 variables (removed 184) and now considering 403/403 (removed 0) transitions.
Running 353 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-7361643119599170343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6383642030232794225.kers'
[2026-05-31 18:41:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7361643119599170343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6383642030232794225.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 402 rows 454 cols 1304 entries
Finished phase 1 with 252 SingleSign rule and 50 generalized
[2026-05-31 18:41:51] [INFO ] Computed 168 invariants in 4 ms
Computed 168 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6383642030232794225.kers
Total runtime 5 ms.
[2026-05-31 18:41:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/464 variables, 100/162 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 6/470 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/873 variables, and 169 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 0/470 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/464 variables, 100/163 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 6/470 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/872 variables, 470/639 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/872 variables, 352/991 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/873 variables, and 991 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 470/470 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40329ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40350ms
[2026-05-31 18:42:31] [INFO ] Invariant cache hit.
[2026-05-31 18:42:32] [INFO ] Implicit Places using invariants in 320 ms returned [60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 80, 81, 82, 83, 85, 86, 87, 88, 90, 92, 94, 95, 96, 97, 101, 102, 103, 104, 105, 107, 264, 265, 266, 267, 269, 270, 271, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 308, 310, 311, 313, 324]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 329 ms to find 83 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 387/654 places, 403/403 transitions.
Applied a total of 0 rules in 13 ms. Remains 387 /387 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40824 ms. Remains : 387/654 places, 403/403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 387 /387 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 353 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-6596476313494765713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4156653298806284685.kers'
[2026-05-31 18:42:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6596476313494765713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4156653298806284685.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:42:32] [INFO ] Computed 85 invariants in 1 ms
Computed 85 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4156653298806284685.kers
Total runtime 2 ms.
[2026-05-31 18:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/381 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 6/387 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/790 variables, and 86 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/387 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/381 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 6/387 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/789 variables, 387/473 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 352/825 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/790 variables, and 825 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 387/387 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40132ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40133ms
[2026-05-31 18:43:12] [INFO ] Invariant cache hit.
[2026-05-31 18:43:12] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-31 18:43:12] [INFO ] Invariant cache hit.
[2026-05-31 18:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:43:12] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 40588 ms. Remains : 387/387 places, 403/403 transitions.
Support contains 73 out of 387 places after structural reductions.
[2026-05-31 18:43:12] [INFO ] Flatten gal took : 51 ms
[2026-05-31 18:43:13] [INFO ] Flatten gal took : 21 ms
[2026-05-31 18:43:13] [INFO ] Input system was already deterministic with 403 transitions.
Reduction of identical properties reduced properties to check from 39 to 36
RANDOM walk for 23187 steps (90 resets) in 1514 ms. (15 steps per ms) remains 0/36 properties
Computed a total of 387 stabilizing places and 402 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p0))||(F(!p0)&&p1))) U X(X(!p2))))'
Support contains 8 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 371 transition count 403
Applied a total of 16 rules in 10 ms. Remains 371 /387 variables (removed 16) and now considering 403/403 (removed 0) transitions.
Running 353 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-5386166888512739702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6571980702192633651.kers'
[2026-05-31 18:43:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5386166888512739702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6571980702192633651.kers]
Normalized transition count is 402 out of 403 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:43:14] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6571980702192633651.kers
Total runtime 2 ms.
[2026-05-31 18:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/371 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/773 variables, 371/441 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/774 variables, and 441 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 371/371 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/371 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/773 variables, 371/441 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 352/793 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/774 variables, and 793 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 371/371 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40114ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40115ms
[2026-05-31 18:43:54] [INFO ] Invariant cache hit.
[2026-05-31 18:43:54] [INFO ] Implicit Places using invariants in 223 ms returned [52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 215, 216, 218, 219, 220]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 225 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 356/387 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 356 /356 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40358 ms. Remains : 356/387 places, 403/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p0))||(F(!p0)&&p1))) U X(X(!p2))))'
Stuttering acceptance computed with spot in 3193 ms :[p2, (AND p0 p2), p2, (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), p2, (AND p0 p2), p0, p0]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 418 ms.
Product exploration explored 100000 steps with 33333 reset in 366 ms.
Computed a total of 356 stabilizing places and 402 stable transitions
Computed a total of 356 stabilizing places and 402 stable transitions
Detected a total of 356/356 stabilizing places and 402/403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 15 ms. Proved property starting from automaton with 11 states, 21 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SupplyChain-PT-00050-LTLFireability-00 finished in 44478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(X(!p0))&&G(!p1)&&F(p2))||G((!p1&&X(X(!p0))))) U X(G(p3)))))'
Support contains 8 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 374 transition count 403
Applied a total of 13 rules in 4 ms. Remains 374 /387 variables (removed 13) and now considering 403/403 (removed 0) transitions.
Running 353 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-6737822983364385531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1557710132626205706.kers'
[2026-05-31 18:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6737822983364385531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1557710132626205706.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:43:58] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1557710132626205706.kers
Total runtime 3 ms.
[2026-05-31 18:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/373 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/374 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/776 variables, 374/447 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/777 variables, and 447 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 374/374 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/373 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/374 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/776 variables, 374/447 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 352/799 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/777 variables, and 799 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 374/374 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40122ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40122ms
[2026-05-31 18:44:38] [INFO ] Invariant cache hit.
[2026-05-31 18:44:38] [INFO ] Implicit Places using invariants in 162 ms returned [53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 217, 218, 219, 220, 222]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 164 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 357/387 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 357 /357 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40297 ms. Remains : 357/387 places, 403/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((!p0&&X(X(!p1))))||(X(X(!p1))&&G(!p0)&&F(p2))) U X(G(p3)))))'
Stuttering acceptance computed with spot in 655 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), true, (AND (NOT p0) p1), (AND (NOT p3) p1), (AND p3 p0), (NOT p2), (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2))), (AND (NOT p2) p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) p1), (AND (NOT p2) (NOT p3) p1)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-01
Entered a terminal (fully accepting) state of product in 13 steps with 2 reset in 0 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-01 finished in 41022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X((X(X(G(p1)))||(G(p0)&&p2)))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 371 transition count 403
Applied a total of 16 rules in 8 ms. Remains 371 /387 variables (removed 16) and now considering 403/403 (removed 0) transitions.
Running 353 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-14267811661775924677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12805734295498135349.kers'
[2026-05-31 18:44:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14267811661775924677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12805734295498135349.kers]
Normalized transition count is 402 out of 403 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:44:39] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12805734295498135349.kers
Total runtime 3 ms.
[2026-05-31 18:44:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/371 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/773 variables, 371/441 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/774 variables, and 441 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 371/371 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/371 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/773 variables, 371/441 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 352/793 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/774 variables, and 793 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 371/371 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40108ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40110ms
[2026-05-31 18:45:19] [INFO ] Invariant cache hit.
[2026-05-31 18:45:19] [INFO ] Implicit Places using invariants in 181 ms returned [52, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 215, 217, 218, 219, 220]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 183 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 355/387 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 355 /355 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40307 ms. Remains : 355/387 places, 403/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X((X(X(G(p1)))||(G(p0)&&p2)))))))'
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-02
Entered a terminal (fully accepting) state of product in 88 steps with 3 reset in 2 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-02 finished in 40792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (p1 U p2)))||G(p3)))'
Support contains 8 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 372 transition count 403
Applied a total of 15 rules in 6 ms. Remains 372 /387 variables (removed 15) and now considering 403/403 (removed 0) transitions.
Running 353 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-16295678454595484577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15428093981023465185.kers'
[2026-05-31 18:45:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16295678454595484577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15428093981023465185.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:45:23] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15428093981023465185.kers
Total runtime 2 ms.
[2026-05-31 18:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/371 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/372 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/774 variables, 372/443 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/775 variables, and 443 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 372/372 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/371 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/372 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/774 variables, 372/443 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 352/795 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/775 variables, and 795 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 372/372 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40089ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40090ms
[2026-05-31 18:46:03] [INFO ] Invariant cache hit.
[2026-05-31 18:46:03] [INFO ] Implicit Places using invariants in 176 ms returned [53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 64, 217, 218, 219, 220, 221]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 178 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 356/387 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 356 /356 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40280 ms. Remains : 356/387 places, 403/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (p1 U p2)))||G(p3)))'
Stuttering acceptance computed with spot in 291 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-03
Entered a terminal (fully accepting) state of product in 61 steps with 3 reset in 1 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-03 finished in 43370 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 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 373 transition count 403
Applied a total of 14 rules in 4 ms. Remains 373 /387 variables (removed 14) and now considering 403/403 (removed 0) transitions.
Running 353 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-4240522086955740751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5185478430481248077.kers'
[2026-05-31 18:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4240522086955740751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5185478430481248077.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:46:03] [INFO ] Computed 71 invariants in 1 ms
Computed 71 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5185478430481248077.kers
Total runtime 2 ms.
[2026-05-31 18:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/373 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/775 variables, 373/445 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 775/776 variables, and 445 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 373/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/373 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/775 variables, 373/445 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 352/797 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/776 variables, and 797 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 373/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40100ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40101ms
[2026-05-31 18:46:43] [INFO ] Invariant cache hit.
[2026-05-31 18:46:44] [INFO ] Implicit Places using invariants in 181 ms returned [52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 216, 217, 218, 219, 220, 221]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 183 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 355/387 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 355 /355 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40295 ms. Remains : 355/387 places, 403/403 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 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-06
Entered a terminal (fully accepting) state of product in 210 steps with 0 reset in 2 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-06 finished in 40447 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 (F(p2) U (X(p4)&&p3))) U p1))'
Support contains 10 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 373 transition count 403
Applied a total of 14 rules in 9 ms. Remains 373 /387 variables (removed 14) and now considering 403/403 (removed 0) transitions.
Running 353 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-16510704647111915003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1163350480868914758.kers'
[2026-05-31 18:46:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16510704647111915003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1163350480868914758.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:46:44] [INFO ] Computed 71 invariants in 2 ms
Computed 71 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1163350480868914758.kers
Total runtime 4 ms.
[2026-05-31 18:46:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/371 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 2/373 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/775 variables, 373/445 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 775/776 variables, and 445 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 373/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/371 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 2/373 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/775 variables, 373/445 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 352/797 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/776 variables, and 797 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 373/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40108ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40110ms
[2026-05-31 18:47:24] [INFO ] Invariant cache hit.
[2026-05-31 18:47:24] [INFO ] Implicit Places using invariants in 176 ms returned [55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 217, 218, 219, 220, 221, 222]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 178 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 357/387 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 357 /357 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40305 ms. Remains : 357/387 places, 403/403 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 (F(p2) U (X(p4)&&p3))) U p1))'
Stuttering acceptance computed with spot in 429 ms :[(NOT p1), (NOT p2), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (NOT p4)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-07
Stuttering criterion allowed to conclude after 256 steps with 0 reset in 7 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-07 finished in 40840 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)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 16 places
Reduce places removed 59 places and 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 328 transition count 266
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 294 rules applied. Total rules applied 388 place count 224 transition count 76
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 484 place count 128 transition count 76
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 484 place count 128 transition count 23
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 46 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 636 place count 29 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 28 transition count 22
Applied a total of 637 rules in 39 ms. Remains 28 /387 variables (removed 359) and now considering 22/403 (removed 381) transitions.
Running 11 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-5779119228180386467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18402653338052646297.kers'
[2026-05-31 18:47:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5779119228180386467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18402653338052646297.kers]
Normalized transition count is 21 out of 22 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 28 cols 61 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-31 18:47:25] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18402653338052646297.kers
Total runtime 0 ms.
[2026-05-31 18:47:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/49 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/50 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 42 constraints, problems are : Problem set: 0 solved, 11 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/49 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/50 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 53 constraints, problems are : Problem set: 0 solved, 11 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 386ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 387ms
[2026-05-31 18:47:25] [INFO ] Invariant cache hit.
[2026-05-31 18:47:25] [INFO ] Implicit Places using invariants in 31 ms returned [19, 20, 21, 22, 23, 27]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 34 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/387 places, 22/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 17 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 17 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 8 transition count 7
Applied a total of 29 rules in 2 ms. Remains 8 /22 variables (removed 14) and now considering 7/22 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16687599686825032712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12789710086093971899.kers'
[2026-05-31 18:47:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16687599686825032712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12789710086093971899.kers]
Normalized transition count is 6 out of 7 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 8 cols 16 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-31 18:47:25] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12789710086093971899.kers
Total runtime 0 ms.
[2026-05-31 18:47:25] [INFO ] Implicit Places using invariants in 23 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/387 places, 7/403 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 6
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15858371966828290692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2153557045253196679.kers'
[2026-05-31 18:47:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15858371966828290692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2153557045253196679.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 6 cols 13 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-31 18:47:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2153557045253196679.kers
Total runtime 0 ms.
[2026-05-31 18:47:25] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-31 18:47:25] [INFO ] Invariant cache hit.
[2026-05-31 18:47:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:47:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/387 places, 6/403 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 525 ms. Remains : 6/387 places, 6/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 0 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-08 finished in 642 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((G(p2)&&p1)))&&p0))))'
Support contains 9 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 373 transition count 403
Applied a total of 14 rules in 3 ms. Remains 373 /387 variables (removed 14) and now considering 403/403 (removed 0) transitions.
Running 353 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-9243842316702394816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13525529407258480704.kers'
[2026-05-31 18:47:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9243842316702394816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13525529407258480704.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:47:25] [INFO ] Computed 71 invariants in 1 ms
Computed 71 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13525529407258480704.kers
Total runtime 2 ms.
[2026-05-31 18:47:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/373 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/775 variables, 373/445 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 775/776 variables, and 445 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 373/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/373 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/775 variables, 373/445 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 352/797 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/776 variables, and 797 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 373/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40092ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40093ms
[2026-05-31 18:48:05] [INFO ] Invariant cache hit.
[2026-05-31 18:48:06] [INFO ] Implicit Places using invariants in 178 ms returned [52, 53, 54, 55, 56, 57, 58, 60, 61, 63, 216, 217, 218, 219, 220, 221]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 180 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 357/387 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 357 /357 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40283 ms. Remains : 357/387 places, 403/403 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((G(p2)&&p1)))&&p0))))'
Stuttering acceptance computed with spot in 262 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-09 finished in 40582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p2)&&p1))||p0)))'
Support contains 7 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 374 transition count 403
Applied a total of 13 rules in 4 ms. Remains 374 /387 variables (removed 13) and now considering 403/403 (removed 0) transitions.
Running 353 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-4140342861634495980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2755186990096899910.kers'
[2026-05-31 18:48:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4140342861634495980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2755186990096899910.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:48:06] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2755186990096899910.kers
Total runtime 2 ms.
[2026-05-31 18:48:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/373 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/374 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/776 variables, 374/447 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/777 variables, and 447 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 374/374 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/373 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/374 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/776 variables, 374/447 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 352/799 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/777 variables, and 799 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 374/374 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40090ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40091ms
[2026-05-31 18:48:46] [INFO ] Invariant cache hit.
[2026-05-31 18:48:46] [INFO ] Implicit Places using invariants in 178 ms returned [53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 217, 219, 220, 221, 222]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 180 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 357/387 places, 403/403 transitions.
Applied a total of 0 rules in 3 ms. Remains 357 /357 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40279 ms. Remains : 357/387 places, 403/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p2)&&p1))||p0)))'
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-10
Stuttering criterion allowed to conclude after 258 steps with 4 reset in 6 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-10 finished in 40467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p1)||F(p2)))'
Support contains 4 out of 387 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 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 16 places
Reduce places removed 59 places and 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 328 transition count 317
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 125 rules applied. Total rules applied 168 place count 285 transition count 235
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 207 place count 246 transition count 235
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 207 place count 246 transition count 187
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 107 rules applied. Total rules applied 314 place count 187 transition count 187
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 314 place count 187 transition count 178
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 332 place count 178 transition count 178
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 333 place count 178 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 333 place count 178 transition count 176
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 335 place count 177 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 176 transition count 175
Applied a total of 336 rules in 50 ms. Remains 176 /387 variables (removed 211) and now considering 175/403 (removed 228) transitions.
Running 77 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-5137739463787440824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15674519610250721010.kers'
[2026-05-31 18:48:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5137739463787440824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15674519610250721010.kers]
Normalized transition count is 174 out of 175 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 176 cols 514 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-31 18:48:46] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15674519610250721010.kers
Total runtime 1 ms.
[2026-05-31 18:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 50/176 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 174/350 variables, 176/235 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/351 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 236 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4723 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 50/176 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 174/350 variables, 176/235 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 76/311 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/351 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 312 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6825 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11570ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 11570ms
[2026-05-31 18:48:58] [INFO ] Invariant cache hit.
[2026-05-31 18:48:58] [INFO ] Implicit Places using invariants in 130 ms returned [62, 63, 64, 66, 67]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 132 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/387 places, 175/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 171 transition count 170
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 166 transition count 165
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 166 transition count 160
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 161 transition count 160
Applied a total of 25 rules in 15 ms. Remains 161 /171 variables (removed 10) and now considering 160/175 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15472096761184654968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10633857394303681654.kers'
[2026-05-31 18:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15472096761184654968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10633857394303681654.kers]
Normalized transition count is 159 out of 160 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 161 cols 474 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-05-31 18:48:58] [INFO ] Computed 53 invariants in 0 ms
Computed 53 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10633857394303681654.kers
Total runtime 1 ms.
[2026-05-31 18:48:58] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-31 18:48:58] [INFO ] Invariant cache hit.
[2026-05-31 18:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:48:58] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 161/387 places, 160/403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12037 ms. Remains : 161/387 places, 160/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p1)||F(p2)))'
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-11
Product exploration explored 100000 steps with 13422 reset in 1023 ms.
Product exploration explored 100000 steps with 13204 reset in 1063 ms.
Computed a total of 161 stabilizing places and 159 stable transitions
Computed a total of 161 stabilizing places and 159 stable transitions
Detected a total of 161/161 stabilizing places and 159/160 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
RANDOM walk for 66 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p2))]
[2026-05-31 18:49:01] [INFO ] Invariant cache hit.
[2026-05-31 18:49:01] [INFO ] [Real]Absence check using 52 positive place invariants in 57 ms returned sat
[2026-05-31 18:49:01] [INFO ] [Real]Absence check using 52 positive and 1 generalized place invariants in 5 ms returned sat
[2026-05-31 18:49:02] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2026-05-31 18:49:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:49:02] [INFO ] [Nat]Absence check using 52 positive place invariants in 46 ms returned sat
[2026-05-31 18:49:02] [INFO ] [Nat]Absence check using 52 positive and 1 generalized place invariants in 18 ms returned sat
[2026-05-31 18:49:03] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2026-05-31 18:49:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:49:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2026-05-31 18:49:03] [INFO ] Computed and/alt/rep : 61/68/61 causal constraints (skipped 1 transitions) in 11 ms.
[2026-05-31 18:49:03] [INFO ] Added : 10 causal constraints over 2 iterations in 148 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 2328 ms.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p2))]
Support contains 4 out of 161 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 : 161/161 places, 160/160 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Running 62 sub problems to find dead transitions.
[2026-05-31 18:49:03] [INFO ] Invariant cache hit.
[2026-05-31 18:49:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 50/161 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 159/320 variables, 161/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/321 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3743 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 50/161 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 159/320 variables, 161/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 61/276 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 277 constraints, problems are : Problem set: 0 solved, 62 unsolved in 6112 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9863ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 9864ms
[2026-05-31 18:49:13] [INFO ] Invariant cache hit.
[2026-05-31 18:49:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-31 18:49:13] [INFO ] Invariant cache hit.
[2026-05-31 18:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:49:13] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2026-05-31 18:49:13] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10167 ms. Remains : 161/161 places, 160/160 transitions.
Computed a total of 161 stabilizing places and 159 stable transitions
Computed a total of 161 stabilizing places and 159 stable transitions
Detected a total of 161/161 stabilizing places and 159/160 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
RANDOM walk for 102 steps (0 resets) in 10 ms. (9 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p2))]
[2026-05-31 18:49:13] [INFO ] Invariant cache hit.
[2026-05-31 18:49:14] [INFO ] [Real]Absence check using 52 positive place invariants in 59 ms returned sat
[2026-05-31 18:49:14] [INFO ] [Real]Absence check using 52 positive and 1 generalized place invariants in 9 ms returned sat
[2026-05-31 18:49:14] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2026-05-31 18:49:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:49:14] [INFO ] [Nat]Absence check using 52 positive place invariants in 44 ms returned sat
[2026-05-31 18:49:14] [INFO ] [Nat]Absence check using 52 positive and 1 generalized place invariants in 10 ms returned sat
[2026-05-31 18:49:15] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2026-05-31 18:49:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:49:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2026-05-31 18:49:15] [INFO ] Computed and/alt/rep : 61/68/61 causal constraints (skipped 1 transitions) in 7 ms.
[2026-05-31 18:49:15] [INFO ] Added : 10 causal constraints over 2 iterations in 128 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 2284 ms.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13439 reset in 1017 ms.
Product exploration explored 100000 steps with 13568 reset in 1049 ms.
Built C files in :
/tmp/ltsmin16584884676693655358
[2026-05-31 18:49:18] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2026-05-31 18:49:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:49:18] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2026-05-31 18:49:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:49:18] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2026-05-31 18:49:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:49:18] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16584884676693655358
Running compilation step : cd /tmp/ltsmin16584884676693655358;'/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 551 ms.
Running link step : cd /tmp/ltsmin16584884676693655358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16584884676693655358;'/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/stateBased7456250178997378540.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 160/160 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /161 variables (removed 1) and now considering 159/160 (removed 1) transitions.
Running 60 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-15592376960164321802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16153942435292767376.kers'
[2026-05-31 18:49:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15592376960164321802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16153942435292767376.kers]
Normalized transition count is 158 out of 159 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 160 cols 471 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-31 18:49:33] [INFO ] Computed 53 invariants in 1 ms
Computed 53 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16153942435292767376.kers
Total runtime 1 ms.
[2026-05-31 18:49:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 50/160 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 158/318 variables, 160/214 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 215 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3469 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/59 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 50/160 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 158/318 variables, 160/214 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 59/273 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/319 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 274 constraints, problems are : Problem set: 0 solved, 60 unsolved in 5077 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/59 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8560ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 8560ms
[2026-05-31 18:49:41] [INFO ] Invariant cache hit.
[2026-05-31 18:49:41] [INFO ] Implicit Places using invariants in 125 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/161 places, 159/160 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 159 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 159 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 158 transition count 157
Applied a total of 3 rules in 14 ms. Remains 158 /159 variables (removed 1) and now considering 157/159 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9586396550122176373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11442116816235529852.kers'
[2026-05-31 18:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9586396550122176373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11442116816235529852.kers]
Normalized transition count is 156 out of 157 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 158 cols 464 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-31 18:49:41] [INFO ] Computed 52 invariants in 7 ms
Computed 52 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11442116816235529852.kers
Total runtime 8 ms.
[2026-05-31 18:49:41] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-31 18:49:41] [INFO ] Invariant cache hit.
[2026-05-31 18:49:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:49:42] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/161 places, 157/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8999 ms. Remains : 158/161 places, 157/160 transitions.
Built C files in :
/tmp/ltsmin11669011176471806862
[2026-05-31 18:49:42] [INFO ] Computing symmetric may disable matrix : 157 transitions.
[2026-05-31 18:49:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:49:42] [INFO ] Computing symmetric may enable matrix : 157 transitions.
[2026-05-31 18:49:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:49:42] [INFO ] Computing Do-Not-Accords matrix : 157 transitions.
[2026-05-31 18:49:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:49:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11669011176471806862
Running compilation step : cd /tmp/ltsmin11669011176471806862;'/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 342 ms.
Running link step : cd /tmp/ltsmin11669011176471806862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11669011176471806862;'/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/stateBased2399262180639806000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 18:49:57] [INFO ] Flatten gal took : 11 ms
[2026-05-31 18:49:57] [INFO ] Flatten gal took : 10 ms
[2026-05-31 18:49:57] [INFO ] Time to serialize gal into /tmp/LTL16899688880648659335.gal : 2 ms
[2026-05-31 18:49:57] [INFO ] Time to serialize properties into /tmp/LTL2947540465595897037.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/LTL16899688880648659335.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14702615039230113393.hoa' '-atoms' '/tmp/LTL2947540465595897037.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/LTL2947540465595897037.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14702615039230113393.hoa
Detected timeout of ITS tools.
[2026-05-31 18:50:12] [INFO ] Flatten gal took : 9 ms
[2026-05-31 18:50:12] [INFO ] Flatten gal took : 9 ms
[2026-05-31 18:50:12] [INFO ] Time to serialize gal into /tmp/LTL13314886004200030382.gal : 7 ms
[2026-05-31 18:50:12] [INFO ] Time to serialize properties into /tmp/LTL17467092955369353368.ltl : 14 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/LTL13314886004200030382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17467092955369353368.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 : !((((("((p196>=1)&&(p496>=1))")||(F("(((p244>=1)&&(p296>=1))&&(p51>=1))")))U("(((p244>=1)&&(p296>=1))&&(p51>=1))"))||(F("(p372>=1)")))...156
Formula 0 simplified : ((!"((p196>=1)&&(p496>=1))" & G!"(((p244>=1)&&(p296>=1))&&(p51>=1))") R !"(((p244>=1)&&(p296>=1))&&(p51>=1))") & G!"(p372>=1)"
Detected timeout of ITS tools.
[2026-05-31 18:50:27] [INFO ] Flatten gal took : 9 ms
[2026-05-31 18:50:27] [INFO ] Applying decomposition
[2026-05-31 18:50:27] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17032592657935784994.txt' '-o' '/tmp/graph17032592657935784994.bin' '-w' '/tmp/graph17032592657935784994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17032592657935784994.bin' '-l' '-1' '-v' '-w' '/tmp/graph17032592657935784994.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:50:27] [INFO ] Decomposing Gal with order
[2026-05-31 18:50:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:50:27] [INFO ] Removed a total of 143 redundant transitions.
[2026-05-31 18:50:27] [INFO ] Flatten gal took : 71 ms
[2026-05-31 18:50:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2026-05-31 18:50:27] [INFO ] Time to serialize gal into /tmp/LTL11506923267193760874.gal : 3 ms
[2026-05-31 18:50:27] [INFO ] Time to serialize properties into /tmp/LTL622767441451711907.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/LTL11506923267193760874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL622767441451711907.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((("((i43.u0.p196>=1)&&(i43.u51.p496>=1))")||(F("(((i43.u43.p244>=1)&&(i43.u1.p296>=1))&&(i16.u21.p51>=1))")))U("(((i43.u43.p244>=1...224
Formula 0 simplified : ((!"((i43.u0.p196>=1)&&(i43.u51.p496>=1))" & G!"(((i43.u43.p244>=1)&&(i43.u1.p296>=1))&&(i16.u21.p51>=1))") R !"(((i43.u43.p244>=1)&...217
Reverse transition relation is NOT exact ! Due to transitions t338, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) ...167
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
37 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.409294,41192,1,0,62967,1594,1842,49352,337,4314,142007
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00050-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SupplyChain-PT-00050-LTLFireability-11 finished in 101272 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(!p0) U !p1))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 371 transition count 403
Applied a total of 16 rules in 6 ms. Remains 371 /387 variables (removed 16) and now considering 403/403 (removed 0) transitions.
Running 353 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-5254031007194773488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7835814462333559255.kers'
[2026-05-31 18:50:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5254031007194773488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7835814462333559255.kers]
Normalized transition count is 402 out of 403 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:50:28] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7835814462333559255.kers
Total runtime 2 ms.
[2026-05-31 18:50:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/371 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/773 variables, 371/441 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/774 variables, and 441 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 371/371 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/371 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 402/773 variables, 371/441 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 352/793 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/774 variables, and 793 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 371/371 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40116ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40118ms
[2026-05-31 18:51:08] [INFO ] Invariant cache hit.
[2026-05-31 18:51:08] [INFO ] Implicit Places using invariants in 165 ms returned [52, 53, 54, 55, 56, 59, 60, 61, 62, 63, 215, 216, 217, 218, 219, 220]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 166 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 355/387 places, 403/403 transitions.
Applied a total of 0 rules in 3 ms. Remains 355 /355 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40295 ms. Remains : 355/387 places, 403/403 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(!p0) U !p1))))'
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, p0]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Product exploration explored 100000 steps with 33333 reset in 325 ms.
Computed a total of 355 stabilizing places and 402 stable transitions
Computed a total of 355 stabilizing places and 402 stable transitions
Detected a total of 355/355 stabilizing places and 402/403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 15 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SupplyChain-PT-00050-LTLFireability-12 finished in 41154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 14 places
Reduce places removed 58 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 329 transition count 266
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 226 rules applied. Total rules applied 319 place count 236 transition count 133
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 359 place count 196 transition count 133
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 359 place count 196 transition count 83
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 471 place count 134 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 471 place count 134 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 489 place count 125 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 490 place count 124 transition count 73
Applied a total of 490 rules in 23 ms. Remains 124 /387 variables (removed 263) and now considering 73/403 (removed 330) transitions.
Running 16 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-9727940797243853793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16063107556898043945.kers'
[2026-05-31 18:51:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9727940797243853793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16063107556898043945.kers]
Normalized transition count is 72 out of 73 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 72 rows 121 cols 205 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-31 18:51:09] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16063107556898043945.kers
Total runtime 1 ms.
[2026-05-31 18:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 50/124 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 72/196 variables, 124/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/197 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 184 constraints, problems are : Problem set: 0 solved, 16 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 50/124 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 72/196 variables, 124/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 16/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 200 constraints, problems are : Problem set: 0 solved, 16 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1468ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1468ms
[2026-05-31 18:51:10] [INFO ] Invariant cache hit.
[2026-05-31 18:51:10] [INFO ] Implicit Places using invariants in 120 ms returned [59, 60, 61, 62, 63, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 121 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/387 places, 73/403 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 118 transition count 67
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 112 transition count 61
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 112 transition count 55
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 106 transition count 55
Applied a total of 30 rules in 6 ms. Remains 106 /118 variables (removed 12) and now considering 55/73 (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-4396322869266215102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17880116882177889489.kers'
[2026-05-31 18:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4396322869266215102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17880116882177889489.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 54 rows 103 cols 157 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-31 18:51:10] [INFO ] Computed 53 invariants in 0 ms
Computed 53 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17880116882177889489.kers
Total runtime 1 ms.
[2026-05-31 18:51:10] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-31 18:51:10] [INFO ] Invariant cache hit.
[2026-05-31 18:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:51:11] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/387 places, 55/403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1860 ms. Remains : 106/387 places, 55/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-13
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-13 finished in 1929 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 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 16 places
Reduce places removed 59 places and 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 328 transition count 317
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 125 rules applied. Total rules applied 168 place count 285 transition count 235
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 207 place count 246 transition count 235
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 207 place count 246 transition count 185
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 111 rules applied. Total rules applied 318 place count 185 transition count 185
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 318 place count 185 transition count 177
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 334 place count 177 transition count 177
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 335 place count 177 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 335 place count 177 transition count 175
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 337 place count 176 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 338 place count 175 transition count 174
Applied a total of 338 rules in 32 ms. Remains 175 /387 variables (removed 212) and now considering 174/403 (removed 229) transitions.
Running 76 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-11389718611472796326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13564461649390098481.kers'
[2026-05-31 18:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11389718611472796326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13564461649390098481.kers]
Normalized transition count is 173 out of 174 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 175 cols 511 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-31 18:51:11] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13564461649390098481.kers
Total runtime 1 ms.
[2026-05-31 18:51:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 50/175 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 173/348 variables, 175/234 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/349 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 235 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4708 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 175/175 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 50/175 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 173/348 variables, 175/234 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 75/309 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/349 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 310 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7072 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 175/175 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11794ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11795ms
[2026-05-31 18:51:22] [INFO ] Invariant cache hit.
[2026-05-31 18:51:23] [INFO ] Implicit Places using invariants in 126 ms returned [62, 63, 64, 65, 67]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 127 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/387 places, 174/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 170 transition count 169
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 165 transition count 164
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 165 transition count 159
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 160 transition count 159
Applied a total of 25 rules in 8 ms. Remains 160 /170 variables (removed 10) and now considering 159/174 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13415145943107247700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-749475862138371549.kers'
[2026-05-31 18:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13415145943107247700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-749475862138371549.kers]
Normalized transition count is 158 out of 159 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 160 cols 471 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-31 18:51:23] [INFO ] Computed 53 invariants in 2 ms
Computed 53 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-749475862138371549.kers
Total runtime 3 ms.
[2026-05-31 18:51:23] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-31 18:51:23] [INFO ] Invariant cache hit.
[2026-05-31 18:51:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:51:23] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 160/387 places, 159/403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12255 ms. Remains : 160/387 places, 159/403 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 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-14
Stuttering criterion allowed to conclude after 90 steps with 1 reset in 2 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-14 finished in 12406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1||(F(p2) U X(X(p3))))))))'
Support contains 7 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 403/403 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 372 transition count 403
Applied a total of 15 rules in 9 ms. Remains 372 /387 variables (removed 15) and now considering 403/403 (removed 0) transitions.
Running 353 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-155255799229965267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5539028822935452394.kers'
[2026-05-31 18:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-155255799229965267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5539028822935452394.kers]
Normalized transition count is 402 out of 403 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 402 rows 371 cols 1019 entries
Finished phase 1 with 299 SingleSign rule and 3 generalized
[2026-05-31 18:51:23] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5539028822935452394.kers
Total runtime 2 ms.
[2026-05-31 18:51:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 50/371 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/372 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/774 variables, 372/443 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/775 variables, and 443 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 372/372 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 50/371 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/372 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 402/774 variables, 372/443 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 352/795 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/775 variables, and 795 constraints, problems are : Problem set: 0 solved, 353 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 372/372 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 353/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40114ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40115ms
[2026-05-31 18:52:03] [INFO ] Invariant cache hit.
[2026-05-31 18:52:03] [INFO ] Implicit Places using invariants in 178 ms returned [53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 216, 217, 218, 219, 220, 221]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 180 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 355/387 places, 403/403 transitions.
Applied a total of 0 rules in 3 ms. Remains 355 /355 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40308 ms. Remains : 355/387 places, 403/403 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1||(F(p2) U X(X(p3))))))))'
Stuttering acceptance computed with spot in 585 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : SupplyChain-PT-00050-LTLFireability-15
Stuttering criterion allowed to conclude after 916 steps with 11 reset in 11 ms.
FORMULA SupplyChain-PT-00050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00050-LTLFireability-15 finished in 40964 ms.
All properties solved by simple procedures.
Total runtime 613593 ms.

BK_STOP 1780253524556

--------------------
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-00050"
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-00050, 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-178024402800196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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