Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900105.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:25 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 48K 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 MedleyA-PT-02-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779698962420

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 08:49:24] [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-25 08:49:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:49:25] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2026-05-25 08:49:25] [INFO ] Transformed 69 places.
[2026-05-25 08:49:25] [INFO ] Transformed 168 transitions.
[2026-05-25 08:49:25] [INFO ] Found NUPN structural information;
[2026-05-25 08:49:25] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 52 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 67 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 159
Applied a total of 4 rules in 49 ms. Remains 67 /69 variables (removed 2) and now considering 159/162 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3587450276741519254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6534837392675674294.kers'
[2026-05-25 08:49:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3587450276741519254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6534837392675674294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 67 cols 593 entries
Finished phase 1 with 57 SingleSign rule and 1 generalized
[2026-05-25 08:49:25] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6534837392675674294.kers
Total runtime 1 ms.
[2026-05-25 08:49:25] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-05-25 08:49:25] [INFO ] Invariant cache hit.
[2026-05-25 08:49:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:49:26] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2026-05-25 08:49:26] [INFO ] Invariant cache hit.
[2026-05-25 08:49:26] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 159/226 variables, 67/89 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 60/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 149 constraints, problems are : Problem set: 0 solved, 158 unsolved in 15212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 159/226 variables, 67/89 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 60/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 158/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/226 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 314 constraints, problems are : Problem set: 0 solved, 158 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45681ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 45743ms
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 159/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47064 ms. Remains : 67/69 places, 159/162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2026-05-25 08:50:12] [INFO ] Invariant cache hit.
[2026-05-25 08:50:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 08:50:12] [INFO ] Invariant cache hit.
[2026-05-25 08:50:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:50:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 67/67 places, 159/159 transitions.
Support contains 52 out of 67 places after structural reductions.
[2026-05-25 08:50:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 08:50:12] [INFO ] Flatten gal took : 59 ms
FORMULA MedleyA-PT-02-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:50:12] [INFO ] Flatten gal took : 15 ms
[2026-05-25 08:50:12] [INFO ] Input system was already deterministic with 159 transitions.
RANDOM walk for 40000 steps (3985 resets) in 2642 ms. (15 steps per ms) remains 10/59 properties
BEST_FIRST walk for 40002 steps (722 resets) in 125 ms. (317 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (915 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (902 resets) in 288 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (918 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (893 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (925 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (895 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
[2026-05-25 08:50:14] [INFO ] Invariant cache hit.
[2026-05-25 08:50:14] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 45/63 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 158/223 variables, 65/74 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 60/134 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/226 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 136 constraints, problems are : Problem set: 1 solved, 6 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 47/57 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/63 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/65 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 158/223 variables, 65/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 60/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/140 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 2/144 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 1/146 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/223 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 3/226 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 2/152 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 152 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5290ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 281 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 56 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 56 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 55 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 55 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 54 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 54 transition count 135
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 0 with 2 rules applied. Total rules applied 27 place count 53 transition count 134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 49 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 57 place count 49 transition count 133
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 49 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 61 place count 47 transition count 132
Applied a total of 61 rules in 82 ms. Remains 47 /67 variables (removed 20) and now considering 132/159 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 47/67 places, 132/159 transitions.
RANDOM walk for 40000 steps (5751 resets) in 416 ms. (95 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (1711 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1745 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11037662822511223633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15283820423289799229.kers'
[2026-05-25 08:50:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11037662822511223633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15283820423289799229.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 47 cols 545 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 08:50:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15283820423289799229.kers
Total runtime 1 ms.
[2026-05-25 08:50:19] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/43 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 131/176 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 60/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/179 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/43 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 131/176 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 60/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/179 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/179 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 120 constraints, problems are : Problem set: 0 solved, 2 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1047ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 132/132 transitions.
Graph (complete) has 224 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 44 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 44 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 43 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 43 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 42 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 42 transition count 118
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 39 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 37 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 36 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 36 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 36 transition count 114
Applied a total of 22 rules in 14 ms. Remains 36 /47 variables (removed 11) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 36/47 places, 114/132 transitions.
RANDOM walk for 30616 steps (6544 resets) in 677 ms. (45 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:50:21] [INFO ] Flatten gal took : 38 ms
[2026-05-25 08:50:21] [INFO ] Flatten gal took : 22 ms
[2026-05-25 08:50:21] [INFO ] Input system was already deterministic with 159 transitions.
Computed a total of 19 stabilizing places and 68 stable transitions
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 52 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 52 transition count 130
Applied a total of 30 rules in 2 ms. Remains 52 /67 variables (removed 15) and now considering 130/159 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7209692084057215007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5136076632401464225.kers'
[2026-05-25 08:50:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7209692084057215007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5136076632401464225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 52 cols 498 entries
Finished phase 1 with 42 SingleSign rule and 1 generalized
[2026-05-25 08:50:21] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5136076632401464225.kers
Total runtime 1 ms.
[2026-05-25 08:50:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 08:50:21] [INFO ] Invariant cache hit.
[2026-05-25 08:50:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 08:50:21] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 08:50:21] [INFO ] Invariant cache hit.
[2026-05-25 08:50:21] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/182 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 56/123 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 123 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/182 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 56/124 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 129/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 253 constraints, problems are : Problem set: 0 solved, 129 unsolved in 23106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30520ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 30521ms
Starting structural reductions in LTL mode, iteration 1 : 52/67 places, 130/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30723 ms. Remains : 52/67 places, 130/159 transitions.
[2026-05-25 08:50:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:50:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:50:52] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-25 08:50:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:50:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:50:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14437571725263632342.gal : 9 ms
[2026-05-25 08:50:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality10346668912682663017.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/CTLCardinality14437571725263632342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10346668912682663017.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,358504,0.35454,13880,2,1946,5,33939,6,0,335,50650,0


Converting to forward existential form...Done !
original formula: (AF(AG(((p55==0) + EF((((p28==1)||(p50==0))||(p60==1)))))) + AX(AG(((A((((p41==0)||(p13==1))&&(p49==1)) U ((p67==1)&&(p14==1))) + (p40==0...172
=> equivalent forward existential formula: ([(FwdU(((FwdU(EY((Init * !(!(EG(!(!(E(TRUE U !(((p55==0) + E(TRUE U (((p28==1)||(p50==0))||(p60==1)))))))))))))...476
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t20, t22, t23, t...461
(forward)formula 0,1,0.921238,25748,1,0,253,97203,310,82,3045,114379,282
FORMULA MedleyA-PT-02-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 137
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 47 transition count 113
Applied a total of 40 rules in 4 ms. Remains 47 /67 variables (removed 20) and now considering 113/159 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15515463040230345629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10375633621367772699.kers'
[2026-05-25 08:50:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15515463040230345629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10375633621367772699.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 47 cols 448 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 08:50:53] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10375633621367772699.kers
Total runtime 0 ms.
[2026-05-25 08:50:53] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 08:50:53] [INFO ] Invariant cache hit.
[2026-05-25 08:50:53] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:50:53] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2026-05-25 08:50:53] [INFO ] Invariant cache hit.
[2026-05-25 08:50:53] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 112 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 227 constraints, problems are : Problem set: 0 solved, 112 unsolved in 17219 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24843ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 24844ms
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 113/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25593 ms. Remains : 47/67 places, 113/159 transitions.
[2026-05-25 08:51:18] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:51:18] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:51:18] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 08:51:18] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:51:18] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:51:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16767141714439070164.gal : 3 ms
[2026-05-25 08:51:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17755797708826954172.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/CTLCardinality16767141714439070164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17755797708826954172.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,241300,0.164164,10852,2,1228,5,24388,6,0,298,34081,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(AX(((p10==0)&&(p51==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(EX(!(((p10==0)&&(p51==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...409
(forward)formula 0,1,0.922082,35728,1,0,233,144865,252,82,2952,166060,269
FORMULA MedleyA-PT-02-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 51 transition count 136
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 43 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 43 transition count 99
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 50 place count 43 transition count 97
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 41 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 39 transition count 95
Applied a total of 58 rules in 35 ms. Remains 39 /67 variables (removed 28) and now considering 95/159 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13322587537087602056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14745623495270752611.kers'
[2026-05-25 08:51:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13322587537087602056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14745623495270752611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 39 cols 390 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:51:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14745623495270752611.kers
Total runtime 1 ms.
[2026-05-25 08:51:20] [INFO ] Implicit Places using invariants in 556 ms returned []
[2026-05-25 08:51:20] [INFO ] Invariant cache hit.
[2026-05-25 08:51:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 08:51:20] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2026-05-25 08:51:20] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2026-05-25 08:51:20] [INFO ] Invariant cache hit.
[2026-05-25 08:51:20] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/134 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 49/98 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 98 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6487 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/134 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 49/98 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 94/192 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 192 constraints, problems are : Problem set: 0 solved, 94 unsolved in 8293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14825ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 14827ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/67 places, 95/159 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15542 ms. Remains : 39/67 places, 95/159 transitions.
[2026-05-25 08:51:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:51:35] [INFO ] Flatten gal took : 20 ms
[2026-05-25 08:51:35] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-25 08:51:35] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:51:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:51:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality8837645598832273181.gal : 2 ms
[2026-05-25 08:51:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality4760768377147936197.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/CTLCardinality8837645598832273181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4760768377147936197.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,65145,0.100688,8072,2,771,5,16480,6,0,249,19177,0


Converting to forward existential form...Done !
original formula: EG((A(((p55==0)||(p43==1)) U (p41==1)) + EF((p57==0))))
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((p41==1)) U (!(((p55==0)||(p43==1))) * !((p41==1)))) + EG(!((p41==1))))) + E(TRUE U (p57==0))...167
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t63, t64, t6...336
(forward)formula 0,1,4.34251,121668,1,0,488,614548,227,227,2390,635375,532
FORMULA MedleyA-PT-02-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 48 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 48 transition count 114
Applied a total of 38 rules in 3 ms. Remains 48 /67 variables (removed 19) and now considering 114/159 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7837466611290329756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15555001648480262437.kers'
[2026-05-25 08:51:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7837466611290329756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15555001648480262437.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 48 cols 449 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 08:51:39] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15555001648480262437.kers
Total runtime 3 ms.
[2026-05-25 08:51:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 08:51:39] [INFO ] Invariant cache hit.
[2026-05-25 08:51:39] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:51:39] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-25 08:51:39] [INFO ] Invariant cache hit.
[2026-05-25 08:51:39] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 114/162 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5550 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 113/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 228 constraints, problems are : Problem set: 0 solved, 113 unsolved in 10538 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16161ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 16162ms
Starting structural reductions in LTL mode, iteration 1 : 48/67 places, 114/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16371 ms. Remains : 48/67 places, 114/159 transitions.
[2026-05-25 08:51:56] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:51:56] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:51:56] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-25 08:51:56] [INFO ] Flatten gal took : 14 ms
[2026-05-25 08:51:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:51:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3874165105581602757.gal : 9 ms
[2026-05-25 08:51:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality7580734591720288541.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/CTLCardinality3874165105581602757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7580734591720288541.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,283517,0.245216,12928,2,1497,5,32147,6,0,302,45432,0


Converting to forward existential form...Done !
original formula: (EF(EG((p46==0))) * AF(AX(((AX(((p14==0)&&(p67==1))) + (p43==0)) + (p58==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EG((p46==0)))))] = FALSE * [FwdG(Init,!(!(EX(!(((!(EX(!(((p14==0)&&(p67==1))))) + (p43==0))...182
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...415
(forward)formula 0,1,7.39262,174400,1,0,444,985299,263,175,2925,964295,506
FORMULA MedleyA-PT-02-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 55 transition count 142
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 55 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 52 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 52 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 51 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 51 transition count 121
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 48 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 48 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 41 place count 48 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 46 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 44 transition count 108
Applied a total of 49 rules in 39 ms. Remains 44 /67 variables (removed 23) and now considering 108/159 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9413493882390696116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11661854886556814166.kers'
[2026-05-25 08:52:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9413493882390696116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11661854886556814166.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 44 cols 434 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 08:52:03] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11661854886556814166.kers
Total runtime 1 ms.
[2026-05-25 08:52:03] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 08:52:03] [INFO ] Invariant cache hit.
[2026-05-25 08:52:03] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-25 08:52:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2026-05-25 08:52:03] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-25 08:52:03] [INFO ] Invariant cache hit.
[2026-05-25 08:52:03] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/152 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 109 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7457 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/152 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 107/216 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 217 constraints, problems are : Problem set: 0 solved, 107 unsolved in 17509 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25020ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 25021ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/67 places, 108/159 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25283 ms. Remains : 44/67 places, 108/159 transitions.
[2026-05-25 08:52:28] [INFO ] Flatten gal took : 13 ms
[2026-05-25 08:52:28] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:52:28] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-25 08:52:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:52:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:52:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality1459931914097326883.gal : 1 ms
[2026-05-25 08:52:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6364901267204077602.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/CTLCardinality1459931914097326883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6364901267204077602.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,96019,0.186395,10904,2,1608,5,28315,6,0,282,27281,0


Converting to forward existential form...Done !
original formula: AF(AG((E(((p2==0) * AF(((p44==0)||(p52==1)))) U (p48==1)) + (p34==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(((p2==0) * !(EG(!(((p44==0)||(p52==1)))))) U (p48==1)) + (p34==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...407
(forward)formula 0,0,2.58739,76168,1,0,515,367245,254,250,2666,387334,503
FORMULA MedleyA-PT-02-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 : 67/67 places, 159/159 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 57 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 57 transition count 144
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 54 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 54 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 52 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 52 transition count 120
Applied a total of 30 rules in 2 ms. Remains 52 /67 variables (removed 15) and now considering 120/159 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18208964253028761764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10944441575002197275.kers'
[2026-05-25 08:52:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18208964253028761764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10944441575002197275.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 52 cols 468 entries
Finished phase 1 with 42 SingleSign rule and 1 generalized
[2026-05-25 08:52:31] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10944441575002197275.kers
Total runtime 0 ms.
[2026-05-25 08:52:31] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 08:52:31] [INFO ] Invariant cache hit.
[2026-05-25 08:52:31] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:52:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-25 08:52:31] [INFO ] Invariant cache hit.
[2026-05-25 08:52:31] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/172 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 52/116 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 116 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/172 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 52/116 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 119/235 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 238 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9726 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14817ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 14818ms
Starting structural reductions in LTL mode, iteration 1 : 52/67 places, 120/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15059 ms. Remains : 52/67 places, 120/159 transitions.
[2026-05-25 08:52:46] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:52:46] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:52:46] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-25 08:52:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:52:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:52:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15314821325208838970.gal : 3 ms
[2026-05-25 08:52:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1679080424673783040.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/CTLCardinality15314821325208838970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1679080424673783040.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,423823,0.450277,19432,2,2561,5,47439,6,0,325,77105,0


Converting to forward existential form...Done !
original formula: EG((AF(EX(EX(((p9==0)||(p2==1))))) * AF(((AX((p17==1)) * (p22==1)) + AX(((p32==0)||(p29==1)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EX(EX(((p9==0)||(p2==1))))))) * !(EG(!(((!(EX(!((p17==1)))) * (p22==1)) + !(EX(!(((p32==0)||(...182
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t...379
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,11.1819,263440,1,0,567,1.1621e+06,276,300,3114,1.59679e+06,550
FORMULA MedleyA-PT-02-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 52 transition count 137
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 28 place count 49 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 49 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 48 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 48 transition count 116
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 0 with 2 rules applied. Total rules applied 35 place count 47 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 47 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 40 place count 47 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 45 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 43 transition count 106
Applied a total of 48 rules in 30 ms. Remains 43 /67 variables (removed 24) and now considering 106/159 (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-2671260111017803886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8691368090756659287.kers'
[2026-05-25 08:52:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2671260111017803886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8691368090756659287.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 106 rows 43 cols 422 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 08:52:58] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8691368090756659287.kers
Total runtime 1 ms.
[2026-05-25 08:52:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 08:52:58] [INFO ] Invariant cache hit.
[2026-05-25 08:52:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 08:52:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2026-05-25 08:52:58] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2026-05-25 08:52:58] [INFO ] Invariant cache hit.
[2026-05-25 08:52:58] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 106/149 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 70 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 106/149 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 99/169 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 171 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10431 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14197ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 14198ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/67 places, 106/159 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14410 ms. Remains : 43/67 places, 106/159 transitions.
[2026-05-25 08:53:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:12] [INFO ] Flatten gal took : 22 ms
[2026-05-25 08:53:12] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-25 08:53:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11591885079797393722.gal : 1 ms
[2026-05-25 08:53:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1888078570656550030.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/CTLCardinality11591885079797393722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1888078570656550030.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,115880,0.188116,11156,2,1373,5,24491,6,0,274,35023,0


Converting to forward existential form...Done !
original formula: AG((E((p61==0) U ((p30==1) + AF((p67==1)))) + (((p43==0)||(p4==1)) * (AF((p53==1)) + EG((p13==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E((p61==0) U ((p30==1) + !(EG(!((p67==1)))))))) * !(((p43==0)||(p4==1))))] = FALSE * [Fw...269
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t2...393
Hit Full ! (commute/partial/dont) 99/0/7
(forward)formula 0,0,9.82884,232448,1,0,729,1.30774e+06,254,303,2547,1.22538e+06,813
FORMULA MedleyA-PT-02-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 51 transition count 136
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 51 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 32 place count 48 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 35 place count 48 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 37 place count 46 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 46 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 43 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 43 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 50 place count 43 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 41 transition count 102
Applied a total of 54 rules in 24 ms. Remains 41 /67 variables (removed 26) and now considering 102/159 (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-7445338551803577932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-141268278689295920.kers'
[2026-05-25 08:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7445338551803577932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-141268278689295920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 41 cols 416 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 08:53:22] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-141268278689295920.kers
Total runtime 0 ms.
[2026-05-25 08:53:22] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 08:53:22] [INFO ] Invariant cache hit.
[2026-05-25 08:53:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-25 08:53:22] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2026-05-25 08:53:22] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-25 08:53:22] [INFO ] Invariant cache hit.
[2026-05-25 08:53:22] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/143 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 104 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3600 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/143 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 20105 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23728ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 23729ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/67 places, 102/159 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24079 ms. Remains : 41/67 places, 102/159 transitions.
[2026-05-25 08:53:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:46] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-25 08:53:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:53:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality216185238877089660.gal : 4 ms
[2026-05-25 08:53:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality7824459031373184258.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/CTLCardinality216185238877089660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7824459031373184258.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,84633,0.111552,8136,2,827,5,17114,6,0,264,18253,0


Converting to forward existential form...Done !
original formula: EG(AF(AG((E(((p27==0)||(p37==1)) U (p46==1)) + (p8==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !((E(((p27==0)||(p37==1)) U (p46==1)) + (p8==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t14, t15, t16, t17, t18, t19, t20, t22, t23...366
(forward)formula 0,0,3.78923,95328,1,0,383,505638,237,160,2568,483474,430
FORMULA MedleyA-PT-02-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 50 transition count 135
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 50 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 46 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 46 transition count 113
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 44 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 44 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 42 transition count 103
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 0 with 2 rules applied. Total rules applied 47 place count 41 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 41 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 53 place count 41 transition count 94
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 57 place count 39 transition count 94
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 0 with 2 rules applied. Total rules applied 59 place count 38 transition count 93
Applied a total of 59 rules in 15 ms. Remains 38 /67 variables (removed 29) and now considering 93/159 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16275791853390781902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13729263552070424361.kers'
[2026-05-25 08:53:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16275791853390781902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13729263552070424361.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 38 cols 378 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 08:53:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13729263552070424361.kers
Total runtime 0 ms.
[2026-05-25 08:53:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 08:53:50] [INFO ] Invariant cache hit.
[2026-05-25 08:53:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 08:53:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2026-05-25 08:53:50] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-25 08:53:50] [INFO ] Invariant cache hit.
[2026-05-25 08:53:50] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 62 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3453 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 150 constraints, problems are : Problem set: 0 solved, 87 unsolved in 11415 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14888ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 14888ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/67 places, 93/159 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15047 ms. Remains : 38/67 places, 93/159 transitions.
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:54:05] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 25 ms
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16930995400903597404.gal : 1 ms
[2026-05-25 08:54:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8218582903073669096.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16930995400903597404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8218582903073669096.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (5301 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1124 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Finished probabilistic random walk after 13100 steps, run visited all 1 properties in 35 ms. (steps per millisecond=374 )
Loading property file /tmp/ReachabilityCardinality8218582903073669096.prop.
Probabilistic random walk after 13100 steps, saw 3226 distinct states, run finished after 39 ms. (steps per millisecond=335 ) properties seen :1
FORMULA MedleyA-PT-02-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 58 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 58 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 140
Applied a total of 20 rules in 2 ms. Remains 57 /67 variables (removed 10) and now considering 140/159 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6500971258992149404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16279032688347727073.kers'
[2026-05-25 08:54:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6500971258992149404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16279032688347727073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 57 cols 533 entries
Finished phase 1 with 47 SingleSign rule and 1 generalized
[2026-05-25 08:54:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16279032688347727073.kers
Total runtime 1 ms.
[2026-05-25 08:54:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 08:54:05] [INFO ] Invariant cache hit.
[2026-05-25 08:54:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-25 08:54:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2026-05-25 08:54:05] [INFO ] Invariant cache hit.
[2026-05-25 08:54:05] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 140/197 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 58/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (OVERLAPS) 0/197 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 14 (OVERLAPS) 0/197 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 140 constraints, problems are : Problem set: 0 solved, 139 unsolved in 18023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/197 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 58/140 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 139/279 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/197 variables, and 280 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48078ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 48078ms
Starting structural reductions in LTL mode, iteration 1 : 57/67 places, 140/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48190 ms. Remains : 57/67 places, 140/159 transitions.
[2026-05-25 08:54:53] [INFO ] Flatten gal took : 21 ms
[2026-05-25 08:54:53] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:54:53] [INFO ] Input system was already deterministic with 140 transitions.
[2026-05-25 08:54:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:53] [INFO ] Flatten gal took : 31 ms
[2026-05-25 08:54:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6444228358175815552.gal : 1 ms
[2026-05-25 08:54:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9857350760266151496.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/CTLCardinality6444228358175815552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9857350760266151496.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,551893,0.801299,29048,2,4484,5,73894,6,0,364,123516,0


Converting to forward existential form...Done !
original formula: (AF(AX((((((p34==1)&&(p19==1)) + A((p57==1) U ((p49==0)||(p18==1)))) + ((AF((p34==1)) * (p41==1)) * ((p10==0)||(p32==1)))) * EG(EX((p59==...241
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(EG((p56==1))) U (!(EX(!((E(!(EG(((p48==0)||(p16==1)))) U (!(EG(((p5==0)||(p17==1)))) * !(...500
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...530
Detected timeout of ITS tools.
[2026-05-25 08:55:24] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:55:24] [INFO ] Applying decomposition
[2026-05-25 08:55:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14509150287319276905.txt' '-o' '/tmp/graph14509150287319276905.bin' '-w' '/tmp/graph14509150287319276905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14509150287319276905.bin' '-l' '-1' '-v' '-w' '/tmp/graph14509150287319276905.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:55:24] [INFO ] Decomposing Gal with order
[2026-05-25 08:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:55:24] [INFO ] Removed a total of 192 redundant transitions.
[2026-05-25 08:55:24] [INFO ] Flatten gal took : 114 ms
[2026-05-25 08:55:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 9 ms.
[2026-05-25 08:55:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8779374352596522200.gal : 3 ms
[2026-05-25 08:55:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality10811537663552951572.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/CTLCardinality8779374352596522200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10811537663552951572.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,551893,0.266874,13816,534,382,14367,2748,227,34042,147,22081,0


Converting to forward existential form...Done !
original formula: (AF(AX((((((u5.p34==1)&&(u2.p19==1)) + A((i4.u8.p57==1) U ((u5.p49==0)||(u2.p18==1)))) + ((AF((u5.p34==1)) * (i2.u3.p41==1)) * ((i1.u1.p1...304
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(EG((u5.p56==1))) U (!(EX(!((E(!(EG(((u5.p48==0)||(u2.p16==1)))) U (!(EG(((i2.u3.p5==0)||(...593
Reverse transition relation is NOT exact ! Due to transitions t45, t46, t70, t73, t109, t111, t132, u2.t20, u2.t21, u2.t22, u2.t23, u2.t24, u2.t25, u2.t26,...619
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.44559,169136,1,0,263142,12910,1362,546523,821,90517,469477
FORMULA MedleyA-PT-02-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 137
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 48 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 48 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 46 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 46 transition count 107
Applied a total of 42 rules in 3 ms. Remains 46 /67 variables (removed 21) and now considering 107/159 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7731747278571131375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11849700025047886677.kers'
[2026-05-25 08:55:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7731747278571131375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11849700025047886677.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 46 cols 424 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 08:55:29] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11849700025047886677.kers
Total runtime 1 ms.
[2026-05-25 08:55:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 08:55:29] [INFO ] Invariant cache hit.
[2026-05-25 08:55:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-25 08:55:30] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-25 08:55:30] [INFO ] Invariant cache hit.
[2026-05-25 08:55:30] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/153 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (OVERLAPS) 0/153 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 110 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/153 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 106/216 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 216 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8404 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18059ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 18072ms
Starting structural reductions in LTL mode, iteration 1 : 46/67 places, 107/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18334 ms. Remains : 46/67 places, 107/159 transitions.
[2026-05-25 08:55:48] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:55:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:55:48] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-25 08:55:48] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:55:48] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:55:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality11545092546028426588.gal : 2 ms
[2026-05-25 08:55:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality7239751852542706858.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/CTLCardinality11545092546028426588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7239751852542706858.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,226168,0.182275,10496,2,1138,5,22916,6,0,288,33059,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.183577,10496,1,0,6,22916,7,1,446,33059,1
FORMULA MedleyA-PT-02-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 55 transition count 142
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 55 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 53 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 53 transition count 131
Applied a total of 28 rules in 2 ms. Remains 53 /67 variables (removed 14) and now considering 131/159 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11381132984664320688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9776190385702165213.kers'
[2026-05-25 08:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11381132984664320688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9776190385702165213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 53 cols 499 entries
Finished phase 1 with 43 SingleSign rule and 1 generalized
[2026-05-25 08:55:48] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9776190385702165213.kers
Total runtime 1 ms.
[2026-05-25 08:55:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 08:55:48] [INFO ] Invariant cache hit.
[2026-05-25 08:55:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 08:55:48] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-25 08:55:48] [INFO ] Invariant cache hit.
[2026-05-25 08:55:48] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/184 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 56/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 123 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4841 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/184 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 56/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 130/253 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 254 constraints, problems are : Problem set: 0 solved, 130 unsolved in 10888 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15803ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 15804ms
Starting structural reductions in LTL mode, iteration 1 : 53/67 places, 131/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16003 ms. Remains : 53/67 places, 131/159 transitions.
[2026-05-25 08:56:04] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:56:04] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:56:04] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-25 08:56:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:56:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:56:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12287242684693841321.gal : 2 ms
[2026-05-25 08:56:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality707984444603287785.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12287242684693841321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality707984444603287785.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,409021,0.566733,21604,2,2847,5,59448,6,0,339,85377,0


Converting to forward existential form...Done !
original formula: (EX(AG(AX((p20==1)))) + AG((((((p40==1) + EX((p22==0))) * EX((p54==0))) + AG(((p59==0)&&(p24==1)))) + AF(!(A((p49==1) U (p66==0)))))))
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(EX(!(E(TRUE U !(!(EX(!((p20==1)))))))))),TRUE) * !(((((p40==1) + EX((p22==0))) * EX((p54==...285
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...466
(forward)formula 0,0,7.08241,167764,1,0,506,896120,306,204,3264,826010,595
FORMULA MedleyA-PT-02-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 140
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 51 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 51 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 50 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 50 transition count 119
Applied a total of 34 rules in 8 ms. Remains 50 /67 variables (removed 17) and now considering 119/159 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17937561493819759974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17336287169838024771.kers'
[2026-05-25 08:56:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17937561493819759974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17336287169838024771.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 50 cols 464 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 08:56:11] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17336287169838024771.kers
Total runtime 1 ms.
[2026-05-25 08:56:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 08:56:11] [INFO ] Invariant cache hit.
[2026-05-25 08:56:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 08:56:11] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2026-05-25 08:56:11] [INFO ] Invariant cache hit.
[2026-05-25 08:56:11] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/169 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 118 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 118/236 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/169 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 237 constraints, problems are : Problem set: 0 solved, 118 unsolved in 13892 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20002ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 20003ms
Starting structural reductions in LTL mode, iteration 1 : 50/67 places, 119/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20199 ms. Remains : 50/67 places, 119/159 transitions.
[2026-05-25 08:56:31] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:56:31] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:56:31] [INFO ] Input system was already deterministic with 119 transitions.
[2026-05-25 08:56:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:56:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:56:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3993437889589539957.gal : 2 ms
[2026-05-25 08:56:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14873663096868549305.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/CTLCardinality3993437889589539957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14873663096868549305.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,321310,0.286649,14880,2,1743,5,34713,6,0,316,55018,0


Converting to forward existential form...Done !
original formula: AX((E((!(EG(((p6==0)||(p20==1)))) * AX((p7==1))) U (p12==1)) * ((p13==0)||(p19==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E((!(EG(((p6==0)||(p20==1)))) * !(EX(!((p7==1))))) U (p12==1))))] = FALSE * [(EY(Init) * !(((p13...182
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...411
(forward)formula 0,0,8.67215,200372,1,0,456,1.12187e+06,268,181,2942,1.19368e+06,504
FORMULA MedleyA-PT-02-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 159/159 transitions.
Graph (complete) has 346 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 55 transition count 143
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 55 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 52 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 52 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 51 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 51 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 48 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 48 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 41 place count 48 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 46 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 44 transition count 110
Applied a total of 49 rules in 41 ms. Remains 44 /67 variables (removed 23) and now considering 110/159 (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-87229291366782835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16605115388392670306.kers'
[2026-05-25 08:56:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-87229291366782835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16605115388392670306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 44 cols 436 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 08:56:40] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16605115388392670306.kers
Total runtime 0 ms.
[2026-05-25 08:56:41] [INFO ] Implicit Places using invariants in 390 ms returned []
[2026-05-25 08:56:41] [INFO ] Invariant cache hit.
[2026-05-25 08:56:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-25 08:56:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2026-05-25 08:56:41] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-25 08:56:41] [INFO ] Invariant cache hit.
[2026-05-25 08:56:41] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/154 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 51/113 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 114 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5847 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/154 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 51/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/154 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 228 constraints, problems are : Problem set: 0 solved, 109 unsolved in 13648 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19531ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 19531ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/67 places, 110/159 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20086 ms. Remains : 44/67 places, 110/159 transitions.
[2026-05-25 08:57:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:57:00] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:57:00] [INFO ] Input system was already deterministic with 110 transitions.
[2026-05-25 08:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:57:00] [INFO ] Flatten gal took : 12 ms
[2026-05-25 08:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality10102603783466121166.gal : 1 ms
[2026-05-25 08:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality10796923174547998105.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/CTLCardinality10102603783466121166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10796923174547998105.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,79609,0.173042,10996,2,1406,5,23207,6,0,284,34482,0


Converting to forward existential form...Done !
original formula: A(!(((p16==1) * !(((EF(((p35==0)||(p57==1))) + (p21==1)) + ((!((p7==0)||(p17==1)))&&((p27==1)||(p44==1))))))) U (p29==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p29==1))))) * !(E(!((p29==1)) U (!(!(((p16==1) * !(((E(TRUE U ((p35==0)||(p57==1))) + (p21==1)...238
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...422
(forward)formula 0,0,3.99352,117108,1,0,403,580254,252,157,2638,592823,471
FORMULA MedleyA-PT-02-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 08:57:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:57:04] [INFO ] Flatten gal took : 20 ms
Total runtime 460003 ms.

BK_STOP 1779699424928

--------------------
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="MedleyA-PT-02"
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 MedleyA-PT-02, 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 r178-oct2-177969019900105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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