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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 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 260K 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-16-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779523816864

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 08:10: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:10:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:10:18] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2026-05-23 08:10:18] [INFO ] Transformed 837 places.
[2026-05-23 08:10:18] [INFO ] Transformed 1122 transitions.
[2026-05-23 08:10:18] [INFO ] Found NUPN structural information;
[2026-05-23 08:10:18] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-16-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 706 transition count 940
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 161 place count 562 transition count 794
Iterating global reduction 1 with 144 rules applied. Total rules applied 305 place count 562 transition count 794
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 311 place count 562 transition count 788
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 380 place count 493 transition count 703
Iterating global reduction 2 with 69 rules applied. Total rules applied 449 place count 493 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 450 place count 493 transition count 702
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 458 place count 485 transition count 689
Iterating global reduction 3 with 8 rules applied. Total rules applied 466 place count 485 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 467 place count 485 transition count 688
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 471 place count 481 transition count 684
Iterating global reduction 4 with 4 rules applied. Total rules applied 475 place count 481 transition count 684
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 479 place count 477 transition count 680
Iterating global reduction 4 with 4 rules applied. Total rules applied 483 place count 477 transition count 680
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 487 place count 477 transition count 676
Applied a total of 487 rules in 155 ms. Remains 477 /721 variables (removed 244) and now considering 676/942 (removed 266) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11862689217858246688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6501052612604428514.kers'
[2026-05-23 08:10:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11862689217858246688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6501052612604428514.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 676 rows 477 cols 1809 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 08:10:18] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6501052612604428514.kers
Total runtime 3 ms.
[2026-05-23 08:10:18] [INFO ] Implicit Places using invariants in 319 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/721 places, 676/942 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 533 ms. Remains : 476/721 places, 676/942 transitions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 676/676 transitions.
Applied a total of 0 rules in 9 ms. Remains 476 /476 variables (removed 0) and now considering 676/676 (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-16732643396858488220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8488416431690111919.kers'
[2026-05-23 08:10:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16732643396858488220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8488416431690111919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 676 rows 476 cols 1807 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 08:10:18] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8488416431690111919.kers
Total runtime 4 ms.
[2026-05-23 08:10:18] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-23 08:10:18] [INFO ] Invariant cache hit.
[2026-05-23 08:10:19] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 675 sub problems to find dead transitions.
[2026-05-23 08:10:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Problem TDEAD585 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 674 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 674 unsolved
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 1 solved, 674 unsolved
Search for dead transitions found 1 dead transitions in 30263ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 476/476 places, 675/676 transitions.
Applied a total of 0 rules in 6 ms. Remains 476 /476 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30786 ms. Remains : 476/476 places, 675/676 transitions.
Support contains 80 out of 476 places after structural reductions.
[2026-05-23 08:10:49] [INFO ] Flatten gal took : 83 ms
[2026-05-23 08:10:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-16-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:10:49] [INFO ] Flatten gal took : 57 ms
[2026-05-23 08:10:50] [INFO ] Input system was already deterministic with 675 transitions.
Support contains 51 out of 476 places (down from 80) after GAL structural reductions.
FORMULA CO4-PT-16-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (751 resets) in 1665 ms. (24 steps per ms) remains 12/25 properties
BEST_FIRST walk for 40003 steps (129 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (159 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (177 resets) in 145 ms. (274 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (158 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (159 resets) in 65 ms. (606 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40002 steps (158 resets) in 65 ms. (606 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (157 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (152 resets) in 72 ms. (547 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (159 resets) in 103 ms. (384 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (160 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15915526243353355849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12832864131907994409.kers'
[2026-05-23 08:10:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15915526243353355849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12832864131907994409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 675 rows 476 cols 1801 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 08:10:50] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12832864131907994409.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 23/48 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 146/194 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 394/588 variables, 112/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 424/1012 variables, 220/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 122/1134 variables, 85/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/1148 variables, 9/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1148 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/1151 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1151 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1151 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 482 constraints, problems are : Problem set: 0 solved, 5 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 23/48 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 146/194 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 394/588 variables, 112/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 424/1012 variables, 220/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 122/1134 variables, 85/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1134 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 15 (OVERLAPS) 14/1148 variables, 9/485 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1148 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1151 variables, 2/487 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1151 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1151 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 487 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2130ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2980 steps, including 52 resets, run visited all 4 properties in 27 ms. (steps per millisecond=110 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 32 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-16-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:10:53] [INFO ] Flatten gal took : 34 ms
[2026-05-23 08:10:53] [INFO ] Flatten gal took : 28 ms
[2026-05-23 08:10:53] [INFO ] Input system was already deterministic with 675 transitions.
Computed a total of 21 stabilizing places and 37 stable transitions
Graph (complete) has 1007 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 675/675 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 474 transition count 674
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 440 transition count 638
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 440 transition count 638
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 440 transition count 636
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 88 place count 425 transition count 618
Iterating global reduction 2 with 15 rules applied. Total rules applied 103 place count 425 transition count 618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 425 transition count 616
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 111 place count 419 transition count 609
Iterating global reduction 3 with 6 rules applied. Total rules applied 117 place count 419 transition count 609
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 417 transition count 607
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 417 transition count 607
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 417 transition count 606
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 416 transition count 605
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 416 transition count 605
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 416 transition count 604
Applied a total of 125 rules in 43 ms. Remains 416 /476 variables (removed 60) and now considering 604/675 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17654987759631202176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7144693989483124660.kers'
[2026-05-23 08:10:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17654987759631202176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7144693989483124660.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 604 rows 416 cols 1645 entries
Finished phase 1 with 410 SingleSign rule and 0 generalized
[2026-05-23 08:10:53] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7144693989483124660.kers
Total runtime 5 ms.
[2026-05-23 08:10:53] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 08:10:53] [INFO ] Invariant cache hit.
[2026-05-23 08:10:53] [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 603 sub problems to find dead transitions.
[2026-05-23 08:10:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/416 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 604/1020 variables, 416/425 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 429 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 416/416 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/416 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 604/1020 variables, 416/429 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 603/1032 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1033 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 416/416 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 416/476 places, 604/675 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 416/476 places, 604/675 transitions.
[2026-05-23 08:11:53] [INFO ] Flatten gal took : 20 ms
[2026-05-23 08:11:53] [INFO ] Flatten gal took : 20 ms
[2026-05-23 08:11:53] [INFO ] Input system was already deterministic with 604 transitions.
[2026-05-23 08:11:53] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:11:53] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:11:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2980152305720433664.gal : 13 ms
[2026-05-23 08:11:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12497661875654927897.ctl : 4 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/CTLCardinality2980152305720433664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12497661875654927897.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.11786e+11,11.2326,296816,2,28731,5,852551,6,0,2261,1.43972e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:12:24] [INFO ] Applying decomposition
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 17 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/graph2959062775232398382.txt' '-o' '/tmp/graph2959062775232398382.bin' '-w' '/tmp/graph2959062775232398382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2959062775232398382.bin' '-l' '-1' '-v' '-w' '/tmp/graph2959062775232398382.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:12:24] [INFO ] Decomposing Gal with order
[2026-05-23 08:12:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:12:24] [INFO ] Removed a total of 423 redundant transitions.
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 76 ms
[2026-05-23 08:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 15 ms.
[2026-05-23 08:12:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality11257585155915093002.gal : 13 ms
[2026-05-23 08:12:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality397235611128479456.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/CTLCardinality11257585155915093002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality397235611128479456.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.11786e+11,0.952874,40072,1636,176,52470,7143,1073,197822,111,48353,0


Converting to forward existential form...Done !
original formula: EF(((i4.i1.i1.u36.p233==1) * ((AX(AF((i7.u78.p435==0))) + (i15.u134.p722==0)) + (((i3.i0.i1.u45.p269==0)&&(i12.u110.p569==1))&&((i10.u2.p...183
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (i4.i1.i1.u36.p233==1)) * !(EX(!(!(EG(!((i7.u78.p435==0))))))))] != FALSE + [((FwdU(Init,...363
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t16, t80, t112, t138, t187, t235, t252, t314, t477, t564, t569, t572, t593, i0.t373,...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 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.
Starting structural reductions in SI_CTL mode, iteration 0 : 476/476 places, 675/675 transitions.
Graph (trivial) has 496 edges and 476 vertex of which 2 / 476 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1006 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 191 rules applied. Total rules applied 193 place count 468 transition count 477
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 388 place count 278 transition count 472
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 394 place count 277 transition count 467
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 399 place count 272 transition count 467
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 399 place count 272 transition count 428
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 477 place count 233 transition count 428
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 484 place count 226 transition count 420
Iterating global reduction 4 with 7 rules applied. Total rules applied 491 place count 226 transition count 420
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 4 with 2 rules applied. Total rules applied 493 place count 226 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 494 place count 225 transition count 418
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 494 place count 225 transition count 416
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 498 place count 223 transition count 416
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 502 place count 219 transition count 410
Iterating global reduction 6 with 4 rules applied. Total rules applied 506 place count 219 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 507 place count 219 transition count 409
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 555 place count 195 transition count 384
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 7 with 12 rules applied. Total rules applied 567 place count 195 transition count 372
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 574 place count 192 transition count 368
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 577 place count 191 transition count 366
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 579 place count 190 transition count 365
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 583 place count 186 transition count 357
Iterating global reduction 11 with 4 rules applied. Total rules applied 587 place count 186 transition count 357
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 591 place count 184 transition count 355
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 11 with 3 rules applied. Total rules applied 594 place count 184 transition count 352
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 597 place count 183 transition count 350
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 599 place count 182 transition count 349
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 601 place count 181 transition count 348
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 615 place count 181 transition count 334
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 622 place count 181 transition count 327
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 629 place count 174 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 629 place count 174 transition count 326
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 631 place count 173 transition count 326
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 16 with 2 rules applied. Total rules applied 633 place count 172 transition count 325
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 634 place count 172 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 635 place count 172 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 637 place count 170 transition count 322
Applied a total of 637 rules in 179 ms. Remains 170 /476 variables (removed 306) and now considering 322/675 (removed 353) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9837602007980405830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16259828782347425200.kers'
[2026-05-23 08:12:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9837602007980405830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16259828782347425200.kers]
Normalized transition count is 321 out of 322 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 170 cols 809 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-23 08:12:54] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16259828782347425200.kers
Total runtime 2 ms.
[2026-05-23 08:12:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 08:12:54] [INFO ] Invariant cache hit.
[2026-05-23 08:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:12:54] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2026-05-23 08:12:54] [INFO ] Redundant transitions in 16 ms returned []
Running 303 sub problems to find dead transitions.
[2026-05-23 08:12:54] [INFO ] Invariant cache hit.
[2026-05-23 08:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 321/490 variables, 169/175 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 1/491 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 1/492 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 177 constraints, problems are : Problem set: 0 solved, 303 unsolved in 24886 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 321/490 variables, 169/175 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 225/400 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 1/491 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 78/479 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/492 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 481 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54953ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 54954ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/476 places, 322/675 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55403 ms. Remains : 170/476 places, 322/675 transitions.
[2026-05-23 08:13:49] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:13:49] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:13:49] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-23 08:13:49] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:13:49] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9261901054428510126.gal : 2 ms
[2026-05-23 08:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9605643316653556405.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/CTLCardinality9261901054428510126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9605643316653556405.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(A((EG((((p448==0)||(p712==1))&&(p299==0))) * (p714==1)) U ((p750==0)||(p833==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((p750==0)||(p833==1))) U (!((EG((((p448==0)||(p712==1))&&(p299==0))) * (p714==1))) * !(((p750...219
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t8, t46, t61, t83, t86, t93, t98, t126, t257, t259, Intersection with reachable at e...222
Detected timeout of ITS tools.
[2026-05-23 08:14:19] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:14:19] [INFO ] Applying decomposition
[2026-05-23 08:14:19] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3607024156579688976.txt' '-o' '/tmp/graph3607024156579688976.bin' '-w' '/tmp/graph3607024156579688976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3607024156579688976.bin' '-l' '-1' '-v' '-w' '/tmp/graph3607024156579688976.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:14:20] [INFO ] Decomposing Gal with order
[2026-05-23 08:14:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:14:20] [INFO ] Removed a total of 280 redundant transitions.
[2026-05-23 08:14:20] [INFO ] Flatten gal took : 19 ms
[2026-05-23 08:14:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 6 ms.
[2026-05-23 08:14:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7759977089688055676.gal : 18 ms
[2026-05-23 08:14:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality13539016826143949663.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/CTLCardinality7759977089688055676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13539016826143949663.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,4.28574e+08,0.06385,6092,165,79,3160,705,624,4394,142,1829,0


Converting to forward existential form...Done !
original formula: EG(A((EG((((i4.i0.u26.p448==0)||(i9.u56.p712==1))&&(i6.i0.u23.p299==0))) * (i9.u56.p714==1)) U ((i9.u57.p750==0)||(i3.i1.u59.p833==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((i9.u57.p750==0)||(i3.i1.u59.p833==1))) U (!((EG((((i4.i0.u26.p448==0)||(i9.u56.p712==1))&&(i...304
Reverse transition relation is NOT exact ! Due to transitions t256, i0.u1.t98, i1.i1.u5.t93, i2.i1.u10.t86, i2.i1.u11.t83, i3.i1.t126, i3.i1.u24.t61, i3.i1...310
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,5.80863,206644,1,0,344056,4579,3685,1.11761e+06,736,27534,323473
FORMULA CO4-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 476/476 places, 675/675 transitions.
Graph (trivial) has 496 edges and 476 vertex of which 2 / 476 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1006 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 187 rules applied. Total rules applied 189 place count 468 transition count 481
Reduce places removed 186 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 190 rules applied. Total rules applied 379 place count 282 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 384 place count 281 transition count 473
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 388 place count 277 transition count 473
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 388 place count 277 transition count 432
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 470 place count 236 transition count 432
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 477 place count 229 transition count 423
Iterating global reduction 4 with 7 rules applied. Total rules applied 484 place count 229 transition count 423
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 484 place count 229 transition count 422
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 486 place count 228 transition count 422
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 490 place count 224 transition count 416
Iterating global reduction 4 with 4 rules applied. Total rules applied 494 place count 224 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 495 place count 224 transition count 415
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 539 place count 202 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 549 place count 202 transition count 382
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 554 place count 200 transition count 379
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 7 with 3 rules applied. Total rules applied 557 place count 199 transition count 377
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 559 place count 198 transition count 376
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 563 place count 194 transition count 368
Iterating global reduction 9 with 4 rules applied. Total rules applied 567 place count 194 transition count 368
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 568 place count 193 transition count 366
Iterating global reduction 9 with 1 rules applied. Total rules applied 569 place count 193 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 570 place count 193 transition count 365
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 576 place count 190 transition count 362
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 10 with 6 rules applied. Total rules applied 582 place count 190 transition count 356
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 588 place count 188 transition count 352
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 592 place count 186 transition count 350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 596 place count 184 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 13 with 11 rules applied. Total rules applied 607 place count 184 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 13 with 5 rules applied. Total rules applied 612 place count 184 transition count 332
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 617 place count 179 transition count 332
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 619 place count 178 transition count 331
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 625 place count 178 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 626 place count 178 transition count 330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 628 place count 176 transition count 328
Applied a total of 628 rules in 98 ms. Remains 176 /476 variables (removed 300) and now considering 328/675 (removed 347) transitions.
[2026-05-23 08:14:26] [INFO ] Flow matrix only has 302 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-2473534649824795519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12544778973260395963.kers'
[2026-05-23 08:14:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2473534649824795519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12544778973260395963.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 176 cols 721 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-23 08:14:26] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12544778973260395963.kers
Total runtime 6 ms.
[2026-05-23 08:14:26] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-23 08:14:26] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-23 08:14:26] [INFO ] Invariant cache hit.
[2026-05-23 08:14:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 08:14:26] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2026-05-23 08:14:26] [INFO ] Redundant transitions in 7 ms returned []
Running 317 sub problems to find dead transitions.
[2026-05-23 08:14:26] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-23 08:14:26] [INFO ] Invariant cache hit.
[2026-05-23 08:14:26] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 301/477 variables, 176/182 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 31/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/478 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 214 constraints, problems are : Problem set: 0 solved, 317 unsolved in 29818 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 176/176 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 301/477 variables, 176/182 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 31/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 317/530 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 1/478 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 531 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 176/176 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59879ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 59881ms
Starting structural reductions in SI_CTL mode, iteration 1 : 176/476 places, 328/675 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60370 ms. Remains : 176/476 places, 328/675 transitions.
[2026-05-23 08:15:26] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:15:26] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:15:26] [INFO ] Input system was already deterministic with 328 transitions.
[2026-05-23 08:15:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:15:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:15:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13868222816346300306.gal : 2 ms
[2026-05-23 08:15:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7611044735546452750.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/CTLCardinality13868222816346300306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7611044735546452750.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(AF((((p544==1) * (AG(((p406==0)||(p548==1))) + A((p563==1) U ((p599==0)||(p576==1))))) * ((p432==1)||(p669==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((p544==1) * (!(E(TRUE U !(((p406==0)||(p548==1))))) + !((E(!(((p599==0)||(p576==1))) U (!((p...269
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t43, t59, t81, t84, t91, t96, t124, t129, t161, t164, t174, t219, t225, t229, t23...270
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-23 08:15:56] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:15:56] [INFO ] Applying decomposition
[2026-05-23 08:15:56] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4378033439024467710.txt' '-o' '/tmp/graph4378033439024467710.bin' '-w' '/tmp/graph4378033439024467710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4378033439024467710.bin' '-l' '-1' '-v' '-w' '/tmp/graph4378033439024467710.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:15:56] [INFO ] Decomposing Gal with order
[2026-05-23 08:15:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:15:56] [INFO ] Removed a total of 293 redundant transitions.
[2026-05-23 08:15:56] [INFO ] Flatten gal took : 12 ms
[2026-05-23 08:15:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 5 ms.
[2026-05-23 08:15:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11415964797077192283.gal : 2 ms
[2026-05-23 08:15:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16430889385154606947.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/CTLCardinality11415964797077192283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16430889385154606947.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,3.15721e+08,0.05829,6116,175,75,2780,533,666,4772,110,1958,0


Converting to forward existential form...Done !
original formula: EG(AF((((i8.i1.u46.p544==1) * (AG(((i9.i2.u30.p406==0)||(i8.i1.u47.p548==1))) + A((i8.i2.u48.p563==1) U ((i5.i1.u54.p599==0)||(i8.i3.u50....216
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((i8.i1.u46.p544==1) * (!(E(TRUE U !(((i9.i2.u30.p406==0)||(i8.i1.u47.p548==1))))) + !((E(!((...390
Reverse transition relation is NOT exact ! Due to transitions t121, t174, t215, t219, t225, i0.u1.t96, i1.i0.u3.t91, i2.u9.t84, i2.u10.t81, i3.u26.t59, i5....390
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 675/675 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 474 transition count 674
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 441 transition count 639
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 441 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 441 transition count 638
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 85 place count 426 transition count 621
Iterating global reduction 2 with 15 rules applied. Total rules applied 100 place count 426 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 426 transition count 619
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 421 transition count 613
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 421 transition count 613
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 420 transition count 612
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 420 transition count 612
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 419 transition count 611
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 419 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 419 transition count 610
Applied a total of 117 rules in 33 ms. Remains 419 /476 variables (removed 57) and now considering 610/675 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10291362911711920058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9791347665696785345.kers'
[2026-05-23 08:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10291362911711920058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9791347665696785345.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 610 rows 419 cols 1654 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-23 08:16:26] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9791347665696785345.kers
Total runtime 6 ms.
[2026-05-23 08:16:26] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-23 08:16:26] [INFO ] Invariant cache hit.
[2026-05-23 08:16:26] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 609 sub problems to find dead transitions.
[2026-05-23 08:16:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 610/1029 variables, 419/428 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 430 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 610/1029 variables, 419/430 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 609/1039 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 1039 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 609 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 419/476 places, 610/675 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 419/476 places, 610/675 transitions.
[2026-05-23 08:17:27] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:17:27] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:17:27] [INFO ] Input system was already deterministic with 610 transitions.
[2026-05-23 08:17:27] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:17:27] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:17:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality11430034386813726942.gal : 2 ms
[2026-05-23 08:17:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1221108441774813158.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/CTLCardinality11430034386813726942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1221108441774813158.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.4217e+11,5.63177,169572,2,22033,5,549961,6,0,2278,728455,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:17:57] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:17:57] [INFO ] Applying decomposition
[2026-05-23 08:17:57] [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/graph15905141113674590428.txt' '-o' '/tmp/graph15905141113674590428.bin' '-w' '/tmp/graph15905141113674590428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15905141113674590428.bin' '-l' '-1' '-v' '-w' '/tmp/graph15905141113674590428.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:17:57] [INFO ] Decomposing Gal with order
[2026-05-23 08:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:17:57] [INFO ] Removed a total of 410 redundant transitions.
[2026-05-23 08:17:57] [INFO ] Flatten gal took : 32 ms
[2026-05-23 08:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 16 ms.
[2026-05-23 08:17:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17304391134921199415.gal : 5 ms
[2026-05-23 08:17:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7763105002985434963.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/CTLCardinality17304391134921199415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7763105002985434963.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,3.4217e+11,0.492254,23288,798,168,27398,8695,1099,78439,122,42622,0


Converting to forward existential form...Done !
original formula: A(EX(AG(AX(FALSE))) U ((!(EX(((i13.i3.u89.p507==1)&&((i1.i0.u8.p110==0)||(i2.i0.u22.p177==1))))) * (EF(AG((i16.i0.u142.p760==1))) + (i4.i...218
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(((i13.i3.u89.p507==1)&&((i1.i0.u8.p110==0)||(i2.i0.u22.p177==1))))) * (E(TRUE U !(E(TRUE...721
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t85, t117, t143, t153, t222, t240, t274, t318, t449, t483, t570, t580, i0.t4, i0.u1...1053
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 675/675 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 474 transition count 674
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 438 transition count 636
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 438 transition count 636
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 438 transition count 634
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 93 place count 422 transition count 615
Iterating global reduction 2 with 16 rules applied. Total rules applied 109 place count 422 transition count 615
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 422 transition count 613
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 117 place count 416 transition count 606
Iterating global reduction 3 with 6 rules applied. Total rules applied 123 place count 416 transition count 606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 414 transition count 604
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 414 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 414 transition count 603
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 413 transition count 602
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 413 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 413 transition count 601
Applied a total of 131 rules in 45 ms. Remains 413 /476 variables (removed 63) and now considering 601/675 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17160503766840828628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3324546038135294731.kers'
[2026-05-23 08:18:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17160503766840828628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3324546038135294731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 413 cols 1637 entries
Finished phase 1 with 407 SingleSign rule and 0 generalized
[2026-05-23 08:18:27] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3324546038135294731.kers
Total runtime 2 ms.
[2026-05-23 08:18:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 08:18:27] [INFO ] Invariant cache hit.
[2026-05-23 08:18:27] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-23 08:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/1014 variables, 413/419 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 422 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (OVERLAPS) 601/1014 variables, 413/425 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 600/1025 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1025 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 413/476 places, 601/675 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 413/476 places, 601/675 transitions.
[2026-05-23 08:19:28] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:19:28] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:19:28] [INFO ] Input system was already deterministic with 601 transitions.
[2026-05-23 08:19:28] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:19:28] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:19:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality14754231649702579785.gal : 2 ms
[2026-05-23 08:19:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10187605819838999220.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/CTLCardinality14754231649702579785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10187605819838999220.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,2.9168e+11,7.15844,198120,2,21923,5,619459,6,0,2246,888980,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.9168e+11,0.703858,28860,1294,234,37296,5115,1042,119809,125,42488,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((i7.u55.p370==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((i7.u55.p370==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t80, t112, t138, t148, t200, t217, t235, t313, t372, t441, t475, t531, t567, i0.t43...952
(forward)formula 0,1,1.47508,53292,1,0,85281,5241,6563,266772,601,42488,206045
FORMULA CO4-PT-16-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 675/675 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 474 transition count 674
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 441 transition count 639
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 441 transition count 639
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 441 transition count 637
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 427 transition count 621
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 427 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 427 transition count 619
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 421 transition count 612
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 421 transition count 612
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 419 transition count 610
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 419 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 419 transition count 609
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 418 transition count 608
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 418 transition count 607
Applied a total of 121 rules in 31 ms. Remains 418 /476 variables (removed 58) and now considering 607/675 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2196678766611931778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4283701761166394194.kers'
[2026-05-23 08:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2196678766611931778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4283701761166394194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 607 rows 418 cols 1653 entries
Finished phase 1 with 412 SingleSign rule and 0 generalized
[2026-05-23 08:19:59] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4283701761166394194.kers
Total runtime 4 ms.
[2026-05-23 08:19:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 08:19:59] [INFO ] Invariant cache hit.
[2026-05-23 08:20:00] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2026-05-23 08:20:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (OVERLAPS) 607/1025 variables, 418/427 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 430 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (OVERLAPS) 607/1025 variables, 418/430 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 606/1036 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1036 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 418/476 places, 607/675 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60474 ms. Remains : 418/476 places, 607/675 transitions.
[2026-05-23 08:21:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:00] [INFO ] Input system was already deterministic with 607 transitions.
[2026-05-23 08:21:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11159093166971389808.gal : 3 ms
[2026-05-23 08:21:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11777437182987965386.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/CTLCardinality11159093166971389808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11777437182987965386.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.01305e+11,7.3261,201784,2,21475,5,628402,6,0,2272,904752,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:21:30] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:21:30] [INFO ] Applying decomposition
[2026-05-23 08:21:30] [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/graph5923608382721204203.txt' '-o' '/tmp/graph5923608382721204203.bin' '-w' '/tmp/graph5923608382721204203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5923608382721204203.bin' '-l' '-1' '-v' '-w' '/tmp/graph5923608382721204203.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:21:30] [INFO ] Decomposing Gal with order
[2026-05-23 08:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:21:30] [INFO ] Removed a total of 404 redundant transitions.
[2026-05-23 08:21:30] [INFO ] Flatten gal took : 19 ms
[2026-05-23 08:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 7 ms.
[2026-05-23 08:21:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15073785818057656134.gal : 4 ms
[2026-05-23 08:21:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11673523285273155901.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/CTLCardinality15073785818057656134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11673523285273155901.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,3.01305e+11,0.479041,23696,1057,164,31245,7325,1073,77463,126,32135,0


Converting to forward existential form...Done !
original formula: AX(A((i15.i0.i0.u65.p641==0) U EF(!(AX(((i8.u62.p407==0)||(i4.i0.i0.u12.p137==1)))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(TRUE U !(!(EX(!(((i8.u62.p407==0)||(i4.i0.i0.u12.p137==1))))))))) * !((i15.i0.i0.u65.p641=...338
Reverse transition relation is NOT exact ! Due to transitions t13, t80, t104, t139, t149, t218, t232, t236, t315, t444, t479, t572, i0.t441, i0.u6.t448, i2...903
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,3.66828,159676,1,0,225184,7325,7238,1.1971e+06,675,35141,386375
FORMULA CO4-PT-16-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 476/476 places, 675/675 transitions.
Graph (trivial) has 509 edges and 476 vertex of which 2 / 476 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 1006 edges and 475 vertex of which 470 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 469 transition count 472
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 201 rules applied. Total rules applied 399 place count 273 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 272 transition count 467
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 400 place count 272 transition count 427
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 480 place count 232 transition count 427
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 488 place count 224 transition count 417
Iterating global reduction 3 with 8 rules applied. Total rules applied 496 place count 224 transition count 417
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 3 with 2 rules applied. Total rules applied 498 place count 224 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 499 place count 223 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 499 place count 223 transition count 413
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 503 place count 221 transition count 413
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 507 place count 217 transition count 407
Iterating global reduction 5 with 4 rules applied. Total rules applied 511 place count 217 transition count 407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 512 place count 217 transition count 406
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 560 place count 193 transition count 381
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 570 place count 193 transition count 371
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 575 place count 191 transition count 368
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 8 with 3 rules applied. Total rules applied 578 place count 190 transition count 366
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 580 place count 189 transition count 365
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 584 place count 185 transition count 357
Iterating global reduction 10 with 4 rules applied. Total rules applied 588 place count 185 transition count 357
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 589 place count 184 transition count 355
Iterating global reduction 10 with 1 rules applied. Total rules applied 590 place count 184 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 591 place count 184 transition count 354
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 597 place count 181 transition count 351
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 11 with 4 rules applied. Total rules applied 601 place count 181 transition count 347
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 604 place count 180 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 13 with 2 rules applied. Total rules applied 606 place count 179 transition count 344
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 608 place count 178 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 14 with 15 rules applied. Total rules applied 623 place count 178 transition count 328
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 8 rules applied. Total rules applied 631 place count 178 transition count 320
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 639 place count 170 transition count 320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 639 place count 170 transition count 319
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 641 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 16 with 2 rules applied. Total rules applied 643 place count 168 transition count 318
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 645 place count 166 transition count 316
Applied a total of 645 rules in 81 ms. Remains 166 /476 variables (removed 310) and now considering 316/675 (removed 359) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12812710718153905271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8762886332101312456.kers'
[2026-05-23 08:21:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12812710718153905271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8762886332101312456.kers]
Normalized transition count is 315 out of 316 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 166 cols 797 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-23 08:21:34] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8762886332101312456.kers
Total runtime 1 ms.
[2026-05-23 08:21:34] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-23 08:21:34] [INFO ] Invariant cache hit.
[2026-05-23 08:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:21:34] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2026-05-23 08:21:34] [INFO ] Redundant transitions in 3 ms returned []
Running 292 sub problems to find dead transitions.
[2026-05-23 08:21:34] [INFO ] Invariant cache hit.
[2026-05-23 08:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 315/480 variables, 165/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 1/481 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 1/482 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 0/482 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 173 constraints, problems are : Problem set: 0 solved, 292 unsolved in 22751 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 315/480 variables, 165/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 266/437 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 1/481 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 26/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 466 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52794ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 52794ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/476 places, 316/675 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53245 ms. Remains : 166/476 places, 316/675 transitions.
[2026-05-23 08:22:27] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:22:27] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:22:27] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-23 08:22:27] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:22:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:22:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality11428321164239927472.gal : 1 ms
[2026-05-23 08:22:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality879229194996286207.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/CTLCardinality11428321164239927472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality879229194996286207.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG(((p784==0)&&(p814==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p784==0)&&(p814==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t41, t54, t76, t79, t86, t91, t119, t226, t229, Intersection with reachable at e...222
(forward)formula 0,0,24.9026,743168,1,0,742,4.29856e+06,657,410,6556,3.92501e+06,982
FORMULA CO4-PT-16-CTLCardinality-2024-12 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 : 476/476 places, 675/675 transitions.
Graph (trivial) has 511 edges and 476 vertex of which 2 / 476 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 1006 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 468 transition count 470
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 202 rules applied. Total rules applied 402 place count 271 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 403 place count 270 transition count 465
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 403 place count 270 transition count 425
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 483 place count 230 transition count 425
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 490 place count 223 transition count 416
Iterating global reduction 3 with 7 rules applied. Total rules applied 497 place count 223 transition count 416
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 3 with 2 rules applied. Total rules applied 499 place count 223 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 222 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 500 place count 222 transition count 412
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 504 place count 220 transition count 412
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 507 place count 217 transition count 407
Iterating global reduction 5 with 3 rules applied. Total rules applied 510 place count 217 transition count 407
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 558 place count 193 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 568 place count 193 transition count 372
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 573 place count 191 transition count 369
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 7 with 3 rules applied. Total rules applied 576 place count 190 transition count 367
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 578 place count 189 transition count 366
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 582 place count 185 transition count 358
Iterating global reduction 9 with 4 rules applied. Total rules applied 586 place count 185 transition count 358
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 587 place count 184 transition count 356
Iterating global reduction 9 with 1 rules applied. Total rules applied 588 place count 184 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 589 place count 184 transition count 355
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 595 place count 181 transition count 352
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 10 with 6 rules applied. Total rules applied 601 place count 181 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 607 place count 179 transition count 342
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 611 place count 177 transition count 340
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 615 place count 175 transition count 338
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 628 place count 175 transition count 325
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 635 place count 175 transition count 318
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 642 place count 168 transition count 318
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 644 place count 167 transition count 317
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 646 place count 165 transition count 315
Applied a total of 646 rules in 64 ms. Remains 165 /476 variables (removed 311) and now considering 315/675 (removed 360) transitions.
[2026-05-23 08:22:52] [INFO ] Flow matrix only has 289 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-10539291129029688665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12388796071825178936.kers'
[2026-05-23 08:22:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10539291129029688665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12388796071825178936.kers]
Normalized transition count is 288 out of 289 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 165 cols 691 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-23 08:22:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12388796071825178936.kers
Total runtime 1 ms.
[2026-05-23 08:22:52] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-23 08:22:52] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-23 08:22:52] [INFO ] Invariant cache hit.
[2026-05-23 08:22:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:22:52] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2026-05-23 08:22:52] [INFO ] Redundant transitions in 2 ms returned []
Running 292 sub problems to find dead transitions.
[2026-05-23 08:22:52] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-23 08:22:52] [INFO ] Invariant cache hit.
[2026-05-23 08:22:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 288/453 variables, 165/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 1/454 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/454 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 172 constraints, problems are : Problem set: 0 solved, 292 unsolved in 18112 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 288/453 variables, 165/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 292/463 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 1/454 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 464 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48152ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 48153ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/476 places, 315/675 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48522 ms. Remains : 165/476 places, 315/675 transitions.
[2026-05-23 08:23:41] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:23:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:23:41] [INFO ] Input system was already deterministic with 315 transitions.
[2026-05-23 08:23:41] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:23:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:23:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11472530052658458433.gal : 2 ms
[2026-05-23 08:23:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5152662523684943509.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11472530052658458433.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5152662523684943509.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 6797 steps (525 resets) in 53 ms. (125 steps per ms) remains 0/1 properties
FORMULA CO4-PT-16-CTLCardinality-2024-13 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 SI_CTL mode, iteration 0 : 476/476 places, 675/675 transitions.
Graph (trivial) has 505 edges and 476 vertex of which 2 / 476 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 1006 edges and 475 vertex of which 473 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 472 transition count 476
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 200 rules applied. Total rules applied 398 place count 277 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 276 transition count 471
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 399 place count 276 transition count 431
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 479 place count 236 transition count 431
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 487 place count 228 transition count 421
Iterating global reduction 3 with 8 rules applied. Total rules applied 495 place count 228 transition count 421
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 3 with 2 rules applied. Total rules applied 497 place count 228 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 498 place count 227 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 498 place count 227 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 502 place count 225 transition count 417
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 506 place count 221 transition count 411
Iterating global reduction 5 with 4 rules applied. Total rules applied 510 place count 221 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 511 place count 221 transition count 410
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 555 place count 199 transition count 387
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 9 rules applied. Total rules applied 564 place count 199 transition count 378
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 569 place count 197 transition count 375
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 8 with 3 rules applied. Total rules applied 572 place count 196 transition count 373
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 574 place count 195 transition count 372
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 578 place count 191 transition count 364
Iterating global reduction 10 with 4 rules applied. Total rules applied 582 place count 191 transition count 364
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 583 place count 190 transition count 362
Iterating global reduction 10 with 1 rules applied. Total rules applied 584 place count 190 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 585 place count 190 transition count 361
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 591 place count 187 transition count 358
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 11 with 6 rules applied. Total rules applied 597 place count 187 transition count 352
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 6 rules applied. Total rules applied 603 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.
Iterating post reduction 13 with 4 rules applied. Total rules applied 607 place count 183 transition count 346
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 609 place count 182 transition count 345
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 622 place count 182 transition count 332
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 629 place count 182 transition count 325
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 636 place count 175 transition count 325
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 638 place count 174 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 640 place count 172 transition count 322
Applied a total of 640 rules in 50 ms. Remains 172 /476 variables (removed 304) and now considering 322/675 (removed 353) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3853551673574297925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6963484514599529910.kers'
[2026-05-23 08:23:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3853551673574297925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6963484514599529910.kers]
Normalized transition count is 321 out of 322 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 172 cols 915 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-23 08:23:41] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6963484514599529910.kers
Total runtime 1 ms.
[2026-05-23 08:23:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 08:23:41] [INFO ] Invariant cache hit.
[2026-05-23 08:23:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 08:23:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2026-05-23 08:23:41] [INFO ] Redundant transitions in 1 ms returned []
Running 308 sub problems to find dead transitions.
[2026-05-23 08:23:41] [INFO ] Invariant cache hit.
[2026-05-23 08:23:41] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 321/492 variables, 171/177 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 26/203 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/493 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 1/494 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 11 (OVERLAPS) 0/494 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 205 constraints, problems are : Problem set: 0 solved, 308 unsolved in 28127 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 172/172 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 321/492 variables, 171/177 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 26/203 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 307/510 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 1/493 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/494 variables, and 512 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 172/172 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58182ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 58183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/476 places, 322/675 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58423 ms. Remains : 172/476 places, 322/675 transitions.
[2026-05-23 08:24:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:24:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:24:39] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-23 08:24:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:24:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:24:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17909973080814655627.gal : 1 ms
[2026-05-23 08:24:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9935471656023871191.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/CTLCardinality17909973080814655627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9935471656023871191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(((p701==0)&&((p670==1)||((p176==0)&&(p428==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p701==0)&&((p670==1)||((p176==0)&&(p428==1))))))] = FALSE
Hit Full ! (commute/partial/dont) 247/0/75
(forward)formula 0,0,1.53865,51136,1,0,9,271293,20,3,5327,77233,8
FORMULA CO4-PT-16-CTLCardinality-2024-14 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 : 476/476 places, 675/675 transitions.
Graph (trivial) has 510 edges and 476 vertex of which 2 / 476 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 1006 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 469 transition count 472
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 201 rules applied. Total rules applied 400 place count 273 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 401 place count 272 transition count 467
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 401 place count 272 transition count 427
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 481 place count 232 transition count 427
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 489 place count 224 transition count 417
Iterating global reduction 3 with 8 rules applied. Total rules applied 497 place count 224 transition count 417
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 3 with 2 rules applied. Total rules applied 499 place count 224 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 223 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 500 place count 223 transition count 413
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 504 place count 221 transition count 413
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 508 place count 217 transition count 407
Iterating global reduction 5 with 4 rules applied. Total rules applied 512 place count 217 transition count 407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 513 place count 217 transition count 406
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 563 place count 192 transition count 380
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 573 place count 192 transition count 370
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 578 place count 190 transition count 367
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 8 with 3 rules applied. Total rules applied 581 place count 189 transition count 365
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 583 place count 188 transition count 364
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 587 place count 184 transition count 356
Iterating global reduction 10 with 4 rules applied. Total rules applied 591 place count 184 transition count 356
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 592 place count 183 transition count 354
Iterating global reduction 10 with 1 rules applied. Total rules applied 593 place count 183 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 594 place count 183 transition count 353
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 600 place count 180 transition count 350
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 11 with 6 rules applied. Total rules applied 606 place count 180 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 6 rules applied. Total rules applied 612 place count 178 transition count 340
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 616 place count 176 transition count 338
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 620 place count 174 transition count 336
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 633 place count 174 transition count 323
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 640 place count 174 transition count 316
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 647 place count 167 transition count 316
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 649 place count 166 transition count 315
Applied a total of 649 rules in 50 ms. Remains 166 /476 variables (removed 310) and now considering 315/675 (removed 360) transitions.
[2026-05-23 08:24:41] [INFO ] Flow matrix only has 289 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-14939543495321233148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-407181703899472711.kers'
[2026-05-23 08:24:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14939543495321233148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-407181703899472711.kers]
Normalized transition count is 288 out of 289 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 166 cols 700 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-23 08:24:41] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-407181703899472711.kers
Total runtime 2 ms.
[2026-05-23 08:24:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 08:24:41] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-23 08:24:41] [INFO ] Invariant cache hit.
[2026-05-23 08:24:41] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-23 08:24:41] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-23 08:24:41] [INFO ] Redundant transitions in 1 ms returned []
Running 314 sub problems to find dead transitions.
[2026-05-23 08:24:41] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-23 08:24:41] [INFO ] Invariant cache hit.
[2026-05-23 08:24:41] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 288/454 variables, 166/172 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 62/234 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/455 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 235 constraints, problems are : Problem set: 0 solved, 314 unsolved in 19023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 288/454 variables, 166/172 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 62/234 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 314/548 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/455 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 549 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49072ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 49072ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/476 places, 315/675 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49343 ms. Remains : 166/476 places, 315/675 transitions.
[2026-05-23 08:25:30] [INFO ] Flatten gal took : 2 ms
[2026-05-23 08:25:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:25:30] [INFO ] Input system was already deterministic with 315 transitions.
[2026-05-23 08:25:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:25:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:25:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16120103651241818761.gal : 1 ms
[2026-05-23 08:25:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14224034230918857784.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/CTLCardinality16120103651241818761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14224034230918857784.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.04343e+08,0.161216,10384,2,2165,5,24180,6,0,970,19717,0


Converting to forward existential form...Done !
original formula: EF(EG(((p3==0)||(p368==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p3==0)||(p368==1)))] != FALSE
Hit Full ! (commute/partial/dont) 311/0/4
(forward)formula 0,1,1.05788,43112,1,0,12,228723,19,3,4872,57153,12
FORMULA CO4-PT-16-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 08:25:31] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:25:31] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:25:31] [INFO ] Applying decomposition
[2026-05-23 08:25:31] [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/graph5159645160794773364.txt' '-o' '/tmp/graph5159645160794773364.bin' '-w' '/tmp/graph5159645160794773364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5159645160794773364.bin' '-l' '-1' '-v' '-w' '/tmp/graph5159645160794773364.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:25:31] [INFO ] Decomposing Gal with order
[2026-05-23 08:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:25:31] [INFO ] Removed a total of 425 redundant transitions.
[2026-05-23 08:25:31] [INFO ] Flatten gal took : 20 ms
[2026-05-23 08:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 4 ms.
[2026-05-23 08:25:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1293026273382601310.gal : 4 ms
[2026-05-23 08:25:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14540605097747733861.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/CTLCardinality1293026273382601310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14540605097747733861.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 3 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.09307e+12,0.860277,35876,1571,176,56426,4765,1086,137316,134,32408,0


Converting to forward existential form...Done !
original formula: EF(((i5.u35.p233==1) * ((AX(AF((i9.u82.p435==0))) + (i18.u146.p722==0)) + (((i4.i1.i2.u45.p269==0)&&(i15.u119.p569==1))&&((i6.u2.p4==0)&&...176
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (i5.u35.p233==1)) * !(EX(!(!(EG(!((i9.u82.p435==0))))))))] != FALSE + [((FwdU(Init,TRUE) ...344
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t92, t126, t157, t240, t283, t294, t354, t489, t527, t587, t618, t628, t629, t630, t...1147
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,48.8813,1051856,1,0,1.05368e+06,4765,6325,8.72477e+06,612,32408,1072358
FORMULA CO4-PT-16-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AF((((i14.u111.p544==1) * (AG(((i9.u73.p406==0)||(i14.u112.p548==1))) + A((i14.u114.p563==1) U ((i11.u128.p599==0)||(i15.u120.p576==1)...203
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((i14.u111.p544==1) * (!(E(TRUE U !(((i9.u73.p406==0)||(i14.u112.p548==1))))) + !((E(!(((i11....373
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 1,0,567.909,3231604,1,0,3.20508e+06,4765,2393,2.2455e+07,269,32408,1328632
FORMULA CO4-PT-16-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EX(AG(AX(FALSE))) U ((!(EX(((i11.u100.p507==1)&&((i5.u8.p110==0)||(i1.u22.p177==1))))) * (EF(AG((i18.u157.p760==1))) + (i2.u30.p203==1)...198
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(((i11.u100.p507==1)&&((i5.u8.p110==0)||(i1.u22.p177==1))))) * (E(TRUE U !(E(TRUE U !((i1...661
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 2,0,1024.52,4412024,1,0,4.1718e+06,4765,2388,3.18928e+07,269,32408,3184676
FORMULA CO4-PT-16-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1779525757768

--------------------
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-16"
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-16, 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-177946967700401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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