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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:34 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 344K 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-21-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779527474274

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-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 09:11:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 09:11:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:11:15] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-23 09:11:15] [INFO ] Transformed 1400 places.
[2026-05-23 09:11:15] [INFO ] Transformed 1583 transitions.
[2026-05-23 09:11:15] [INFO ] Found NUPN structural information;
[2026-05-23 09:11:15] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 307 places in 17 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1072 transition count 1232
Discarding 155 places :
Symmetric choice reduction at 1 with 155 rule applications. Total rules 180 place count 917 transition count 1077
Iterating global reduction 1 with 155 rules applied. Total rules applied 335 place count 917 transition count 1077
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 467 place count 785 transition count 945
Iterating global reduction 1 with 132 rules applied. Total rules applied 599 place count 785 transition count 945
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 602 place count 785 transition count 942
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 669 place count 718 transition count 875
Iterating global reduction 2 with 67 rules applied. Total rules applied 736 place count 718 transition count 875
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 781 place count 673 transition count 830
Iterating global reduction 2 with 45 rules applied. Total rules applied 826 place count 673 transition count 830
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 828 place count 673 transition count 828
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 853 place count 648 transition count 803
Iterating global reduction 3 with 25 rules applied. Total rules applied 878 place count 648 transition count 803
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 880 place count 648 transition count 801
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 888 place count 640 transition count 793
Iterating global reduction 4 with 8 rules applied. Total rules applied 896 place count 640 transition count 793
Applied a total of 896 rules in 380 ms. Remains 640 /1093 variables (removed 453) and now considering 793/1236 (removed 443) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17994091163924111222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13292424502520054398.kers'
[2026-05-23 09:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17994091163924111222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13292424502520054398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 793 rows 640 cols 1772 entries
Finished phase 1 with 635 SingleSign rule and 0 generalized
[2026-05-23 09:11:16] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13292424502520054398.kers
Total runtime 4 ms.
[2026-05-23 09:11:16] [INFO ] Implicit Places using invariants in 396 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 639/1093 places, 793/1236 transitions.
Applied a total of 0 rules in 15 ms. Remains 639 /639 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 872 ms. Remains : 639/1093 places, 793/1236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 transitions.
Applied a total of 0 rules in 14 ms. Remains 639 /639 variables (removed 0) and now considering 793/793 (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-8380500148031883905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4846767367952420436.kers'
[2026-05-23 09:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8380500148031883905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4846767367952420436.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 793 rows 639 cols 1770 entries
Finished phase 1 with 635 SingleSign rule and 0 generalized
[2026-05-23 09:11:16] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4846767367952420436.kers
Total runtime 6 ms.
[2026-05-23 09:11:17] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-23 09:11:17] [INFO ] Invariant cache hit.
[2026-05-23 09:11:17] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2026-05-23 09:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/637 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/1432 variables, and 4 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/639 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/637 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/637 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (OVERLAPS) 793/1430 variables, 637/641 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 788/1429 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/1432 variables, and 1429 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 637/639 constraints, PredecessorRefiner: 788/792 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in LTL mode , in 1 iterations and 61219 ms. Remains : 639/639 places, 793/793 transitions.
Support contains 50 out of 639 places after structural reductions.
[2026-05-23 09:12:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-23 09:12:18] [INFO ] Flatten gal took : 65 ms
FORMULA CO4-PT-21-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:12:18] [INFO ] Flatten gal took : 34 ms
[2026-05-23 09:12:18] [INFO ] Input system was already deterministic with 793 transitions.
Support contains 32 out of 639 places (down from 50) after GAL structural reductions.
FORMULA CO4-PT-21-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (131 resets) in 2287 ms. (17 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (15 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (12 resets) in 101 ms. (39 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (17 resets) in 65 ms. (60 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (18 resets) in 64 ms. (61 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (16 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (18 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
[2026-05-23 09:12:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 56/84 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 225/309 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 493/802 variables, 213/295 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 18/820 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 10/830 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/830 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 377/1207 variables, 209/513 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1207 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 145/1352 variables, 78/591 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1352 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 63/1415 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1415 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 15/1430 variables, 11/641 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1430 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 2/1432 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1432 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 0/1432 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1432/1432 variables, and 643 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2823 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 639/639 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 56/84 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 225/309 variables, 54/84 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 493/802 variables, 213/314 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 18/820 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 10/830 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/830 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 377/1207 variables, 209/532 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1207 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 145/1352 variables, 78/610 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1352 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 63/1415 variables, 39/649 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1415 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 15/1430 variables, 11/660 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/1432 variables, and 660 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 637/639 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7843ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 793/793 transitions.
Graph (trivial) has 642 edges and 639 vertex of which 3 / 639 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 983 edges and 637 vertex of which 615 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 615 transition count 483
Reduce places removed 266 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 1 with 268 rules applied. Total rules applied 559 place count 349 transition count 481
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 564 place count 348 transition count 477
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 568 place count 344 transition count 477
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 568 place count 344 transition count 418
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 686 place count 285 transition count 418
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 689 place count 282 transition count 415
Iterating global reduction 4 with 3 rules applied. Total rules applied 692 place count 282 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 692 place count 282 transition count 414
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 694 place count 281 transition count 414
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 695 place count 280 transition count 413
Iterating global reduction 4 with 1 rules applied. Total rules applied 696 place count 280 transition count 413
Performed 93 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 882 place count 187 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 888 place count 187 transition count 297
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 894 place count 181 transition count 291
Iterating global reduction 5 with 6 rules applied. Total rules applied 900 place count 181 transition count 291
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 984 place count 139 transition count 295
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1004 place count 139 transition count 275
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 1030 place count 113 transition count 223
Iterating global reduction 6 with 26 rules applied. Total rules applied 1056 place count 113 transition count 223
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1070 place count 113 transition count 209
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1073 place count 110 transition count 200
Iterating global reduction 7 with 3 rules applied. Total rules applied 1076 place count 110 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1077 place count 110 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1081 place count 110 transition count 195
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1090 place count 110 transition count 186
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1100 place count 101 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1101 place count 101 transition count 184
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1106 place count 101 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 296 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 2 rules applied. Total rules applied 1108 place count 100 transition count 183
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1109 place count 100 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1110 place count 100 transition count 181
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1111 place count 100 transition count 181
Graph (complete) has 293 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 1112 place count 99 transition count 181
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1113 place count 99 transition count 180
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1114 place count 99 transition count 180
Graph (complete) has 290 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 1115 place count 98 transition count 180
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1116 place count 98 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1118 place count 98 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1119 place count 98 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1120 place count 97 transition count 177
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t70.t74.t699.t758 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 4 / 93 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
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 16 with 4 rules applied. Total rules applied 1124 place count 90 transition count 174
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 1131 place count 89 transition count 168
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1133 place count 87 transition count 165
Iterating global reduction 18 with 2 rules applied. Total rules applied 1135 place count 87 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1136 place count 87 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 19 with 24 rules applied. Total rules applied 1160 place count 87 transition count 140
Discarding 6 places :
Symmetric choice reduction at 19 with 6 rule applications. Total rules 1166 place count 81 transition count 134
Iterating global reduction 19 with 6 rules applied. Total rules applied 1172 place count 81 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 1177 place count 81 transition count 129
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1178 place count 80 transition count 128
Iterating global reduction 20 with 1 rules applied. Total rules applied 1179 place count 80 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1180 place count 80 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1181 place count 80 transition count 126
Free-agglomeration rule applied 18 times.
Iterating global reduction 21 with 18 rules applied. Total rules applied 1199 place count 80 transition count 108
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 21 with 18 rules applied. Total rules applied 1217 place count 62 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 1221 place count 62 transition count 104
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 1223 place count 62 transition count 102
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1226 place count 60 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 1227 place count 60 transition count 100
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 23 with 4 rules applied. Total rules applied 1231 place count 60 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1232 place count 60 transition count 99
Applied a total of 1232 rules in 185 ms. Remains 60 /639 variables (removed 579) and now considering 99/793 (removed 694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 60/639 places, 99/793 transitions.
RANDOM walk for 40000 steps (8 resets) in 434 ms. (91 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/2 properties
[2026-05-23 09:12:27] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-614120525618861635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16935441278879426606.kers'
[2026-05-23 09:12:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-614120525618861635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16935441278879426606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 60 cols 237 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-23 09:12:27] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16935441278879426606.kers
Total runtime 3 ms.
[2026-05-23 09:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/107 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/142 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/144 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/152 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/107 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/142 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/144 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/152 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/152 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 5 ms.
[2026-05-23 09:12:27] [INFO ] Flatten gal took : 27 ms
[2026-05-23 09:12:27] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:12:27] [INFO ] Input system was already deterministic with 793 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 986 edges and 639 vertex of which 625 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 639/639 places, 793/793 transitions.
Graph (trivial) has 683 edges and 639 vertex of which 3 / 639 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 984 edges and 637 vertex of which 623 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 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 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 285 rules applied. Total rules applied 287 place count 622 transition count 490
Reduce places removed 284 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 1 with 286 rules applied. Total rules applied 573 place count 338 transition count 488
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 576 place count 337 transition count 486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 578 place count 335 transition count 486
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 578 place count 335 transition count 426
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 698 place count 275 transition count 426
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 702 place count 271 transition count 422
Iterating global reduction 4 with 4 rules applied. Total rules applied 706 place count 271 transition count 422
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 706 place count 271 transition count 419
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 712 place count 268 transition count 419
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 715 place count 265 transition count 416
Iterating global reduction 4 with 3 rules applied. Total rules applied 718 place count 265 transition count 416
Performed 39 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 796 place count 226 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 798 place count 226 transition count 372
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 804 place count 220 transition count 366
Iterating global reduction 5 with 6 rules applied. Total rules applied 810 place count 220 transition count 366
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 5 with 2 rules applied. Total rules applied 812 place count 219 transition count 365
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 813 place count 218 transition count 364
Iterating global reduction 5 with 1 rules applied. Total rules applied 814 place count 218 transition count 364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 815 place count 217 transition count 362
Iterating global reduction 5 with 1 rules applied. Total rules applied 816 place count 217 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 817 place count 217 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 836 place count 217 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 847 place count 217 transition count 331
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 858 place count 206 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 858 place count 206 transition count 330
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 860 place count 205 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 862 place count 204 transition count 329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 864 place count 202 transition count 327
Applied a total of 864 rules in 98 ms. Remains 202 /639 variables (removed 437) and now considering 327/793 (removed 466) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1066548996220544072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2866119490295823270.kers'
[2026-05-23 09:12:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1066548996220544072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2866119490295823270.kers]
Normalized transition count is 326 out of 327 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 202 cols 793 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-23 09:12:27] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2866119490295823270.kers
Total runtime 2 ms.
[2026-05-23 09:12:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 09:12:27] [INFO ] Invariant cache hit.
[2026-05-23 09:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:12:27] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-23 09:12:28] [INFO ] Redundant transitions in 17 ms returned []
Running 314 sub problems to find dead transitions.
[2026-05-23 09:12:28] [INFO ] Invariant cache hit.
[2026-05-23 09:12:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 326/528 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/529 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 207 constraints, problems are : Problem set: 0 solved, 314 unsolved in 23117 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 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/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 326/528 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 314/520 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 1/529 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 521 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53182ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 53184ms
Starting structural reductions in SI_CTL mode, iteration 1 : 202/639 places, 327/793 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53503 ms. Remains : 202/639 places, 327/793 transitions.
[2026-05-23 09:13:21] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:13:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:13:21] [INFO ] Input system was already deterministic with 327 transitions.
[2026-05-23 09:13:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:13:21] [INFO ] Flatten gal took : 23 ms
[2026-05-23 09:13:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16969453377995143301.gal : 7 ms
[2026-05-23 09:13:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6014944193382615656.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/CTLCardinality16969453377995143301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6014944193382615656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF(AG(!(E((p1163==1) U A((p1011==0) U (p305==1)))))) * AF((p1101==0)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(!(E((p1163==1) U !((E(!((p305==1)) U (!((p1011==0)) * !((p305==1)))) + EG(!((p...221
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t34, t60, t73, t78, t93, t107, t112, t167, t187, t324, Intersection with reachable ...226
(forward)formula 0,1,11.9849,377716,1,0,727,2.334e+06,697,387,7202,2.10597e+06,1071
FORMULA CO4-PT-21-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 639/639 places, 793/793 transitions.
Graph (trivial) has 685 edges and 639 vertex of which 3 / 639 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 984 edges and 637 vertex of which 624 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 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 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 623 transition count 487
Reduce places removed 288 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 1 with 290 rules applied. Total rules applied 581 place count 335 transition count 485
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 583 place count 334 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 584 place count 333 transition count 484
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 584 place count 333 transition count 424
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 704 place count 273 transition count 424
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 707 place count 270 transition count 421
Iterating global reduction 4 with 3 rules applied. Total rules applied 710 place count 270 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 710 place count 270 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 714 place count 268 transition count 419
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 716 place count 266 transition count 417
Iterating global reduction 4 with 2 rules applied. Total rules applied 718 place count 266 transition count 417
Performed 41 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 800 place count 225 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 802 place count 225 transition count 371
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 809 place count 218 transition count 364
Iterating global reduction 5 with 7 rules applied. Total rules applied 816 place count 218 transition count 364
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 5 with 2 rules applied. Total rules applied 818 place count 217 transition count 363
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 819 place count 216 transition count 362
Iterating global reduction 5 with 1 rules applied. Total rules applied 820 place count 216 transition count 362
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 821 place count 215 transition count 360
Iterating global reduction 5 with 1 rules applied. Total rules applied 822 place count 215 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 823 place count 215 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 842 place count 215 transition count 340
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 853 place count 215 transition count 329
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 864 place count 204 transition count 329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 864 place count 204 transition count 328
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 866 place count 203 transition count 328
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 8 with 2 rules applied. Total rules applied 868 place count 202 transition count 327
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 870 place count 202 transition count 327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 872 place count 200 transition count 325
Applied a total of 872 rules in 73 ms. Remains 200 /639 variables (removed 439) and now considering 325/793 (removed 468) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5793461965083043761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10744410576726298186.kers'
[2026-05-23 09:13:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5793461965083043761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10744410576726298186.kers]
Normalized transition count is 324 out of 325 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 200 cols 789 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-23 09:13:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10744410576726298186.kers
Total runtime 2 ms.
[2026-05-23 09:13:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 09:13:33] [INFO ] Invariant cache hit.
[2026-05-23 09:13:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:13:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2026-05-23 09:13:33] [INFO ] Redundant transitions in 4 ms returned []
Running 312 sub problems to find dead transitions.
[2026-05-23 09:13:33] [INFO ] Invariant cache hit.
[2026-05-23 09:13:33] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 324/524 variables, 200/204 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 1/525 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 206 constraints, problems are : Problem set: 0 solved, 312 unsolved in 22814 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 324/524 variables, 200/204 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 312/517 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 1/525 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 518 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52868ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 52870ms
Starting structural reductions in SI_CTL mode, iteration 1 : 200/639 places, 325/793 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53156 ms. Remains : 200/639 places, 325/793 transitions.
[2026-05-23 09:14:26] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:14:26] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:14:26] [INFO ] Input system was already deterministic with 325 transitions.
[2026-05-23 09:14:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:14:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:14:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality10491849274295524910.gal : 3 ms
[2026-05-23 09:14:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality3245041445188161663.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/CTLCardinality10491849274295524910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3245041445188161663.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(E((p1221!=1) U EG(((p724==0)||(p1179==1)))))
=> equivalent forward existential formula: [FwdG(Init,E((p1221!=1) U EG(((p724==0)||(p1179==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t16, t32, t56, t70, t75, t90, t104, t109, t163, t184, t321, Intersection with reachable ...226
(forward)formula 0,1,13.8254,438052,1,0,688,2.28162e+06,679,428,6780,2.8834e+06,1051
FORMULA CO4-PT-21-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 639/639 places, 793/793 transitions.
Graph (trivial) has 684 edges and 639 vertex of which 3 / 639 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 984 edges and 637 vertex of which 624 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 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 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 286 rules applied. Total rules applied 288 place count 623 transition count 490
Reduce places removed 285 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 1 with 287 rules applied. Total rules applied 575 place count 338 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 576 place count 337 transition count 488
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 576 place count 337 transition count 428
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 696 place count 277 transition count 428
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 700 place count 273 transition count 424
Iterating global reduction 3 with 4 rules applied. Total rules applied 704 place count 273 transition count 424
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 704 place count 273 transition count 421
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 710 place count 270 transition count 421
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 713 place count 267 transition count 418
Iterating global reduction 3 with 3 rules applied. Total rules applied 716 place count 267 transition count 418
Performed 39 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 794 place count 228 transition count 377
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 796 place count 228 transition count 375
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 803 place count 221 transition count 368
Iterating global reduction 4 with 7 rules applied. Total rules applied 810 place count 221 transition count 368
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 4 with 2 rules applied. Total rules applied 812 place count 220 transition count 367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 813 place count 219 transition count 366
Iterating global reduction 4 with 1 rules applied. Total rules applied 814 place count 219 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 815 place count 218 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 218 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 817 place count 218 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 834 place count 218 transition count 346
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 9 rules applied. Total rules applied 843 place count 218 transition count 337
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 852 place count 209 transition count 337
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 852 place count 209 transition count 336
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 854 place count 208 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 856 place count 207 transition count 335
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 857 place count 207 transition count 335
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 859 place count 205 transition count 333
Applied a total of 859 rules in 80 ms. Remains 205 /639 variables (removed 434) and now considering 333/793 (removed 460) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10362822281713212279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9068209123434536049.kers'
[2026-05-23 09:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10362822281713212279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9068209123434536049.kers]
Normalized transition count is 332 out of 333 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 205 cols 803 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 09:14:40] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9068209123434536049.kers
Total runtime 1 ms.
[2026-05-23 09:14:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 09:14:40] [INFO ] Invariant cache hit.
[2026-05-23 09:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:14:40] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2026-05-23 09:14:40] [INFO ] Redundant transitions in 4 ms returned []
Running 320 sub problems to find dead transitions.
[2026-05-23 09:14:40] [INFO ] Invariant cache hit.
[2026-05-23 09:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 332/537 variables, 205/209 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 1/538 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/538 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 210 constraints, problems are : Problem set: 0 solved, 320 unsolved in 23636 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 332/537 variables, 205/209 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 320/529 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 1/538 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 530 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53687ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 53688ms
Starting structural reductions in SI_CTL mode, iteration 1 : 205/639 places, 333/793 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53970 ms. Remains : 205/639 places, 333/793 transitions.
[2026-05-23 09:15:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:34] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-23 09:15:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality4003047708103209841.gal : 2 ms
[2026-05-23 09:15:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15543545545469221400.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/CTLCardinality4003047708103209841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15543545545469221400.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,2.05714e+08,0.21302,12004,2,1554,5,31390,6,0,1139,31915,0


Converting to forward existential form...Done !
original formula: (AG((p1334!=1)) * (EG(((p1084!=1)||(p1083!=0))) + AG((p603!=1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p1334!=1)))] = FALSE * [(FwdU((Init * !(EG(((p1084!=1)||(p1083!=0))))),TRUE) * !((p603!=...169
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t21, t38, t62, t75, t81, t95, t109, t114, t168, t189, Intersection with reachable a...225
(forward)formula 0,0,11.2204,303628,1,0,620,1.85602e+06,691,332,6937,1.72295e+06,967
FORMULA CO4-PT-21-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 639/639 places, 793/793 transitions.
Graph (trivial) has 670 edges and 639 vertex of which 3 / 639 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 984 edges and 637 vertex of which 623 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 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 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 280 rules applied. Total rules applied 282 place count 622 transition count 495
Reduce places removed 279 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 1 with 281 rules applied. Total rules applied 563 place count 343 transition count 493
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 565 place count 342 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 566 place count 341 transition count 492
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 566 place count 341 transition count 432
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 686 place count 281 transition count 432
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 689 place count 278 transition count 429
Iterating global reduction 4 with 3 rules applied. Total rules applied 692 place count 278 transition count 429
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 692 place count 278 transition count 427
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 696 place count 276 transition count 427
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 698 place count 274 transition count 425
Iterating global reduction 4 with 2 rules applied. Total rules applied 700 place count 274 transition count 425
Performed 39 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 778 place count 235 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 780 place count 235 transition count 381
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 787 place count 228 transition count 374
Iterating global reduction 5 with 7 rules applied. Total rules applied 794 place count 228 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 796 place count 227 transition count 373
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 797 place count 226 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 798 place count 226 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 799 place count 225 transition count 370
Iterating global reduction 5 with 1 rules applied. Total rules applied 800 place count 225 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 801 place count 225 transition count 369
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 820 place count 225 transition count 350
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 831 place count 225 transition count 339
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 842 place count 214 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 842 place count 214 transition count 338
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 844 place count 213 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 846 place count 212 transition count 337
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 848 place count 212 transition count 337
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 850 place count 210 transition count 335
Applied a total of 850 rules in 59 ms. Remains 210 /639 variables (removed 429) and now considering 335/793 (removed 458) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13597732676450526168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17029212867951308753.kers'
[2026-05-23 09:15:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13597732676450526168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17029212867951308753.kers]
Normalized transition count is 334 out of 335 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 210 cols 809 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-23 09:15:45] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17029212867951308753.kers
Total runtime 1 ms.
[2026-05-23 09:15:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 09:15:46] [INFO ] Invariant cache hit.
[2026-05-23 09:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:15:46] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2026-05-23 09:15:46] [INFO ] Redundant transitions in 2 ms returned []
Running 322 sub problems to find dead transitions.
[2026-05-23 09:15:46] [INFO ] Invariant cache hit.
[2026-05-23 09:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 334/544 variables, 210/214 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 1/545 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 215 constraints, problems are : Problem set: 0 solved, 322 unsolved in 23620 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/210 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 334/544 variables, 210/214 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 322/536 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (OVERLAPS) 1/545 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 537 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/210 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53669ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 53669ms
Starting structural reductions in SI_CTL mode, iteration 1 : 210/639 places, 335/793 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53916 ms. Remains : 210/639 places, 335/793 transitions.
[2026-05-23 09:16:39] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:16:39] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:16:39] [INFO ] Input system was already deterministic with 335 transitions.
[2026-05-23 09:16:39] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:16:39] [INFO ] Flatten gal took : 20 ms
[2026-05-23 09:16:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality15519251089295496989.gal : 1 ms
[2026-05-23 09:16:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9962656687652427560.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/CTLCardinality15519251089295496989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9962656687652427560.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((((p1027==0)||(p615==0)) + ((p1229==1) + EG(((p396==0)&&(p319==1))))) + ((AF((p604==1)) + (p125==0)) + !(A(((p1007==0)||(p232==1)) U ...183
=> equivalent forward existential formula: [FwdG(Init,((((p1027==0)||(p615==0)) + ((p1229==1) + EG(((p396==0)&&(p319==1))))) + ((!(EG(!((p604==1)))) + (p12...307
Reverse transition relation is NOT exact ! Due to transitions t4, t16, t33, t58, t71, t79, t94, t112, t117, t173, t194, t331, Intersection with reachable ...226
(forward)formula 0,1,23.5308,652384,1,0,998,3.58434e+06,714,600,7036,4.14713e+06,1465
FORMULA CO4-PT-21-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 638 transition count 792
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 611 transition count 764
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 611 transition count 764
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 71 place count 596 transition count 749
Iterating global reduction 1 with 15 rules applied. Total rules applied 86 place count 596 transition count 749
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 590 transition count 743
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 590 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 587 transition count 740
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 587 transition count 740
Applied a total of 104 rules in 65 ms. Remains 587 /639 variables (removed 52) and now considering 740/793 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12997014156576856911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5160463546877624698.kers'
[2026-05-23 09:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12997014156576856911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5160463546877624698.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 740 rows 587 cols 1662 entries
Finished phase 1 with 583 SingleSign rule and 0 generalized
[2026-05-23 09:17:03] [INFO ] Computed 4 invariants in 6 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5160463546877624698.kers
Total runtime 9 ms.
[2026-05-23 09:17:03] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-23 09:17:03] [INFO ] Invariant cache hit.
[2026-05-23 09:17:04] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 739 sub problems to find dead transitions.
[2026-05-23 09:17:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 740/1326 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1326/1327 variables, and 590 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/587 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 739 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 740/1326 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1326 variables, 738/1328 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/1327 variables, and 1330 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/587 constraints, PredecessorRefiner: 738/739 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 739 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 587/639 places, 740/793 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 587/639 places, 740/793 transitions.
[2026-05-23 09:18:04] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:18:04] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:18:04] [INFO ] Input system was already deterministic with 740 transitions.
[2026-05-23 09:18:04] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:18:04] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:18:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality737680237111212367.gal : 2 ms
[2026-05-23 09:18:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality209195161634936824.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/CTLCardinality737680237111212367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality209195161634936824.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.45809e+10,3.40915,94072,2,11281,5,278807,6,0,3083,491590,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:18:34] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:18:34] [INFO ] Applying decomposition
[2026-05-23 09:18:34] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10068551372411124042.txt' '-o' '/tmp/graph10068551372411124042.bin' '-w' '/tmp/graph10068551372411124042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10068551372411124042.bin' '-l' '-1' '-v' '-w' '/tmp/graph10068551372411124042.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:18:34] [INFO ] Decomposing Gal with order
[2026-05-23 09:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:18:34] [INFO ] Removed a total of 232 redundant transitions.
[2026-05-23 09:18:34] [INFO ] Flatten gal took : 153 ms
[2026-05-23 09:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2026-05-23 09:18:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality8604128713376920417.gal : 12 ms
[2026-05-23 09:18:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4895635469749368044.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/CTLCardinality8604128713376920417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4895635469749368044.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,9.45809e+10,0.30472,15444,848,102,20890,1858,1301,34305,90,6945,0


Converting to forward existential form...Done !
original formula: (AG(EX(EX(AG(((i21.u221.p1315==0)||(i17.i0.i0.u172.p1072==1)))))) + EG((i3.i1.i1.u28.p251==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((i3.i1.i1.u28.p251==1)))),TRUE) * !(EX(EX(!(E(TRUE U !(((i21.u221.p1315==0)||(i17.i0.i0.u172...182
Reverse transition relation is NOT exact ! Due to transitions t50, t62, t106, t190, t287, t307, t392, t432, t500, t534, t546, t554, t578, t618, t627, t654,...853
Using saturation style SCC detection
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 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,0,17.0098,475144,1,0,672681,6245,10657,3.10568e+06,525,30541,576079
FORMULA CO4-PT-21-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 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 637 transition count 792
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 608 transition count 762
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 608 transition count 762
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 592 transition count 746
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 592 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 592 transition count 745
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 586 transition count 739
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 586 transition count 739
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 583 transition count 736
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 583 transition count 736
Applied a total of 112 rules in 63 ms. Remains 583 /639 variables (removed 56) and now considering 736/793 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15734989185613221133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4091098152643296327.kers'
[2026-05-23 09:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15734989185613221133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4091098152643296327.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 736 rows 583 cols 1654 entries
Finished phase 1 with 579 SingleSign rule and 0 generalized
[2026-05-23 09:18:52] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4091098152643296327.kers
Total runtime 10 ms.
[2026-05-23 09:18:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 09:18:52] [INFO ] Invariant cache hit.
[2026-05-23 09:18:52] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2026-05-23 09:18:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 583/639 places, 736/793 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 583/639 places, 736/793 transitions.
[2026-05-23 09:19:52] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:19:52] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:19:52] [INFO ] Input system was already deterministic with 736 transitions.
[2026-05-23 09:19:52] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:19:52] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:19:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10707068805334070339.gal : 3 ms
[2026-05-23 09:19:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1903420110005344876.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/CTLCardinality10707068805334070339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1903420110005344876.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,8.66365e+10,2.99139,94176,2,11501,5,278103,6,0,3066,489052,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,3.10946,94176,1,0,6,278103,7,1,3708,489052,1
FORMULA CO4-PT-21-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 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 637 transition count 792
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 609 transition count 763
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 609 transition count 763
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 593 transition count 747
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 593 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 593 transition count 746
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 587 transition count 740
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 587 transition count 740
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 584 transition count 737
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 584 transition count 737
Applied a total of 110 rules in 62 ms. Remains 584 /639 variables (removed 55) and now considering 737/793 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7172806890397858870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10822784965751583685.kers'
[2026-05-23 09:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7172806890397858870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10822784965751583685.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 737 rows 584 cols 1656 entries
Finished phase 1 with 580 SingleSign rule and 0 generalized
[2026-05-23 09:19:55] [INFO ] Computed 4 invariants in 6 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10822784965751583685.kers
Total runtime 8 ms.
[2026-05-23 09:19:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-23 09:19:55] [INFO ] Invariant cache hit.
[2026-05-23 09:19:56] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 736 sub problems to find dead transitions.
[2026-05-23 09:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (OVERLAPS) 1/584 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 737/1321 variables, 584/588 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 588 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 736 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (OVERLAPS) 1/584 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (OVERLAPS) 737/1321 variables, 584/588 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1321 variables, 736/1324 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1324 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 736 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 584/639 places, 737/793 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 584/639 places, 737/793 transitions.
[2026-05-23 09:20:56] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:20:56] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:20:56] [INFO ] Input system was already deterministic with 737 transitions.
[2026-05-23 09:20:56] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:20:56] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:20:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality5302248916288308499.gal : 2 ms
[2026-05-23 09:20:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9271656527923121799.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/CTLCardinality5302248916288308499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9271656527923121799.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.7189e+10,2.91025,90796,2,11188,5,272409,6,0,3071,478494,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:21:26] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:21:26] [INFO ] Applying decomposition
[2026-05-23 09:21:26] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6410830583876439745.txt' '-o' '/tmp/graph6410830583876439745.bin' '-w' '/tmp/graph6410830583876439745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6410830583876439745.bin' '-l' '-1' '-v' '-w' '/tmp/graph6410830583876439745.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:21:26] [INFO ] Decomposing Gal with order
[2026-05-23 09:21:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:21:26] [INFO ] Removed a total of 227 redundant transitions.
[2026-05-23 09:21:26] [INFO ] Flatten gal took : 24 ms
[2026-05-23 09:21:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-23 09:21:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality12384578033090394472.gal : 7 ms
[2026-05-23 09:21:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7023445442888439661.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/CTLCardinality12384578033090394472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7023445442888439661.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,8.7189e+10,0.53174,23616,1197,122,31931,2241,1285,100917,98,8938,0


Converting to forward existential form...Done !
original formula: EF(AG(AX((i10.i0.i1.u104.p788==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((i10.i0.i1.u104.p788==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t272, t284, t304, t344, t378, t390, t419, t498, t544, t587, t624, t651, t652...913
(forward)formula 0,1,1.75349,65128,1,0,102409,3047,8681,349101,511,13527,266295
FORMULA CO4-PT-21-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 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 637 transition count 792
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 608 transition count 762
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 608 transition count 762
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 592 transition count 746
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 592 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 592 transition count 745
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 586 transition count 739
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 586 transition count 739
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 583 transition count 736
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 583 transition count 736
Applied a total of 112 rules in 62 ms. Remains 583 /639 variables (removed 56) and now considering 736/793 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15302967994389941440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6232009898831384397.kers'
[2026-05-23 09:21:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15302967994389941440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6232009898831384397.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 736 rows 583 cols 1654 entries
Finished phase 1 with 579 SingleSign rule and 0 generalized
[2026-05-23 09:21:28] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6232009898831384397.kers
Total runtime 11 ms.
[2026-05-23 09:21:28] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 09:21:28] [INFO ] Invariant cache hit.
[2026-05-23 09:21:28] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2026-05-23 09:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 583/639 places, 736/793 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60617 ms. Remains : 583/639 places, 736/793 transitions.
[2026-05-23 09:22:29] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:22:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:22:29] [INFO ] Input system was already deterministic with 736 transitions.
[2026-05-23 09:22:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:22:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:22:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8174047017687415241.gal : 3 ms
[2026-05-23 09:22:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16266723171631599411.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/CTLCardinality8174047017687415241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16266723171631599411.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,8.66365e+10,3.4667,94256,2,11501,5,278103,6,0,3066,489052,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:22:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:22:59] [INFO ] Applying decomposition
[2026-05-23 09:22:59] [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/graph277561451518742830.txt' '-o' '/tmp/graph277561451518742830.bin' '-w' '/tmp/graph277561451518742830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph277561451518742830.bin' '-l' '-1' '-v' '-w' '/tmp/graph277561451518742830.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:22:59] [INFO ] Decomposing Gal with order
[2026-05-23 09:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:22:59] [INFO ] Removed a total of 222 redundant transitions.
[2026-05-23 09:22:59] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:22:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2026-05-23 09:22:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3846395481916469910.gal : 5 ms
[2026-05-23 09:22:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5537579831999371802.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/CTLCardinality3846395481916469910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5537579831999371802.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,8.66365e+10,0.444722,18620,1123,109,24838,2142,1243,57663,92,8060,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t272, t284, t304, t343, t398, t418, t456, t497, t543, t552, t574, t614, t623...869
Using 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 an SCC at level 6
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 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 637 transition count 792
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 611 transition count 765
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 611 transition count 765
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 68 place count 598 transition count 752
Iterating global reduction 1 with 13 rules applied. Total rules applied 81 place count 598 transition count 752
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 598 transition count 751
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 593 transition count 746
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 593 transition count 746
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 591 transition count 744
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 591 transition count 744
Applied a total of 96 rules in 58 ms. Remains 591 /639 variables (removed 48) and now considering 744/793 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15601439175300539226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16359642277818685236.kers'
[2026-05-23 09:23:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15601439175300539226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16359642277818685236.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 744 rows 591 cols 1670 entries
Finished phase 1 with 587 SingleSign rule and 0 generalized
[2026-05-23 09:23:29] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16359642277818685236.kers
Total runtime 4 ms.
[2026-05-23 09:23:29] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-23 09:23:29] [INFO ] Invariant cache hit.
[2026-05-23 09:23:29] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 743 sub problems to find dead transitions.
[2026-05-23 09:23:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 744/1335 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 595 constraints, problems are : Problem set: 0 solved, 743 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 744/1335 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1335 variables, 743/1338 constraints. Problems are: Problem set: 0 solved, 743 unsolved
SMT process timed out in 60152ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 591/639 places, 744/793 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60666 ms. Remains : 591/639 places, 744/793 transitions.
[2026-05-23 09:24:30] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:24:30] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:24:30] [INFO ] Input system was already deterministic with 744 transitions.
[2026-05-23 09:24:30] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:24:30] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:24:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7480160426588006723.gal : 2 ms
[2026-05-23 09:24:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality13134180869648721798.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/CTLCardinality7480160426588006723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13134180869648721798.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,8.97324e+10,3.32498,100324,2,11562,5,306550,6,0,3106,533943,0


Converting to forward existential form...Done !
original formula: (AF(AG(A(EX((p1171==1)) U (p957==1)))) + EG((((p944==0)||(p319==1)) * EX((p1039==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EG((((p944==0)||(p319==1)) * EX((p1039==1)))))),!(!(E(TRUE U !(!((E(!((p957==1)) U (!(EX((p1171=...212
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
Detected timeout of ITS tools.
[2026-05-23 09:25:00] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:25:00] [INFO ] Applying decomposition
[2026-05-23 09:25:00] [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/graph15013226317057475690.txt' '-o' '/tmp/graph15013226317057475690.bin' '-w' '/tmp/graph15013226317057475690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15013226317057475690.bin' '-l' '-1' '-v' '-w' '/tmp/graph15013226317057475690.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:25:00] [INFO ] Decomposing Gal with order
[2026-05-23 09:25:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:25:00] [INFO ] Removed a total of 221 redundant transitions.
[2026-05-23 09:25:00] [INFO ] Flatten gal took : 21 ms
[2026-05-23 09:25:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2026-05-23 09:25:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6592369574117607019.gal : 6 ms
[2026-05-23 09:25:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12729438620973399739.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/CTLCardinality6592369574117607019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12729438620973399739.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,8.97324e+10,0.370269,18580,963,110,25055,2072,1324,55715,95,8015,0


Converting to forward existential form...Done !
original formula: (AF(AG(A(EX((i19.u182.p1171==1)) U (i13.u135.p957==1)))) + EG((((i18.i1.i2.u133.p944==0)||(i6.i0.i0.u36.p319==1)) * EX((i15.i1.i0.u156.p1...166
=> equivalent forward existential formula: [FwdG((Init * !(EG((((i18.i1.i2.u133.p944==0)||(i6.i0.i0.u36.p319==1)) * EX((i15.i1.i0.u156.p1039==1)))))),!(!(E...291
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t190, t311, t350, t384, t396, t425, t463, t504, t550, t558, t561, t581, t621, t630...904
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 793/793 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 637 transition count 792
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 610 transition count 764
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 610 transition count 764
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 73 place count 594 transition count 748
Iterating global reduction 1 with 16 rules applied. Total rules applied 89 place count 594 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 594 transition count 747
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 588 transition count 741
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 588 transition count 741
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 585 transition count 738
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 585 transition count 738
Applied a total of 108 rules in 63 ms. Remains 585 /639 variables (removed 54) and now considering 738/793 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6593121808662351319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16021246935390110464.kers'
[2026-05-23 09:25:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6593121808662351319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16021246935390110464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 738 rows 585 cols 1658 entries
Finished phase 1 with 581 SingleSign rule and 0 generalized
[2026-05-23 09:25:30] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16021246935390110464.kers
Total runtime 5 ms.
[2026-05-23 09:25:30] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-23 09:25:30] [INFO ] Invariant cache hit.
[2026-05-23 09:25:30] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 737 sub problems to find dead transitions.
[2026-05-23 09:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 589 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1323 variables, 737/1326 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1327 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 737 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 585/639 places, 738/793 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 585/639 places, 738/793 transitions.
[2026-05-23 09:26:31] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:26:31] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:26:31] [INFO ] Input system was already deterministic with 738 transitions.
[2026-05-23 09:26:31] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:26:31] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:26:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1095378268266210812.gal : 2 ms
[2026-05-23 09:26:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality17053608843421383212.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/CTLCardinality1095378268266210812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17053608843421383212.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,8.75784e+10,3.19066,97752,2,11477,5,288241,6,0,3076,520869,0


Converting to forward existential form...Done !
original formula: A((p588==1) U EF(!(EX((p1272==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(EX((p1272==0)))))))) * !(E(!(E(TRUE U !(EX((p1272==0))))) U (!((p588==1)) * !(E(TRUE...191
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...546
Detected timeout of ITS tools.
[2026-05-23 09:27:01] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:27:01] [INFO ] Applying decomposition
[2026-05-23 09:27:01] [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/graph9157460459446417533.txt' '-o' '/tmp/graph9157460459446417533.bin' '-w' '/tmp/graph9157460459446417533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9157460459446417533.bin' '-l' '-1' '-v' '-w' '/tmp/graph9157460459446417533.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:27:01] [INFO ] Decomposing Gal with order
[2026-05-23 09:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:27:01] [INFO ] Removed a total of 225 redundant transitions.
[2026-05-23 09:27:01] [INFO ] Flatten gal took : 19 ms
[2026-05-23 09:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-23 09:27:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12134959731986072165.gal : 5 ms
[2026-05-23 09:27:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14597140520531188941.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/CTLCardinality12134959731986072165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14597140520531188941.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,8.75784e+10,0.507081,24552,1194,113,33766,2062,1315,105369,98,8480,0


Converting to forward existential form...Done !
original formula: A((i7.i0.i1.u73.p588==1) U EF(!(EX((i20.i1.i0.u209.p1272==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(EX((i20.i1.i0.u209.p1272==0)))))))) * !(E(!(E(TRUE U !(EX((i20.i1.i0.u209.p1272==0))...249
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t188, t305, t344, t390, t419, t458, t499, t545, t625, t652, t653, i0.i0.t585, i0.i...955
Using saturation style SCC detection
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 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,2.27153,98912,1,0,145431,3505,9702,627302,568,15335,331709
FORMULA CO4-PT-21-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-23 09:27:03] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:27:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:27:03] [INFO ] Applying decomposition
[2026-05-23 09:27:03] [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/graph3738059174570746924.txt' '-o' '/tmp/graph3738059174570746924.bin' '-w' '/tmp/graph3738059174570746924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3738059174570746924.bin' '-l' '-1' '-v' '-w' '/tmp/graph3738059174570746924.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:27:03] [INFO ] Decomposing Gal with order
[2026-05-23 09:27:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:27:03] [INFO ] Removed a total of 229 redundant transitions.
[2026-05-23 09:27:03] [INFO ] Flatten gal took : 19 ms
[2026-05-23 09:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-23 09:27:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality14433375706870986330.gal : 5 ms
[2026-05-23 09:27:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2483222653373321037.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/CTLCardinality14433375706870986330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2483222653373321037.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.68888e+11,0.640751,29676,1558,133,41707,2435,1311,135399,93,10198,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t69, t118, t207, t321, t332, t353, t364, t372, t420, t452, t519, t575, t596, t620, t621, t632...1324
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 a local 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
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,481.2,2631388,1,0,3.04497e+06,6769,2817,2.17333e+07,190,41416,986422
FORMULA CO4-PT-21-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(AG(A(EX((i21.u211.p1171==1)) U (i14.u157.p957==1)))) + EG((((i13.i1.i1.u155.p944==0)||(i4.u40.p319==1)) * EX((i17.u182.p1039==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EG((((i13.i1.i1.u155.p944==0)||(i4.u40.p319==1)) * EX((i17.u182.p1039==1)))))),!(!(E(TRUE U !(!(...279
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-23 09:35:25] [INFO ] Applying decomposition
[2026-05-23 09:35:25] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:35:25] [INFO ] Decomposing Gal with order
[2026-05-23 09:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:35:25] [INFO ] Removed a total of 85 redundant transitions.
[2026-05-23 09:35:25] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 6 ms.
[2026-05-23 09:35:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8674997759523472323.gal : 3 ms
[2026-05-23 09:35:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality7283657941691291721.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/CTLCardinality8674997759523472323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7283657941691291721.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.68888e+11,0.990099,38692,249,3713,4379,99197,247,9988,1732,344988,0


Converting to forward existential form...Done !
original formula: (AF(AG(A(EX((i0.i0.i1.u11.p1171==1)) U (i0.i0.i1.u11.p957==1)))) + EG((((i0.i0.i1.u11.p944==0)||(i0.i0.i0.i0.i0.u7.p319==1)) * EX((i0.i0....175
=> equivalent forward existential formula: [FwdG((Init * !(EG((((i0.i0.i1.u11.p944==0)||(i0.i0.i0.i0.i0.u7.p319==1)) * EX((i0.i0.i1.u11.p1039==1)))))),!(!(...308
Reverse transition relation is NOT exact ! Due to transitions i0.t700, i0.t671, i0.t57, i0.u13.t37, i0.u13.t44, i0.u13.t54, i0.u13.t55, i0.u13.t58, i0.u13....2083
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
(forward)formula 0,0,1263.03,7234792,1,0,1.42731e+06,2.31746e+07,826,5.3059e+06,7802,1.02399e+08,137917
FORMULA CO4-PT-21-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 2715750 ms.

BK_STOP 1779530191286

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

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