Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993500129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DBSingleClientW-PT-d0m10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m10-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-12
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-13
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-14
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779560519466

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 18:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 18:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 18:22:02] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2026-05-23 18:22:02] [INFO ] Transformed 553 places.
[2026-05-23 18:22:02] [INFO ] Transformed 150 transitions.
[2026-05-23 18:22:02] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 103 transition count 141
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 37 place count 81 transition count 102
Iterating global reduction 1 with 22 rules applied. Total rules applied 59 place count 81 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 81 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 71 place count 71 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 71 transition count 88
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 69 transition count 84
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 67 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 66 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 66 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 66 transition count 78
Applied a total of 95 rules in 87 ms. Remains 66 /109 variables (removed 43) and now considering 78/150 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15425587524051606790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16261491922075298299.kers'
[2026-05-23 18:22:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15425587524051606790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16261491922075298299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 66 cols 249 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-23 18:22:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16261491922075298299.kers
Total runtime 2 ms.
[2026-05-23 18:22:03] [INFO ] Implicit Places using invariants in 571 ms returned []
[2026-05-23 18:22:03] [INFO ] Invariant cache hit.
[2026-05-23 18:22:03] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 18:22:03] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-23 18:22:03] [INFO ] Invariant cache hit.
[2026-05-23 18:22:03] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/143 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 28/95 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 101 constraints, problems are : Problem set: 0 solved, 77 unsolved in 7853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 78/143 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 71/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/144 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 178 constraints, problems are : Problem set: 0 solved, 77 unsolved in 17066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25181ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 25202ms
Starting structural reductions in LTL mode, iteration 1 : 66/109 places, 78/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26380 ms. Remains : 66/109 places, 78/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-23 18:22:29] [INFO ] Invariant cache hit.
[2026-05-23 18:22:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 18:22:29] [INFO ] Invariant cache hit.
[2026-05-23 18:22:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 18:22:29] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 66/66 places, 78/78 transitions.
Support contains 6 out of 66 places after structural reductions.
[2026-05-23 18:22:29] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-23 18:22:29] [INFO ] Flatten gal took : 62 ms
[2026-05-23 18:22:29] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 18:22:29] [INFO ] Flatten gal took : 34 ms
[2026-05-23 18:22:29] [INFO ] Input system was already deterministic with 78 transitions.
Support contains 4 out of 66 places (down from 6) after GAL structural reductions.
RANDOM walk for 40000 steps (9187 resets) in 1534 ms. (26 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (4062 resets) in 553 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3959 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4041 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
[2026-05-23 18:22:30] [INFO ] Invariant cache hit.
[2026-05-23 18:22:30] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 34/142 variables, 19/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/144 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 96 constraints, problems are : Problem set: 1 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/45 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/106 variables, 45/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 11/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 35/141 variables, 19/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 16/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/144 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/144 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 99 constraints, problems are : Problem set: 1 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 483ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 78/78 transitions.
Graph (complete) has 192 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 59 transition count 67
Applied a total of 16 rules in 64 ms. Remains 59 /66 variables (removed 7) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 59/66 places, 67/78 transitions.
RANDOM walk for 40000 steps (9216 resets) in 200 ms. (199 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (4101 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13463439593439299042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3626603658611254705.kers'
[2026-05-23 18:22:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13463439593439299042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3626603658611254705.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 59 cols 215 entries
Finished phase 1 with 54 SingleSign rule and 3 generalized
[2026-05-23 18:22:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3626603658611254705.kers
Total runtime 1 ms.
[2026-05-23 18:22:31] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/66 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/98 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/126 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/66 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/98 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 28/126 variables, 26/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 15/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 13 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 59/59 places, 67/67 transitions.
RANDOM walk for 40000 steps (9177 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4085 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18381 steps, run visited all 1 properties in 91 ms. (steps per millisecond=201 )
Probabilistic random walk after 18381 steps, saw 8076 distinct states, run finished after 99 ms. (steps per millisecond=185 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2026-05-23 18:22:32] [INFO ] Flatten gal took : 14 ms
[2026-05-23 18:22:32] [INFO ] Flatten gal took : 15 ms
[2026-05-23 18:22:32] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 212 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 63 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 60 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 59 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 58 transition count 64
Applied a total of 19 rules in 27 ms. Remains 58 /66 variables (removed 8) and now considering 64/78 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11365545219827023915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16024862016118184906.kers'
[2026-05-23 18:22:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11365545219827023915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16024862016118184906.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 18:22:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16024862016118184906.kers
Total runtime 4 ms.
[2026-05-23 18:22:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-23 18:22:32] [INFO ] Invariant cache hit.
[2026-05-23 18:22:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:22:32] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-23 18:22:32] [INFO ] Invariant cache hit.
[2026-05-23 18:22:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 85 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 148 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6852 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11050ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 11051ms
Starting structural reductions in LTL mode, iteration 1 : 58/66 places, 64/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11347 ms. Remains : 58/66 places, 64/78 transitions.
[2026-05-23 18:22:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:22:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:22:43] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 18:22:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:22:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:22:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17566046096393887761.gal : 4 ms
[2026-05-23 18:22:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17986242732367828285.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17566046096393887761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17986242732367828285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
Detected timeout of ITS tools.
[2026-05-23 18:23:13] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:23:13] [INFO ] Applying decomposition
[2026-05-23 18:23:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17678837309894680459.txt' '-o' '/tmp/graph17678837309894680459.bin' '-w' '/tmp/graph17678837309894680459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17678837309894680459.bin' '-l' '-1' '-v' '-w' '/tmp/graph17678837309894680459.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:23:13] [INFO ] Decomposing Gal with order
[2026-05-23 18:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:23:13] [INFO ] Removed a total of 59 redundant transitions.
[2026-05-23 18:23:13] [INFO ] Flatten gal took : 85 ms
[2026-05-23 18:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 11 ms.
[2026-05-23 18:23:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality9873021547097081821.gal : 5 ms
[2026-05-23 18:23:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14165055864889265728.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/CTLCardinality9873021547097081821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14165055864889265728.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,2.39871e+07,2.00699,49048,1796,965,59394,8153,219,157574,68,158298,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t9, t28, t40, t45, t46, t48, t49, t50, t51, t52, t53, t54, t56, t57, t58, t59, t60, t...285
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,24.6026,404024,1,0,535731,55047,852,1.61885e+06,364,1.50912e+06,1067419
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 60 transition count 68
Applied a total of 15 rules in 10 ms. Remains 60 /66 variables (removed 6) and now considering 68/78 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18242044516144448192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4302858702431291818.kers'
[2026-05-23 18:23:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18242044516144448192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4302858702431291818.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 60 cols 217 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 18:23:38] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4302858702431291818.kers
Total runtime 1 ms.
[2026-05-23 18:23:38] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 18:23:38] [INFO ] Invariant cache hit.
[2026-05-23 18:23:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 18:23:38] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2026-05-23 18:23:38] [INFO ] Invariant cache hit.
[2026-05-23 18:23:38] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 153 constraints, problems are : Problem set: 0 solved, 67 unsolved in 6674 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9025ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 9026ms
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 68/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9360 ms. Remains : 60/66 places, 68/78 transitions.
[2026-05-23 18:23:48] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:23:48] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:23:48] [INFO ] Input system was already deterministic with 68 transitions.
[2026-05-23 18:23:48] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:23:48] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:23:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13169199204194183603.gal : 1 ms
[2026-05-23 18:23:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14451101364727014525.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/CTLCardinality13169199204194183603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14451101364727014525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(!(E((AF((l152<=1)) + EX((p11>=1))) U (l488<=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((!(EG(!((l152<=1)))) + EX((p11>=1))) U (l488<=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t42, t43, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...301
Detected timeout of ITS tools.
[2026-05-23 18:24:18] [INFO ] Flatten gal took : 8 ms
[2026-05-23 18:24:18] [INFO ] Applying decomposition
[2026-05-23 18:24:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15334400786402972433.txt' '-o' '/tmp/graph15334400786402972433.bin' '-w' '/tmp/graph15334400786402972433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15334400786402972433.bin' '-l' '-1' '-v' '-w' '/tmp/graph15334400786402972433.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:24:18] [INFO ] Decomposing Gal with order
[2026-05-23 18:24:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:24:18] [INFO ] Removed a total of 67 redundant transitions.
[2026-05-23 18:24:18] [INFO ] Flatten gal took : 16 ms
[2026-05-23 18:24:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 5 ms.
[2026-05-23 18:24:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6417841332707565127.gal : 4 ms
[2026-05-23 18:24:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12821350809056486218.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/CTLCardinality6417841332707565127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12821350809056486218.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.93928e+07,9.39807,178204,3091,582,175521,4324,218,1.15686e+06,65,55652,0


Converting to forward existential form...Done !
original formula: AF(!(E((AF((u0.l152<=1)) + EX((i1.u1.p11>=1))) U (i6.u12.l488<=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((!(EG(!((u0.l152<=1)))) + EX((i1.u1.p11>=1))) U (i6.u12.l488<=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t28, t34, t41, t42, t43, t49, t50, t51, t52, t53, t54, t55, t56, t60, t61, t62, t63, ...307
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 78/78 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 63 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 60 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 59 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 58 transition count 64
Applied a total of 19 rules in 13 ms. Remains 58 /66 variables (removed 8) and now considering 64/78 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5447311236680784445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14183596520225923340.kers'
[2026-05-23 18:24:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5447311236680784445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14183596520225923340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 18:24:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14183596520225923340.kers
Total runtime 1 ms.
[2026-05-23 18:24:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 18:24:48] [INFO ] Invariant cache hit.
[2026-05-23 18:24:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:24:48] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-23 18:24:48] [INFO ] Invariant cache hit.
[2026-05-23 18:24:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 85 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4722 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 148 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10872ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 10873ms
Starting structural reductions in LTL mode, iteration 1 : 58/66 places, 64/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11163 ms. Remains : 58/66 places, 64/78 transitions.
[2026-05-23 18:24:59] [INFO ] Flatten gal took : 5 ms
[2026-05-23 18:24:59] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:24:59] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 18:24:59] [INFO ] Flatten gal took : 5 ms
[2026-05-23 18:24:59] [INFO ] Flatten gal took : 5 ms
[2026-05-23 18:24:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality9308633571760703721.gal : 2 ms
[2026-05-23 18:24:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2231274612951138063.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/CTLCardinality9308633571760703721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2231274612951138063.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,2.39871e+07,3.78517,87028,2,18239,5,299149,6,0,296,378855,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(EX(TRUE))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(EX(TRUE)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,0,14.3204,266256,1,0,137,1.13587e+06,148,58,2101,1.23222e+06,148
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 18:25:13] [INFO ] Flatten gal took : 5 ms
[2026-05-23 18:25:13] [INFO ] Flatten gal took : 6 ms
[2026-05-23 18:25:13] [INFO ] Applying decomposition
[2026-05-23 18:25:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4196147200756381483.txt' '-o' '/tmp/graph4196147200756381483.bin' '-w' '/tmp/graph4196147200756381483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4196147200756381483.bin' '-l' '-1' '-v' '-w' '/tmp/graph4196147200756381483.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:25:13] [INFO ] Decomposing Gal with order
[2026-05-23 18:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:25:13] [INFO ] Removed a total of 79 redundant transitions.
[2026-05-23 18:25:13] [INFO ] Flatten gal took : 14 ms
[2026-05-23 18:25:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 13 ms.
[2026-05-23 18:25:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8128447413752774065.gal : 4 ms
[2026-05-23 18:25:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11076622213313317122.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/CTLCardinality8128447413752774065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11076622213313317122.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34299e+08,7.85929,125540,3130,678,131216,11808,242,823742,70,96241,0


Converting to forward existential form...Done !
original formula: AF(!(E((AF((i4.u9.l152<=1)) + EX((i1.u3.p11>=1))) U (i4.u13.l488<=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((!(EG(!((i4.u9.l152<=1)))) + EX((i1.u3.p11>=1))) U (i4.u13.l488<=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t28, t49, t50, t51, t52, t57, t58, t59, t60, t61, t62, t63, t64, t68, t69, t70, t71, ...320
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,185.985,1802636,1,0,1.88189e+06,80067,1089,1.40614e+07,440,520074,2239198
FORMULA DBSingleClientW-PT-d0m10-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 378603 ms.

BK_STOP 1779560900695

--------------------
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="DBSingleClientW-PT-d0m10"
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 DBSingleClientW-PT-d0m10, 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 r082-smll-177946993500129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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