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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 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 336K 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-20-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779526893842

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 09:01:34] [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 09:01:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:01:35] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2026-05-23 09:01:35] [INFO ] Transformed 1178 places.
[2026-05-23 09:01:35] [INFO ] Transformed 1463 transitions.
[2026-05-23 09:01:35] [INFO ] Found NUPN structural information;
[2026-05-23 09:01:35] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 187 places in 15 ms
Reduce places removed 187 places and 251 transitions.
Support contains 73 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 972 transition count 1208
Discarding 153 places :
Symmetric choice reduction at 1 with 153 rule applications. Total rules 176 place count 819 transition count 1053
Iterating global reduction 1 with 153 rules applied. Total rules applied 329 place count 819 transition count 1053
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 446 place count 702 transition count 932
Iterating global reduction 1 with 117 rules applied. Total rules applied 563 place count 702 transition count 932
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 569 place count 702 transition count 926
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 625 place count 646 transition count 863
Iterating global reduction 2 with 56 rules applied. Total rules applied 681 place count 646 transition count 863
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 684 place count 646 transition count 860
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 717 place count 613 transition count 826
Iterating global reduction 3 with 33 rules applied. Total rules applied 750 place count 613 transition count 826
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 755 place count 613 transition count 821
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 769 place count 599 transition count 807
Iterating global reduction 4 with 14 rules applied. Total rules applied 783 place count 599 transition count 807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 784 place count 599 transition count 806
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 787 place count 596 transition count 803
Iterating global reduction 5 with 3 rules applied. Total rules applied 790 place count 596 transition count 803
Applied a total of 790 rules in 276 ms. Remains 596 /991 variables (removed 395) and now considering 803/1212 (removed 409) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3465368533059604589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3423901255919450107.kers'
[2026-05-23 09:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3465368533059604589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3423901255919450107.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 803 rows 596 cols 2097 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-23 09:01:35] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3423901255919450107.kers
Total runtime 6 ms.
[2026-05-23 09:01:35] [INFO ] Implicit Places using invariants in 342 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 595/991 places, 803/1212 transitions.
Applied a total of 0 rules in 10 ms. Remains 595 /595 variables (removed 0) and now considering 803/803 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 674 ms. Remains : 595/991 places, 803/1212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 803/803 transitions.
Applied a total of 0 rules in 9 ms. Remains 595 /595 variables (removed 0) and now considering 803/803 (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-10277286761625932031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11652039123109171809.kers'
[2026-05-23 09:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10277286761625932031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11652039123109171809.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 803 rows 595 cols 2095 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-23 09:01:35] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11652039123109171809.kers
Total runtime 4 ms.
[2026-05-23 09:01:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-23 09:01:36] [INFO ] Invariant cache hit.
[2026-05-23 09:01:36] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 802 sub problems to find dead transitions.
[2026-05-23 09:01:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 5/11 constraints. Problems are: Problem set: 5 solved, 797 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1398 variables, and 11 constraints, problems are : Problem set: 5 solved, 797 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 797 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 797 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 797 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 5/11 constraints. Problems are: Problem set: 5 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 797 unsolved
At refinement iteration 4 (OVERLAPS) 803/1395 variables, 592/603 constraints. Problems are: Problem set: 5 solved, 797 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1395 variables, 791/1394 constraints. Problems are: Problem set: 5 solved, 797 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1395/1398 variables, and 1394 constraints, problems are : Problem set: 5 solved, 797 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 592/595 constraints, PredecessorRefiner: 791/802 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 5 solved, 797 unsolved
Search for dead transitions found 5 dead transitions in 60359ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 595/595 places, 798/803 transitions.
Applied a total of 0 rules in 9 ms. Remains 595 /595 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60922 ms. Remains : 595/595 places, 798/803 transitions.
Support contains 73 out of 595 places after structural reductions.
[2026-05-23 09:02:37] [INFO ] Flatten gal took : 75 ms
[2026-05-23 09:02:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-20-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:02:37] [INFO ] Flatten gal took : 37 ms
[2026-05-23 09:02:37] [INFO ] Input system was already deterministic with 798 transitions.
Support contains 53 out of 595 places (down from 73) after GAL structural reductions.
FORMULA CO4-PT-20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (659 resets) in 2086 ms. (19 steps per ms) remains 22/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8036473748474825923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14912491118386196032.kers'
[2026-05-23 09:02:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8036473748474825923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14912491118386196032.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 798 rows 595 cols 2065 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-23 09:02:38] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14912491118386196032.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 12/74 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 191/265 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 442/707 variables, 151/231 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 446/1153 variables, 221/452 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1153 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 185/1338 variables, 111/563 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1338 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 48/1386 variables, 32/595 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1386 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 7/1393 variables, 6/601 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1393 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/1393 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1393/1393 variables, and 601 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2417 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 12/74 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 191/265 variables, 74/81 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 442/707 variables, 151/233 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/707 variables, 21/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/707 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 446/1153 variables, 221/478 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1153 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 185/1338 variables, 111/589 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1338 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 48/1386 variables, 32/621 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1386 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 7/1393 variables, 6/627 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1393/1393 variables, and 627 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7449ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 798/798 transitions.
Graph (trivial) has 578 edges and 595 vertex of which 3 / 595 are part of one of the 1 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1158 edges and 593 vertex of which 574 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 266 rules applied. Total rules applied 268 place count 574 transition count 516
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 243 rules applied. Total rules applied 511 place count 334 transition count 513
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 517 place count 333 transition count 508
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 522 place count 328 transition count 508
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 522 place count 328 transition count 470
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 598 place count 290 transition count 470
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 605 place count 283 transition count 463
Iterating global reduction 4 with 7 rules applied. Total rules applied 612 place count 283 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 613 place count 283 transition count 462
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 613 place count 283 transition count 461
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 615 place count 282 transition count 461
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 617 place count 280 transition count 458
Iterating global reduction 5 with 2 rules applied. Total rules applied 619 place count 280 transition count 458
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 620 place count 279 transition count 457
Iterating global reduction 5 with 1 rules applied. Total rules applied 621 place count 279 transition count 457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 622 place count 279 transition count 456
Performed 88 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 6 with 176 rules applied. Total rules applied 798 place count 191 transition count 348
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 811 place count 191 transition count 335
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 816 place count 186 transition count 326
Iterating global reduction 7 with 5 rules applied. Total rules applied 821 place count 186 transition count 326
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 823 place count 185 transition count 325
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 824 place count 184 transition count 323
Iterating global reduction 7 with 1 rules applied. Total rules applied 825 place count 184 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 826 place count 184 transition count 322
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 904 place count 145 transition count 363
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 919 place count 145 transition count 348
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 940 place count 124 transition count 264
Iterating global reduction 9 with 21 rules applied. Total rules applied 961 place count 124 transition count 264
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 971 place count 124 transition count 254
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 973 place count 122 transition count 246
Iterating global reduction 10 with 2 rules applied. Total rules applied 975 place count 122 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 976 place count 122 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 979 place count 122 transition count 242
Free-agglomeration rule applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 993 place count 122 transition count 228
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1009 place count 108 transition count 226
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1012 place count 108 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1013 place count 108 transition count 225
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1014 place count 108 transition count 225
Applied a total of 1014 rules in 195 ms. Remains 108 /595 variables (removed 487) and now considering 225/798 (removed 573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 108/595 places, 225/798 transitions.
RANDOM walk for 40000 steps (8 resets) in 1140 ms. (35 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2026-05-23 09:02:46] [INFO ] Flow matrix only has 203 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6373116610821827445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15741794566558896961.kers'
[2026-05-23 09:02:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6373116610821827445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15741794566558896961.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 203 rows 107 cols 617 entries
Finished phase 1 with 91 SingleSign rule and 7 generalized
[2026-05-23 09:02:46] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15741794566558896961.kers
Total runtime 1 ms.
[2026-05-23 09:02:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 76/311 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 2/9 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/108 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-20-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:02:46] [INFO ] Flatten gal took : 28 ms
[2026-05-23 09:02:46] [INFO ] Flatten gal took : 26 ms
[2026-05-23 09:02:46] [INFO ] Input system was already deterministic with 798 transitions.
Computed a total of 37 stabilizing places and 52 stable transitions
Graph (complete) has 1161 edges and 595 vertex of which 584 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 593 transition count 798
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 41 place count 554 transition count 759
Iterating global reduction 1 with 39 rules applied. Total rules applied 80 place count 554 transition count 759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 554 transition count 756
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 111 place count 526 transition count 728
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 526 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 526 transition count 727
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 155 place count 511 transition count 710
Iterating global reduction 3 with 15 rules applied. Total rules applied 170 place count 511 transition count 710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 172 place count 511 transition count 708
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 179 place count 504 transition count 701
Iterating global reduction 4 with 7 rules applied. Total rules applied 186 place count 504 transition count 701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 504 transition count 699
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 503 transition count 698
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 503 transition count 698
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 502 transition count 697
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 502 transition count 697
Applied a total of 192 rules in 59 ms. Remains 502 /595 variables (removed 93) and now considering 697/798 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12243270324744453617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9222005489062381683.kers'
[2026-05-23 09:02:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12243270324744453617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9222005489062381683.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 697 rows 502 cols 1844 entries
Finished phase 1 with 496 SingleSign rule and 0 generalized
[2026-05-23 09:02:46] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9222005489062381683.kers
Total runtime 4 ms.
[2026-05-23 09:02:46] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-23 09:02:46] [INFO ] Invariant cache hit.
[2026-05-23 09:02:46] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2026-05-23 09:02:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/501 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 696 unsolved
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 30126ms
Starting structural reductions in LTL mode, iteration 1 : 502/595 places, 697/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30615 ms. Remains : 502/595 places, 697/798 transitions.
[2026-05-23 09:03:16] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:03:16] [INFO ] Flatten gal took : 19 ms
[2026-05-23 09:03:16] [INFO ] Input system was already deterministic with 697 transitions.
[2026-05-23 09:03:16] [INFO ] Flatten gal took : 18 ms
[2026-05-23 09:03:16] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:03:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality599327172436474845.gal : 16 ms
[2026-05-23 09:03:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5430015705247552297.ctl : 2 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/CTLCardinality599327172436474845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5430015705247552297.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,1.44052e+12,17.7556,455004,2,31643,5,1.30656e+06,6,0,2696,2.31193e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:03:47] [INFO ] Flatten gal took : 15 ms
[2026-05-23 09:03:47] [INFO ] Applying decomposition
[2026-05-23 09:03:47] [INFO ] Flatten gal took : 14 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/graph15616290990230546514.txt' '-o' '/tmp/graph15616290990230546514.bin' '-w' '/tmp/graph15616290990230546514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15616290990230546514.bin' '-l' '-1' '-v' '-w' '/tmp/graph15616290990230546514.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:03:47] [INFO ] Decomposing Gal with order
[2026-05-23 09:03:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:03:47] [INFO ] Removed a total of 414 redundant transitions.
[2026-05-23 09:03:47] [INFO ] Flatten gal took : 80 ms
[2026-05-23 09:03:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 14 ms.
[2026-05-23 09:03:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3472120695517845574.gal : 11 ms
[2026-05-23 09:03:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10717222562794757530.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/CTLCardinality3472120695517845574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10717222562794757530.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 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,1.44052e+12,2.6951,102876,2322,286,147309,10510,1161,664404,139,95761,0


Converting to forward existential form...Done !
original formula: AF((EF(AG((i12.u85.p581!=1))) + EX((((i16.u144.p864!=0)&&(i19.u174.p1042!=1))&&((i2.u27.p255!=0)&&(i6.u0.p5!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(E(TRUE U !((i12.u85.p581!=1))))) + EX((((i16.u144.p864!=0)&&(i19.u174.p1042!=1))&&((i2....197
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t53, t86, t95, t96, t140, t186, t224, t268, t321, t357, t366, t456, t497, t556, t55...1106
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 797
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 44 place count 552 transition count 757
Iterating global reduction 1 with 40 rules applied. Total rules applied 84 place count 552 transition count 757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 552 transition count 754
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 117 place count 522 transition count 724
Iterating global reduction 2 with 30 rules applied. Total rules applied 147 place count 522 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 522 transition count 723
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 164 place count 506 transition count 705
Iterating global reduction 3 with 16 rules applied. Total rules applied 180 place count 506 transition count 705
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 506 transition count 703
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 189 place count 499 transition count 696
Iterating global reduction 4 with 7 rules applied. Total rules applied 196 place count 499 transition count 696
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 198 place count 499 transition count 694
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 498 transition count 693
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 498 transition count 693
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 497 transition count 692
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 497 transition count 692
Applied a total of 202 rules in 68 ms. Remains 497 /595 variables (removed 98) and now considering 692/798 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16582099534922622553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4366180563459308628.kers'
[2026-05-23 09:04:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16582099534922622553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4366180563459308628.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 692 rows 497 cols 1830 entries
Finished phase 1 with 491 SingleSign rule and 0 generalized
[2026-05-23 09:04:17] [INFO ] Computed 6 invariants in 7 ms
Computed 6 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4366180563459308628.kers
Total runtime 8 ms.
[2026-05-23 09:04:17] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-23 09:04:17] [INFO ] Invariant cache hit.
[2026-05-23 09:04:18] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2026-05-23 09:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 691 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 30110ms
Starting structural reductions in LTL mode, iteration 1 : 497/595 places, 692/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30600 ms. Remains : 497/595 places, 692/798 transitions.
[2026-05-23 09:04:48] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:04:48] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:04:48] [INFO ] Input system was already deterministic with 692 transitions.
[2026-05-23 09:04:48] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:04:48] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:04:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality1132562592841254181.gal : 3 ms
[2026-05-23 09:04:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13859117456553376708.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/CTLCardinality1132562592841254181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13859117456553376708.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,1.31535e+12,18.9271,506008,2,32571,5,1.47447e+06,6,0,2674,2.59628e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:05:18] [INFO ] Flatten gal took : 27 ms
[2026-05-23 09:05:18] [INFO ] Applying decomposition
[2026-05-23 09:05:18] [INFO ] Flatten gal took : 10 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/graph6325149385048642112.txt' '-o' '/tmp/graph6325149385048642112.bin' '-w' '/tmp/graph6325149385048642112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6325149385048642112.bin' '-l' '-1' '-v' '-w' '/tmp/graph6325149385048642112.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:05:18] [INFO ] Decomposing Gal with order
[2026-05-23 09:05:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:05:18] [INFO ] Removed a total of 427 redundant transitions.
[2026-05-23 09:05:18] [INFO ] Flatten gal took : 26 ms
[2026-05-23 09:05:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 8 ms.
[2026-05-23 09:05:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7830055025018825429.gal : 6 ms
[2026-05-23 09:05:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1953219021329694690.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/CTLCardinality7830055025018825429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1953219021329694690.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,1.31535e+12,2.10178,77380,2639,295,101751,9782,1226,470427,126,94834,0


Converting to forward existential form...Done !
original formula: EX(AF(((i19.u181.p1025==0)&&(i5.u38.p296==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((i19.u181.p1025==0)&&(i5.u38.p296==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t183, t244, t265, t354, t363, t454, t485, t525, t553, t554, t58...1101
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 797
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 44 place count 552 transition count 757
Iterating global reduction 1 with 40 rules applied. Total rules applied 84 place count 552 transition count 757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 552 transition count 754
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 116 place count 523 transition count 725
Iterating global reduction 2 with 29 rules applied. Total rules applied 145 place count 523 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 523 transition count 724
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 162 place count 507 transition count 706
Iterating global reduction 3 with 16 rules applied. Total rules applied 178 place count 507 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 507 transition count 704
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 187 place count 500 transition count 697
Iterating global reduction 4 with 7 rules applied. Total rules applied 194 place count 500 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 500 transition count 695
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 499 transition count 694
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 499 transition count 694
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 498 transition count 693
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 498 transition count 693
Applied a total of 200 rules in 57 ms. Remains 498 /595 variables (removed 97) and now considering 693/798 (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-5616796311985605764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11434393831726725762.kers'
[2026-05-23 09:05:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5616796311985605764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11434393831726725762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 693 rows 498 cols 1832 entries
Finished phase 1 with 492 SingleSign rule and 0 generalized
[2026-05-23 09:05:48] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11434393831726725762.kers
Total runtime 3 ms.
[2026-05-23 09:05:48] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-23 09:05:48] [INFO ] Invariant cache hit.
[2026-05-23 09:05:49] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2026-05-23 09:05:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 692 unsolved
SMT process timed out in 30103ms, After SMT, problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in LTL mode, iteration 1 : 498/595 places, 693/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30576 ms. Remains : 498/595 places, 693/798 transitions.
[2026-05-23 09:06:19] [INFO ] Flatten gal took : 14 ms
[2026-05-23 09:06:19] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:06:19] [INFO ] Input system was already deterministic with 693 transitions.
[2026-05-23 09:06:19] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:06:19] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:06:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7387597184031317930.gal : 3 ms
[2026-05-23 09:06:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1348165274991721584.ctl : 2 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/CTLCardinality7387597184031317930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1348165274991721584.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,1.3187e+12,18.1542,467428,2,33100,5,1.39846e+06,6,0,2679,2.38967e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:06:49] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:06:49] [INFO ] Applying decomposition
[2026-05-23 09:06:49] [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/graph12122875317408391049.txt' '-o' '/tmp/graph12122875317408391049.bin' '-w' '/tmp/graph12122875317408391049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12122875317408391049.bin' '-l' '-1' '-v' '-w' '/tmp/graph12122875317408391049.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:06:49] [INFO ] Decomposing Gal with order
[2026-05-23 09:06:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:06:49] [INFO ] Removed a total of 410 redundant transitions.
[2026-05-23 09:06:49] [INFO ] Flatten gal took : 24 ms
[2026-05-23 09:06:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 14 ms.
[2026-05-23 09:06:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11067018361783416772.gal : 5 ms
[2026-05-23 09:06:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9034382536006262617.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/CTLCardinality11067018361783416772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9034382536006262617.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 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,1.3187e+12,0.862325,35392,1453,228,60919,4285,1188,116118,131,19411,0


Converting to forward existential form...Done !
original formula: AG(EX(((AX((i10.u147.p916==1)) * (i6.u2.p5==0)) * (i1.u19.p212==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((!(EX(!((i10.u147.p916==1)))) * (i6.u2.p5==0)) * (i1.u19.p212==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t28, t52, t83, t92, t93, t139, t185, t231, t267, t356, t365, t554, t555, t591, t592, t619, t6...1163
(forward)formula 0,0,2.33426,90052,1,0,179472,4753,6294,374078,611,19411,509992
FORMULA CO4-PT-20-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 797
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 45 place count 551 transition count 756
Iterating global reduction 1 with 41 rules applied. Total rules applied 86 place count 551 transition count 756
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 89 place count 551 transition count 753
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 119 place count 521 transition count 723
Iterating global reduction 2 with 30 rules applied. Total rules applied 149 place count 521 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 521 transition count 722
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 166 place count 505 transition count 704
Iterating global reduction 3 with 16 rules applied. Total rules applied 182 place count 505 transition count 704
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 184 place count 505 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 190 place count 499 transition count 696
Iterating global reduction 4 with 6 rules applied. Total rules applied 196 place count 499 transition count 696
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 198 place count 499 transition count 694
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 498 transition count 693
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 498 transition count 693
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 497 transition count 692
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 497 transition count 692
Applied a total of 202 rules in 55 ms. Remains 497 /595 variables (removed 98) and now considering 692/798 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10762823701401205791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12069174102944209863.kers'
[2026-05-23 09:06:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10762823701401205791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12069174102944209863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 692 rows 497 cols 1832 entries
Finished phase 1 with 491 SingleSign rule and 0 generalized
[2026-05-23 09:06:51] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12069174102944209863.kers
Total runtime 3 ms.
[2026-05-23 09:06:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-23 09:06:52] [INFO ] Invariant cache hit.
[2026-05-23 09:06:52] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2026-05-23 09:06:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 692/1189 variables, 497/503 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1189/1189 variables, and 503 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 692/1189 variables, 497/506 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1189 variables, 691/1197 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1189/1189 variables, and 1199 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 497/595 places, 692/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 497/595 places, 692/798 transitions.
[2026-05-23 09:07:52] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:07:52] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:07:52] [INFO ] Input system was already deterministic with 692 transitions.
[2026-05-23 09:07:52] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:07:52] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:07:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality16268856427036989795.gal : 4 ms
[2026-05-23 09:07:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6379549437752066478.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/CTLCardinality16268856427036989795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6379549437752066478.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,1.32684e+12,23.1037,589716,2,37545,5,1.69529e+06,6,0,2674,3.0719e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:08:22] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:08:22] [INFO ] Applying decomposition
[2026-05-23 09:08:22] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6256870402031882825.txt' '-o' '/tmp/graph6256870402031882825.bin' '-w' '/tmp/graph6256870402031882825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6256870402031882825.bin' '-l' '-1' '-v' '-w' '/tmp/graph6256870402031882825.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:08:22] [INFO ] Decomposing Gal with order
[2026-05-23 09:08:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:08:22] [INFO ] Removed a total of 425 redundant transitions.
[2026-05-23 09:08:22] [INFO ] Flatten gal took : 40 ms
[2026-05-23 09:08:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 9 ms.
[2026-05-23 09:08:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6243009475082123514.gal : 10 ms
[2026-05-23 09:08:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality16890205394050354197.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/CTLCardinality6243009475082123514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16890205394050354197.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 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,1.32684e+12,2.83381,101960,2482,313,132468,14098,1180,648264,134,143815,0


Converting to forward existential form...Done !
original formula: (AG((AF((i21.u185.p514==1)) * EF((i4.u31.p297==0)))) + EX(AG(((i0.u62.p436==0)||(i2.i0.i2.u27.p277==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !(EX(!(E(TRUE U !(((i0.u62.p436==0)||(i2.i0.i2.u27.p277==1)))))))),TRUE),!((i21.u185.p514==1...300
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t137, t171, t183, t221, t265, t306, t318, t354, t363, t441, t45...1092
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Graph (trivial) has 632 edges and 595 vertex of which 3 / 595 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1159 edges and 593 vertex of which 582 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 277 place count 581 transition count 510
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 278 rules applied. Total rules applied 555 place count 306 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 305 transition count 507
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 556 place count 305 transition count 471
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 628 place count 269 transition count 471
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 640 place count 257 transition count 458
Iterating global reduction 3 with 12 rules applied. Total rules applied 652 place count 257 transition count 458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 653 place count 257 transition count 457
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 653 place count 257 transition count 453
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 661 place count 253 transition count 453
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 665 place count 249 transition count 446
Iterating global reduction 4 with 4 rules applied. Total rules applied 669 place count 249 transition count 446
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 755 place count 206 transition count 402
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 768 place count 206 transition count 389
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 774 place count 202 transition count 387
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 783 place count 193 transition count 374
Iterating global reduction 6 with 9 rules applied. Total rules applied 792 place count 193 transition count 374
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 6 with 2 rules applied. Total rules applied 794 place count 193 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 795 place count 192 transition count 372
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 797 place count 191 transition count 371
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 798 place count 190 transition count 369
Iterating global reduction 8 with 1 rules applied. Total rules applied 799 place count 190 transition count 369
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 800 place count 189 transition count 367
Iterating global reduction 8 with 1 rules applied. Total rules applied 801 place count 189 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 802 place count 189 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 828 place count 189 transition count 340
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 16 rules applied. Total rules applied 844 place count 189 transition count 324
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 860 place count 173 transition count 324
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 860 place count 173 transition count 321
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 866 place count 170 transition count 321
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 11 with 2 rules applied. Total rules applied 868 place count 169 transition count 320
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 869 place count 169 transition count 320
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 871 place count 167 transition count 318
Applied a total of 871 rules in 110 ms. Remains 167 /595 variables (removed 428) and now considering 318/798 (removed 480) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16819797462734488728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3822361007893834361.kers'
[2026-05-23 09:08:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16819797462734488728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3822361007893834361.kers]
Normalized transition count is 317 out of 318 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 167 cols 887 entries
Finished phase 1 with 161 SingleSign rule and 0 generalized
[2026-05-23 09:08:52] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3822361007893834361.kers
Total runtime 3 ms.
[2026-05-23 09:08:53] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 09:08:53] [INFO ] Invariant cache hit.
[2026-05-23 09:08:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:08:53] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2026-05-23 09:08:53] [INFO ] Redundant transitions in 26 ms returned []
Running 295 sub problems to find dead transitions.
[2026-05-23 09:08:53] [INFO ] Invariant cache hit.
[2026-05-23 09:08:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 317/484 variables, 167/173 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 1/485 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 174 constraints, problems are : Problem set: 0 solved, 295 unsolved in 18581 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 167/167 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 317/484 variables, 167/173 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 295/468 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 1/485 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 470 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 167/167 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48659ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 48660ms
Starting structural reductions in SI_CTL mode, iteration 1 : 167/595 places, 318/798 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49140 ms. Remains : 167/595 places, 318/798 transitions.
[2026-05-23 09:09:42] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:09:42] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:09:42] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-23 09:09:42] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:09:42] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:09:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1658089251078914951.gal : 1 ms
[2026-05-23 09:09:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17396039229252195760.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/CTLCardinality1658089251078914951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17396039229252195760.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,3.57758e+08,0.113539,8192,2,1316,5,16932,6,0,972,11478,0


Converting to forward existential form...Done !
original formula: AG(EF(((p1173==0)&&(p935==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p1173==0)&&(p935==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t18, t34, t54, t66, t77, t81, t87, t125, t134, t298, t299, t301, t306...269
(forward)formula 0,0,3.01422,106772,1,0,465,576271,656,233,6854,374925,654
FORMULA CO4-PT-20-CTLCardinality-2024-05 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 : 595/595 places, 798/798 transitions.
Graph (trivial) has 620 edges and 595 vertex of which 3 / 595 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 1159 edges and 593 vertex of which 586 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
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 585 transition count 521
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 271 rules applied. Total rules applied 542 place count 317 transition count 518
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 545 place count 316 transition count 516
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 547 place count 314 transition count 516
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 547 place count 314 transition count 480
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 619 place count 278 transition count 480
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 631 place count 266 transition count 467
Iterating global reduction 4 with 12 rules applied. Total rules applied 643 place count 266 transition count 467
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 644 place count 266 transition count 466
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 644 place count 266 transition count 462
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 652 place count 262 transition count 462
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 656 place count 258 transition count 455
Iterating global reduction 5 with 4 rules applied. Total rules applied 660 place count 258 transition count 455
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 744 place count 216 transition count 412
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 13 rules applied. Total rules applied 757 place count 216 transition count 399
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 763 place count 212 transition count 397
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 772 place count 203 transition count 384
Iterating global reduction 7 with 9 rules applied. Total rules applied 781 place count 203 transition count 384
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 783 place count 203 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 784 place count 202 transition count 382
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 9 with 2 rules applied. Total rules applied 786 place count 201 transition count 381
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 787 place count 200 transition count 379
Iterating global reduction 9 with 1 rules applied. Total rules applied 788 place count 200 transition count 379
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 789 place count 199 transition count 377
Iterating global reduction 9 with 1 rules applied. Total rules applied 790 place count 199 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 791 place count 199 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 815 place count 199 transition count 352
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 10 with 14 rules applied. Total rules applied 829 place count 199 transition count 338
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 15 rules applied. Total rules applied 844 place count 185 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 845 place count 184 transition count 337
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 2 Pre rules applied. Total rules applied 845 place count 184 transition count 335
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 849 place count 182 transition count 335
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 851 place count 181 transition count 334
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 853 place count 181 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 854 place count 181 transition count 333
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 855 place count 180 transition count 332
Applied a total of 855 rules in 87 ms. Remains 180 /595 variables (removed 415) and now considering 332/798 (removed 466) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13265323700101304952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10971986244042904277.kers'
[2026-05-23 09:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13265323700101304952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10971986244042904277.kers]
Normalized transition count is 331 out of 332 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 180 cols 922 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-23 09:09:45] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10971986244042904277.kers
Total runtime 1 ms.
[2026-05-23 09:09:45] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 09:09:45] [INFO ] Invariant cache hit.
[2026-05-23 09:09:45] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-23 09:09:45] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2026-05-23 09:09:45] [INFO ] Redundant transitions in 4 ms returned []
Running 329 sub problems to find dead transitions.
[2026-05-23 09:09:45] [INFO ] Invariant cache hit.
[2026-05-23 09:09:45] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 331/510 variables, 179/185 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 61/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/511 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (OVERLAPS) 1/512 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 248 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 180/180 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 331/510 variables, 179/185 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 61/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 328/574 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/512 variables, and 575 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 179/180 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 328/329 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 180/595 places, 332/798 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60470 ms. Remains : 180/595 places, 332/798 transitions.
[2026-05-23 09:10:45] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:10:45] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:10:45] [INFO ] Input system was already deterministic with 332 transitions.
[2026-05-23 09:10:45] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:10:45] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:10:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality5879475369162535137.gal : 1 ms
[2026-05-23 09:10:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality4453822231182668625.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/CTLCardinality5879475369162535137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4453822231182668625.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.01958e+08,0.254973,14240,2,1955,5,36620,6,0,1034,37416,0


Converting to forward existential form...Done !
original formula: AF((((AG((p710==0)) * !(A(((p1114==0)||(p6==1)) U (p808==1)))) * ((p180==0)&&(p1138==1))) * (p255==0)))
=> equivalent forward existential formula: [FwdG(Init,!((((!(E(TRUE U !((p710==0)))) * !(!((E(!((p808==1)) U (!(((p1114==0)||(p6==1))) * !((p808==1)))) + E...225
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t9, t12, t13, t25, t43, t54, t63, t75, t91, t97, t133, t142, t210, t235, ...357
Detected timeout of ITS tools.
[2026-05-23 09:11:15] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:11:15] [INFO ] Applying decomposition
[2026-05-23 09:11:15] [INFO ] Flatten gal took : 5 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/graph2769923980485157619.txt' '-o' '/tmp/graph2769923980485157619.bin' '-w' '/tmp/graph2769923980485157619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2769923980485157619.bin' '-l' '-1' '-v' '-w' '/tmp/graph2769923980485157619.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:11:15] [INFO ] Decomposing Gal with order
[2026-05-23 09:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:11:15] [INFO ] Removed a total of 248 redundant transitions.
[2026-05-23 09:11:15] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 4 ms.
[2026-05-23 09:11:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality615923747783619512.gal : 2 ms
[2026-05-23 09:11:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10667965764513155650.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/CTLCardinality615923747783619512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10667965764513155650.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.01958e+08,0.08255,7248,235,183,4108,1744,613,8096,154,7064,0


Converting to forward existential form...Done !
original formula: AF((((AG((i5.i2.u34.p710==0)) * !(A(((i7.i1.u61.p1114==0)||(i4.u24.p6==1)) U (i6.i1.u42.p808==1)))) * ((i2.i1.u4.p180==0)&&(i7.i1.u62.p11...186
=> equivalent forward existential formula: [FwdG(Init,!((((!(E(TRUE U !((i5.i2.u34.p710==0)))) * !(!((E(!((i6.i1.u42.p808==1)) U (!(((i7.i1.u61.p1114==0)||...310
Reverse transition relation is NOT exact ! Due to transitions t210, t250, t251, t315, i1.i1.u10.t330, i1.i3.u16.t91, i2.i1.u4.t97, i2.i3.u18.t75, i3.t329, ...571
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Graph (trivial) has 625 edges and 595 vertex of which 3 / 595 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1159 edges and 593 vertex of which 582 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 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 581 transition count 518
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 270 rules applied. Total rules applied 539 place count 314 transition count 515
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 543 place count 313 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 546 place count 310 transition count 512
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 546 place count 310 transition count 476
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 618 place count 274 transition count 476
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 629 place count 263 transition count 464
Iterating global reduction 4 with 11 rules applied. Total rules applied 640 place count 263 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 641 place count 263 transition count 463
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 641 place count 263 transition count 459
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 649 place count 259 transition count 459
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 653 place count 255 transition count 452
Iterating global reduction 5 with 4 rules applied. Total rules applied 657 place count 255 transition count 452
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 743 place count 212 transition count 408
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 13 rules applied. Total rules applied 756 place count 212 transition count 395
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 762 place count 208 transition count 393
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 771 place count 199 transition count 380
Iterating global reduction 7 with 9 rules applied. Total rules applied 780 place count 199 transition count 380
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 782 place count 199 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 783 place count 198 transition count 378
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 9 with 2 rules applied. Total rules applied 785 place count 197 transition count 377
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 786 place count 196 transition count 375
Iterating global reduction 9 with 1 rules applied. Total rules applied 787 place count 196 transition count 375
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 788 place count 195 transition count 373
Iterating global reduction 9 with 1 rules applied. Total rules applied 789 place count 195 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 790 place count 195 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 816 place count 195 transition count 346
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 10 with 17 rules applied. Total rules applied 833 place count 195 transition count 329
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 850 place count 178 transition count 329
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 850 place count 178 transition count 327
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 854 place count 176 transition count 327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 858 place count 174 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 860 place count 172 transition count 323
Applied a total of 860 rules in 76 ms. Remains 172 /595 variables (removed 423) and now considering 323/798 (removed 475) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7880371829257677680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-242869198979590522.kers'
[2026-05-23 09:11:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7880371829257677680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-242869198979590522.kers]
Normalized transition count is 322 out of 323 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 172 cols 845 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-23 09:11:45] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-242869198979590522.kers
Total runtime 1 ms.
[2026-05-23 09:11:46] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-23 09:11:46] [INFO ] Invariant cache hit.
[2026-05-23 09:11:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:11:46] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2026-05-23 09:11:46] [INFO ] Redundant transitions in 2 ms returned []
Running 303 sub problems to find dead transitions.
[2026-05-23 09:11:46] [INFO ] Invariant cache hit.
[2026-05-23 09:11:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 322/493 variables, 171/177 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 1/494 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 1/495 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 179 constraints, problems are : Problem set: 0 solved, 303 unsolved in 24639 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 172/172 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 322/493 variables, 171/177 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 303/480 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 1/494 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/495 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 482 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 172/172 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54693ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 54694ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/595 places, 323/798 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55126 ms. Remains : 172/595 places, 323/798 transitions.
[2026-05-23 09:12:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:12:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:12:40] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-23 09:12:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:12:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:12:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9963502376093317493.gal : 1 ms
[2026-05-23 09:12:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17406968898876947434.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/CTLCardinality9963502376093317493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17406968898876947434.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.59221e+08,0.147079,9872,2,1775,5,24616,6,0,996,17835,0


Converting to forward existential form...Done !
original formula: A(((p1041==0)||(p195==1)) U EF(AG(EF(((p534==0)||(p221==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(E(TRUE U ((p534==0)||(p221==1))))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(E(...298
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t19, t35, t56, t68, t79, t83, t91, t129, t138, t196, t229, t280, ...279
(forward)formula 0,1,2.89238,98432,1,0,466,501207,675,236,6954,382754,661
FORMULA CO4-PT-20-CTLCardinality-2024-07 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 : 595/595 places, 798/798 transitions.
Graph (trivial) has 619 edges and 595 vertex of which 3 / 595 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 1159 edges and 593 vertex of which 585 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 584 transition count 523
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 267 rules applied. Total rules applied 533 place count 320 transition count 520
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 540 place count 319 transition count 514
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 546 place count 313 transition count 514
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 546 place count 313 transition count 478
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 618 place count 277 transition count 478
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 630 place count 265 transition count 465
Iterating global reduction 4 with 12 rules applied. Total rules applied 642 place count 265 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 643 place count 265 transition count 464
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 643 place count 265 transition count 460
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 651 place count 261 transition count 460
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 655 place count 257 transition count 453
Iterating global reduction 5 with 4 rules applied. Total rules applied 659 place count 257 transition count 453
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 745 place count 214 transition count 409
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 12 rules applied. Total rules applied 757 place count 214 transition count 397
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 763 place count 210 transition count 395
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 772 place count 201 transition count 382
Iterating global reduction 7 with 9 rules applied. Total rules applied 781 place count 201 transition count 382
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 783 place count 201 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 784 place count 200 transition count 380
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 9 with 2 rules applied. Total rules applied 786 place count 199 transition count 379
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 787 place count 198 transition count 377
Iterating global reduction 9 with 1 rules applied. Total rules applied 788 place count 198 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 814 place count 198 transition count 351
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 15 rules applied. Total rules applied 829 place count 198 transition count 336
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 16 rules applied. Total rules applied 845 place count 183 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 846 place count 182 transition count 335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 846 place count 182 transition count 333
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 850 place count 180 transition count 333
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 12 with 2 rules applied. Total rules applied 852 place count 179 transition count 332
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 853 place count 179 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 854 place count 179 transition count 331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 856 place count 177 transition count 329
Applied a total of 856 rules in 78 ms. Remains 177 /595 variables (removed 418) and now considering 329/798 (removed 469) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1475838306238448984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9051882426438858903.kers'
[2026-05-23 09:12:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1475838306238448984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9051882426438858903.kers]
Normalized transition count is 328 out of 329 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 177 cols 910 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-23 09:12:43] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-9051882426438858903.kers
Total runtime 17 ms.
[2026-05-23 09:12:44] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-23 09:12:44] [INFO ] Invariant cache hit.
[2026-05-23 09:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:12:44] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2026-05-23 09:12:44] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2026-05-23 09:12:44] [INFO ] Invariant cache hit.
[2026-05-23 09:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 328/504 variables, 176/182 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 1/505 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 1/506 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 0/506 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 184 constraints, problems are : Problem set: 0 solved, 306 unsolved in 24701 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 177/177 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 328/504 variables, 176/182 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 305/487 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 1/505 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 306 unsolved
SMT process timed out in 54744ms, After SMT, problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 54744ms
Starting structural reductions in SI_CTL mode, iteration 1 : 177/595 places, 329/798 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55209 ms. Remains : 177/595 places, 329/798 transitions.
[2026-05-23 09:13:39] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:13:39] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:13:39] [INFO ] Input system was already deterministic with 329 transitions.
[2026-05-23 09:13:39] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:13:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:13:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality4192819998943446783.gal : 2 ms
[2026-05-23 09:13:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5215296415403133453.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/CTLCardinality4192819998943446783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5215296415403133453.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,5.71359e+08,0.210724,12448,2,2117,5,36807,6,0,1021,26934,0


Converting to forward existential form...Done !
original formula: EF(((EF(EG((p449==0))) * !(E((p811==0) U EF(((p595==0)||(p1009==1)))))) * (AF((p953==1)) + EF((p741==0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E(TRUE U EG((p449==0))) * !(E((p811==0) U E(TRUE U ((p595==0)||(p1009==1))))))) * !(EG(!(...317
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t7, t8, t17, t34, t56, t58, t71, t82, t86, t92, t130, t139, t311, t312, t314,...262
Detected timeout of ITS tools.
[2026-05-23 09:14:09] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:14:09] [INFO ] Applying decomposition
[2026-05-23 09:14:09] [INFO ] Flatten gal took : 4 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/graph9077413203371161446.txt' '-o' '/tmp/graph9077413203371161446.bin' '-w' '/tmp/graph9077413203371161446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9077413203371161446.bin' '-l' '-1' '-v' '-w' '/tmp/graph9077413203371161446.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:14:09] [INFO ] Decomposing Gal with order
[2026-05-23 09:14:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:14:09] [INFO ] Removed a total of 251 redundant transitions.
[2026-05-23 09:14:09] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:14:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 4 ms.
[2026-05-23 09:14:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality14114285090618708177.gal : 2 ms
[2026-05-23 09:14:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11109513382777549281.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/CTLCardinality14114285090618708177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11109513382777549281.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,5.71359e+08,0.057659,6024,157,110,2521,910,636,3740,148,2952,0


Converting to forward existential form...Done !
original formula: EF(((EF(EG((i3.u25.p449==0))) * !(E((i6.i2.u43.p811==0) U EF(((i8.i0.u26.p595==0)||(i9.i1.u59.p1009==1)))))) * (AF((i8.i1.u50.p953==1)) +...182
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E(TRUE U EG((i3.u25.p449==0))) * !(E((i6.i2.u43.p811==0) U E(TRUE U ((i8.i0.u26.p595==0)|...411
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u4.t92, i0.i3.u19.t71, i1.i3.u16.t86, i2.u10.t82, i3.t317, i3.t136, i3.u25.t56, i3.u25....411
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 4
Fast SCC detection found an 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
(forward)formula 0,0,10.0025,320100,1,0,375682,22824,3790,2.39819e+06,786,189084,215275
FORMULA CO4-PT-20-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 797
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 557 transition count 762
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 557 transition count 762
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 557 transition count 759
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 101 place count 533 transition count 735
Iterating global reduction 2 with 24 rules applied. Total rules applied 125 place count 533 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 533 transition count 734
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 137 place count 522 transition count 722
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 522 transition count 722
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 522 transition count 720
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 154 place count 518 transition count 716
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 518 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 518 transition count 715
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 517 transition count 714
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 517 transition count 714
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 516 transition count 713
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 516 transition count 713
Applied a total of 163 rules in 57 ms. Remains 516 /595 variables (removed 79) and now considering 713/798 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17277781478046281607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17361893445316110099.kers'
[2026-05-23 09:14:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17277781478046281607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17361893445316110099.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 713 rows 516 cols 1880 entries
Finished phase 1 with 510 SingleSign rule and 0 generalized
[2026-05-23 09:14:19] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17361893445316110099.kers
Total runtime 3 ms.
[2026-05-23 09:14:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 09:14:19] [INFO ] Invariant cache hit.
[2026-05-23 09:14:19] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2026-05-23 09:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/516 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/1229 variables, and 9 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/516 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/516 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/1229 variables, 516/525 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 712/1237 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1239 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 516/595 places, 713/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60537 ms. Remains : 516/595 places, 713/798 transitions.
[2026-05-23 09:15:19] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:15:19] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:15:19] [INFO ] Input system was already deterministic with 713 transitions.
[2026-05-23 09:15:19] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:15:19] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:15:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16211539172176780451.gal : 3 ms
[2026-05-23 09:15:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9938413757440011179.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/CTLCardinality16211539172176780451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9938413757440011179.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,1.55999e+12,24.0122,626612,2,44185,5,1.81025e+06,6,0,2771,3.33003e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:15:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:49] [INFO ] Applying decomposition
[2026-05-23 09:15:49] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2990656267867569861.txt' '-o' '/tmp/graph2990656267867569861.bin' '-w' '/tmp/graph2990656267867569861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2990656267867569861.bin' '-l' '-1' '-v' '-w' '/tmp/graph2990656267867569861.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:15:50] [INFO ] Decomposing Gal with order
[2026-05-23 09:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:15:50] [INFO ] Removed a total of 429 redundant transitions.
[2026-05-23 09:15:50] [INFO ] Flatten gal took : 20 ms
[2026-05-23 09:15:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2026-05-23 09:15:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14761031479862955831.gal : 5 ms
[2026-05-23 09:15:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16638555340069337166.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/CTLCardinality14761031479862955831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16638555340069337166.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,1.55999e+12,2.1488,82068,1889,262,123416,8775,1165,438626,132,51618,0


Converting to forward existential form...Done !
original formula: (A(EX(TRUE) U ((i0.u9.p135==1) * EX(A(E(((i9.u69.p439==0)||(i10.u79.p511==1)) U ((i3.u10.p137==0)||(i21.u175.p974==1))) U (((i11.u135.p78...275
=> equivalent forward existential formula: ((([((FwdU(Init,!(((i0.u9.p135==1) * EX(!((E(!((((i11.u135.p789==0)||(i3.u49.p341==1))&&((i5.u32.p275==0)||(i3.u...1739
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t86, t95, t96, t140, t175, t187, t273, t314, t365, t374, t418, t464, t497, t507, t5...1083
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
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 797
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 45 place count 551 transition count 756
Iterating global reduction 1 with 41 rules applied. Total rules applied 86 place count 551 transition count 756
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 89 place count 551 transition count 753
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 119 place count 521 transition count 723
Iterating global reduction 2 with 30 rules applied. Total rules applied 149 place count 521 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 521 transition count 722
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 166 place count 505 transition count 704
Iterating global reduction 3 with 16 rules applied. Total rules applied 182 place count 505 transition count 704
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 184 place count 505 transition count 702
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 191 place count 498 transition count 695
Iterating global reduction 4 with 7 rules applied. Total rules applied 198 place count 498 transition count 695
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 200 place count 498 transition count 693
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 497 transition count 692
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 497 transition count 692
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 203 place count 496 transition count 691
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 496 transition count 691
Applied a total of 204 rules in 62 ms. Remains 496 /595 variables (removed 99) and now considering 691/798 (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-5133253705454742620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12698923147334950269.kers'
[2026-05-23 09:16:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5133253705454742620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12698923147334950269.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 691 rows 496 cols 1828 entries
Finished phase 1 with 490 SingleSign rule and 0 generalized
[2026-05-23 09:16:20] [INFO ] Computed 6 invariants in 6 ms
Computed 6 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12698923147334950269.kers
Total runtime 7 ms.
[2026-05-23 09:16:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 09:16:20] [INFO ] Invariant cache hit.
[2026-05-23 09:16:20] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2026-05-23 09:16:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1187 variables, 496/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1187/1187 variables, and 502 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1187 variables, 496/505 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1187 variables, 690/1195 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1187/1187 variables, and 1196 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 496/595 places, 691/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 496/595 places, 691/798 transitions.
[2026-05-23 09:17:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:17:20] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:17:20] [INFO ] Input system was already deterministic with 691 transitions.
[2026-05-23 09:17:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:17:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:17:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5729267723964889994.gal : 2 ms
[2026-05-23 09:17:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12739016134365055771.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/CTLCardinality5729267723964889994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12739016134365055771.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,1.30702e+12,17.7655,448808,2,31801,5,1.32055e+06,6,0,2669,2.25363e+06,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,17.8574,448808,1,0,6,1.32055e+06,7,1,3295,2.25363e+06,1
FORMULA CO4-PT-20-CTLCardinality-2024-10 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 : 595/595 places, 798/798 transitions.
Graph (trivial) has 632 edges and 595 vertex of which 3 / 595 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 1159 edges and 593 vertex of which 582 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 275 place count 581 transition count 512
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 276 rules applied. Total rules applied 551 place count 308 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 552 place count 307 transition count 509
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 307 transition count 473
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 624 place count 271 transition count 473
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 636 place count 259 transition count 460
Iterating global reduction 3 with 12 rules applied. Total rules applied 648 place count 259 transition count 460
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 259 transition count 459
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 649 place count 259 transition count 455
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 657 place count 255 transition count 455
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 661 place count 251 transition count 448
Iterating global reduction 4 with 4 rules applied. Total rules applied 665 place count 251 transition count 448
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 751 place count 208 transition count 404
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 764 place count 208 transition count 391
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 770 place count 204 transition count 389
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 779 place count 195 transition count 376
Iterating global reduction 6 with 9 rules applied. Total rules applied 788 place count 195 transition count 376
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 6 with 2 rules applied. Total rules applied 790 place count 195 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 791 place count 194 transition count 374
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 793 place count 193 transition count 373
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 794 place count 192 transition count 371
Iterating global reduction 8 with 1 rules applied. Total rules applied 795 place count 192 transition count 371
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 796 place count 191 transition count 369
Iterating global reduction 8 with 1 rules applied. Total rules applied 797 place count 191 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 798 place count 191 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 824 place count 191 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 16 rules applied. Total rules applied 840 place count 191 transition count 326
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 856 place count 175 transition count 326
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 856 place count 175 transition count 323
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 862 place count 172 transition count 323
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 11 with 2 rules applied. Total rules applied 864 place count 171 transition count 322
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 866 place count 169 transition count 320
Applied a total of 866 rules in 63 ms. Remains 169 /595 variables (removed 426) and now considering 320/798 (removed 478) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11327822318803376993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11907973360552755212.kers'
[2026-05-23 09:17:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11327822318803376993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11907973360552755212.kers]
Normalized transition count is 319 out of 320 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 169 cols 891 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-23 09:17:38] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11907973360552755212.kers
Total runtime 1 ms.
[2026-05-23 09:17:38] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-23 09:17:38] [INFO ] Invariant cache hit.
[2026-05-23 09:17:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:17:39] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2026-05-23 09:17:39] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2026-05-23 09:17:39] [INFO ] Invariant cache hit.
[2026-05-23 09:17:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 319/488 variables, 169/175 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 1/489 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 0/489 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 176 constraints, problems are : Problem set: 0 solved, 297 unsolved in 19265 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 319/488 variables, 169/175 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 297/472 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 1/489 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 473 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49312ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 49313ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/595 places, 320/798 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49693 ms. Remains : 169/595 places, 320/798 transitions.
[2026-05-23 09:18:28] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:18:28] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:18:28] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-23 09:18:28] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:18:28] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:18:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6605899201334758085.gal : 2 ms
[2026-05-23 09:18:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1352239206836638852.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/CTLCardinality6605899201334758085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1352239206836638852.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.67836e+08,0.119157,8288,2,1356,5,17525,6,0,982,11877,0


Converting to forward existential form...Done !
original formula: AG(AF(EG((p822!=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG((p822!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t19, t37, t57, t69, t80, t84, t90, t128, t137, t301, t302, t304, t309...269
Detected timeout of ITS tools.
[2026-05-23 09:18:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:18:58] [INFO ] Applying decomposition
[2026-05-23 09:18:58] [INFO ] Flatten gal took : 4 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/graph9091658949300626138.txt' '-o' '/tmp/graph9091658949300626138.bin' '-w' '/tmp/graph9091658949300626138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9091658949300626138.bin' '-l' '-1' '-v' '-w' '/tmp/graph9091658949300626138.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:18:58] [INFO ] Decomposing Gal with order
[2026-05-23 09:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:18:58] [INFO ] Removed a total of 252 redundant transitions.
[2026-05-23 09:18:58] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 5 ms.
[2026-05-23 09:18:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1189531828686360804.gal : 2 ms
[2026-05-23 09:18:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3883080651828620676.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/CTLCardinality1189531828686360804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3883080651828620676.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,3.67836e+08,0.069596,6364,158,114,3509,665,620,5570,138,2335,0


Converting to forward existential form...Done !
original formula: AG(AF(EG((i6.i2.u43.p822!=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG((i6.i2.u43.p822!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u9.t80, i1.i1.t131, i1.i1.t307, i1.i1.u26.t57, i1.i1.u26.t309, i1.i1.u61.t1, i1.i1.u61....442
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
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 an SCC at level 7
(forward)formula 0,0,12.0342,385784,1,0,384115,21180,3644,3.40413e+06,717,185897,232827
FORMULA CO4-PT-20-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Graph (trivial) has 631 edges and 595 vertex of which 3 / 595 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 1159 edges and 593 vertex of which 582 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 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 581 transition count 514
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 274 rules applied. Total rules applied 547 place count 310 transition count 511
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 549 place count 309 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 550 place count 308 transition count 510
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 550 place count 308 transition count 474
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 622 place count 272 transition count 474
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 634 place count 260 transition count 461
Iterating global reduction 4 with 12 rules applied. Total rules applied 646 place count 260 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 647 place count 260 transition count 460
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 647 place count 260 transition count 456
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 655 place count 256 transition count 456
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 658 place count 253 transition count 451
Iterating global reduction 5 with 3 rules applied. Total rules applied 661 place count 253 transition count 451
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 747 place count 210 transition count 407
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 13 rules applied. Total rules applied 760 place count 210 transition count 394
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 766 place count 206 transition count 392
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 775 place count 197 transition count 379
Iterating global reduction 7 with 9 rules applied. Total rules applied 784 place count 197 transition count 379
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 786 place count 197 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 787 place count 196 transition count 377
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 9 with 2 rules applied. Total rules applied 789 place count 195 transition count 376
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 790 place count 194 transition count 374
Iterating global reduction 9 with 1 rules applied. Total rules applied 791 place count 194 transition count 374
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 792 place count 193 transition count 372
Iterating global reduction 9 with 1 rules applied. Total rules applied 793 place count 193 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 794 place count 193 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 820 place count 193 transition count 345
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 10 with 16 rules applied. Total rules applied 836 place count 193 transition count 329
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 852 place count 177 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 852 place count 177 transition count 326
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 858 place count 174 transition count 326
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 12 with 2 rules applied. Total rules applied 860 place count 173 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 862 place count 171 transition count 323
Applied a total of 862 rules in 60 ms. Remains 171 /595 variables (removed 424) and now considering 323/798 (removed 475) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-353856270920105037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16587430930864891669.kers'
[2026-05-23 09:19:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-353856270920105037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16587430930864891669.kers]
Normalized transition count is 322 out of 323 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 171 cols 901 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 09:19:10] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16587430930864891669.kers
Total runtime 1 ms.
[2026-05-23 09:19:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 09:19:10] [INFO ] Invariant cache hit.
[2026-05-23 09:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:19:10] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-23 09:19:10] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-23 09:19:10] [INFO ] Invariant cache hit.
[2026-05-23 09:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 322/493 variables, 171/177 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/494 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/494 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 178 constraints, problems are : Problem set: 0 solved, 300 unsolved in 19274 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 322/493 variables, 171/177 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 300/477 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 1/494 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 478 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49319ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 49320ms
Starting structural reductions in SI_CTL mode, iteration 1 : 171/595 places, 323/798 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49608 ms. Remains : 171/595 places, 323/798 transitions.
[2026-05-23 09:20:00] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:20:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:00] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-23 09:20:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4127036649443326263.gal : 1 ms
[2026-05-23 09:20:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6246567268887257899.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/CTLCardinality4127036649443326263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6246567268887257899.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.77914e+08,0.125187,8596,2,1373,5,18451,6,0,993,12555,0


Converting to forward existential form...Done !
original formula: EF(!(A((p659==1) U AG((p938!=1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !((p938!=1)))))) * !((p659==1))),TRUE) * !((p938!=1)))] != FALSE + [F...215
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t7, t8, t20, t36, t57, t69, t80, t84, t90, t128, t137, t304, t305, t307, t311...269
(forward)formula 0,1,3.53028,120676,1,0,473,642520,674,242,7450,439510,672
FORMULA CO4-PT-20-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 798/798 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 797
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 553 transition count 758
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 553 transition count 758
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 553 transition count 755
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 115 place count 523 transition count 725
Iterating global reduction 2 with 30 rules applied. Total rules applied 145 place count 523 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 523 transition count 724
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 162 place count 507 transition count 706
Iterating global reduction 3 with 16 rules applied. Total rules applied 178 place count 507 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 507 transition count 704
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 187 place count 500 transition count 697
Iterating global reduction 4 with 7 rules applied. Total rules applied 194 place count 500 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 500 transition count 695
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 499 transition count 694
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 499 transition count 694
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 498 transition count 693
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 498 transition count 693
Applied a total of 200 rules in 71 ms. Remains 498 /595 variables (removed 97) and now considering 693/798 (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-12415077338692254204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-486479669013832757.kers'
[2026-05-23 09:20:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12415077338692254204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-486479669013832757.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 693 rows 498 cols 1832 entries
Finished phase 1 with 492 SingleSign rule and 0 generalized
[2026-05-23 09:20:03] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-486479669013832757.kers
Total runtime 7 ms.
[2026-05-23 09:20:04] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 09:20:04] [INFO ] Invariant cache hit.
[2026-05-23 09:20:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2026-05-23 09:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 692 unsolved
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 30097ms
Starting structural reductions in LTL mode, iteration 1 : 498/595 places, 693/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30560 ms. Remains : 498/595 places, 693/798 transitions.
[2026-05-23 09:20:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:20:34] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:20:34] [INFO ] Input system was already deterministic with 693 transitions.
[2026-05-23 09:20:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:20:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:20:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality878424055718680482.gal : 2 ms
[2026-05-23 09:20:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality8916723118281969956.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/CTLCardinality878424055718680482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8916723118281969956.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,1.35996e+12,17.5671,446676,2,31848,5,1.2886e+06,6,0,2679,2.27175e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:21:04] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:21:04] [INFO ] Applying decomposition
[2026-05-23 09:21:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1668224436648377444.txt' '-o' '/tmp/graph1668224436648377444.bin' '-w' '/tmp/graph1668224436648377444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1668224436648377444.bin' '-l' '-1' '-v' '-w' '/tmp/graph1668224436648377444.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:21:04] [INFO ] Decomposing Gal with order
[2026-05-23 09:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:21:04] [INFO ] Removed a total of 428 redundant transitions.
[2026-05-23 09:21:04] [INFO ] Flatten gal took : 18 ms
[2026-05-23 09:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2026-05-23 09:21:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality17788095510413975998.gal : 4 ms
[2026-05-23 09:21:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11944997675110399055.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/CTLCardinality17788095510413975998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11944997675110399055.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,1.35996e+12,2.45451,90772,2602,326,117517,10037,1100,574672,129,95155,0


Converting to forward existential form...Done !
original formula: AX(((i14.u26.p231==0) * ((EG((i14.u27.p236==0)) + (i21.u181.p1109==1)) + (i14.u117.p727==1))))
=> equivalent forward existential formula: ([(EY(Init) * !((i14.u26.p231==0)))] = FALSE * [(((EY(Init) * !((i14.u117.p727==1))) * !((i21.u181.p1109==1))) *...191
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t53, t84, t93, t94, t138, t184, t267, t308, t320, t356, t365, t443, t455, t498, t55...1093
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 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
Detected timeout of ITS tools.
[2026-05-23 09:21:34] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:21:34] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:21:34] [INFO ] Applying decomposition
[2026-05-23 09:21:34] [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/graph5460365566843767429.txt' '-o' '/tmp/graph5460365566843767429.bin' '-w' '/tmp/graph5460365566843767429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5460365566843767429.bin' '-l' '-1' '-v' '-w' '/tmp/graph5460365566843767429.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:21:34] [INFO ] Decomposing Gal with order
[2026-05-23 09:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:21:34] [INFO ] Removed a total of 449 redundant transitions.
[2026-05-23 09:21:34] [INFO ] Flatten gal took : 21 ms
[2026-05-23 09:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2026-05-23 09:21:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality13882140975891975609.gal : 6 ms
[2026-05-23 09:21:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6313971849942956144.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/CTLCardinality13882140975891975609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6313971849942956144.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 6 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.7362e+12,2.37352,86232,2798,323,144841,5928,1355,427985,137,31257,0


Converting to forward existential form...Done !
original formula: AF((EF(AG((i12.i0.i0.u105.p581!=1))) + EX((((i16.u179.p864!=0)&&(i20.u215.p1042!=1))&&((i2.i1.i0.u37.p255!=0)&&(i7.u0.p5!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(E(TRUE U !((i12.i0.i0.u105.p581!=1))))) + EX((((i16.u179.p864!=0)&&(i20.u215.p1042!=1))...210
Reverse transition relation is NOT exact ! Due to transitions t35, t64, t117, t219, t264, t313, t383, t413, t430, t478, t525, t607, t714, t719, t721, t749,...1370
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
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 17
Fast SCC detection found a local 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
(forward)formula 0,1,23.6739,868920,1,0,1.0616e+06,15745,9504,7.4515e+06,742,79512,1648559
FORMULA CO4-PT-20-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-23 09:48:14] [INFO ] Applying decomposition
[2026-05-23 09:48:14] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:48:14] [INFO ] Decomposing Gal with order
[2026-05-23 09:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:48:14] [INFO ] Removed a total of 276 redundant transitions.
[2026-05-23 09:48:14] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 4 ms.
[2026-05-23 09:48:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6380559629443380259.gal : 3 ms
[2026-05-23 09:48:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality7730900976578194769.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/CTLCardinality6380559629443380259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7730900976578194769.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 5 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.7362e+12,12.5881,376600,1507,5504,372431,265297,356,1.88069e+06,1767,1.78412e+06,0


Converting to forward existential form...Done !
original formula: EX(AF(((i0.i1.i1.i1.u16.p1025==0)&&(i0.i0.i0.u5.p296==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((i0.i1.i1.i1.u16.p1025==0)&&(i0.i0.i0.u5.p296==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t642, i0.t264, i0.t167, i0.i0.i0.t430, i0.i0.i0.u5.t438, i0.i0.i0.u5.t475, i0.i0.i0.u5.t47...2110

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-20"
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-20, 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-177946967700433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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