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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.9K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 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 255K 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-15-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779523397723

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 08:03:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:03:19] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2026-05-23 08:03:19] [INFO ] Transformed 833 places.
[2026-05-23 08:03:19] [INFO ] Transformed 1106 transitions.
[2026-05-23 08:03:19] [INFO ] Found NUPN structural information;
[2026-05-23 08:03:19] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 124 places in 11 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 691 transition count 907
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 161 place count 550 transition count 764
Iterating global reduction 1 with 141 rules applied. Total rules applied 302 place count 550 transition count 764
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 307 place count 550 transition count 759
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 370 place count 487 transition count 688
Iterating global reduction 2 with 63 rules applied. Total rules applied 433 place count 487 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 487 transition count 687
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 444 place count 477 transition count 673
Iterating global reduction 3 with 10 rules applied. Total rules applied 454 place count 477 transition count 673
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 457 place count 477 transition count 670
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 460 place count 474 transition count 667
Iterating global reduction 4 with 3 rules applied. Total rules applied 463 place count 474 transition count 667
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 464 place count 473 transition count 666
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 473 transition count 666
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 466 place count 473 transition count 665
Applied a total of 466 rules in 157 ms. Remains 473 /709 variables (removed 236) and now considering 665/909 (removed 244) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15607508257681548180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-641377891166123971.kers'
[2026-05-23 08:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15607508257681548180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-641377891166123971.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 473 cols 1752 entries
Finished phase 1 with 466 SingleSign rule and 0 generalized
[2026-05-23 08:03:19] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-641377891166123971.kers
Total runtime 6 ms.
[2026-05-23 08:03:19] [INFO ] Implicit Places using invariants in 324 ms returned [5, 393]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 357 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 471/709 places, 665/909 transitions.
Applied a total of 0 rules in 10 ms. Remains 471 /471 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 541 ms. Remains : 471/709 places, 665/909 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Applied a total of 0 rules in 9 ms. Remains 471 /471 variables (removed 0) and now considering 665/665 (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-10791135429802993050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12771673144292604491.kers'
[2026-05-23 08:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10791135429802993050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12771673144292604491.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 471 cols 1738 entries
Finished phase 1 with 466 SingleSign rule and 0 generalized
[2026-05-23 08:03:19] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12771673144292604491.kers
Total runtime 4 ms.
[2026-05-23 08:03:19] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-23 08:03:19] [INFO ] Invariant cache hit.
[2026-05-23 08:03:20] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 664 sub problems to find dead transitions.
[2026-05-23 08:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/469 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 665/1134 variables, 469/474 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1134/1136 variables, and 474 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 469/471 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/469 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (OVERLAPS) 665/1134 variables, 469/475 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 631/1106 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/1136 variables, and 1106 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 469/471 constraints, PredecessorRefiner: 631/664 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 471/471 places, 665/665 transitions.
Support contains 81 out of 471 places after structural reductions.
[2026-05-23 08:04:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 08:04:20] [INFO ] Flatten gal took : 74 ms
[2026-05-23 08:04:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:04:20] [INFO ] Flatten gal took : 35 ms
[2026-05-23 08:04:21] [INFO ] Input system was already deterministic with 665 transitions.
Support contains 67 out of 471 places (down from 81) after GAL structural reductions.
RANDOM walk for 40000 steps (791 resets) in 2867 ms. (13 steps per ms) remains 16/33 properties
BEST_FIRST walk for 4002 steps (15 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (13 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
[2026-05-23 08:04:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 68/97 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 326/423 variables, 62/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 21/444 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 3/447 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 429/876 variables, 211/315 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/876 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 222/1098 variables, 134/449 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1098 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 34/1132 variables, 25/474 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1132 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 4/1136 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1136 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 0/1136 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1136/1136 variables, and 476 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1755 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 68/97 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 326/423 variables, 62/92 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 15/107 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 21/444 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 3/447 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 429/876 variables, 211/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/876 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 222/1098 variables, 134/465 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 34/1132 variables, 25/490 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1132 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 18 (OVERLAPS) 4/1136 variables, 2/492 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1136 variables, 0/492 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 0/1136 variables, 0/492 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1136/1136 variables, and 492 constraints, problems are : Problem set: 2 solved, 14 unsolved in 4408 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6179ms problems are : Problem set: 2 solved, 14 unsolved
Parikh walk visited 13 properties in 1696 ms.
Support contains 4 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 665/665 transitions.
Graph (trivial) has 507 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 959 edges and 470 vertex of which 444 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 444 transition count 435
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 191 rules applied. Total rules applied 399 place count 257 transition count 431
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 402 place count 256 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 403 place count 255 transition count 429
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 403 place count 255 transition count 395
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 471 place count 221 transition count 395
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 482 place count 210 transition count 381
Iterating global reduction 4 with 11 rules applied. Total rules applied 493 place count 210 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 495 place count 210 transition count 379
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 495 place count 210 transition count 376
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 501 place count 207 transition count 376
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 504 place count 204 transition count 372
Iterating global reduction 5 with 3 rules applied. Total rules applied 507 place count 204 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 508 place count 204 transition count 371
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 509 place count 203 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 510 place count 203 transition count 370
Performed 76 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 662 place count 127 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 16 rules applied. Total rules applied 678 place count 127 transition count 255
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 680 place count 126 transition count 254
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 684 place count 122 transition count 246
Iterating global reduction 8 with 4 rules applied. Total rules applied 688 place count 122 transition count 246
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 696 place count 118 transition count 242
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 697 place count 118 transition count 241
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 698 place count 117 transition count 239
Iterating global reduction 9 with 1 rules applied. Total rules applied 699 place count 117 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 700 place count 117 transition count 238
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 778 place count 78 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 10 with 80 rules applied. Total rules applied 858 place count 78 transition count 198
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 886 place count 50 transition count 131
Iterating global reduction 11 with 28 rules applied. Total rules applied 914 place count 50 transition count 131
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 935 place count 50 transition count 110
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 941 place count 44 transition count 85
Iterating global reduction 12 with 6 rules applied. Total rules applied 947 place count 44 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 952 place count 44 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 954 place count 43 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 957 place count 43 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 14 with 10 rules applied. Total rules applied 967 place count 43 transition count 74
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 968 place count 42 transition count 72
Iterating global reduction 14 with 1 rules applied. Total rules applied 969 place count 42 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 970 place count 42 transition count 71
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 978 place count 42 transition count 63
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 988 place count 34 transition count 61
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 991 place count 34 transition count 61
Graph (complete) has 107 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 992 place count 33 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 995 place count 33 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 996 place count 32 transition count 57
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t358.t528.t355 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 18 with 5 rules applied. Total rules applied 1001 place count 26 transition count 53
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 16 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 12 rules applied. Total rules applied 1013 place count 20 transition count 46
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 37 edges and 19 vertex of which 12 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 20 with 14 rules applied. Total rules applied 1027 place count 12 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 1037 place count 12 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 22 with 5 rules applied. Total rules applied 1042 place count 12 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 22 with 3 rules applied. Total rules applied 1045 place count 12 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1048 place count 9 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 24 with 2 rules applied. Total rules applied 1050 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 1052 place count 7 transition count 8
Applied a total of 1052 rules in 123 ms. Remains 7 /471 variables (removed 464) and now considering 8/665 (removed 657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 7/471 places, 8/665 transitions.
RANDOM walk for 110 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA CO4-PT-15-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:04:30] [INFO ] Flatten gal took : 25 ms
[2026-05-23 08:04:30] [INFO ] Flatten gal took : 51 ms
[2026-05-23 08:04:30] [INFO ] Input system was already deterministic with 665 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 961 edges and 471 vertex of which 464 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Graph (trivial) has 502 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 960 edges and 470 vertex of which 464 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 190 rules applied. Total rules applied 192 place count 463 transition count 467
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 191 rules applied. Total rules applied 383 place count 276 transition count 463
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 387 place count 275 transition count 460
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 389 place count 273 transition count 460
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 389 place count 273 transition count 426
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 457 place count 239 transition count 426
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 468 place count 228 transition count 412
Iterating global reduction 4 with 11 rules applied. Total rules applied 479 place count 228 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 480 place count 228 transition count 411
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 480 place count 228 transition count 408
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 486 place count 225 transition count 408
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 489 place count 222 transition count 404
Iterating global reduction 5 with 3 rules applied. Total rules applied 492 place count 222 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 493 place count 222 transition count 403
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 555 place count 191 transition count 368
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 6 with 13 rules applied. Total rules applied 568 place count 191 transition count 355
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 10 rules applied. Total rules applied 578 place count 187 transition count 349
Reduce places removed 2 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 8 with 5 rules applied. Total rules applied 583 place count 185 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 585 place count 184 transition count 345
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 589 place count 180 transition count 337
Iterating global reduction 10 with 4 rules applied. Total rules applied 593 place count 180 transition count 337
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 601 place count 176 transition count 333
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 10 with 3 rules applied. Total rules applied 604 place count 176 transition count 330
Reduce places removed 1 places and 0 transitions.
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 11 with 3 rules applied. Total rules applied 607 place count 175 transition count 328
Reduce places removed 1 places and 0 transitions.
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 12 with 3 rules applied. Total rules applied 610 place count 174 transition count 326
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 612 place count 173 transition count 325
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 613 place count 172 transition count 323
Iterating global reduction 14 with 1 rules applied. Total rules applied 614 place count 172 transition count 323
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 615 place count 171 transition count 321
Iterating global reduction 14 with 1 rules applied. Total rules applied 616 place count 171 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 617 place count 171 transition count 320
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 15 with 2 rules applied. Total rules applied 619 place count 170 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 632 place count 170 transition count 306
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 15 with 7 rules applied. Total rules applied 639 place count 170 transition count 299
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 646 place count 163 transition count 299
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 17 with 2 rules applied. Total rules applied 648 place count 162 transition count 298
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 650 place count 160 transition count 296
Applied a total of 650 rules in 126 ms. Remains 160 /471 variables (removed 311) and now considering 296/665 (removed 369) transitions.
[2026-05-23 08:04:30] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5906447888955895307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17212857084352393250.kers'
[2026-05-23 08:04:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5906447888955895307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17212857084352393250.kers]
Normalized transition count is 269 out of 270 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 160 cols 597 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-23 08:04:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17212857084352393250.kers
Total runtime 1 ms.
[2026-05-23 08:04:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 08:04:30] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
[2026-05-23 08:04:30] [INFO ] Invariant cache hit.
[2026-05-23 08:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:04:30] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2026-05-23 08:04:30] [INFO ] Redundant transitions in 13 ms returned []
Running 275 sub problems to find dead transitions.
[2026-05-23 08:04:30] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
[2026-05-23 08:04:30] [INFO ] Invariant cache hit.
[2026-05-23 08:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 269/428 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/429 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 1/430 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/430 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 166 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20763 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 269/428 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 255/419 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/429 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 1/430 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 441 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50829ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 50831ms
Starting structural reductions in SI_CTL mode, iteration 1 : 160/471 places, 296/665 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51155 ms. Remains : 160/471 places, 296/665 transitions.
[2026-05-23 08:05:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:05:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:05:21] [INFO ] Input system was already deterministic with 296 transitions.
[2026-05-23 08:05:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:05:21] [INFO ] Flatten gal took : 25 ms
[2026-05-23 08:05:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality9752865401788073249.gal : 16 ms
[2026-05-23 08:05:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4842308196512936462.ctl : 3 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/CTLCardinality9752865401788073249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4842308196512936462.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.77843e+07,0.132545,8636,2,1582,5,20366,6,0,923,16218,0


Converting to forward existential form...Done !
original formula: EG(((EF(((p162==1)||(p429==0))) + (p431==0)) + ((p361==1)||((p509==0)&&(p631==1)))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((p162==1)||(p429==0))) + (p431==0)) + ((p361==1)||((p509==0)&&(p631==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t53, t68, t89, t98, t103, t136, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,2.76648,94048,1,0,401,507598,618,213,6127,334681,608
FORMULA CO4-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 664
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 436 transition count 629
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 436 transition count 629
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 436 transition count 625
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 84 place count 425 transition count 611
Iterating global reduction 2 with 11 rules applied. Total rules applied 95 place count 425 transition count 611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 425 transition count 609
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 420 transition count 602
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 420 transition count 602
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 417 transition count 599
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 417 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 417 transition count 598
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 416 transition count 597
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 416 transition count 597
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 416 transition count 596
Applied a total of 117 rules in 50 ms. Remains 416 /471 variables (removed 55) and now considering 596/665 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14438573765443204769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12561822917311603807.kers'
[2026-05-23 08:05:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14438573765443204769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12561822917311603807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 596 rows 416 cols 1565 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-23 08:05:24] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12561822917311603807.kers
Total runtime 3 ms.
[2026-05-23 08:05:24] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 08:05:24] [INFO ] Invariant cache hit.
[2026-05-23 08:05:24] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 595 sub problems to find dead transitions.
[2026-05-23 08:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (OVERLAPS) 1/416 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 596/1012 variables, 416/422 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 425 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 416/416 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (OVERLAPS) 1/416 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 596/1012 variables, 416/425 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 595/1020 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 416/416 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 416/471 places, 596/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60537 ms. Remains : 416/471 places, 596/665 transitions.
[2026-05-23 08:06:24] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:06:24] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:06:24] [INFO ] Input system was already deterministic with 596 transitions.
[2026-05-23 08:06:24] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:06:24] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:06:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16010448697976704354.gal : 5 ms
[2026-05-23 08:06:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2575533098292231604.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/CTLCardinality16010448697976704354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2575533098292231604.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.54795e+11,5.05377,144816,2,17361,5,431733,6,0,2253,682220,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:06:54] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:06:54] [INFO ] Applying decomposition
[2026-05-23 08:06:55] [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/graph881238208240083853.txt' '-o' '/tmp/graph881238208240083853.bin' '-w' '/tmp/graph881238208240083853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph881238208240083853.bin' '-l' '-1' '-v' '-w' '/tmp/graph881238208240083853.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:06:55] [INFO ] Decomposing Gal with order
[2026-05-23 08:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:06:55] [INFO ] Removed a total of 399 redundant transitions.
[2026-05-23 08:06:55] [INFO ] Flatten gal took : 81 ms
[2026-05-23 08:06:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 14 ms.
[2026-05-23 08:06:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality11615051521851881664.gal : 8 ms
[2026-05-23 08:06:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality15132307576699622904.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/CTLCardinality11615051521851881664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15132307576699622904.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.54795e+11,3.697,126240,2602,61,215559,1066,1034,962605,78,6667,0


Converting to forward existential form...Done !
original formula: (A((!(AX(((E((i6.u67.p392==1) U ((i14.u129.p630==0)||(i7.u88.p497==1))) * ((i17.u141.p682==0)||(i14.u123.p612==1))) * (i0.u39.p246==1))))...375
=> equivalent forward existential formula: ((([(EY(FwdU((FwdU(Init,!(!(E(TRUE U !((!(EX(!((((i12.u115.p580==0)||(i10.i1.i1.u108.p556==1))||((i17.u148.p734=...1245
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t80, t143, t151, t168, t199, t204, t226, t289, t317, t399, t426, t535, t565, t570, t...991
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 13
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Graph (trivial) has 508 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 960 edges and 470 vertex of which 463 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 462 transition count 462
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 195 rules applied. Total rules applied 392 place count 271 transition count 458
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 394 place count 270 transition count 457
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 394 place count 270 transition count 422
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 464 place count 235 transition count 422
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 472 place count 227 transition count 411
Iterating global reduction 3 with 8 rules applied. Total rules applied 480 place count 227 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 480 place count 227 transition count 410
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 226 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 484 place count 224 transition count 408
Iterating global reduction 3 with 2 rules applied. Total rules applied 486 place count 224 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 487 place count 224 transition count 407
Performed 34 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 555 place count 190 transition count 369
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 568 place count 190 transition count 356
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 10 rules applied. Total rules applied 578 place count 186 transition count 350
Reduce places removed 2 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 6 with 5 rules applied. Total rules applied 583 place count 184 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 585 place count 183 transition count 346
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 589 place count 179 transition count 338
Iterating global reduction 8 with 4 rules applied. Total rules applied 593 place count 179 transition count 338
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 601 place count 175 transition count 334
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 8 with 3 rules applied. Total rules applied 604 place count 175 transition count 331
Reduce places removed 1 places and 0 transitions.
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 9 with 3 rules applied. Total rules applied 607 place count 174 transition count 329
Reduce places removed 1 places and 0 transitions.
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 10 with 3 rules applied. Total rules applied 610 place count 173 transition count 327
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 612 place count 172 transition count 326
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 613 place count 171 transition count 324
Iterating global reduction 12 with 1 rules applied. Total rules applied 614 place count 171 transition count 324
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 616 place count 170 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 629 place count 170 transition count 310
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 12 with 7 rules applied. Total rules applied 636 place count 170 transition count 303
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 643 place count 163 transition count 303
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 14 with 2 rules applied. Total rules applied 645 place count 162 transition count 302
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 647 place count 160 transition count 300
Applied a total of 647 rules in 165 ms. Remains 160 /471 variables (removed 311) and now considering 300/665 (removed 365) transitions.
[2026-05-23 08:07:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9642211550035918814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12661045557642754100.kers'
[2026-05-23 08:07:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9642211550035918814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12661045557642754100.kers]
Normalized transition count is 273 out of 274 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 160 cols 611 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-23 08:07:25] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12661045557642754100.kers
Total runtime 1 ms.
[2026-05-23 08:07:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 08:07:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2026-05-23 08:07:25] [INFO ] Invariant cache hit.
[2026-05-23 08:07:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:07:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2026-05-23 08:07:25] [INFO ] Redundant transitions in 6 ms returned []
Running 280 sub problems to find dead transitions.
[2026-05-23 08:07:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2026-05-23 08:07:25] [INFO ] Invariant cache hit.
[2026-05-23 08:07:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 273/433 variables, 160/165 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 166 constraints, problems are : Problem set: 0 solved, 280 unsolved in 17360 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 273/433 variables, 160/165 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 280/445 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 280 unsolved in 28361 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45750ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 45751ms
Starting structural reductions in SI_CTL mode, iteration 1 : 160/471 places, 300/665 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46126 ms. Remains : 160/471 places, 300/665 transitions.
[2026-05-23 08:08:11] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:08:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:08:11] [INFO ] Input system was already deterministic with 300 transitions.
[2026-05-23 08:08:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:08:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:08:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7736429621603995976.gal : 2 ms
[2026-05-23 08:08:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16479913959449815784.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/CTLCardinality7736429621603995976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16479913959449815784.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,7.63822e+07,0.127886,8832,2,1496,5,20962,6,0,930,15480,0


Converting to forward existential form...Done !
original formula: EG(EF((!(A(((p345==0)||(p666==1)) U (p225==0))) * (p423==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(!((E(!((p225==0)) U (!(((p345==0)||(p666==1))) * !((p225==0)))) + EG(!((p225==0)))))) * (...176
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t54, t70, t94, t102, t107, t138, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,20.1607,575608,1,0,594,2.90344e+06,636,342,6041,3.44766e+06,848
FORMULA CO4-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 664
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 434 transition count 627
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 434 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 434 transition count 623
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 91 place count 420 transition count 606
Iterating global reduction 2 with 14 rules applied. Total rules applied 105 place count 420 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 420 transition count 605
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 413 transition count 595
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 413 transition count 595
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 409 transition count 591
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 409 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 409 transition count 590
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 407 transition count 588
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 407 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 407 transition count 586
Applied a total of 135 rules in 39 ms. Remains 407 /471 variables (removed 64) and now considering 586/665 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3696904503373093757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-901727384748200712.kers'
[2026-05-23 08:08:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3696904503373093757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-901727384748200712.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 586 rows 407 cols 1543 entries
Finished phase 1 with 402 SingleSign rule and 0 generalized
[2026-05-23 08:08:31] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-901727384748200712.kers
Total runtime 3 ms.
[2026-05-23 08:08:32] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:08:32] [INFO ] Invariant cache hit.
[2026-05-23 08:08:32] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 585 sub problems to find dead transitions.
[2026-05-23 08:08:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 4 (OVERLAPS) 586/993 variables, 407/413 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/993 variables, and 415 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 585 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 4 (OVERLAPS) 586/993 variables, 407/415 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 585/1000 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/993 variables, and 1000 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 585 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 407/471 places, 586/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60532 ms. Remains : 407/471 places, 586/665 transitions.
[2026-05-23 08:09:32] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:09:32] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:09:32] [INFO ] Input system was already deterministic with 586 transitions.
[2026-05-23 08:09:32] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:09:32] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:09:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality12497011517244155818.gal : 2 ms
[2026-05-23 08:09:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6274457832492128881.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/CTLCardinality12497011517244155818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6274457832492128881.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.34435e+11,4.32489,128676,2,15228,5,398270,6,0,2207,596486,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:10:02] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:10:02] [INFO ] Applying decomposition
[2026-05-23 08:10:02] [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/graph8841417017455978184.txt' '-o' '/tmp/graph8841417017455978184.bin' '-w' '/tmp/graph8841417017455978184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8841417017455978184.bin' '-l' '-1' '-v' '-w' '/tmp/graph8841417017455978184.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:10:02] [INFO ] Decomposing Gal with order
[2026-05-23 08:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:10:02] [INFO ] Removed a total of 369 redundant transitions.
[2026-05-23 08:10:02] [INFO ] Flatten gal took : 38 ms
[2026-05-23 08:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 9 ms.
[2026-05-23 08:10:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16688286226354143352.gal : 4 ms
[2026-05-23 08:10:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality17151974890862218753.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/CTLCardinality16688286226354143352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17151974890862218753.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.34435e+11,1.62444,70312,2088,63,113531,936,1000,481876,79,5783,0


Converting to forward existential form...Done !
original formula: ((AF(((i8.u50.p327!=0)&&(i2.u32.p85!=1))) + EG(!(A(((i10.u74.p460==0)||(i8.u47.p307==1)) U AX(((i5.i1.i1.u13.p152==0)||(i15.u70.p445==1))...387
=> equivalent forward existential formula: [(FwdU((Init * !((!(EG(!(((i8.u50.p327!=0)&&(i2.u32.p85!=1))))) + EG(!(!((E(!(!(EX(!(((i5.i1.i1.u13.p152==0)||(i...579
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t74, t97, t132, t142, t163, t181, t225, t279, t310, t392, t418, t438, t472, t527, t5...917
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Graph (trivial) has 510 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 960 edges and 470 vertex of which 463 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 462 transition count 462
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 195 rules applied. Total rules applied 392 place count 271 transition count 458
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 394 place count 270 transition count 457
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 394 place count 270 transition count 422
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 464 place count 235 transition count 422
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 475 place count 224 transition count 408
Iterating global reduction 3 with 11 rules applied. Total rules applied 486 place count 224 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 487 place count 224 transition count 407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 487 place count 224 transition count 404
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 493 place count 221 transition count 404
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 496 place count 218 transition count 400
Iterating global reduction 4 with 3 rules applied. Total rules applied 499 place count 218 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 218 transition count 399
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 564 place count 186 transition count 363
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 577 place count 186 transition count 350
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 587 place count 182 transition count 344
Reduce places removed 2 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 7 with 5 rules applied. Total rules applied 592 place count 180 transition count 341
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 594 place count 179 transition count 340
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 598 place count 175 transition count 332
Iterating global reduction 9 with 4 rules applied. Total rules applied 602 place count 175 transition count 332
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 610 place count 171 transition count 328
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 9 with 3 rules applied. Total rules applied 613 place count 171 transition count 325
Reduce places removed 1 places and 0 transitions.
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 10 with 3 rules applied. Total rules applied 616 place count 170 transition count 323
Reduce places removed 1 places and 0 transitions.
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 11 with 3 rules applied. Total rules applied 619 place count 169 transition count 321
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 621 place count 168 transition count 320
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 622 place count 167 transition count 318
Iterating global reduction 13 with 1 rules applied. Total rules applied 623 place count 167 transition count 318
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 624 place count 166 transition count 316
Iterating global reduction 13 with 1 rules applied. Total rules applied 625 place count 166 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 626 place count 166 transition count 315
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 14 with 2 rules applied. Total rules applied 628 place count 165 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 14 with 13 rules applied. Total rules applied 641 place count 165 transition count 301
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 7 rules applied. Total rules applied 648 place count 165 transition count 294
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 655 place count 158 transition count 294
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 16 with 2 rules applied. Total rules applied 657 place count 157 transition count 293
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 659 place count 155 transition count 291
Applied a total of 659 rules in 65 ms. Remains 155 /471 variables (removed 316) and now considering 291/665 (removed 374) transitions.
[2026-05-23 08:10:32] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12854528047439767762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3186432798743238240.kers'
[2026-05-23 08:10:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12854528047439767762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3186432798743238240.kers]
Normalized transition count is 264 out of 265 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 155 cols 587 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-23 08:10:32] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3186432798743238240.kers
Total runtime 1 ms.
[2026-05-23 08:10:33] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-23 08:10:33] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-23 08:10:33] [INFO ] Invariant cache hit.
[2026-05-23 08:10:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:10:33] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2026-05-23 08:10:33] [INFO ] Redundant transitions in 3 ms returned []
Running 271 sub problems to find dead transitions.
[2026-05-23 08:10:33] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-23 08:10:33] [INFO ] Invariant cache hit.
[2026-05-23 08:10:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 264/419 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 1/420 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 161 constraints, problems are : Problem set: 0 solved, 271 unsolved in 16546 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 264/419 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 271/431 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 1/420 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/420 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 432 constraints, problems are : Problem set: 0 solved, 271 unsolved in 24237 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40804ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 40804ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/471 places, 291/665 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41138 ms. Remains : 155/471 places, 291/665 transitions.
[2026-05-23 08:11:13] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:11:13] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:11:13] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-23 08:11:13] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:11:13] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:11:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14748302210616745891.gal : 5 ms
[2026-05-23 08:11:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12442097358965508598.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/CTLCardinality14748302210616745891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12442097358965508598.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.80937e+07,0.115969,8568,2,1541,5,19548,6,0,901,15130,0


Converting to forward existential form...Done !
original formula: AG(AF((p148==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p148==1)))] = FALSE
Hit Full ! (commute/partial/dont) 289/0/2
(forward)formula 0,0,0.687497,31392,1,0,8,163141,20,3,4392,55521,8
FORMULA CO4-PT-15-CTLCardinality-2024-11 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 : 471/471 places, 665/665 transitions.
Graph (trivial) has 510 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 960 edges and 470 vertex of which 463 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 462 transition count 461
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 196 rules applied. Total rules applied 394 place count 270 transition count 457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 396 place count 269 transition count 456
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 396 place count 269 transition count 421
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 466 place count 234 transition count 421
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 477 place count 223 transition count 407
Iterating global reduction 3 with 11 rules applied. Total rules applied 488 place count 223 transition count 407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 489 place count 223 transition count 406
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 489 place count 223 transition count 403
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 495 place count 220 transition count 403
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 498 place count 217 transition count 399
Iterating global reduction 4 with 3 rules applied. Total rules applied 501 place count 217 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 502 place count 217 transition count 398
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 566 place count 185 transition count 362
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 577 place count 185 transition count 351
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 8 rules applied. Total rules applied 585 place count 182 transition count 346
Reduce places removed 2 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 7 with 5 rules applied. Total rules applied 590 place count 180 transition count 343
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 592 place count 179 transition count 342
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 596 place count 175 transition count 334
Iterating global reduction 9 with 4 rules applied. Total rules applied 600 place count 175 transition count 334
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 608 place count 171 transition count 330
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 9 with 3 rules applied. Total rules applied 611 place count 171 transition count 327
Reduce places removed 1 places and 0 transitions.
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 10 with 3 rules applied. Total rules applied 614 place count 170 transition count 325
Reduce places removed 1 places and 0 transitions.
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 11 with 3 rules applied. Total rules applied 617 place count 169 transition count 323
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 619 place count 168 transition count 322
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 620 place count 167 transition count 320
Iterating global reduction 13 with 1 rules applied. Total rules applied 621 place count 167 transition count 320
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 622 place count 166 transition count 318
Iterating global reduction 13 with 1 rules applied. Total rules applied 623 place count 166 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 624 place count 166 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 14 with 14 rules applied. Total rules applied 638 place count 166 transition count 303
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 7 rules applied. Total rules applied 645 place count 166 transition count 296
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 652 place count 159 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 652 place count 159 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 654 place count 158 transition count 295
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 16 with 2 rules applied. Total rules applied 656 place count 157 transition count 294
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 658 place count 155 transition count 292
Applied a total of 658 rules in 50 ms. Remains 155 /471 variables (removed 316) and now considering 292/665 (removed 373) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12761279426987307915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7518846666241093686.kers'
[2026-05-23 08:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12761279426987307915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7518846666241093686.kers]
Normalized transition count is 291 out of 292 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 155 cols 693 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-23 08:11:14] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7518846666241093686.kers
Total runtime 1 ms.
[2026-05-23 08:11:14] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-23 08:11:14] [INFO ] Invariant cache hit.
[2026-05-23 08:11:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:11:15] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2026-05-23 08:11:15] [INFO ] Redundant transitions in 1 ms returned []
Running 272 sub problems to find dead transitions.
[2026-05-23 08:11:15] [INFO ] Invariant cache hit.
[2026-05-23 08:11:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 291/446 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/447 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/447 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 161 constraints, problems are : Problem set: 0 solved, 272 unsolved in 16736 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 291/446 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 272/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 1/447 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 433 constraints, problems are : Problem set: 0 solved, 272 unsolved in 29431 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46191ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 46192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/471 places, 292/665 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46534 ms. Remains : 155/471 places, 292/665 transitions.
[2026-05-23 08:12:01] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:12:01] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:12:01] [INFO ] Input system was already deterministic with 292 transitions.
[2026-05-23 08:12:01] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:12:01] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:12:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5765360144124287134.gal : 25 ms
[2026-05-23 08:12:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2236907376835668754.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5765360144124287134.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2236907376835668754.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 39804 steps (3103 resets) in 327 ms. (121 steps per ms) remains 0/1 properties
FORMULA CO4-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 664
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 433 transition count 626
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 433 transition count 626
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 433 transition count 622
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 421 transition count 608
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 421 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 421 transition count 607
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 415 transition count 598
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 415 transition count 598
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 411 transition count 594
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 411 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 411 transition count 593
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 409 transition count 591
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 409 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 409 transition count 589
Applied a total of 131 rules in 33 ms. Remains 409 /471 variables (removed 62) and now considering 589/665 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16131566801359322568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6247181432314778471.kers'
[2026-05-23 08:12:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16131566801359322568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6247181432314778471.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 589 rows 409 cols 1549 entries
Finished phase 1 with 404 SingleSign rule and 0 generalized
[2026-05-23 08:12:01] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6247181432314778471.kers
Total runtime 10 ms.
[2026-05-23 08:12:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-23 08:12:01] [INFO ] Invariant cache hit.
[2026-05-23 08:12:01] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2026-05-23 08:12:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 589/998 variables, 409/415 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 998/998 variables, and 417 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 589/998 variables, 409/417 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/998 variables, 588/1005 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/998 variables, and 1005 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 409/471 places, 589/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 409/471 places, 589/665 transitions.
[2026-05-23 08:13:01] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:13:01] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:13:01] [INFO ] Input system was already deterministic with 589 transitions.
[2026-05-23 08:13:02] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:13:02] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:13:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2826405754237739685.gal : 3 ms
[2026-05-23 08:13:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3725932616602096207.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/CTLCardinality2826405754237739685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3725932616602096207.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.49159e+11,3.4544,99196,2,14003,5,328278,6,0,2218,415233,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:13:32] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:13:32] [INFO ] Applying decomposition
[2026-05-23 08:13:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11720666368571976834.txt' '-o' '/tmp/graph11720666368571976834.bin' '-w' '/tmp/graph11720666368571976834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11720666368571976834.bin' '-l' '-1' '-v' '-w' '/tmp/graph11720666368571976834.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:13:32] [INFO ] Decomposing Gal with order
[2026-05-23 08:13:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:13:32] [INFO ] Removed a total of 380 redundant transitions.
[2026-05-23 08:13:32] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:13:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 6 ms.
[2026-05-23 08:13:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5616453144132272312.gal : 4 ms
[2026-05-23 08:13:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality782704746925606859.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/CTLCardinality5616453144132272312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality782704746925606859.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49159e+11,1.08453,46064,1331,69,76151,1111,1020,276671,75,4817,0


Converting to forward existential form...Done !
original formula: (AX((EG(EX((i14.u74.p435==0))) + ((AG(((i16.u140.p774==0)||(i6.u51.p308==1))) * (i2.u28.p223==0)) * (i15.i1.i0.u123.p651==1)))) * EX(((EX...267
=> equivalent forward existential formula: ((([(FwdU((EY(Init) * !(EG(EX((i14.u74.p435==0))))),TRUE) * !(((i16.u140.p774==0)||(i6.u51.p308==1))))] = FALSE ...476
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t47, t75, t88, t133, t143, t159, t182, t212, t279, t314, t476, t531, t561, t579...961
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Graph (trivial) has 508 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 960 edges and 470 vertex of which 463 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 462 transition count 461
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 196 rules applied. Total rules applied 394 place count 270 transition count 457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 396 place count 269 transition count 456
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 396 place count 269 transition count 421
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 466 place count 234 transition count 421
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 475 place count 225 transition count 409
Iterating global reduction 3 with 9 rules applied. Total rules applied 484 place count 225 transition count 409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 485 place count 225 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 485 place count 225 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 491 place count 222 transition count 405
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 492 place count 221 transition count 403
Iterating global reduction 4 with 1 rules applied. Total rules applied 493 place count 221 transition count 403
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 557 place count 189 transition count 367
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 570 place count 189 transition count 354
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 10 rules applied. Total rules applied 580 place count 185 transition count 348
Reduce places removed 2 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 6 with 5 rules applied. Total rules applied 585 place count 183 transition count 345
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 587 place count 182 transition count 344
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 591 place count 178 transition count 336
Iterating global reduction 8 with 4 rules applied. Total rules applied 595 place count 178 transition count 336
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 603 place count 174 transition count 332
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 8 with 3 rules applied. Total rules applied 606 place count 174 transition count 329
Reduce places removed 1 places and 0 transitions.
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 9 with 3 rules applied. Total rules applied 609 place count 173 transition count 327
Reduce places removed 1 places and 0 transitions.
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 10 with 3 rules applied. Total rules applied 612 place count 172 transition count 325
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 614 place count 171 transition count 324
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 615 place count 170 transition count 322
Iterating global reduction 12 with 1 rules applied. Total rules applied 616 place count 170 transition count 322
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 617 place count 169 transition count 320
Iterating global reduction 12 with 1 rules applied. Total rules applied 618 place count 169 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 619 place count 169 transition count 319
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 621 place count 168 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 634 place count 168 transition count 305
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 13 with 7 rules applied. Total rules applied 641 place count 168 transition count 298
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 648 place count 161 transition count 298
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 15 with 2 rules applied. Total rules applied 650 place count 160 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 652 place count 158 transition count 295
Applied a total of 652 rules in 52 ms. Remains 158 /471 variables (removed 313) and now considering 295/665 (removed 370) transitions.
[2026-05-23 08:14:02] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1743641815767827538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5606381670103534638.kers'
[2026-05-23 08:14:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1743641815767827538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5606381670103534638.kers]
Normalized transition count is 268 out of 269 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 158 cols 598 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-23 08:14:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5606381670103534638.kers
Total runtime 2 ms.
[2026-05-23 08:14:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 08:14:02] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-23 08:14:02] [INFO ] Invariant cache hit.
[2026-05-23 08:14:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:14:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-05-23 08:14:02] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2026-05-23 08:14:02] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-23 08:14:02] [INFO ] Invariant cache hit.
[2026-05-23 08:14:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 268/426 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/427 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 164 constraints, problems are : Problem set: 0 solved, 275 unsolved in 16463 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 268/426 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 275/438 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/427 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 439 constraints, problems are : Problem set: 0 solved, 275 unsolved in 26888 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43374ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 43375ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/471 places, 295/665 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43610 ms. Remains : 158/471 places, 295/665 transitions.
[2026-05-23 08:14:45] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:14:45] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:14:45] [INFO ] Input system was already deterministic with 295 transitions.
[2026-05-23 08:14:45] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:14:45] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:14:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality4238401331152233043.gal : 1 ms
[2026-05-23 08:14:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality5937263162891205321.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/CTLCardinality4238401331152233043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5937263162891205321.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.76045e+07,0.12201,8612,2,1616,5,19573,6,0,917,15490,0


Converting to forward existential form...Done !
original formula: AF(AG(((p503==1)&&((p721==0)||(p806==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p503==1)&&((p721==0)||(p806==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t13, t53, t65, t86, t94, t99, t131, t213, t215, Intersection with reachable at e...222
(forward)formula 0,0,2.21616,81940,1,0,405,420868,615,210,6111,274807,604
FORMULA CO4-PT-15-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 665/665 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 664
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 432 transition count 625
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 432 transition count 625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 432 transition count 623
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 92 place count 419 transition count 607
Iterating global reduction 2 with 13 rules applied. Total rules applied 105 place count 419 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 419 transition count 605
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 414 transition count 598
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 414 transition count 598
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 412 transition count 596
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 412 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 412 transition count 595
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 411 transition count 594
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 411 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 411 transition count 593
Applied a total of 125 rules in 48 ms. Remains 411 /471 variables (removed 60) and now considering 593/665 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2866731851971407755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15910911327662249479.kers'
[2026-05-23 08:14:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2866731851971407755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15910911327662249479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 593 rows 411 cols 1555 entries
Finished phase 1 with 406 SingleSign rule and 0 generalized
[2026-05-23 08:14:48] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15910911327662249479.kers
Total runtime 6 ms.
[2026-05-23 08:14:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 08:14:48] [INFO ] Invariant cache hit.
[2026-05-23 08:14:48] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2026-05-23 08:14:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 593/1004 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1004/1004 variables, and 419 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 593/1004 variables, 411/419 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1004 variables, 592/1011 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1004 variables, and 1011 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 411/471 places, 593/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60502 ms. Remains : 411/471 places, 593/665 transitions.
[2026-05-23 08:15:48] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:15:48] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:15:48] [INFO ] Input system was already deterministic with 593 transitions.
[2026-05-23 08:15:48] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:15:48] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:15:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5464983807903491308.gal : 3 ms
[2026-05-23 08:15:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8868803497471348003.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/CTLCardinality5464983807903491308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8868803497471348003.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.50282e+11,4.48915,126884,2,15206,5,391405,6,0,2228,565088,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:16:18] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:16:18] [INFO ] Applying decomposition
[2026-05-23 08:16:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3722115025197087738.txt' '-o' '/tmp/graph3722115025197087738.bin' '-w' '/tmp/graph3722115025197087738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3722115025197087738.bin' '-l' '-1' '-v' '-w' '/tmp/graph3722115025197087738.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:16:18] [INFO ] Decomposing Gal with order
[2026-05-23 08:16:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:16:18] [INFO ] Removed a total of 390 redundant transitions.
[2026-05-23 08:16:18] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:16:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2026-05-23 08:16:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11563836007955488680.gal : 3 ms
[2026-05-23 08:16:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1316074488213716918.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/CTLCardinality11563836007955488680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1316074488213716918.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.50282e+11,0.273991,14448,918,84,19763,941,992,36362,86,3659,0


Converting to forward existential form...Done !
original formula: (AX(EG(AX(!(A((i0.i0.i0.u3.p89==1) U (i1.u22.p173==1)))))) + ((EF(AX(FALSE)) * AX(((i15.u137.p686==1)&&((i6.u98.p510==0)||(i1.u23.p186==1...224
=> equivalent forward existential formula: (([((Init * !(!(EX(!(EG(!(EX(!(!(!((E(!((i1.u22.p173==1)) U (!((i0.i0.i0.u3.p89==1)) * !((i1.u22.p173==1)))) + E...857
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t46, t83, t96, t208, t220, t238, t278, t287, t315, t480, t534, t564, t568, i0.i...957
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 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
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
Detected timeout of ITS tools.
[2026-05-23 08:16:49] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:16:49] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:16:49] [INFO ] Applying decomposition
[2026-05-23 08:16: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/graph4258972911568292775.txt' '-o' '/tmp/graph4258972911568292775.bin' '-w' '/tmp/graph4258972911568292775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4258972911568292775.bin' '-l' '-1' '-v' '-w' '/tmp/graph4258972911568292775.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:16:49] [INFO ] Decomposing Gal with order
[2026-05-23 08:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:16:49] [INFO ] Removed a total of 424 redundant transitions.
[2026-05-23 08:16:49] [INFO ] Flatten gal took : 29 ms
[2026-05-23 08:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 6 ms.
[2026-05-23 08:16:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12786543518187939077.gal : 5 ms
[2026-05-23 08:16:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15407444636849572627.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/CTLCardinality12786543518187939077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15407444636849572627.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 4 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.31004e+11,0.905794,34496,1734,103,53667,1193,1136,174026,120,4554,0


Converting to forward existential form...Done !
original formula: (A((!(AX(((E((i6.u71.p392==1) U ((i7.u136.p630==0)||(i10.i0.i1.u92.p497==1))) * ((i17.u147.p682==0)||(i14.u130.p612==1))) * (i4.i0.i3.u42...382
=> equivalent forward existential formula: ((([(EY(FwdU((FwdU(Init,!(!(E(TRUE U !((!(EX(!((((i12.u120.p580==0)||(i13.u111.p556==1))||((i17.u158.p734==0)||(...1261
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t54, t101, t106, t168, t215, t249, t254, t268, t278, t303, t309, t318, t357, t4...1401
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,450.892,2495472,1,0,3.04892e+06,1730,2495,1.62688e+07,211,8005,1439148
FORMULA CO4-PT-15-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((AF(((i5.u57.p327!=0)&&(i4.i0.i0.u3.p85!=1))) + EG(!(A(((i9.u85.p460==0)||(i5.u53.p307==1)) U AX(((i2.u19.p152==0)||(i14.u82.p445==1))))...392
=> equivalent forward existential formula: [(FwdU((Init * !((!(EG(!(((i5.u57.p327!=0)&&(i4.i0.i0.u3.p85!=1))))) + EG(!(!((E(!(!(EX(!(((i2.u19.p152==0)||(i1...572
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
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
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
(forward)formula 1,0,1095.55,5546308,1,0,6.70909e+06,1878,4318,4.01006e+07,335,10670,6100029
FORMULA CO4-PT-15-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX((EG(EX((i8.u81.p435==0))) + ((AG(((i18.u165.p774==0)||(i5.u53.p308==1))) * (i3.u37.p223==0)) * (i15.u139.p651==1)))) * EX(((EX(EG(AG(...267
=> equivalent forward existential formula: ((([(FwdU((EY(Init) * !(EG(EX((i8.u81.p435==0))))),TRUE) * !(((i18.u165.p774==0)||(i5.u53.p308==1))))] = FALSE *...474
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
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 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
Detected timeout of ITS tools.
[2026-05-23 08:41:19] [INFO ] Applying decomposition
[2026-05-23 08:41:19] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:41:19] [INFO ] Decomposing Gal with order
[2026-05-23 08:41:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:41:19] [INFO ] Removed a total of 250 redundant transitions.
[2026-05-23 08:41:19] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:41:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 4 ms.
[2026-05-23 08:41:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality815703284468052547.gal : 3 ms
[2026-05-23 08:41:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14547236123468166385.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/CTLCardinality815703284468052547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14547236123468166385.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 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31004e+11,2.80288,99756,736,3027,67039,135064,307,293272,1381,690202,0


Converting to forward existential form...Done !
original formula: (AX((EG(EX((i0.i1.i1.i0.u11.p435==0))) + ((AG(((i0.i1.i1.i1.i1.u17.p774==0)||(i0.i1.u8.p308==1))) * (i0.i0.i0.u5.p223==0)) * (i0.i1.i1.i0...320
=> equivalent forward existential formula: ((([(FwdU((EY(Init) * !(EG(EX((i0.i1.i1.i0.u11.p435==0))))),TRUE) * !(((i0.i1.i1.i1.i1.u17.p774==0)||(i0.i1.u8.p...545
Reverse transition relation is NOT exact ! Due to transitions t633, t637, t640, t641, i0.t528, i0.t16, i0.i0.i0.t357, i0.i0.i0.u5.t427, i0.i0.i0.u5.t439, i...2395

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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-15"
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-15, 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-177946967700393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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