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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 27 07:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 07:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 07:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.2K May 27 07:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 27 07:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 27 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 27 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:56 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 9.1K 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-00002-CTLFireability-2024-00
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-01
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-02
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-03
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-04
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-05
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-06
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-07
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-08
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-09
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-10
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-11
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-12
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-13
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-14
FORMULA_NAME SupplyChain-PT-00002-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780250538496

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 18:02:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 18:02:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:02:20] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-31 18:02:20] [INFO ] Transformed 30 places.
[2026-05-31 18:02:20] [INFO ] Transformed 19 transitions.
[2026-05-31 18:02:20] [INFO ] Parsed PT model containing 30 places and 19 transitions and 78 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SupplyChain-PT-00002-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Running 17 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-8993763383280540922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13143951895035971828.kers'
[2026-05-31 18:02:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8993763383280540922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13143951895035971828.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:20] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13143951895035971828.kers
Total runtime 1 ms.
[2026-05-31 18:02:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/30 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/48 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/49 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/49 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 48 constraints, problems are : Problem set: 0 solved, 17 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/30 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/48 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/49 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 65 constraints, problems are : Problem set: 0 solved, 17 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1321ms
[2026-05-31 18:02:21] [INFO ] Invariant cache hit.
[2026-05-31 18:02:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-31 18:02:21] [INFO ] Invariant cache hit.
[2026-05-31 18:02:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:21] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1485 ms. Remains : 30/30 places, 19/19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:02:21] [INFO ] Invariant cache hit.
[2026-05-31 18:02:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-31 18:02:21] [INFO ] Invariant cache hit.
[2026-05-31 18:02:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 30/30 places, 19/19 transitions.
Support contains 30 out of 30 places after structural reductions.
[2026-05-31 18:02:21] [INFO ] Flatten gal took : 21 ms
[2026-05-31 18:02:21] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:02:21] [INFO ] Input system was already deterministic with 19 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (3073 resets) in 1136 ms. (35 steps per ms) remains 2/31 properties
BEST_FIRST walk for 40001 steps (1234 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1143 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2026-05-31 18:02:22] [INFO ] Invariant cache hit.
[2026-05-31 18:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 2 (OVERLAPS) 12/21 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 21/49 variables, and 9 constraints, problems are : Problem set: 2 solved, 0 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/10 constraints, State Equation: 0/30 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2026-05-31 18:02:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-31 18:02:22] [INFO ] Flatten gal took : 5 ms
FORMULA SupplyChain-PT-00002-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 18:02:22] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:02:22] [INFO ] Input system was already deterministic with 19 transitions.
Computed a total of 30 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 8 places
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 22 transition count 17
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 19 transition count 13
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 11 place count 17 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 16 transition count 12
Applied a total of 12 rules in 18 ms. Remains 16 /30 variables (removed 14) and now considering 12/19 (removed 7) transitions.
Running 9 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-10250156468608581205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3509230414483272120.kers'
[2026-05-31 18:02:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10250156468608581205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3509230414483272120.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 16 cols 35 entries
Finished phase 1 with 7 SingleSign rule and 2 generalized
[2026-05-31 18:02:22] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3509230414483272120.kers
Total runtime 1 ms.
[2026-05-31 18:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 11/27 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/28 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 11/27 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/28 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 34 constraints, problems are : Problem set: 0 solved, 9 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 374ms
[2026-05-31 18:02:23] [INFO ] Invariant cache hit.
[2026-05-31 18:02:23] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 10, 11]
[2026-05-31 18:02:23] [INFO ] Actually due to overlaps returned [10, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 14/30 places, 12/19 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
Applied a total of 3 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 10/12 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10662858908070623616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16642106713396872663.kers'
[2026-05-31 18:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10662858908070623616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16642106713396872663.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 13 cols 25 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-31 18:02:23] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16642106713396872663.kers
Total runtime 0 ms.
[2026-05-31 18:02:23] [INFO ] Implicit Places using invariants in 29 ms returned [0, 9]
[2026-05-31 18:02:23] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 12/30 places, 10/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 467 ms. Remains : 12/30 places, 10/19 transitions.
[2026-05-31 18:02:23] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:23] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:23] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-31 18:02:23] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:23] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7366833983100310496.gal : 1 ms
[2026-05-31 18:02:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3299577911325357602.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7366833983100310496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3299577911325357602.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.020283,3708,2,26,5,93,6,0,55,52,0


Converting to forward existential form...Done !
original formula: AF(((AF(AG(A((p18>=1) U (p17>=1)))) * (p21>=1)) * (p8>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E(TRUE U !(!((E(!((p17>=1)) U (!((p18>=1)) * !((p17>=1)))) + EG(!((p17>=1))))))))))) * (...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 7/0/3
(forward)formula 0,0,0.024826,4288,1,0,18,537,33,2,298,423,25
FORMULA SupplyChain-PT-00002-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 25 transition count 19
Applied a total of 5 rules in 1 ms. Remains 25 /30 variables (removed 5) and now considering 19/19 (removed 0) transitions.
Running 17 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-6506034915764338810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7010098411339418716.kers'
[2026-05-31 18:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6506034915764338810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7010098411339418716.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:23] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7010098411339418716.kers
Total runtime 0 ms.
[2026-05-31 18:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 55 constraints, problems are : Problem set: 0 solved, 17 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 848ms
[2026-05-31 18:02:24] [INFO ] Invariant cache hit.
[2026-05-31 18:02:24] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 10, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/30 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 890 ms. Remains : 21/30 places, 19/19 transitions.
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 8 ms
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:24] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:02:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12494752575219187259.gal : 1 ms
[2026-05-31 18:02:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18241819660907594298.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12494752575219187259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18241819660907594298.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.00482,3892,2,73,5,247,6,0,100,132,0


Converting to forward existential form...Done !
original formula: AX((AF(EX(EG(((p22>=1)&&(p9>=1))))) * ((!(A(((p4>=1)&&(p6>=1)) U AX((((p15>=1)&&(p24>=1))&&(p28>=1))))) + EG(((p22>=1)&&(p9>=1)))) + ((p2...186
=> equivalent forward existential formula: ([FwdG(EY(Init),!(EX(EG(((p22>=1)&&(p9>=1))))))] = FALSE * ([((EY(Init) * !((!(!((E(!(!(EX(!((((p15>=1)&&(p24>=1...630
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.0193,4740,1,0,67,2113,71,31,626,1723,119
FORMULA SupplyChain-PT-00002-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 25 transition count 19
Applied a total of 5 rules in 0 ms. Remains 25 /30 variables (removed 5) and now considering 19/19 (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-3217700937829047178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2018910254106783147.kers'
[2026-05-31 18:02:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3217700937829047178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2018910254106783147.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:24] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2018910254106783147.kers
Total runtime 0 ms.
[2026-05-31 18:02:24] [INFO ] Implicit Places using invariants in 30 ms returned [0, 10, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/30 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 22/30 places, 19/19 transitions.
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:24] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 5 ms
[2026-05-31 18:02:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:24] [INFO ] Time to serialize gal into /tmp/CTLFireability567959521508112241.gal : 2 ms
[2026-05-31 18:02:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12480723815307098843.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability567959521508112241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12480723815307098843.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.00748,3896,2,83,5,265,6,0,104,143,0


Converting to forward existential form...Done !
original formula: EG(AF(((AX(((p4>=1)&&(p6>=1))) + A((AG((((p14>=1)&&(p23>=1))&&(p27>=1))) * ((((p11>=1)&&(p13>=1))&&(p3>=1))||((p4>=1)&&(p6>=1)))) U ((p22...196
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!(((p4>=1)&&(p6>=1))))) + !((E(!(((p22>=1)&&(p9>=1))) U (!((!(E(TRUE U !((((p14>=1)&&(p...330
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.026047,4760,1,0,48,3116,78,26,661,2679,79
FORMULA SupplyChain-PT-00002-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 19
Applied a total of 3 rules in 1 ms. Remains 27 /30 variables (removed 3) and now considering 19/19 (removed 0) transitions.
Running 17 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-3798070782502231073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12587162102943363363.kers'
[2026-05-31 18:02:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3798070782502231073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12587162102943363363.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:24] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12587162102943363363.kers
Total runtime 0 ms.
[2026-05-31 18:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/45 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/46 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/45 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/46 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 59 constraints, problems are : Problem set: 0 solved, 17 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 770ms
[2026-05-31 18:02:24] [INFO ] Invariant cache hit.
[2026-05-31 18:02:25] [INFO ] Implicit Places using invariants in 32 ms returned [1, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 806 ms. Remains : 25/30 places, 19/19 transitions.
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16548355348261529705.gal : 1 ms
[2026-05-31 18:02:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4684347853697433494.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16548355348261529705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4684347853697433494.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.004915,3928,2,115,5,337,6,0,115,205,0


Converting to forward existential form...Done !
original formula: (A((p19>=1) U !(EG((EX((((p14>=1)&&(p23>=1))&&(p27>=1))) + (((p11>=1)&&(p13>=1))&&(p3>=1)))))) * A((AF(AX(E(((((p1>=1)&&(p2>=1))&&((p25>=...284
=> equivalent forward existential formula: [(((Init * !((E(!(!(EG((EX((((p14>=1)&&(p23>=1))&&(p27>=1))) + (((p11>=1)&&(p13>=1))&&(p3>=1)))))) U (!((p19>=1)...760
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 14/12/5
Using saturation style SCC detection
(forward)formula 0,0,0.024441,4780,1,0,28,3243,31,5,649,2766,30
FORMULA SupplyChain-PT-00002-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 19
Applied a total of 6 rules in 0 ms. Remains 24 /30 variables (removed 6) and now considering 19/19 (removed 0) transitions.
Running 17 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-11771407933132553352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4985427330347386769.kers'
[2026-05-31 18:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11771407933132553352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4985427330347386769.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:25] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4985427330347386769.kers
Total runtime 1 ms.
[2026-05-31 18:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 17 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 17 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 670ms
[2026-05-31 18:02:25] [INFO ] Invariant cache hit.
[2026-05-31 18:02:25] [INFO ] Implicit Places using invariants in 27 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 700 ms. Remains : 23/30 places, 19/19 transitions.
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12032688634639905329.gal : 1 ms
[2026-05-31 18:02:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5583132141660945314.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12032688634639905329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5583132141660945314.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.004812,3904,2,63,5,212,6,0,108,122,0


Converting to forward existential form...Done !
original formula: AF((((EX((p26>=2)) * EG(!(A(((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))&&(p30>=1)) U ((p21>=1)&&(p8>=1)))))) * (EF(((((p10<1)||(p12<1))||...257
=> equivalent forward existential formula: [FwdG(Init,!((((EX((p26>=2)) * EG(!(!((E(!(((p21>=1)&&(p8>=1))) U (!(((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))...381
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 15/0/4
Hit Full ! (commute/partial/dont) 0/0/4
Hit Full ! (commute/partial/dont) 0/0/4
Using saturation style SCC detection
(forward)formula 0,0,0.017356,4636,1,0,31,1848,40,6,645,1735,36
FORMULA SupplyChain-PT-00002-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 19
Applied a total of 3 rules in 1 ms. Remains 27 /30 variables (removed 3) and now considering 19/19 (removed 0) transitions.
Running 17 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-17312567008076109487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9069723087910802807.kers'
[2026-05-31 18:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17312567008076109487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9069723087910802807.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:25] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9069723087910802807.kers
Total runtime 0 ms.
[2026-05-31 18:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/45 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/46 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/45 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/46 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 59 constraints, problems are : Problem set: 0 solved, 17 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 741ms
[2026-05-31 18:02:26] [INFO ] Invariant cache hit.
[2026-05-31 18:02:26] [INFO ] Implicit Places using invariants in 32 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 775 ms. Remains : 26/30 places, 19/19 transitions.
[2026-05-31 18:02:26] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:26] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:26] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:26] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:26] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15933250669566333756.gal : 0 ms
[2026-05-31 18:02:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13218164075938695568.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15933250669566333756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13218164075938695568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.004508,3924,2,75,5,234,6,0,119,129,0


Converting to forward existential form...Done !
original formula: EG((EX(E(AG((p26>=2)) U !(((p21>=1)&&(p8>=1))))) * E(((!(((p16>=1) + EF((((p15>=1)&&(p24>=1))&&(p28>=1))))) + E(((((p1>=1)&&(p2>=1))&&((p...378
=> equivalent forward existential formula: [FwdG(Init,(EX(E(!(E(TRUE U !((p26>=2)))) U !(((p21>=1)&&(p8>=1))))) * E(((!(((p16>=1) + E(TRUE U (((p15>=1)&&(p...445
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 14/12/5
(forward)formula 0,1,0.020054,4744,1,0,65,2744,42,32,662,3878,65
FORMULA SupplyChain-PT-00002-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 25 transition count 19
Applied a total of 5 rules in 0 ms. Remains 25 /30 variables (removed 5) and now considering 19/19 (removed 0) transitions.
Running 17 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-5465953725268042903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11953059790034111536.kers'
[2026-05-31 18:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5465953725268042903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11953059790034111536.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:26] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11953059790034111536.kers
Total runtime 0 ms.
[2026-05-31 18:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 55 constraints, problems are : Problem set: 0 solved, 17 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 738ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 738ms
[2026-05-31 18:02:27] [INFO ] Invariant cache hit.
[2026-05-31 18:02:27] [INFO ] Implicit Places using invariants in 31 ms returned [1, 10, 11, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 774 ms. Remains : 21/30 places, 19/19 transitions.
[2026-05-31 18:02:27] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:27] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:27] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:27] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:27] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7292689252199102593.gal : 1 ms
[2026-05-31 18:02:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14778708110888579028.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7292689252199102593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14778708110888579028.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.003933,3900,2,88,5,253,6,0,100,149,0


Converting to forward existential form...Done !
original formula: AX(AF(EG((E(!((((p10<1)||(p12<1))||(p3<1))) U !((((p10<1)||(p12<1))||(p3<1)))) * ((((p5<1)||(p7<1))||((p14<1)||(p23<1)))||(p27<1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((E(!((((p10<1)||(p12<1))||(p3<1))) U !((((p10<1)||(p12<1))||(p3<1)))) * ((((p5<1)||(p7<1))||...197
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
(forward)formula 0,0,0.014794,4392,1,0,57,1764,66,31,627,1598,95
FORMULA SupplyChain-PT-00002-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 19
Applied a total of 8 rules in 1 ms. Remains 22 /30 variables (removed 8) and now considering 19/19 (removed 0) transitions.
Running 17 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-4128162803550174717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1431182870948408495.kers'
[2026-05-31 18:02:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4128162803550174717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1431182870948408495.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:27] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1431182870948408495.kers
Total runtime 0 ms.
[2026-05-31 18:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 17 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 708ms
[2026-05-31 18:02:28] [INFO ] Invariant cache hit.
[2026-05-31 18:02:28] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 9, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 745 ms. Remains : 18/30 places, 19/19 transitions.
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:28] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10188161908439880943.gal : 1 ms
[2026-05-31 18:02:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5604749990220121550.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10188161908439880943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5604749990220121550.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.005459,3860,2,51,5,177,6,0,89,108,0


Converting to forward existential form...Done !
original formula: A(AF(EG(EF(((p22>=1)&&(p9>=1))))) U AX(((p22>=1)&&(p9>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((p22>=1)&&(p9>=1))))))))) * !(E(!(!(EX(!(((p22>=1)&&(p9>=1)))))) U (!(!(EG(!(EG(E(TRUE ...231
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
(forward)formula 0,0,0.015075,4408,1,0,60,1540,66,37,539,1345,119
FORMULA SupplyChain-PT-00002-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 19
Applied a total of 6 rules in 1 ms. Remains 24 /30 variables (removed 6) and now considering 19/19 (removed 0) transitions.
Running 17 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-14357760802129036302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18334694200194806107.kers'
[2026-05-31 18:02:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14357760802129036302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18334694200194806107.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:28] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18334694200194806107.kers
Total runtime 0 ms.
[2026-05-31 18:02:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/43 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 17 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/43 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 17 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 738ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 739ms
[2026-05-31 18:02:28] [INFO ] Invariant cache hit.
[2026-05-31 18:02:28] [INFO ] Implicit Places using invariants in 33 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 775 ms. Remains : 23/30 places, 19/19 transitions.
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:28] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:28] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6174871863387004027.gal : 0 ms
[2026-05-31 18:02:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6954711261894131409.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6174871863387004027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6954711261894131409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.004525,3928,2,107,5,277,6,0,107,163,0


Converting to forward existential form...Done !
original formula: (EX((((AG(((p5<1)||(p7<1))) + ((p21>=1)&&(p8>=1))) * ((p22<1)||(p9<1))) + (((p21<1)||(p8<1)) * AG(((p20<1)||(p22<1)))))) * EG(((EF(((p18>...459
=> equivalent forward existential formula: [FwdG((Init * EX((((!(E(TRUE U !(((p5<1)||(p7<1))))) + ((p21>=1)&&(p8>=1))) * ((p22<1)||(p9<1))) + (((p21<1)||(p...623
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.025483,5180,1,0,90,3761,87,55,678,3700,157
FORMULA SupplyChain-PT-00002-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 19
Applied a total of 3 rules in 1 ms. Remains 27 /30 variables (removed 3) and now considering 19/19 (removed 0) transitions.
Running 17 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-7855183396915484052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10576359024486403849.kers'
[2026-05-31 18:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7855183396915484052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10576359024486403849.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:29] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10576359024486403849.kers
Total runtime 0 ms.
[2026-05-31 18:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/45 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/46 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/45 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/46 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 59 constraints, problems are : Problem set: 0 solved, 17 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 729ms
[2026-05-31 18:02:29] [INFO ] Invariant cache hit.
[2026-05-31 18:02:29] [INFO ] Implicit Places using invariants in 29 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 761 ms. Remains : 26/30 places, 19/19 transitions.
[2026-05-31 18:02:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:29] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:29] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:29] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:29] [INFO ] Time to serialize gal into /tmp/CTLFireability18227850012828161372.gal : 1 ms
[2026-05-31 18:02:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9395115098870094615.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18227850012828161372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9395115098870094615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.004295,3924,2,94,5,264,6,0,119,142,0


Converting to forward existential form...Done !
original formula: (!(E(!(((EF(((p19>=1)||((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))&&(p30>=1)))) * AG((((p15>=1)&&(p24>=1))&&(p28>=1)))) * (((((p10>=1)&&(...342
=> equivalent forward existential formula: [(EY((Init * !(!(E(!(((E(TRUE U ((p19>=1)||((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))&&(p30>=1)))) * !(E(TRUE U...416
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 18/0/1
Using saturation style SCC detection
(forward)formula 0,1,0.013707,4400,1,0,21,2242,29,0,616,1542,23
FORMULA SupplyChain-PT-00002-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 25 transition count 19
Applied a total of 5 rules in 2 ms. Remains 25 /30 variables (removed 5) and now considering 19/19 (removed 0) transitions.
Running 17 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-17095131916953397304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6975549017003517608.kers'
[2026-05-31 18:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17095131916953397304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6975549017003517608.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:29] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6975549017003517608.kers
Total runtime 0 ms.
[2026-05-31 18:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 55 constraints, problems are : Problem set: 0 solved, 17 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 731ms
[2026-05-31 18:02:30] [INFO ] Invariant cache hit.
[2026-05-31 18:02:30] [INFO ] Implicit Places using invariants in 29 ms returned [1, 10, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/30 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 763 ms. Remains : 22/30 places, 19/19 transitions.
[2026-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:30] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10883512452938688882.gal : 0 ms
[2026-05-31 18:02:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4507491125873972543.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10883512452938688882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4507491125873972543.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.004526,3900,2,79,5,253,6,0,104,151,0


Converting to forward existential form...Done !
original formula: EG(((((p10>=1)&&(p12>=1))&&((p3>=1)&&(p26<2))) + ((((p10<1)||(p12<1))||(p3<1)) * (AX(((p20<1)||(p22<1))) + !(A(AX((((p15>=1)&&(p24>=1))&&...196
=> equivalent forward existential formula: [FwdG(Init,((((p10>=1)&&(p12>=1))&&((p3>=1)&&(p26<2))) + ((((p10<1)||(p12<1))||(p3<1)) * (!(EX(!(((p20<1)||(p22<...342
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.019656,4604,1,0,52,2975,74,29,655,2665,81
FORMULA SupplyChain-PT-00002-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 23 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 23 transition count 15
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 19 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 17 transition count 13
Applied a total of 11 rules in 5 ms. Remains 17 /30 variables (removed 13) and now considering 13/19 (removed 6) transitions.
Running 9 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-1632049162808347833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3563222594118299976.kers'
[2026-05-31 18:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1632049162808347833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3563222594118299976.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 14 cols 30 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-31 18:02:30] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3563222594118299976.kers
Total runtime 0 ms.
[2026-05-31 18:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/29 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/29 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 323ms
[2026-05-31 18:02:30] [INFO ] Invariant cache hit.
[2026-05-31 18:02:30] [INFO ] Implicit Places using invariants in 25 ms returned [6, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 14/30 places, 13/19 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 14 transition count 11
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 12 transition count 9
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 12 transition count 7
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 10 transition count 7
Applied a total of 10 rules in 3 ms. Remains 10 /14 variables (removed 4) and now considering 7/13 (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-2794936821249866942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3097247542106895963.kers'
[2026-05-31 18:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2794936821249866942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3097247542106895963.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 7 cols 13 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-31 18:02:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3097247542106895963.kers
Total runtime 1 ms.
[2026-05-31 18:02:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-31 18:02:30] [INFO ] Invariant cache hit.
[2026-05-31 18:02:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 10/30 places, 7/19 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 410 ms. Remains : 10/30 places, 7/19 transitions.
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:31] [INFO ] Input system was already deterministic with 7 transitions.
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6688553220076916665.gal : 0 ms
[2026-05-31 18:02:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7897608931079799252.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6688553220076916665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7897608931079799252.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8,0.002539,3788,2,22,5,77,6,0,45,40,0


Converting to forward existential form...Done !
original formula: AF((((p14>=1)&&(p23>=1))&&(p27>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((p14>=1)&&(p23>=1))&&(p27>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 5/0/2
(forward)formula 0,0,0.004193,4056,1,0,12,198,20,2,232,153,13
FORMULA SupplyChain-PT-00002-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 19
Applied a total of 2 rules in 1 ms. Remains 28 /30 variables (removed 2) and now considering 19/19 (removed 0) transitions.
Running 17 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-16281591401820566541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15849136755236228493.kers'
[2026-05-31 18:02:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16281591401820566541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15849136755236228493.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:31] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15849136755236228493.kers
Total runtime 0 ms.
[2026-05-31 18:02:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/28 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/46 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/47 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/47 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/28 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/46 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/47 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 61 constraints, problems are : Problem set: 0 solved, 17 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 727ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 727ms
[2026-05-31 18:02:31] [INFO ] Invariant cache hit.
[2026-05-31 18:02:31] [INFO ] Implicit Places using invariants in 30 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/30 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 760 ms. Remains : 27/30 places, 19/19 transitions.
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:31] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:31] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:02:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2220654765967552135.gal : 1 ms
[2026-05-31 18:02:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13680281591690078514.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2220654765967552135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13680281591690078514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.007272,3936,2,101,5,299,6,0,122,175,0


Converting to forward existential form...Done !
original formula: A(((EF(!(EG(((p19>=1)&&(p21>=1))))) * EG((EF((p16>=1)) + E((p20>=1) U ((p4>=1)&&(p6>=1)))))) * EG((((!(E(((p21>=1)&&(p8>=1)) U (p26>=2)))...659
=> equivalent forward existential formula: [((Init * !(EG(!(((!((((((E((((p14>=1)&&(p23>=1))&&(p27>=1)) U ((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))&&(p30...1578
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 17/0/2
Hit Full ! (commute/partial/dont) 15/3/4
Hit Full ! (commute/partial/dont) 16/0/3
Using saturation style SCC detection
(forward)formula 0,1,0.041456,4816,1,0,40,3428,61,15,736,2829,49
FORMULA SupplyChain-PT-00002-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 19
Applied a total of 6 rules in 2 ms. Remains 24 /30 variables (removed 6) and now considering 19/19 (removed 0) transitions.
Running 17 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-17801829097300494719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2928289396037678599.kers'
[2026-05-31 18:02:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17801829097300494719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2928289396037678599.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:31] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2928289396037678599.kers
Total runtime 0 ms.
[2026-05-31 18:02:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 17 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 17 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 636ms
[2026-05-31 18:02:32] [INFO ] Invariant cache hit.
[2026-05-31 18:02:32] [INFO ] Implicit Places using invariants in 30 ms returned [1, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/30 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 670 ms. Remains : 21/30 places, 19/19 transitions.
[2026-05-31 18:02:32] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:32] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:32] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:32] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:32] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13448642776210970582.gal : 0 ms
[2026-05-31 18:02:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13638698406675664096.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13448642776210970582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13638698406675664096.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,50,0.008678,3888,2,65,5,204,6,0,100,114,0


Converting to forward existential form...Done !
original formula: EX((E(!(((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))&&(p30>=1))) U EF((p18>=1))) + ((p18>=1) * AX((((p11<1)||(p13<1))||(p3<1))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(Init),!(((((p1>=1)&&(p2>=1))&&((p25>=1)&&(p29>=1)))&&(p30>=1)))),TRUE) * (p18>=1))] != FALSE + [...230
Hit Full ! (commute/partial/dont) 14/0/5
(forward)formula 0,1,0.01246,4172,1,0,10,356,17,1,236,310,7
FORMULA SupplyChain-PT-00002-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2026-05-31 18:02:32] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:32] [INFO ] Flatten gal took : 1 ms
Total runtime 12689 ms.

BK_STOP 1780250552595

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-00002"
export BK_EXAMINATION="CTLFireability"
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-00002, examination is CTLFireability"
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-178024402800162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SupplyChain-PT-00002.tgz
mv SupplyChain-PT-00002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;