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.r066-tall-177946967700417.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 CO4-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 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 239K 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 CO4-PT-18-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779525164223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 08:32:45] [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-23 08:32:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:32:45] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-23 08:32:45] [INFO ] Transformed 979 places.
[2026-05-23 08:32:45] [INFO ] Transformed 1111 transitions.
[2026-05-23 08:32:45] [INFO ] Found NUPN structural information;
[2026-05-23 08:32:45] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 110 places :
Symmetric choice reduction at 1 with 110 rule applications. Total rules 127 place count 698 transition count 819
Iterating global reduction 1 with 110 rules applied. Total rules applied 237 place count 698 transition count 819
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 322 place count 613 transition count 734
Iterating global reduction 1 with 85 rules applied. Total rules applied 407 place count 613 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 408 place count 613 transition count 733
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 444 place count 577 transition count 697
Iterating global reduction 2 with 36 rules applied. Total rules applied 480 place count 577 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 577 transition count 696
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 501 place count 557 transition count 676
Iterating global reduction 3 with 20 rules applied. Total rules applied 521 place count 557 transition count 676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 522 place count 557 transition count 675
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 531 place count 548 transition count 666
Iterating global reduction 4 with 9 rules applied. Total rules applied 540 place count 548 transition count 666
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 541 place count 548 transition count 665
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 544 place count 545 transition count 662
Iterating global reduction 5 with 3 rules applied. Total rules applied 547 place count 545 transition count 662
Applied a total of 547 rules in 278 ms. Remains 545 /822 variables (removed 277) and now considering 662/934 (removed 272) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14032669992035716697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13511144422167028606.kers'
[2026-05-23 08:32:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14032669992035716697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13511144422167028606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 662 rows 545 cols 1472 entries
Finished phase 1 with 540 SingleSign rule and 0 generalized
[2026-05-23 08:32:46] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13511144422167028606.kers
Total runtime 4 ms.
[2026-05-23 08:32:46] [INFO ] Implicit Places using invariants in 310 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 341 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/822 places, 662/934 transitions.
Applied a total of 0 rules in 31 ms. Remains 544 /544 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 672 ms. Remains : 544/822 places, 662/934 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Applied a total of 0 rules in 10 ms. Remains 544 /544 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9055553033459475902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15370959253159377462.kers'
[2026-05-23 08:32:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9055553033459475902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15370959253159377462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 662 rows 544 cols 1470 entries
Finished phase 1 with 540 SingleSign rule and 0 generalized
[2026-05-23 08:32:46] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15370959253159377462.kers
Total runtime 4 ms.
[2026-05-23 08:32:46] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 08:32:46] [INFO ] Invariant cache hit.
[2026-05-23 08:32:46] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2026-05-23 08:32:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/544 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 662/1206 variables, 544/548 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 548 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/544 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 662/1206 variables, 544/548 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1206 variables, 661/1209 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 1211 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 544/544 places, 662/662 transitions.
Support contains 70 out of 544 places after structural reductions.
[2026-05-23 08:33:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 08:33:47] [INFO ] Flatten gal took : 59 ms
FORMULA CO4-PT-18-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:33:47] [INFO ] Flatten gal took : 27 ms
[2026-05-23 08:33:47] [INFO ] Input system was already deterministic with 662 transitions.
Support contains 55 out of 544 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (63 resets) in 1487 ms. (26 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4003 steps (23 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (19 resets) in 24 ms. (160 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (23 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (24 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (22 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (19 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (18 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (22 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (22 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (21 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (21 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
[2026-05-23 08:33:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 119/160 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 344/504 variables, 130/171 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 26/530 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 391/921 variables, 202/378 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 192/1113 variables, 111/489 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 77/1190 variables, 45/534 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 14 (OVERLAPS) 16/1206 variables, 14/548 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1206 variables, 1/549 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1206 variables, 0/549 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 0/1206 variables, 0/549 constraints. Problems are: Problem set: 1 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 549 constraints, problems are : Problem set: 1 solved, 24 unsolved in 3139 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 111/148 variables, 37/37 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 3/40 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 333/481 variables, 124/164 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 21/185 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 26/507 variables, 4/189 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 1/190 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 395/902 variables, 202/392 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 202/1104 variables, 115/507 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1104 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 83/1187 variables, 49/556 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1187 variables, 1/557 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1187 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 19/1206 variables, 16/573 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1206 variables, 0/573 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 573 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8157ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 662/662 transitions.
Graph (trivial) has 505 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 9 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 813 edges and 542 vertex of which 535 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 238 rules applied. Total rules applied 240 place count 535 transition count 413
Reduce places removed 231 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 304 transition count 403
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 491 place count 294 transition count 403
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 491 place count 294 transition count 366
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 565 place count 257 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 572 place count 250 transition count 359
Iterating global reduction 3 with 7 rules applied. Total rules applied 579 place count 250 transition count 359
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 579 place count 250 transition count 357
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 583 place count 248 transition count 357
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 587 place count 244 transition count 353
Iterating global reduction 3 with 4 rules applied. Total rules applied 591 place count 244 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 244 transition count 352
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 593 place count 243 transition count 351
Iterating global reduction 4 with 1 rules applied. Total rules applied 594 place count 243 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 595 place count 243 transition count 350
Performed 68 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 731 place count 175 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 735 place count 175 transition count 268
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 739 place count 171 transition count 264
Iterating global reduction 6 with 4 rules applied. Total rules applied 743 place count 171 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 745 place count 170 transition count 263
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 803 place count 141 transition count 266
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 816 place count 141 transition count 253
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 830 place count 127 transition count 225
Iterating global reduction 7 with 14 rules applied. Total rules applied 844 place count 127 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 853 place count 127 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 860 place count 127 transition count 209
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 876 place count 127 transition count 193
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 893 place count 111 transition count 192
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 899 place count 111 transition count 192
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 900 place count 111 transition count 192
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 901 place count 111 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 902 place count 110 transition count 190
Applied a total of 902 rules in 119 ms. Remains 110 /544 variables (removed 434) and now considering 190/662 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 110/544 places, 190/662 transitions.
RANDOM walk for 40000 steps (3175 resets) in 1552 ms. (25 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40003 steps (429 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (406 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
[2026-05-23 08:33:56] [INFO ] Flow matrix only has 173 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16557655059698097525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-836582698279888395.kers'
[2026-05-23 08:33:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16557655059698097525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-836582698279888395.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 173 rows 108 cols 450 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-23 08:33:56] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-836582698279888395.kers
Total runtime 1 ms.
[2026-05-23 08:33:56] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 91/100 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/150 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/156 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 105/261 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 21/282 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/283 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/283 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 104 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 91/100 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 50/150 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/156 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 105/261 variables, 79/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/282 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/283 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/283 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/283 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 199 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CO4-PT-18-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:33:57] [INFO ] Flatten gal took : 31 ms
[2026-05-23 08:33:57] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:33:57] [INFO ] Input system was already deterministic with 662 transitions.
Computed a total of 21 stabilizing places and 24 stable transitions
Graph (complete) has 816 edges and 544 vertex of which 538 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 502 transition count 620
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 502 transition count 620
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 115 place count 471 transition count 589
Iterating global reduction 0 with 31 rules applied. Total rules applied 146 place count 471 transition count 589
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 149 place count 471 transition count 586
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 166 place count 454 transition count 569
Iterating global reduction 1 with 17 rules applied. Total rules applied 183 place count 454 transition count 569
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 192 place count 445 transition count 560
Iterating global reduction 1 with 9 rules applied. Total rules applied 201 place count 445 transition count 560
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 203 place count 445 transition count 558
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 441 transition count 554
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 441 transition count 554
Applied a total of 211 rules in 55 ms. Remains 441 /544 variables (removed 103) and now considering 554/662 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14149748029333414006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2151443035003488982.kers'
[2026-05-23 08:33:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14149748029333414006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2151443035003488982.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 554 rows 441 cols 1244 entries
Finished phase 1 with 437 SingleSign rule and 0 generalized
[2026-05-23 08:33:57] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2151443035003488982.kers
Total runtime 5 ms.
[2026-05-23 08:33:57] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 08:33:57] [INFO ] Invariant cache hit.
[2026-05-23 08:33:57] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 553 sub problems to find dead transitions.
[2026-05-23 08:33:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 3 (OVERLAPS) 554/995 variables, 441/445 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/995 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 553 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 995/995 variables, and 447 constraints, problems are : Problem set: 0 solved, 553 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 553 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 4 (OVERLAPS) 554/995 variables, 441/447 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/995 variables, 553/1000 constraints. Problems are: Problem set: 0 solved, 553 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 995/995 variables, and 1000 constraints, problems are : Problem set: 0 solved, 553 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 553 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 441/544 places, 554/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60463 ms. Remains : 441/544 places, 554/662 transitions.
[2026-05-23 08:34:57] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:34:57] [INFO ] Flatten gal took : 15 ms
[2026-05-23 08:34:57] [INFO ] Input system was already deterministic with 554 transitions.
[2026-05-23 08:34:57] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:34:57] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:34:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality9906167570991084904.gal : 17 ms
[2026-05-23 08:34:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5114102419687147632.ctl : 8 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/CTLCardinality9906167570991084904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5114102419687147632.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,6.38723e+08,1.19362,42192,2,5637,5,116976,6,0,2316,207479,0


Converting to forward existential form...Done !
original formula: EG(AX(AF(E((((p134==0)||(p819==1))&&((p820==0)||(p237==1))) U !(((p553==0)||(p861==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(E((((p134==0)||(p819==1))&&((p820==0)||(p237==1))) U !(((p553==0)||(p861==1)))))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t53, t55, t58, t104, t1...457
Detected timeout of ITS tools.
[2026-05-23 08:35:27] [INFO ] Flatten gal took : 26 ms
[2026-05-23 08:35:27] [INFO ] Applying decomposition
[2026-05-23 08:35:27] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11726776839826000611.txt' '-o' '/tmp/graph11726776839826000611.bin' '-w' '/tmp/graph11726776839826000611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11726776839826000611.bin' '-l' '-1' '-v' '-w' '/tmp/graph11726776839826000611.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:35:28] [INFO ] Decomposing Gal with order
[2026-05-23 08:35:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:35:28] [INFO ] Removed a total of 167 redundant transitions.
[2026-05-23 08:35:28] [INFO ] Flatten gal took : 74 ms
[2026-05-23 08:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2026-05-23 08:35:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9830832492058188422.gal : 8 ms
[2026-05-23 08:35:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality973770238047525889.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/CTLCardinality9830832492058188422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality973770238047525889.ctl'

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 -...261
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,6.38723e+08,0.156512,10344,588,94,10461,1465,908,16590,94,5531,0


Converting to forward existential form...Done !
original formula: EG(AX(AF(E((((i1.u8.p134==0)||(i18.u147.p819==1))&&((i18.u148.p820==0)||(i3.u27.p237==1))) U !(((i12.i0.i0.u89.p553==0)||(i11.u88.p861==1...162
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(E((((i1.u8.p134==0)||(i18.u147.p819==1))&&((i18.u148.p820==0)||(i3.u27.p237==1))) U !((...217
Reverse transition relation is NOT exact ! Due to transitions t49, t58, t104, t188, t296, t299, t343, t377, t389, t432, t470, t497, t498, i0.i0.i0.t461, i1...719
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,22.1944,597860,1,0,805704,3926,6616,3.83738e+06,538,17915,658910
FORMULA CO4-PT-18-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 501 transition count 619
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 501 transition count 619
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 117 place count 470 transition count 588
Iterating global reduction 0 with 31 rules applied. Total rules applied 148 place count 470 transition count 588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 151 place count 470 transition count 585
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 169 place count 452 transition count 567
Iterating global reduction 1 with 18 rules applied. Total rules applied 187 place count 452 transition count 567
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 198 place count 441 transition count 556
Iterating global reduction 1 with 11 rules applied. Total rules applied 209 place count 441 transition count 556
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 211 place count 441 transition count 554
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 436 transition count 549
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 436 transition count 549
Applied a total of 221 rules in 47 ms. Remains 436 /544 variables (removed 108) and now considering 549/662 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13384771774683664184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2919666653911210453.kers'
[2026-05-23 08:35:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13384771774683664184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2919666653911210453.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 549 rows 436 cols 1234 entries
Finished phase 1 with 432 SingleSign rule and 0 generalized
[2026-05-23 08:35:50] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2919666653911210453.kers
Total runtime 3 ms.
[2026-05-23 08:35:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 08:35:50] [INFO ] Invariant cache hit.
[2026-05-23 08:35:50] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2026-05-23 08:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 436/544 places, 549/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 436/544 places, 549/662 transitions.
[2026-05-23 08:36:50] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:36:51] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:36:51] [INFO ] Input system was already deterministic with 549 transitions.
[2026-05-23 08:36:51] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:36:51] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:36:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6850302965008860143.gal : 3 ms
[2026-05-23 08:36:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality601628130018843324.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/CTLCardinality6850302965008860143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality601628130018843324.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,6.23624e+08,1.17545,40148,2,5584,5,109955,6,0,2291,192353,0


Converting to forward existential form...Done !
original formula: (AX((p481==1)) + EF((p217==1)))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U (p217==1))))) * !((p481==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
(forward)formula 0,1,29.4456,756104,1,0,712,4.76661e+06,1121,479,12590,2.73124e+06,1132
FORMULA CO4-PT-18-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Graph (trivial) has 570 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 814 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 535 transition count 381
Reduce places removed 271 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 545 place count 264 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 546 place count 263 transition count 380
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 546 place count 263 transition count 343
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 620 place count 226 transition count 343
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 631 place count 215 transition count 332
Iterating global reduction 3 with 11 rules applied. Total rules applied 642 place count 215 transition count 332
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 642 place count 215 transition count 330
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 646 place count 213 transition count 330
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 651 place count 208 transition count 325
Iterating global reduction 3 with 5 rules applied. Total rules applied 656 place count 208 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 657 place count 208 transition count 324
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 715 place count 179 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 722 place count 179 transition count 288
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 727 place count 176 transition count 286
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 732 place count 171 transition count 281
Iterating global reduction 6 with 5 rules applied. Total rules applied 737 place count 171 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 739 place count 170 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 740 place count 169 transition count 279
Iterating global reduction 6 with 1 rules applied. Total rules applied 741 place count 169 transition count 279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 742 place count 168 transition count 277
Iterating global reduction 6 with 1 rules applied. Total rules applied 743 place count 168 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 744 place count 168 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 759 place count 168 transition count 261
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 7 with 9 rules applied. Total rules applied 768 place count 168 transition count 252
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 777 place count 159 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 779 place count 158 transition count 251
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 781 place count 158 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 783 place count 156 transition count 249
Applied a total of 783 rules in 81 ms. Remains 156 /544 variables (removed 388) and now considering 249/662 (removed 413) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7057396967784491574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11332629683249335264.kers'
[2026-05-23 08:37:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7057396967784491574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11332629683249335264.kers]
Normalized transition count is 248 out of 249 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 156 cols 596 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-23 08:37:20] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11332629683249335264.kers
Total runtime 2 ms.
[2026-05-23 08:37:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 08:37:20] [INFO ] Invariant cache hit.
[2026-05-23 08:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:37:21] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2026-05-23 08:37:21] [INFO ] Redundant transitions in 11 ms returned []
Running 236 sub problems to find dead transitions.
[2026-05-23 08:37:21] [INFO ] Invariant cache hit.
[2026-05-23 08:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 248/404 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/405 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 161 constraints, problems are : Problem set: 0 solved, 236 unsolved in 13587 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 248/404 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 236/396 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 1/405 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 397 constraints, problems are : Problem set: 0 solved, 236 unsolved in 26392 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40008ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 40008ms
Starting structural reductions in SI_CTL mode, iteration 1 : 156/544 places, 249/662 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40272 ms. Remains : 156/544 places, 249/662 transitions.
[2026-05-23 08:38:01] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:38:01] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:38:01] [INFO ] Input system was already deterministic with 249 transitions.
[2026-05-23 08:38:01] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:38:01] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:38:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14110326363840183697.gal : 2 ms
[2026-05-23 08:38:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14900787624230653068.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/CTLCardinality14110326363840183697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14900787624230653068.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.99298e+06,0.085665,7232,2,775,5,11471,6,0,863,12346,0


Converting to forward existential form...Done !
original formula: (AG((p489==0)) + EG((((AF((p805==0)) + (p882==1)) * (p700==0)) * (p195==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((((!(EG(!((p805==0)))) + (p882==1)) * (p700==0)) * (p195==1))))),TRUE) * !((p489==0)))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t29, t47, t74, t89, t94, t148, Intersection with reachable at each step enabled. (d...201
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.73394,62364,1,0,489,355496,532,289,5785,277579,776
FORMULA CO4-PT-18-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 503 transition count 621
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 503 transition count 621
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 112 place count 473 transition count 591
Iterating global reduction 0 with 30 rules applied. Total rules applied 142 place count 473 transition count 591
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 145 place count 473 transition count 588
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 162 place count 456 transition count 571
Iterating global reduction 1 with 17 rules applied. Total rules applied 179 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 189 place count 446 transition count 561
Iterating global reduction 1 with 10 rules applied. Total rules applied 199 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 201 place count 446 transition count 559
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 442 transition count 555
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 442 transition count 555
Applied a total of 209 rules in 53 ms. Remains 442 /544 variables (removed 102) and now considering 555/662 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14814291229344566109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-768376728808135929.kers'
[2026-05-23 08:38:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14814291229344566109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-768376728808135929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 555 rows 442 cols 1246 entries
Finished phase 1 with 438 SingleSign rule and 0 generalized
[2026-05-23 08:38:02] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-768376728808135929.kers
Total runtime 4 ms.
[2026-05-23 08:38:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-23 08:38:03] [INFO ] Invariant cache hit.
[2026-05-23 08:38:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2026-05-23 08:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (OVERLAPS) 555/997 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/997 variables, and 448 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 555/997 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 554/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1002 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 442/544 places, 555/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60447 ms. Remains : 442/544 places, 555/662 transitions.
[2026-05-23 08:39:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:39:03] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:39:03] [INFO ] Input system was already deterministic with 555 transitions.
[2026-05-23 08:39:03] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:39:03] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:39:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15081519086610830164.gal : 2 ms
[2026-05-23 08:39:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14330571933591519482.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/CTLCardinality15081519086610830164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14330571933591519482.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,6.43986e+08,1.2389,43524,2,5593,5,119811,6,0,2321,210691,0


Converting to forward existential form...Done !
original formula: EG(EX(((AG((p550==0)) + AF((p349==0))) + (!(A((p291==0) U (p735==0))) * AX((p333==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((!(E(TRUE U !((p550==0)))) + !(EG(!((p349==0))))) + (!(!((E(!((p735==0)) U (!((p291==0)) * !((p73...221
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t101, t1...457
Detected timeout of ITS tools.
[2026-05-23 08:39:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:39:33] [INFO ] Applying decomposition
[2026-05-23 08:39:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10661643065541102347.txt' '-o' '/tmp/graph10661643065541102347.bin' '-w' '/tmp/graph10661643065541102347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10661643065541102347.bin' '-l' '-1' '-v' '-w' '/tmp/graph10661643065541102347.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:39:33] [INFO ] Decomposing Gal with order
[2026-05-23 08:39:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:39:33] [INFO ] Removed a total of 174 redundant transitions.
[2026-05-23 08:39:33] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-23 08:39:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality699010375661751930.gal : 6 ms
[2026-05-23 08:39:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2317364996630486903.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/CTLCardinality699010375661751930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2317364996630486903.ctl'

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 -...261
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,6.43986e+08,0.15974,10104,559,89,9796,1460,943,15517,88,5233,0


Converting to forward existential form...Done !
original formula: EG(EX(((AG((i13.i0.i0.u93.p550==0)) + AF((i2.u50.p349==0))) + (!(A((i8.i0.i0.u32.p291==0) U (i17.u134.p735==0))) * AX((i4.u45.p333==1))))...157
=> equivalent forward existential formula: [FwdG(Init,EX(((!(E(TRUE U !((i13.i0.i0.u93.p550==0)))) + !(EG(!((i2.u50.p349==0))))) + (!(!((E(!((i17.u134.p735...289
Reverse transition relation is NOT exact ! Due to transitions t48, t57, t101, t185, t273, t285, t299, t343, t377, t434, t462, t471, t498, t499, i0.t49, i0....684
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,22.6535,588336,1,0,889639,7123,6874,3.78002e+06,466,37766,707049
FORMULA CO4-PT-18-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 505 transition count 623
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 505 transition count 623
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 107 place count 476 transition count 594
Iterating global reduction 0 with 29 rules applied. Total rules applied 136 place count 476 transition count 594
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 139 place count 476 transition count 591
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 156 place count 459 transition count 574
Iterating global reduction 1 with 17 rules applied. Total rules applied 173 place count 459 transition count 574
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 183 place count 449 transition count 564
Iterating global reduction 1 with 10 rules applied. Total rules applied 193 place count 449 transition count 564
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 195 place count 449 transition count 562
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 444 transition count 557
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 444 transition count 557
Applied a total of 205 rules in 70 ms. Remains 444 /544 variables (removed 100) and now considering 557/662 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8991819097233846745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3896673820181706334.kers'
[2026-05-23 08:39:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8991819097233846745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3896673820181706334.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 557 rows 444 cols 1250 entries
Finished phase 1 with 440 SingleSign rule and 0 generalized
[2026-05-23 08:39:56] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3896673820181706334.kers
Total runtime 4 ms.
[2026-05-23 08:39:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 08:39:56] [INFO ] Invariant cache hit.
[2026-05-23 08:39:56] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 556 sub problems to find dead transitions.
[2026-05-23 08:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1001 variables, 444/448 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 450 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 557/1001 variables, 444/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 556/1006 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 1006 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 444/544 places, 557/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60487 ms. Remains : 444/544 places, 557/662 transitions.
[2026-05-23 08:40:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:40:56] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:40:56] [INFO ] Input system was already deterministic with 557 transitions.
[2026-05-23 08:40:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:40:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:40:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16263323640047054064.gal : 2 ms
[2026-05-23 08:40:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9816629329639920020.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/CTLCardinality16263323640047054064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9816629329639920020.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,6.75234e+08,1.13521,40492,2,5645,5,112165,6,0,2331,195012,0


Converting to forward existential form...Done !
original formula: EF((AX(AX((p894==1))) * AX((((p122==1)||(p580==0))||((p146==1)||(p311==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(!(EX(!((p894==1)))))))) * !(EX(!((((p122==1)||(p580==0))||((p146==1)||(p311==1))))))...166
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t54, t56, t59, t103, t1...457
(forward)formula 0,1,13.0806,341492,1,0,712,1.44165e+06,1133,481,12407,1.35216e+06,1130
FORMULA CO4-PT-18-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Graph (trivial) has 550 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 814 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 535 transition count 395
Reduce places removed 257 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 261 rules applied. Total rules applied 520 place count 278 transition count 391
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 524 place count 274 transition count 391
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 524 place count 274 transition count 354
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 598 place count 237 transition count 354
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 610 place count 225 transition count 342
Iterating global reduction 3 with 12 rules applied. Total rules applied 622 place count 225 transition count 342
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 622 place count 225 transition count 340
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 626 place count 223 transition count 340
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 631 place count 218 transition count 334
Iterating global reduction 3 with 5 rules applied. Total rules applied 636 place count 218 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 638 place count 218 transition count 332
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 694 place count 190 transition count 304
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 699 place count 190 transition count 299
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 703 place count 188 transition count 297
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 708 place count 183 transition count 292
Iterating global reduction 6 with 5 rules applied. Total rules applied 713 place count 183 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 715 place count 182 transition count 291
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 716 place count 181 transition count 290
Iterating global reduction 6 with 1 rules applied. Total rules applied 717 place count 181 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 728 place count 181 transition count 279
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 6 rules applied. Total rules applied 734 place count 181 transition count 273
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 740 place count 175 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 742 place count 174 transition count 272
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 744 place count 174 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 745 place count 174 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 747 place count 172 transition count 269
Applied a total of 747 rules in 71 ms. Remains 172 /544 variables (removed 372) and now considering 269/662 (removed 393) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10244202608255475778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4427018918010467420.kers'
[2026-05-23 08:41:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10244202608255475778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4427018918010467420.kers]
Normalized transition count is 268 out of 269 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 172 cols 640 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-23 08:41:10] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4427018918010467420.kers
Total runtime 4 ms.
[2026-05-23 08:41:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 08:41:10] [INFO ] Invariant cache hit.
[2026-05-23 08:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:41:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2026-05-23 08:41:10] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-23 08:41:10] [INFO ] Invariant cache hit.
[2026-05-23 08:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 268/439 variables, 171/175 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/440 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/441 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 177 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19656 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 268/439 variables, 171/175 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 252/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 1/440 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SMT process timed out in 49704ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49705ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/544 places, 269/662 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49961 ms. Remains : 172/544 places, 269/662 transitions.
[2026-05-23 08:42:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:42:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:42:00] [INFO ] Input system was already deterministic with 269 transitions.
[2026-05-23 08:42:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:42:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1468229577421467083.gal : 1 ms
[2026-05-23 08:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11349467047052891687.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/CTLCardinality1468229577421467083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11349467047052891687.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,6.42686e+06,0.120121,8520,2,861,5,15001,6,0,947,19532,0


Converting to forward existential form...Done !
original formula: EF((A(((((p900==1)||(p161==0))||((p908==1)||(p964==0)))||(((p736==1)||(p600==0))||(p848==1))) U A(AG((p207==1)) U ((p912==1)&&((p485==0)|...183
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p503==1)) * !(EG(!(!((E(!(((p912==1)&&((p485==0)||(p702==1)))) U (!(!(E(TRUE U !((p207==1...708
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t30, t49, t84, t100, t105, t167, Intersection with reachable at each step enabled. ...203
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.4958,232468,1,0,707,1.49091e+06,576,477,6304,1.29974e+06,1115
FORMULA CO4-PT-18-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 500 transition count 618
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 500 transition count 618
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 120 place count 468 transition count 586
Iterating global reduction 0 with 32 rules applied. Total rules applied 152 place count 468 transition count 586
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 155 place count 468 transition count 583
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 173 place count 450 transition count 565
Iterating global reduction 1 with 18 rules applied. Total rules applied 191 place count 450 transition count 565
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 202 place count 439 transition count 554
Iterating global reduction 1 with 11 rules applied. Total rules applied 213 place count 439 transition count 554
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 215 place count 439 transition count 552
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 434 transition count 547
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 434 transition count 547
Applied a total of 225 rules in 55 ms. Remains 434 /544 variables (removed 110) and now considering 547/662 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16354824336927348430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-702061124080390264.kers'
[2026-05-23 08:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16354824336927348430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-702061124080390264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 547 rows 434 cols 1230 entries
Finished phase 1 with 430 SingleSign rule and 0 generalized
[2026-05-23 08:42:07] [INFO ] Computed 4 invariants in 5 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-702061124080390264.kers
Total runtime 6 ms.
[2026-05-23 08:42:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 08:42:07] [INFO ] Invariant cache hit.
[2026-05-23 08:42:08] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2026-05-23 08:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/981 variables, 434/438 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 440 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (OVERLAPS) 547/981 variables, 434/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 546/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 987 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 434/544 places, 547/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 434/544 places, 547/662 transitions.
[2026-05-23 08:43:08] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:43:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:43:08] [INFO ] Input system was already deterministic with 547 transitions.
[2026-05-23 08:43:08] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:43:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:43:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16870048455413770908.gal : 2 ms
[2026-05-23 08:43:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2767222528943090153.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/CTLCardinality16870048455413770908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2767222528943090153.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,6.18111e+08,1.27379,40956,2,5674,5,113837,6,0,2281,195825,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
(forward)formula 0,0,13.8988,317608,1,0,690,1.19306e+06,1109,467,12157,1.17426e+06,1100
FORMULA CO4-PT-18-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Graph (trivial) has 579 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 814 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 278 place count 535 transition count 376
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 554 place count 259 transition count 376
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 554 place count 259 transition count 340
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 626 place count 223 transition count 340
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 638 place count 211 transition count 328
Iterating global reduction 2 with 12 rules applied. Total rules applied 650 place count 211 transition count 328
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 650 place count 211 transition count 326
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 654 place count 209 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 659 place count 204 transition count 321
Iterating global reduction 2 with 5 rules applied. Total rules applied 664 place count 204 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 665 place count 204 transition count 320
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 725 place count 174 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 732 place count 174 transition count 283
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 737 place count 171 transition count 281
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 743 place count 165 transition count 275
Iterating global reduction 5 with 6 rules applied. Total rules applied 749 place count 165 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 751 place count 165 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 752 place count 164 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 754 place count 163 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 755 place count 162 transition count 271
Iterating global reduction 7 with 1 rules applied. Total rules applied 756 place count 162 transition count 271
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 757 place count 161 transition count 269
Iterating global reduction 7 with 1 rules applied. Total rules applied 758 place count 161 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 759 place count 161 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 775 place count 161 transition count 252
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 10 rules applied. Total rules applied 785 place count 161 transition count 242
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 795 place count 151 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 797 place count 150 transition count 241
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 799 place count 148 transition count 239
Applied a total of 799 rules in 51 ms. Remains 148 /544 variables (removed 396) and now considering 239/662 (removed 423) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1052995324246267914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13661617981383101250.kers'
[2026-05-23 08:43:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1052995324246267914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13661617981383101250.kers]
Normalized transition count is 238 out of 239 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 148 cols 576 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-23 08:43:22] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13661617981383101250.kers
Total runtime 3 ms.
[2026-05-23 08:43:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 08:43:22] [INFO ] Invariant cache hit.
[2026-05-23 08:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:43:22] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-23 08:43:22] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-23 08:43:22] [INFO ] Invariant cache hit.
[2026-05-23 08:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 238/386 variables, 148/152 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 1/387 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 153 constraints, problems are : Problem set: 0 solved, 226 unsolved in 12393 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 148/148 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 238/386 variables, 148/152 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 226/378 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 379 constraints, problems are : Problem set: 0 solved, 226 unsolved in 23076 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 148/148 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35488ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 35488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 148/544 places, 239/662 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35734 ms. Remains : 148/544 places, 239/662 transitions.
[2026-05-23 08:43:58] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:43:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:43:58] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-23 08:43:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:43:58] [INFO ] Flatten gal took : 2 ms
[2026-05-23 08:43:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17929799843166999870.gal : 1 ms
[2026-05-23 08:43:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15461191432029232857.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/CTLCardinality17929799843166999870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15461191432029232857.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.58862e+06,0.074036,6844,2,735,5,10168,6,0,821,10499,0


Converting to forward existential form...Done !
original formula: AF(AG((p876==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p876==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t27, t42, t68, t84, t89, t142, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,0,2.47221,92960,1,0,373,387785,505,237,5135,572495,573
FORMULA CO4-PT-18-CTLCardinality-2024-10 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 : 544/544 places, 662/662 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 502 transition count 620
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 502 transition count 620
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 114 place count 472 transition count 590
Iterating global reduction 0 with 30 rules applied. Total rules applied 144 place count 472 transition count 590
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 147 place count 472 transition count 587
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 163 place count 456 transition count 571
Iterating global reduction 1 with 16 rules applied. Total rules applied 179 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 189 place count 446 transition count 561
Iterating global reduction 1 with 10 rules applied. Total rules applied 199 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 201 place count 446 transition count 559
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 442 transition count 555
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 442 transition count 555
Applied a total of 209 rules in 48 ms. Remains 442 /544 variables (removed 102) and now considering 555/662 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16337064894829780638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11144840694946092912.kers'
[2026-05-23 08:44:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16337064894829780638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11144840694946092912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 555 rows 442 cols 1246 entries
Finished phase 1 with 438 SingleSign rule and 0 generalized
[2026-05-23 08:44:00] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11144840694946092912.kers
Total runtime 4 ms.
[2026-05-23 08:44:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 08:44:00] [INFO ] Invariant cache hit.
[2026-05-23 08:44:00] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2026-05-23 08:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (OVERLAPS) 555/997 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/997 variables, and 448 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 555/997 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 554/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1002 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 442/544 places, 555/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60479 ms. Remains : 442/544 places, 555/662 transitions.
[2026-05-23 08:45:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:45:01] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:45:01] [INFO ] Input system was already deterministic with 555 transitions.
[2026-05-23 08:45:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:45:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:45:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality3230605112739496213.gal : 2 ms
[2026-05-23 08:45:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13559169381862889852.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/CTLCardinality3230605112739496213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13559169381862889852.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,6.40191e+08,1.41524,44308,2,5692,5,123681,6,0,2321,216883,0


Converting to forward existential form...Done !
original formula: EG((AG(AX(FALSE)) + EF(EG(((p743==0)&&(p448==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EX(!(FALSE)))))) + E(TRUE U EG(((p743==0)&&(p448==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t53, t55, t58, t102, t1...457
Detected timeout of ITS tools.
[2026-05-23 08:45:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:45:31] [INFO ] Applying decomposition
[2026-05-23 08:45:31] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5221926678845175417.txt' '-o' '/tmp/graph5221926678845175417.bin' '-w' '/tmp/graph5221926678845175417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5221926678845175417.bin' '-l' '-1' '-v' '-w' '/tmp/graph5221926678845175417.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:45:31] [INFO ] Decomposing Gal with order
[2026-05-23 08:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:45:31] [INFO ] Removed a total of 171 redundant transitions.
[2026-05-23 08:45:31] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-23 08:45:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality12064021709692776356.gal : 4 ms
[2026-05-23 08:45:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16842885445390201544.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/CTLCardinality12064021709692776356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16842885445390201544.ctl'

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 -...264
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,6.40191e+08,0.173143,10572,602,95,11098,1404,867,17289,94,4891,0


Converting to forward existential form...Done !
original formula: EG((AG(AX(FALSE)) + EF(EG(((i10.u133.p743==0)&&(i10.u72.p448==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EX(!(FALSE)))))) + E(TRUE U EG(((i10.u133.p743==0)&&(i10.u72.p448==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t49, t58, t102, t188, t286, t301, t345, t379, t391, t434, t471, t498, t499, i0.t462, i0.t453,...692
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Graph (trivial) has 568 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 814 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 269 place count 535 transition count 385
Reduce places removed 267 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 275 rules applied. Total rules applied 544 place count 268 transition count 377
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 552 place count 260 transition count 377
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 552 place count 260 transition count 341
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 624 place count 224 transition count 341
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 636 place count 212 transition count 328
Iterating global reduction 3 with 12 rules applied. Total rules applied 648 place count 212 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 212 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 649 place count 212 transition count 325
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 653 place count 210 transition count 325
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 658 place count 205 transition count 320
Iterating global reduction 4 with 5 rules applied. Total rules applied 663 place count 205 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 664 place count 205 transition count 319
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 724 place count 175 transition count 289
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 7 rules applied. Total rules applied 731 place count 175 transition count 282
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 736 place count 172 transition count 280
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 742 place count 166 transition count 274
Iterating global reduction 7 with 6 rules applied. Total rules applied 748 place count 166 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 750 place count 166 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 751 place count 165 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 753 place count 164 transition count 271
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 754 place count 163 transition count 270
Iterating global reduction 9 with 1 rules applied. Total rules applied 755 place count 163 transition count 270
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 756 place count 162 transition count 268
Iterating global reduction 9 with 1 rules applied. Total rules applied 757 place count 162 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 758 place count 162 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 774 place count 162 transition count 251
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 10 with 9 rules applied. Total rules applied 783 place count 162 transition count 242
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 10 rules applied. Total rules applied 793 place count 153 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 794 place count 152 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 794 place count 152 transition count 240
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 796 place count 151 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 798 place count 150 transition count 239
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 801 place count 150 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 803 place count 148 transition count 237
Applied a total of 803 rules in 54 ms. Remains 148 /544 variables (removed 396) and now considering 237/662 (removed 425) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5759232144142526952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5347871342305544431.kers'
[2026-05-23 08:46:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5759232144142526952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5347871342305544431.kers]
Normalized transition count is 236 out of 237 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 236 rows 148 cols 574 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-23 08:46:01] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5347871342305544431.kers
Total runtime 2 ms.
[2026-05-23 08:46:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 08:46:01] [INFO ] Invariant cache hit.
[2026-05-23 08:46:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:46:01] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2026-05-23 08:46:01] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2026-05-23 08:46:01] [INFO ] Invariant cache hit.
[2026-05-23 08:46:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 236/384 variables, 148/152 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/385 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 153 constraints, problems are : Problem set: 0 solved, 224 unsolved in 11966 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 148/148 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 236/384 variables, 148/152 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 224/376 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 1/385 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 377 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27505 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 148/148 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39488ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 39489ms
Starting structural reductions in SI_CTL mode, iteration 1 : 148/544 places, 237/662 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39715 ms. Remains : 148/544 places, 237/662 transitions.
[2026-05-23 08:46:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:46:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 08:46:41] [INFO ] Input system was already deterministic with 237 transitions.
[2026-05-23 08:46:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 08:46:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 08:46:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2040845042741990429.gal : 1 ms
[2026-05-23 08:46:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2996218044324977517.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/CTLCardinality2040845042741990429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2996218044324977517.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,2.66846e+06,0.076555,6684,2,730,5,9417,6,0,819,9719,0


Converting to forward existential form...Done !
original formula: (EG(AF((EG((p165==0)) + (p326==0)))) + E((p860!=1) U (p284==1)))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!((EG((p165==0)) + (p326==0))))))] != FALSE + [(FwdU(Init,(p860!=1)) * (p284==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t9, t19, t32, t58, t70, t75, t137, t230, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,2.86261,94404,1,0,442,548795,503,237,5261,505248,686
FORMULA CO4-PT-18-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 662/662 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 506 transition count 624
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 506 transition count 624
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 105 place count 477 transition count 595
Iterating global reduction 0 with 29 rules applied. Total rules applied 134 place count 477 transition count 595
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 137 place count 477 transition count 592
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 153 place count 461 transition count 576
Iterating global reduction 1 with 16 rules applied. Total rules applied 169 place count 461 transition count 576
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 180 place count 450 transition count 565
Iterating global reduction 1 with 11 rules applied. Total rules applied 191 place count 450 transition count 565
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 193 place count 450 transition count 563
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 445 transition count 558
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 445 transition count 558
Applied a total of 203 rules in 45 ms. Remains 445 /544 variables (removed 99) and now considering 558/662 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10578585103123048098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9982381770746835913.kers'
[2026-05-23 08:46:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10578585103123048098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9982381770746835913.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 558 rows 445 cols 1252 entries
Finished phase 1 with 441 SingleSign rule and 0 generalized
[2026-05-23 08:46:44] [INFO ] Computed 4 invariants in 7 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9982381770746835913.kers
Total runtime 9 ms.
[2026-05-23 08:46:44] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:46:44] [INFO ] Invariant cache hit.
[2026-05-23 08:46:44] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2026-05-23 08:46:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (OVERLAPS) 558/1003 variables, 445/449 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 451 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (OVERLAPS) 558/1003 variables, 445/451 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 557/1008 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 1009 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 445/544 places, 558/662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60481 ms. Remains : 445/544 places, 558/662 transitions.
[2026-05-23 08:47:44] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:47:44] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:47:44] [INFO ] Input system was already deterministic with 558 transitions.
[2026-05-23 08:47:44] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:47:44] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:47:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15303957745603504071.gal : 1 ms
[2026-05-23 08:47:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality13019807167744783590.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/CTLCardinality15303957745603504071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13019807167744783590.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,6.71999e+08,1.62723,50456,2,7717,5,144045,6,0,2336,251002,0


Converting to forward existential form...Done !
original formula: E((EX(EF(((p462==1) * AG(((p865==0)||(p430==1)))))) + AX(EX(AX(((p965==0)||(p378==1)))))) U !(AF((AG((p406==1)) * EX(((p404==0)||(p126==1...162
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX(E(TRUE U ((p462==1) * !(E(TRUE U !(((p865==0)||(p430==1)))))))) + !(EX(!(EX(!(EX(!(((p965==0...248
Reverse transition relation is NOT exact ! Due to transitions t6, t16, t17, t18, t19, t20, t21, t22, t26, t29, t38, t49, t57, t59, t60, t78, t91, t102, t10...582
Detected timeout of ITS tools.
[2026-05-23 08:48:14] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:48:14] [INFO ] Applying decomposition
[2026-05-23 08:48:14] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14733615893654608285.txt' '-o' '/tmp/graph14733615893654608285.bin' '-w' '/tmp/graph14733615893654608285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14733615893654608285.bin' '-l' '-1' '-v' '-w' '/tmp/graph14733615893654608285.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:48:14] [INFO ] Decomposing Gal with order
[2026-05-23 08:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:48:14] [INFO ] Removed a total of 158 redundant transitions.
[2026-05-23 08:48:14] [INFO ] Flatten gal took : 25 ms
[2026-05-23 08:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-23 08:48:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9523056168335408779.gal : 4 ms
[2026-05-23 08:48:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8985669794561738027.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/CTLCardinality9523056168335408779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8985669794561738027.ctl'

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 -...262
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,6.71999e+08,0.251962,13552,764,96,16305,1674,994,34591,99,6796,0


Converting to forward existential form...Done !
original formula: E((EX(EF(((i9.u75.p462==1) * AG(((i18.u159.p865==0)||(i5.i0.i0.u4.p430==1)))))) + AX(EX(AX(((i19.u169.p965==0)||(i4.u52.p378==1)))))) U !...238
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX(E(TRUE U ((i9.u75.p462==1) * !(E(TRUE U !(((i18.u159.p865==0)||(i5.i0.i0.u4.p430==1)))))))) ...324
Reverse transition relation is NOT exact ! Due to transitions t49, t59, t78, t104, t115, t116, t138, t150, t174, t186, t188, t189, t232, t233, t299, t393, ...973
Detected timeout of ITS tools.
[2026-05-23 08:48:44] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:48:44] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:48:44] [INFO ] Applying decomposition
[2026-05-23 08:48:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16774381858507439868.txt' '-o' '/tmp/graph16774381858507439868.bin' '-w' '/tmp/graph16774381858507439868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16774381858507439868.bin' '-l' '-1' '-v' '-w' '/tmp/graph16774381858507439868.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:48:44] [INFO ] Decomposing Gal with order
[2026-05-23 08:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:48:44] [INFO ] Removed a total of 172 redundant transitions.
[2026-05-23 08:48:44] [INFO ] Flatten gal took : 19 ms
[2026-05-23 08:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2026-05-23 08:48:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16271584119314757882.gal : 5 ms
[2026-05-23 08:48:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1164892660865535793.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/CTLCardinality16271584119314757882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1164892660865535793.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 2 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,1.51213e+09,0.340731,17608,1035,91,24387,2304,1258,46275,95,9324,0


Converting to forward existential form...Done !
original formula: EG((AG(AX(FALSE)) + EF(EG(((i17.u169.p743==0)&&(i8.i0.i0.u87.p448==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EX(!(FALSE)))))) + E(TRUE U EG(((i17.u169.p743==0)&&(i8.i0.i0.u87.p448==1))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t88, t109, t150, t151, t177, t189, t231, t254, t262, t288, t289, t332, t348, t363, t416, t507...1164
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,95.3243,1688320,1,0,2.35453e+06,3772,8687,9.18147e+06,480,21398,2821606
FORMULA CO4-PT-18-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((EX(EF(((i8.i1.i2.u94.p462==1) * AG(((i7.u204.p865==0)||(i6.i1.i0.u3.p430==1)))))) + AX(EX(AX(((i21.u206.p965==0)||(i6.i0.i1.u69.p378==...255
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX(E(TRUE U ((i8.i1.i2.u94.p462==1) * !(E(TRUE U !(((i7.u204.p865==0)||(i6.i1.i0.u3.p430==1))))...341
(forward)formula 1,1,166.238,2200428,1,0,3.12542e+06,3952,6149,1.15138e+07,338,22738,963916
FORMULA CO4-PT-18-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1126391 ms.

BK_STOP 1779526291803

--------------------
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="CO4-PT-18"
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 CO4-PT-18, 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 r066-tall-177946967700417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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