fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695500393
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DLCflexbar-PT-2a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
545.584 311625.00 383958.00 3142.10 FFTTTTFFFFTTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500393.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 DLCflexbar-PT-2a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Mar 6 15:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 15:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 15:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 15:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 139K Mar 6 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 545K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-00
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-01
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-02
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-03
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-04
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-05
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-06
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-07
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-08
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-09
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-10
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-11
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-12
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-13
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-14
FORMULA_NAME DLCflexbar-PT-2a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779606912818

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-2a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 07:15:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 07:15:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:15:14] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-05-24 07:15:14] [INFO ] Transformed 353 places.
[2026-05-24 07:15:14] [INFO ] Transformed 2169 transitions.
[2026-05-24 07:15:14] [INFO ] Found NUPN structural information;
[2026-05-24 07:15:14] [INFO ] Parsed PT model containing 353 places and 2169 transitions and 8205 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 264 transitions
Reduce redundant transitions removed 264 transitions.
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 118 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 1905/1905 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 329 transition count 1725
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 329 transition count 1725
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 58 place count 329 transition count 1715
Drop transitions (Redundant composition of simpler transitions.) removed 551 transitions
Redundant transition composition rules discarded 551 transitions
Iterating global reduction 1 with 551 rules applied. Total rules applied 609 place count 329 transition count 1164
Applied a total of 609 rules in 97 ms. Remains 329 /353 variables (removed 24) and now considering 1164/1905 (removed 741) transitions.
[2026-05-24 07:15:14] [INFO ] Flow matrix only has 232 transitions (discarded 932 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6700852006290010968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15803606260165351496.kers'
[2026-05-24 07:15:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6700852006290010968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15803606260165351496.kers]
Normalized transition count is 231 out of 232 initially.
Culling duplicate invariants (modulo rational): removing 172 columns.
Culled 172 columns in 1 ms.
// Phase 1: matrix 231 rows 157 cols 485 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-24 07:15:14] [INFO ] Computed 196 invariants in 3 ms
Computed 196 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15803606260165351496.kers
Total runtime 6 ms.
[2026-05-24 07:15:15] [INFO ] Implicit Places using invariants in 844 ms returned [157, 158, 159, 160, 161, 163, 164, 165, 167, 168, 169, 170, 172, 173, 174, 176, 177, 178, 181, 184, 187, 188, 191, 192, 193, 194, 195, 196, 197, 198, 200, 201, 202, 203, 204, 206, 207, 208, 209, 210, 211, 212, 214, 215, 216, 217, 218, 219, 220, 222, 223, 224, 225, 227, 229, 230, 232, 233, 235, 237, 238, 240, 241, 245, 250, 251, 252, 253, 254, 257, 259, 260, 262, 263, 264, 266, 267, 268, 270, 271, 272, 273, 274, 275, 280, 282, 286, 287, 288, 289, 291, 293, 294, 295, 298, 301, 303, 304, 306, 307, 308, 309, 311, 312, 314, 315, 316, 317, 318, 319, 325, 327]
Discarding 112 places :
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Implicit Place search using SMT only with invariants took 887 ms to find 112 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 217/353 places, 649/1905 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 338 transitions
Redundant transition composition rules discarded 338 transitions
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 217 transition count 311
Applied a total of 338 rules in 15 ms. Remains 217 /217 variables (removed 0) and now considering 311/649 (removed 338) transitions.
[2026-05-24 07:15:15] [INFO ] Flow matrix only has 232 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5440184389685552283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9179340250576865933.kers'
[2026-05-24 07:15:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5440184389685552283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9179340250576865933.kers]
Normalized transition count is 231 out of 232 initially.
Culling duplicate invariants (modulo rational): removing 60 columns.
Culled 60 columns in 0 ms.
// Phase 1: matrix 231 rows 157 cols 485 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-24 07:15:15] [INFO ] Computed 84 invariants in 0 ms
Computed 84 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9179340250576865933.kers
Total runtime 1 ms.
[2026-05-24 07:15:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 07:15:15] [INFO ] Flow matrix only has 232 transitions (discarded 79 similar events)
[2026-05-24 07:15:15] [INFO ] Invariant cache hit.
[2026-05-24 07:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:15:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 217/353 places, 311/1905 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1206 ms. Remains : 217/353 places, 311/1905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Applied a total of 0 rules in 2 ms. Remains 217 /217 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2026-05-24 07:15:15] [INFO ] Flow matrix only has 232 transitions (discarded 79 similar events)
[2026-05-24 07:15:15] [INFO ] Invariant cache hit.
[2026-05-24 07:15:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 07:15:15] [INFO ] Flow matrix only has 232 transitions (discarded 79 similar events)
[2026-05-24 07:15:15] [INFO ] Invariant cache hit.
[2026-05-24 07:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:15:15] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-24 07:15:15] [INFO ] Flow matrix only has 232 transitions (discarded 79 similar events)
[2026-05-24 07:15:15] [INFO ] Invariant cache hit.
[2026-05-24 07:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 60/217 variables, 60/84 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 231/448 variables, 217/301 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/449 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/449 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 302 constraints, problems are : Problem set: 0 solved, 310 unsolved in 21938 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 217/217 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 60/217 variables, 60/84 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 231/448 variables, 217/301 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 310/611 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/449 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/449 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 612 constraints, problems are : Problem set: 0 solved, 310 unsolved in 24341 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 217/217 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46374ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 46399ms
Finished structural reductions in LTL mode , in 1 iterations and 46596 ms. Remains : 217/217 places, 311/311 transitions.
Support contains 118 out of 217 places after structural reductions.
[2026-05-24 07:16:02] [INFO ] Flatten gal took : 41 ms
[2026-05-24 07:16:02] [INFO ] Flatten gal took : 17 ms
[2026-05-24 07:16:02] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 117 out of 217 places (down from 118) after GAL structural reductions.
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2041 ms. (19 steps per ms) remains 22/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
[2026-05-24 07:16:03] [INFO ] Flow matrix only has 232 transitions (discarded 79 similar events)
[2026-05-24 07:16:03] [INFO ] Invariant cache hit.
[2026-05-24 07:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/110 variables, 46/46 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 107/217 variables, 38/84 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 231/448 variables, 217/301 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/301 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/449 variables, 1/302 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/302 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/449 variables, 0/302 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 302 constraints, problems are : Problem set: 4 solved, 18 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 217/217 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 18 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
After SMT solving in domain Int declared 74/449 variables, and 33 constraints, problems are : Problem set: 22 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 33/84 constraints, State Equation: 0/217 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 787ms problems are : Problem set: 22 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 22 atomic propositions for a total of 14 simplifications.
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 07:16:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-24 07:16:03] [INFO ] Flatten gal took : 12 ms
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 07:16:04] [INFO ] Flatten gal took : 11 ms
[2026-05-24 07:16:04] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 63 out of 217 places (down from 68) after GAL structural reductions.
Computed a total of 61 stabilizing places and 1 stable transitions
Graph (complete) has 394 edges and 217 vertex of which 157 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 164 transition count 311
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 77 place count 140 transition count 263
Iterating global reduction 1 with 24 rules applied. Total rules applied 101 place count 140 transition count 263
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 140 transition count 253
Applied a total of 111 rules in 10 ms. Remains 140 /217 variables (removed 77) and now considering 253/311 (removed 58) transitions.
[2026-05-24 07:16:04] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14482709790927926523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16957087856658084505.kers'
[2026-05-24 07:16:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14482709790927926523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16957087856658084505.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:16:04] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16957087856658084505.kers
Total runtime 1 ms.
[2026-05-24 07:16:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 07:16:04] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:16:04] [INFO ] Invariant cache hit.
[2026-05-24 07:16:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:16:04] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 07:16:04] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:16:04] [INFO ] Invariant cache hit.
[2026-05-24 07:16:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 7/140 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/337 variables, 140/171 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/338 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 172 constraints, problems are : Problem set: 0 solved, 252 unsolved in 13457 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 7/140 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/337 variables, 140/171 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 252/423 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 424 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12951 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26434ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 26435ms
Starting structural reductions in LTL mode, iteration 1 : 140/217 places, 253/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26561 ms. Remains : 140/217 places, 253/311 transitions.
[2026-05-24 07:16:30] [INFO ] Flatten gal took : 12 ms
[2026-05-24 07:16:30] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:16:30] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 07:16:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:16:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:16:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15192378102943058866.gal : 3 ms
[2026-05-24 07:16:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality12809270498078778814.ctl : 16 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/CTLCardinality15192378102943058866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12809270498078778814.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,3.90625e+17,0.046366,4904,2,388,5,1482,6,0,738,1019,0


Converting to forward existential form...Done !
original formula: AF(((E(A((p199==0) U (p352==0)) U A((p350==1) U (p321==0))) * EX(E((p45==1) U (p20==1)))) + (AG(((p279==0) * EF((p344==0)))) * AX((p282==...161
=> equivalent forward existential formula: [FwdG(Init,!(((E(!((E(!((p352==0)) U (!((p199==0)) * !((p352==0)))) + EG(!((p352==0))))) U !((E(!((p321==0)) U (...324
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 251/0/2
Hit Full ! (commute/partial/dont) 252/0/1
(forward)formula 0,0,0.15985,8800,1,0,10,23691,57,4,3672,4409,31
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 158 transition count 311
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 83 place count 134 transition count 263
Iterating global reduction 1 with 24 rules applied. Total rules applied 107 place count 134 transition count 263
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 117 place count 134 transition count 253
Applied a total of 117 rules in 6 ms. Remains 134 /217 variables (removed 83) and now considering 253/311 (removed 58) transitions.
[2026-05-24 07:16:30] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15927329903875897295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16080390469814136046.kers'
[2026-05-24 07:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15927329903875897295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16080390469814136046.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:16:30] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16080390469814136046.kers
Total runtime 15 ms.
[2026-05-24 07:16:30] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 07:16:30] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:16:30] [INFO ] Invariant cache hit.
[2026-05-24 07:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:16:31] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 07:16:31] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:16:31] [INFO ] Invariant cache hit.
[2026-05-24 07:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/331 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/332 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 160 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12977 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/331 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 252/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 412 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11818 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24816ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 24817ms
Starting structural reductions in LTL mode, iteration 1 : 134/217 places, 253/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25017 ms. Remains : 134/217 places, 253/311 transitions.
[2026-05-24 07:16:55] [INFO ] Flatten gal took : 11 ms
[2026-05-24 07:16:55] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:16:55] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 07:16:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:16:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:16:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality639376821523556553.gal : 3 ms
[2026-05-24 07:16:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5267383615081665549.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/CTLCardinality639376821523556553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5267383615081665549.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 -...282
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,3.90625e+17,0.037169,4988,2,376,5,1446,6,0,732,1001,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(!(E((p285==1) U (p104==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(E((p285==1) U (p104==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 252/0/1
(forward)formula 0,0,0.120959,7936,1,0,8,19410,22,2,3409,2188,11
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 162 transition count 311
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 76 place count 141 transition count 269
Iterating global reduction 1 with 21 rules applied. Total rules applied 97 place count 141 transition count 269
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 106 place count 141 transition count 260
Applied a total of 106 rules in 4 ms. Remains 141 /217 variables (removed 76) and now considering 260/311 (removed 51) transitions.
[2026-05-24 07:16:56] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7154491293243525291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7741343589338695518.kers'
[2026-05-24 07:16:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7154491293243525291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7741343589338695518.kers]
Normalized transition count is 201 out of 202 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 201 rows 136 cols 425 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 07:16:56] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7741343589338695518.kers
Total runtime 0 ms.
[2026-05-24 07:16:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 07:16:56] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
[2026-05-24 07:16:56] [INFO ] Invariant cache hit.
[2026-05-24 07:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:16:56] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-24 07:16:56] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
[2026-05-24 07:16:56] [INFO ] Invariant cache hit.
[2026-05-24 07:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 5/141 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 201/342 variables, 141/170 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 171 constraints, problems are : Problem set: 0 solved, 259 unsolved in 13731 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 141/141 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 5/141 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 201/342 variables, 141/170 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 259/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 430 constraints, problems are : Problem set: 0 solved, 259 unsolved in 12921 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 141/141 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26700ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 26701ms
Starting structural reductions in LTL mode, iteration 1 : 141/217 places, 260/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27166 ms. Remains : 141/217 places, 260/311 transitions.
[2026-05-24 07:17:23] [INFO ] Flatten gal took : 23 ms
[2026-05-24 07:17:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:17:23] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-24 07:17:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:17:23] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:17:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15227829020642664650.gal : 2 ms
[2026-05-24 07:17:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5874918129039769544.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/CTLCardinality15227829020642664650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5874918129039769544.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,5.93262e+17,0.052314,5064,2,393,5,1514,6,0,752,1039,0


Converting to forward existential form...Done !
original formula: EX((A(!(((p128==0)||(p173==1))) U !((!((((p207==0)||(p199==1))&&(p161==1))) * (EG((p293==1)) + (p267!=1))))) + (!(A((p103==1) U EF((p280=...183
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!((!((((p207==0)||(p199==1))&&(p161==1))) * (EG((p293==1)) + (p267!=1)))))))) * !(E(!(!((!...521
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.147532,8692,1,0,16,23309,37,13,3544,4308,27
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 158 transition count 311
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 135 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 135 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 114 place count 135 transition count 256
Applied a total of 114 rules in 4 ms. Remains 135 /217 variables (removed 82) and now considering 256/311 (removed 55) transitions.
[2026-05-24 07:17:23] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5362029580070127281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8471783538210612057.kers'
[2026-05-24 07:17:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5362029580070127281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8471783538210612057.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 199 rows 134 cols 421 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:17:23] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8471783538210612057.kers
Total runtime 1 ms.
[2026-05-24 07:17:23] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 07:17:23] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:17:23] [INFO ] Invariant cache hit.
[2026-05-24 07:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:17:24] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 07:17:24] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:17:24] [INFO ] Invariant cache hit.
[2026-05-24 07:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/334 variables, 135/160 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/335 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 161 constraints, problems are : Problem set: 0 solved, 255 unsolved in 13390 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/334 variables, 135/160 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 255/415 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 416 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11636 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25068ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 25069ms
Starting structural reductions in LTL mode, iteration 1 : 135/217 places, 256/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25547 ms. Remains : 135/217 places, 256/311 transitions.
[2026-05-24 07:17:49] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:17:49] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:17:49] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-24 07:17:49] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:17:49] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:17:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13920949372828703354.gal : 2 ms
[2026-05-24 07:17:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality285307195443113529.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/CTLCardinality13920949372828703354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality285307195443113529.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,4.6875e+17,0.034834,4996,2,379,5,1462,6,0,738,1010,0


Converting to forward existential form...Done !
original formula: EG(AX(((EF((p127==1)) + EX(TRUE)) + ((p289==0)||(p12==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((E(TRUE U (p127==1)) + EX(TRUE)) + ((p289==0)||(p12==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.123299,8052,1,0,8,19968,19,2,3432,2929,12
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 161 transition count 311
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 142 transition count 273
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 142 transition count 273
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 101 place count 142 transition count 266
Applied a total of 101 rules in 23 ms. Remains 142 /217 variables (removed 75) and now considering 266/311 (removed 45) transitions.
[2026-05-24 07:17:49] [INFO ] Flow matrix only has 206 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6691266451723235339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-957822220252670295.kers'
[2026-05-24 07:17:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6691266451723235339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-957822220252670295.kers]
Normalized transition count is 205 out of 206 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 205 rows 138 cols 433 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 07:17:49] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-957822220252670295.kers
Total runtime 1 ms.
[2026-05-24 07:17:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 07:17:49] [INFO ] Flow matrix only has 206 transitions (discarded 60 similar events)
[2026-05-24 07:17:49] [INFO ] Invariant cache hit.
[2026-05-24 07:17:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:17:49] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-24 07:17:49] [INFO ] Flow matrix only has 206 transitions (discarded 60 similar events)
[2026-05-24 07:17:49] [INFO ] Invariant cache hit.
[2026-05-24 07:17:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 4/142 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 205/347 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/348 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 171 constraints, problems are : Problem set: 0 solved, 265 unsolved in 14197 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 4/142 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 205/347 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 265/435 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 1/348 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 436 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13213 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27451ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 27452ms
Starting structural reductions in LTL mode, iteration 1 : 142/217 places, 266/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27662 ms. Remains : 142/217 places, 266/311 transitions.
[2026-05-24 07:18:16] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:18:17] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:18:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality10933705010551839826.gal : 1 ms
[2026-05-24 07:18:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality11678493005900924804.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/CTLCardinality10933705010551839826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11678493005900924804.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,9.1125e+17,0.055872,5068,2,397,5,1542,6,0,763,1057,0


Converting to forward existential form...Done !
original formula: E(!(E(!(EF((p13==1))) U (EG((p64==0)) * A((p128==1) U ((p323==0)||(p95==1)))))) U (((AF(EX((p175!=1))) * EX(AF((p154==0)))) * (AF(((p334=...211
=> equivalent forward existential formula: [((((FwdU(Init,!(E(!(E(TRUE U (p13==1))) U (EG((p64==0)) * !((E(!(((p323==0)||(p95==1))) U (!((p128==1)) * !(((p...352
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 262/4/4
(forward)formula 0,0,0.182622,9440,1,0,20,27872,64,8,3509,7307,30
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Graph (trivial) has 297 edges and 217 vertex of which 146 / 217 are part of one of the 23 SCC in 6 ms
Free SCC test removed 123 places
Ensure Unique test removed 269 transitions
Reduce isomorphic transitions removed 269 transitions.
Graph (complete) has 125 edges and 94 vertex of which 38 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 38 transition count 39
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 35 transition count 38
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 28 place count 16 transition count 19
Iterating global reduction 2 with 19 rules applied. Total rules applied 47 place count 16 transition count 19
Applied a total of 47 rules in 25 ms. Remains 16 /217 variables (removed 201) and now considering 19/311 (removed 292) transitions.
[2026-05-24 07:18:17] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12429749646882123614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5723746047058894536.kers'
[2026-05-24 07:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12429749646882123614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5723746047058894536.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 27 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 07:18:17] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5723746047058894536.kers
Total runtime 0 ms.
[2026-05-24 07:18:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 07:18:17] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
[2026-05-24 07:18:17] [INFO ] Invariant cache hit.
[2026-05-24 07:18:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:18:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-24 07:18:17] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2026-05-24 07:18:17] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
[2026-05-24 07:18:17] [INFO ] Invariant cache hit.
[2026-05-24 07:18:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 12/28 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 26 constraints, problems are : Problem set: 0 solved, 18 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 12/28 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/29 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 44 constraints, problems are : Problem set: 0 solved, 18 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 661ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/217 places, 19/311 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 745 ms. Remains : 16/217 places, 19/311 transitions.
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:18:17] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:18:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:18:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality38370574098622674.gal : 0 ms
[2026-05-24 07:18:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3162652903976993602.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/CTLCardinality38370574098622674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3162652903976993602.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 -...281
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,37,0.002746,3832,2,38,5,117,6,0,64,74,0


Converting to forward existential form...Done !
original formula: AF(AG(((p9==0)&&(((p258==0)&&(p245==1))||(((p104==0)||(p206==1))&&(((p33==0)||(p314==1))||(p56==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p9==0)&&(((p258==0)&&(p245==1))||(((p104==0)||(p206==1))&&(((p33==0)||(p314==1))||(p...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.005776,4152,1,0,7,338,19,1,362,145,11
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 158 transition count 311
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 83 place count 134 transition count 263
Iterating global reduction 1 with 24 rules applied. Total rules applied 107 place count 134 transition count 263
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 117 place count 134 transition count 253
Applied a total of 117 rules in 4 ms. Remains 134 /217 variables (removed 83) and now considering 253/311 (removed 58) transitions.
[2026-05-24 07:18:18] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8340777019060981217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1890100259046523125.kers'
[2026-05-24 07:18:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8340777019060981217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1890100259046523125.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:18:18] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1890100259046523125.kers
Total runtime 0 ms.
[2026-05-24 07:18:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 07:18:18] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:18:18] [INFO ] Invariant cache hit.
[2026-05-24 07:18:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:18:18] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 07:18:18] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:18:18] [INFO ] Invariant cache hit.
[2026-05-24 07:18:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/331 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/332 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 160 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12880 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/331 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 252/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 412 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11442 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24367ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 24370ms
Starting structural reductions in LTL mode, iteration 1 : 134/217 places, 253/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24729 ms. Remains : 134/217 places, 253/311 transitions.
[2026-05-24 07:18:42] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:18:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:18:42] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 07:18:42] [INFO ] Flatten gal took : 17 ms
[2026-05-24 07:18:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:18:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7242630097640911786.gal : 1 ms
[2026-05-24 07:18:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8604804835973197179.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/CTLCardinality7242630097640911786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8604804835973197179.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,3.90625e+17,0.048156,4984,2,376,5,1446,6,0,732,1001,0


Converting to forward existential form...Done !
original formula: AX(EF(EX(EF((p229==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EX(E(TRUE U (p229==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.1197,7612,1,0,6,19176,14,1,3184,1747,7
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 157 transition count 311
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 134 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 place count 134 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 115 place count 134 transition count 256
Applied a total of 115 rules in 2 ms. Remains 134 /217 variables (removed 83) and now considering 256/311 (removed 55) transitions.
[2026-05-24 07:18:42] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16152290450896014604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7014278550332221980.kers'
[2026-05-24 07:18:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16152290450896014604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7014278550332221980.kers]
Normalized transition count is 199 out of 200 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 134 cols 421 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:18:42] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7014278550332221980.kers
Total runtime 1 ms.
[2026-05-24 07:18:43] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 07:18:43] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:18:43] [INFO ] Invariant cache hit.
[2026-05-24 07:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:18:43] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 07:18:43] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:18:43] [INFO ] Invariant cache hit.
[2026-05-24 07:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 199/333 variables, 134/158 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 1/334 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 159 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11676 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 199/333 variables, 134/158 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 255/413 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 1/334 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 414 constraints, problems are : Problem set: 0 solved, 255 unsolved in 10745 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22433ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 22434ms
Starting structural reductions in LTL mode, iteration 1 : 134/217 places, 256/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22592 ms. Remains : 134/217 places, 256/311 transitions.
[2026-05-24 07:19:05] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:19:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:19:05] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-24 07:19:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:19:05] [INFO ] Flatten gal took : 16 ms
[2026-05-24 07:19:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13040556646293580456.gal : 2 ms
[2026-05-24 07:19:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1918252994417362307.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/CTLCardinality13040556646293580456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1918252994417362307.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,4.6875e+17,0.049363,4996,2,370,5,1463,6,0,737,1014,0


Converting to forward existential form...Done !
original formula: EX(EF(AX(((p77==0)&&(p135==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(!(((p77==0)&&(p135==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.132186,7528,1,0,6,20363,11,0,2852,2521,4
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 159 transition count 311
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 137 transition count 267
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 137 transition count 267
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 111 place count 137 transition count 258
Applied a total of 111 rules in 2 ms. Remains 137 /217 variables (removed 80) and now considering 258/311 (removed 53) transitions.
[2026-05-24 07:19:05] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2467633220482445857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5073931608545930599.kers'
[2026-05-24 07:19:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2467633220482445857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5073931608545930599.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 200 rows 135 cols 423 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 07:19:05] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5073931608545930599.kers
Total runtime 0 ms.
[2026-05-24 07:19:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 07:19:05] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2026-05-24 07:19:05] [INFO ] Invariant cache hit.
[2026-05-24 07:19:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:19:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-24 07:19:05] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2026-05-24 07:19:05] [INFO ] Invariant cache hit.
[2026-05-24 07:19:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 200/337 variables, 137/163 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/338 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 164 constraints, problems are : Problem set: 0 solved, 257 unsolved in 13248 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 200/337 variables, 137/163 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 257/420 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 421 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12165 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25426ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 25427ms
Starting structural reductions in LTL mode, iteration 1 : 137/217 places, 258/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25618 ms. Remains : 137/217 places, 258/311 transitions.
[2026-05-24 07:19:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:19:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:19:31] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-24 07:19:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:19:31] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:19:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17479776468229581423.gal : 0 ms
[2026-05-24 07:19:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16867413138800327259.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/CTLCardinality17479776468229581423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16867413138800327259.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,5.625e+17,0.03128,5060,2,384,5,1483,6,0,744,1020,0


Converting to forward existential form...Done !
original formula: E((p127==0) U !((!(AF((p204==0))) + A(AX((p89==1)) U AF(((p195==0)||(p60==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,(p127==0)) * !(!((E(!(!(EG(!(((p195==0)||(p60==1)))))) U (!(!(EX(!((p89==1))))) * !(!(EG(!(((p195==...252
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 255/0/3
(forward)formula 0,0,0.128459,8452,1,0,10,23047,41,3,3491,4259,18
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 159 transition count 311
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 136 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 104 place count 136 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 113 place count 136 transition count 256
Applied a total of 113 rules in 2 ms. Remains 136 /217 variables (removed 81) and now considering 256/311 (removed 55) transitions.
[2026-05-24 07:19:31] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12133202899115442665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10402372235847453884.kers'
[2026-05-24 07:19:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12133202899115442665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10402372235847453884.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 199 rows 134 cols 421 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:19:31] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10402372235847453884.kers
Total runtime 1 ms.
[2026-05-24 07:19:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 07:19:31] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:19:31] [INFO ] Invariant cache hit.
[2026-05-24 07:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:19:31] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 07:19:31] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:19:31] [INFO ] Invariant cache hit.
[2026-05-24 07:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/335 variables, 136/162 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 163 constraints, problems are : Problem set: 0 solved, 255 unsolved in 13262 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/335 variables, 136/162 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 255/417 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 418 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11584 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24858ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 24859ms
Starting structural reductions in LTL mode, iteration 1 : 136/217 places, 256/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25060 ms. Remains : 136/217 places, 256/311 transitions.
[2026-05-24 07:19:56] [INFO ] Flatten gal took : 10 ms
[2026-05-24 07:19:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:19:56] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-24 07:19:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:19:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:19:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10788021380543596900.gal : 1 ms
[2026-05-24 07:19:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12967092194574626066.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/CTLCardinality10788021380543596900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12967092194574626066.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,4.6875e+17,0.029203,5000,2,381,5,1468,6,0,739,1014,0


Converting to forward existential form...Done !
original formula: EX((((p203==0)&&(p93==0))&&(p320==0)))
=> equivalent forward existential formula: [(EY(Init) * (((p203==0)&&(p93==0))&&(p320==0)))] != FALSE
(forward)formula 0,0,0.038237,5264,1,0,6,1468,8,1,909,1014,2
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 311/311 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 162 transition count 311
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 142 transition count 271
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 142 transition count 271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 103 place count 142 transition count 263
Applied a total of 103 rules in 2 ms. Remains 142 /217 variables (removed 75) and now considering 263/311 (removed 48) transitions.
[2026-05-24 07:19:56] [INFO ] Flow matrix only has 204 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16865833963050775875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11379082645786101943.kers'
[2026-05-24 07:19:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16865833963050775875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11379082645786101943.kers]
Normalized transition count is 203 out of 204 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 203 rows 137 cols 429 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-24 07:19:56] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11379082645786101943.kers
Total runtime 0 ms.
[2026-05-24 07:19:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 07:19:56] [INFO ] Flow matrix only has 204 transitions (discarded 59 similar events)
[2026-05-24 07:19:56] [INFO ] Invariant cache hit.
[2026-05-24 07:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:19:56] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-24 07:19:56] [INFO ] Flow matrix only has 204 transitions (discarded 59 similar events)
[2026-05-24 07:19:56] [INFO ] Invariant cache hit.
[2026-05-24 07:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 5/142 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 203/345 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 172 constraints, problems are : Problem set: 0 solved, 262 unsolved in 14007 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 142/142 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 5/142 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 203/345 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 262/433 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 434 constraints, problems are : Problem set: 0 solved, 262 unsolved in 13254 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 142/142 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27277ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 27279ms
Starting structural reductions in LTL mode, iteration 1 : 142/217 places, 263/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27434 ms. Remains : 142/217 places, 263/311 transitions.
[2026-05-24 07:20:24] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:20:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:24] [INFO ] Input system was already deterministic with 263 transitions.
[2026-05-24 07:20:24] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1114905160484797246.gal : 1 ms
[2026-05-24 07:20:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality5601377225972685492.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/CTLCardinality1114905160484797246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5601377225972685492.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.1e+17,0.043587,5064,2,396,5,1532,6,0,758,1045,0


Converting to forward existential form...Done !
original formula: EG((E(!((!(((p329==1)&&((p22==0)||(p326==1)))) * AX(((p308==0)||(p14==1))))) U EX(TRUE)) * (EX(((((p82==0)||(p17==1))||((p76==0)||(p21==1...230
=> equivalent forward existential formula: [FwdG(Init,(E(!((!(((p329==1)&&((p22==0)||(p326==1)))) * !(EX(!(((p308==0)||(p14==1))))))) U EX(TRUE)) * (EX((((...285
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 260/0/3
(forward)formula 0,1,0.19502,10432,1,0,18,33617,38,13,3590,13524,29
FORMULA DLCflexbar-PT-2a-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 07:20:24] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:20:24] [INFO ] Flatten gal took : 4 ms
Total runtime 310422 ms.

BK_STOP 1779607224443

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="DLCflexbar-PT-2a"
export BK_EXAMINATION="CTLCardinality"
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 DLCflexbar-PT-2a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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