About the Execution of ITS-Tools for SupplyChain-PT-00020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 502.352 | 120875.00 | 143087.00 | 347.40 | FTFFFFTFFFFFFTFF | normal |
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-178024402800187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is SupplyChain-PT-00020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800187
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 27 07:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 07:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 07:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 07:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 27 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 27 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 81K May 26 18:17 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-00
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-01
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-02
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-03
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-04
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-05
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-06
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-07
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-08
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-09
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-10
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-11
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-12
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-13
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-14
FORMULA_NAME SupplyChain-PT-00020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1780250707507
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-31 18:05:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 18:05:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:05:09] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-31 18:05:09] [INFO ] Transformed 264 places.
[2026-05-31 18:05:09] [INFO ] Transformed 163 transitions.
[2026-05-31 18:05:09] [INFO ] Parsed PT model containing 264 places and 163 transitions and 726 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 57 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 163/163 transitions.
Ensure Unique test removed 74 places
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 190 transition count 163
Applied a total of 74 rules in 28 ms. Remains 190 /264 variables (removed 74) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15191902591083539702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15825029703901067853.kers'
[2026-05-31 18:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15191902591083539702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15825029703901067853.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 162 rows 184 cols 524 entries
Finished phase 1 with 102 SingleSign rule and 20 generalized
[2026-05-31 18:05:09] [INFO ] Computed 68 invariants in 1 ms
Computed 68 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15825029703901067853.kers
Total runtime 2 ms.
[2026-05-31 18:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/190 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/352 variables, 190/259 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 260 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10111 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 190/190 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/190 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/352 variables, 190/259 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 143/402 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/353 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 403 constraints, problems are : Problem set: 0 solved, 143 unsolved in 14639 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 190/190 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24889ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 24908ms
[2026-05-31 18:05:34] [INFO ] Invariant cache hit.
[2026-05-31 18:05:34] [INFO ] Implicit Places using invariants in 119 ms returned [0, 1, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83, 86, 88, 96, 171, 172, 173, 175, 176, 177, 180, 181, 182, 183, 184, 185, 186, 187, 188]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 126 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25150 ms. Remains : 155/264 places, 163/163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5703018942991481751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18369732618763926013.kers'
[2026-05-31 18:05:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5703018942991481751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18369732618763926013.kers]
Normalized transition count is 162 out of 163 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 162 rows 149 cols 404 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:05:34] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18369732618763926013.kers
Total runtime 1 ms.
[2026-05-31 18:05:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/155 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/317 variables, 155/189 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/318 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 190 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8193 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 20/155 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 162/317 variables, 155/189 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 143/332 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/318 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/318 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 333 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11334 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19555ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19556ms
[2026-05-31 18:05:54] [INFO ] Invariant cache hit.
[2026-05-31 18:05:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-31 18:05:54] [INFO ] Invariant cache hit.
[2026-05-31 18:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:05:54] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19736 ms. Remains : 155/155 places, 163/163 transitions.
Support contains 57 out of 155 places after structural reductions.
[2026-05-31 18:05:54] [INFO ] Flatten gal took : 37 ms
[2026-05-31 18:05:54] [INFO ] Flatten gal took : 14 ms
[2026-05-31 18:05:54] [INFO ] Input system was already deterministic with 163 transitions.
RANDOM walk for 40000 steps (385 resets) in 1709 ms. (23 steps per ms) remains 15/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
[2026-05-31 18:05:55] [INFO ] Invariant cache hit.
[2026-05-31 18:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/80 variables, 13/13 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/14 constraints. Problems are: Problem set: 10 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Real declared 80/318 variables, and 15 constraints, problems are : Problem set: 15 solved, 0 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 13/27 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/155 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 15 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SupplyChain-PT-00020-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SupplyChain-PT-00020-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 15 atomic propositions for a total of 14 simplifications.
FORMULA SupplyChain-PT-00020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 155 stabilizing places and 162 stable transitions
FORMULA SupplyChain-PT-00020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Reduce places removed 25 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 130 transition count 108
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 86 rules applied. Total rules applied 122 place count 94 transition count 58
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 136 place count 80 transition count 58
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 136 place count 80 transition count 38
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 179 place count 57 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 179 place count 57 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 185 place count 54 transition count 35
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 186 place count 54 transition count 34
Applied a total of 186 rules in 25 ms. Remains 54 /155 variables (removed 101) and now considering 34/163 (removed 129) transitions.
Running 12 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-11456920618506484590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12568656769857042636.kers'
[2026-05-31 18:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11456920618506484590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12568656769857042636.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 33 rows 53 cols 92 entries
Finished phase 1 with 28 SingleSign rule and 2 generalized
[2026-05-31 18:05:55] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12568656769857042636.kers
Total runtime 0 ms.
[2026-05-31 18:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 19/53 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/54 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 33/87 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/88 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/88 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 80 constraints, problems are : Problem set: 0 solved, 12 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 19/53 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/54 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 33/87 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/88 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 92 constraints, problems are : Problem set: 0 solved, 12 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 821ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 822ms
[2026-05-31 18:05:56] [INFO ] Invariant cache hit.
[2026-05-31 18:05:56] [INFO ] Implicit Places using invariants in 60 ms returned [25, 26, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/155 places, 34/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 31
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 48 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 47 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 47 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 45 transition count 25
Applied a total of 15 rules in 5 ms. Remains 45 /51 variables (removed 6) and now considering 25/34 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1307169502125841637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17456285685810669411.kers'
[2026-05-31 18:05:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1307169502125841637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17456285685810669411.kers]
Normalized transition count is 24 out of 25 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 24 rows 44 cols 67 entries
Finished phase 1 with 22 SingleSign rule and 2 generalized
[2026-05-31 18:05:56] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17456285685810669411.kers
Total runtime 0 ms.
[2026-05-31 18:05:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-31 18:05:56] [INFO ] Invariant cache hit.
[2026-05-31 18:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:05:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/155 places, 25/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1044 ms. Remains : 45/155 places, 25/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-01
Product exploration explored 100000 steps with 6808 reset in 322 ms.
Product exploration explored 100000 steps with 6829 reset in 258 ms.
Computed a total of 45 stabilizing places and 24 stable transitions
Computed a total of 45 stabilizing places and 24 stable transitions
Detected a total of 45/45 stabilizing places and 24/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 55 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2026-05-31 18:05:57] [INFO ] Invariant cache hit.
[2026-05-31 18:05:57] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2026-05-31 18:05:57] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-31 18:05:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-31 18:05:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:05:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2026-05-31 18:05:57] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-31 18:05:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-31 18:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:05:57] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 1 transitions) in 1 ms.
[2026-05-31 18:05:57] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 334 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-31 18:05:57] [INFO ] Invariant cache hit.
[2026-05-31 18:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 19/44 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/45 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 24/69 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 68 constraints, problems are : Problem set: 0 solved, 5 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/44 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/45 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 24/69 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/70 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 73 constraints, problems are : Problem set: 0 solved, 5 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 345ms
[2026-05-31 18:05:58] [INFO ] Invariant cache hit.
[2026-05-31 18:05:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-31 18:05:58] [INFO ] Invariant cache hit.
[2026-05-31 18:05:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:05:58] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-05-31 18:05:58] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 45/45 places, 25/25 transitions.
Computed a total of 45 stabilizing places and 24 stable transitions
Computed a total of 45 stabilizing places and 24 stable transitions
Detected a total of 45/45 stabilizing places and 24/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 46 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 55 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2026-05-31 18:05:58] [INFO ] Invariant cache hit.
[2026-05-31 18:05:58] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2026-05-31 18:05:58] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-31 18:05:58] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-31 18:05:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:05:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2026-05-31 18:05:58] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-31 18:05:58] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-31 18:05:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:05:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:05:58] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 1 transitions) in 1 ms.
[2026-05-31 18:05:58] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 235 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6797 reset in 194 ms.
Product exploration explored 100000 steps with 6774 reset in 213 ms.
Built C files in :
/tmp/ltsmin16263037944620844027
[2026-05-31 18:05:59] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2026-05-31 18:05:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:05:59] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2026-05-31 18:05:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:05:59] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2026-05-31 18:05:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:05:59] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16263037944620844027
Running compilation step : cd /tmp/ltsmin16263037944620844027;'/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 262 ms.
Running link step : cd /tmp/ltsmin16263037944620844027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16263037944620844027;'/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/stateBased14711521402761371101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:06:14] [INFO ] Invariant cache hit.
[2026-05-31 18:06:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-31 18:06:14] [INFO ] Invariant cache hit.
[2026-05-31 18:06:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:06:14] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2026-05-31 18:06:14] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 45/45 places, 25/25 transitions.
Built C files in :
/tmp/ltsmin3981861176406862643
[2026-05-31 18:06:14] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2026-05-31 18:06:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:06:14] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2026-05-31 18:06:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:06:14] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2026-05-31 18:06:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:06:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3981861176406862643
Running compilation step : cd /tmp/ltsmin3981861176406862643;'/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 96 ms.
Running link step : cd /tmp/ltsmin3981861176406862643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3981861176406862643;'/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/stateBased14315413335373094324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 18:06:29] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:06:29] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:06:29] [INFO ] Time to serialize gal into /tmp/LTL7740838739677513611.gal : 1 ms
[2026-05-31 18:06:29] [INFO ] Time to serialize properties into /tmp/LTL1255333720966439184.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7740838739677513611.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14945976368808772980.hoa' '-atoms' '/tmp/LTL1255333720966439184.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1255333720966439184.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14945976368808772980.hoa
Reverse transition relation is NOT exact ! Due to transitions t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
56 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.592388,37832,1,0,159,108684,70,51,1069,82325,275
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SupplyChain-PT-00020-LTLCardinality-01 finished in 34337 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 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Reduce places removed 25 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 130 transition count 108
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 86 rules applied. Total rules applied 122 place count 94 transition count 58
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 136 place count 80 transition count 58
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 136 place count 80 transition count 38
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 179 place count 57 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 179 place count 57 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 185 place count 54 transition count 35
Applied a total of 185 rules in 10 ms. Remains 54 /155 variables (removed 101) and now considering 35/163 (removed 128) transitions.
Running 12 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-18401670375936318369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13369332198188874757.kers'
[2026-05-31 18:06:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18401670375936318369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13369332198188874757.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 53 cols 94 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-31 18:06:29] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13369332198188874757.kers
Total runtime 0 ms.
[2026-05-31 18:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 20/54 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 34/88 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 80 constraints, problems are : Problem set: 0 solved, 12 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 20/54 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 34/88 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 92 constraints, problems are : Problem set: 0 solved, 12 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 769ms
[2026-05-31 18:06:30] [INFO ] Invariant cache hit.
[2026-05-31 18:06:30] [INFO ] Implicit Places using invariants in 52 ms returned [25, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/155 places, 35/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 33
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 50 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 50 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 48 transition count 29
Applied a total of 10 rules in 4 ms. Remains 48 /52 variables (removed 4) and now considering 29/35 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15525168539387333804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18141008492455559837.kers'
[2026-05-31 18:06:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15525168539387333804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18141008492455559837.kers]
Normalized transition count is 28 out of 29 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 28 rows 47 cols 78 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-31 18:06:30] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18141008492455559837.kers
Total runtime 0 ms.
[2026-05-31 18:06:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-31 18:06:30] [INFO ] Invariant cache hit.
[2026-05-31 18:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:06:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/155 places, 29/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 961 ms. Remains : 48/155 places, 29/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-03
Stuttering criterion allowed to conclude after 138 steps with 12 reset in 2 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLCardinality-03 finished in 1056 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&&F(G(p1)))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 163
Applied a total of 6 rules in 8 ms. Remains 149 /155 variables (removed 6) and now considering 163/163 (removed 0) transitions.
Running 143 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4568441086155541711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8984229202493107334.kers'
[2026-05-31 18:06:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4568441086155541711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8984229202493107334.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 149 cols 404 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:06:30] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8984229202493107334.kers
Total runtime 2 ms.
[2026-05-31 18:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 20/149 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 162/311 variables, 149/177 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 178 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7717 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 149/149 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 20/149 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 162/311 variables, 149/177 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 143/320 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/312 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 321 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11272 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 149/149 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19018ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 19028ms
[2026-05-31 18:06:50] [INFO ] Invariant cache hit.
[2026-05-31 18:06:50] [INFO ] Implicit Places using invariants in 81 ms returned [62, 63, 65, 145, 146, 148]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 82 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/155 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19121 ms. Remains : 143/155 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLCardinality-04 finished in 19270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 163
Applied a total of 6 rules in 3 ms. Remains 149 /155 variables (removed 6) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11758476019882487699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15112691772623372282.kers'
[2026-05-31 18:06:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11758476019882487699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15112691772623372282.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 149 cols 404 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:06:50] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15112691772623372282.kers
Total runtime 1 ms.
[2026-05-31 18:06:50] [INFO ] Implicit Places using invariants in 64 ms returned [62, 63, 65, 145, 146, 148]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/155 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 143/155 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 551 steps with 183 reset in 3 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLCardinality-05 finished in 212 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 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 163
Applied a total of 6 rules in 9 ms. Remains 149 /155 variables (removed 6) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:06:50] [INFO ] Invariant cache hit.
[2026-05-31 18:06:50] [INFO ] Implicit Places using invariants in 62 ms returned [62, 63, 145, 146, 148]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 66 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/155 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 144/155 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLCardinality-08 finished in 231 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 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 163
Applied a total of 6 rules in 4 ms. Remains 149 /155 variables (removed 6) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:06:50] [INFO ] Invariant cache hit.
[2026-05-31 18:06:50] [INFO ] Implicit Places using invariants in 67 ms returned [62, 63, 65, 145, 146, 148]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/155 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 143/155 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLCardinality-10 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 163
Applied a total of 6 rules in 4 ms. Remains 149 /155 variables (removed 6) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:06:50] [INFO ] Invariant cache hit.
[2026-05-31 18:06:50] [INFO ] Implicit Places using invariants in 60 ms returned [62, 63, 65, 145, 146, 148]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 61 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/155 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 143/155 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 106 ms.
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00020-LTLCardinality-12 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 163/163 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 163
Applied a total of 6 rules in 2 ms. Remains 149 /155 variables (removed 6) and now considering 163/163 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:06:51] [INFO ] Invariant cache hit.
[2026-05-31 18:06:51] [INFO ] Implicit Places using invariants in 81 ms returned [62, 63, 65, 145, 146, 148]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 81 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/155 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 143/155 places, 163/163 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00020-LTLCardinality-13
Product exploration explored 100000 steps with 1255 reset in 239 ms.
Product exploration explored 100000 steps with 1245 reset in 251 ms.
Computed a total of 143 stabilizing places and 162 stable transitions
Computed a total of 143 stabilizing places and 162 stable transitions
Detected a total of 143/143 stabilizing places and 162/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 329 steps (0 resets) in 10 ms. (29 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13711786848029365377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2955448856360905139.kers'
[2026-05-31 18:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13711786848029365377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2955448856360905139.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 143 cols 383 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-31 18:06:52] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2955448856360905139.kers
Total runtime 1 ms.
[2026-05-31 18:06:52] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-31 18:06:52] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-31 18:06:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:06:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-31 18:06:52] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-31 18:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:06:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-31 18:06:52] [INFO ] Computed and/alt/rep : 142/162/142 causal constraints (skipped 1 transitions) in 10 ms.
[2026-05-31 18:06:52] [INFO ] Added : 74 causal constraints over 15 iterations in 217 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 847 ms.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 163/163 transitions.
Reduce places removed 20 places and 20 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 0 with 39 rules applied. Total rules applied 39 place count 123 transition count 104
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 98 rules applied. Total rules applied 137 place count 84 transition count 45
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 157 place count 64 transition count 45
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 157 place count 64 transition count 25
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 197 place count 44 transition count 25
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 198 place count 44 transition count 24
Applied a total of 198 rules in 13 ms. Remains 44 /143 variables (removed 99) and now considering 24/163 (removed 139) transitions.
Running 4 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-2444504701629344059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8386880106980325706.kers'
[2026-05-31 18:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2444504701629344059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8386880106980325706.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 23 rows 43 cols 65 entries
Finished phase 1 with 21 SingleSign rule and 2 generalized
[2026-05-31 18:06:52] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8386880106980325706.kers
Total runtime 3 ms.
[2026-05-31 18:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/67 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 67 constraints, problems are : Problem set: 0 solved, 4 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 20/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/67 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 71 constraints, problems are : Problem set: 0 solved, 4 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 295ms
[2026-05-31 18:06:53] [INFO ] Invariant cache hit.
[2026-05-31 18:06:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-31 18:06:53] [INFO ] Invariant cache hit.
[2026-05-31 18:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:06:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2026-05-31 18:06:53] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/143 places, 24/163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 44/143 places, 24/163 transitions.
Computed a total of 44 stabilizing places and 23 stable transitions
Computed a total of 44 stabilizing places and 23 stable transitions
Detected a total of 44/44 stabilizing places and 23/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2026-05-31 18:06:53] [INFO ] Invariant cache hit.
[2026-05-31 18:06:53] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2026-05-31 18:06:53] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-31 18:06:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-31 18:06:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:06:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2026-05-31 18:06:53] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-31 18:06:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-31 18:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:06:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:06:53] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 1 transitions) in 1 ms.
[2026-05-31 18:06:53] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 327 ms.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7933 reset in 178 ms.
Product exploration explored 100000 steps with 8029 reset in 198 ms.
Built C files in :
/tmp/ltsmin4040140757920485725
[2026-05-31 18:06:54] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2026-05-31 18:06:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:06:54] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2026-05-31 18:06:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:06:54] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2026-05-31 18:06:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:06:54] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4040140757920485725
Running compilation step : cd /tmp/ltsmin4040140757920485725;'/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 107 ms.
Running link step : cd /tmp/ltsmin4040140757920485725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4040140757920485725;'/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/stateBased10946112815224146496.hoa' '--buchi-type=spotba'
LTSmin run took 14058 ms.
FORMULA SupplyChain-PT-00020-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SupplyChain-PT-00020-LTLCardinality-13 finished in 17096 ms.
All properties solved by simple procedures.
Total runtime 119418 ms.
BK_STOP 1780250828382
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SupplyChain-PT-00020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is SupplyChain-PT-00020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SupplyChain-PT-00020.tgz
mv SupplyChain-PT-00020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
