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-177946993700390.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 DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 6 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 91K 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 DES-PT-20b-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779692007127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 06:53:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 06:53:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 06:53:30] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2026-05-25 06:53:30] [INFO ] Transformed 360 places.
[2026-05-25 06:53:30] [INFO ] Transformed 311 transitions.
[2026-05-25 06:53:30] [INFO ] Found NUPN structural information;
[2026-05-25 06:53:30] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (338 resets) in 2567 ms. (15 steps per ms) remains 5/10 properties
FORMULA DES-PT-20b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 06:53:31] [INFO ] Flatten gal took : 227 ms
BEST_FIRST walk for 40004 steps (47 resets) in 552 ms. (72 steps per ms) remains 5/5 properties
[2026-05-25 06:53:31] [INFO ] Flatten gal took : 140 ms
BEST_FIRST walk for 40003 steps (60 resets) in 830 ms. (48 steps per ms) remains 5/5 properties
[2026-05-25 06:53:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3143722486133517687.gal : 61 ms
BEST_FIRST walk for 40004 steps (43 resets) in 338 ms. (118 steps per ms) remains 5/5 properties
[2026-05-25 06:53:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality762843884577520617.prop : 9 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/ReachabilityCardinality3143722486133517687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality762843884577520617.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (49 resets) in 427 ms. (93 steps per ms) remains 5/5 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 ...327
Loading property file /tmp/ReachabilityCardinality762843884577520617.prop.
BEST_FIRST walk for 40003 steps (44 resets) in 393 ms. (101 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6243610245458482925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3858613181363082731.kers'
[2026-05-25 06:53:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6243610245458482925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3858613181363082731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 360 cols 987 entries
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
Finished phase 1 with 171 SingleSign rule and 124 generalized
[2026-05-25 06:53:31] [INFO ] Computed 65 invariants in 3 ms
Computed 65 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3858613181363082731.kers
Total runtime 6 ms.
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :16 after 19
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :19 after 35
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :35 after 169
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :169 after 235
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :235 after 1349
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1349 after 22055
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :22055 after 206107
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem DES-PT-20b-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DES-PT-20b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 228/306 variables, 35/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 228/341 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 2/343 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/343 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 16/322 variables, 6/349 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 16/365 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 3/368 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 37/359 variables, 18/386 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 37/423 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/360 variables, 1/424 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 1/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :206107 after 1.80704e+08
At refinement iteration 16 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 0/785 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.80704e+08 after 3.10347e+08
At refinement iteration 18 (OVERLAPS) 0/671 variables, 0/785 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 785 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3898 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 231/277 variables, 30/76 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 231/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 2/309 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 39/316 variables, 11/320 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 39/359 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 4/363 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/363 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 43/359 variables, 19/382 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 43/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 4/429 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/360 variables, 1/430 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 1/431 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 791 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9091ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 349 transition count 292
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 336 transition count 289
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 333 transition count 289
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 333 transition count 283
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 327 transition count 283
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 60 place count 313 transition count 269
Iterating global reduction 3 with 14 rules applied. Total rules applied 74 place count 313 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 313 transition count 268
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 312 transition count 268
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 84 place count 304 transition count 260
Iterating global reduction 3 with 8 rules applied. Total rules applied 92 place count 304 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 98 place count 304 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 98 place count 304 transition count 253
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 303 transition count 253
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 216 place count 245 transition count 195
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 243 transition count 213
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 243 transition count 209
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 228 place count 239 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 239 transition count 208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 239 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 233 place count 237 transition count 206
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 237 place count 237 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 236 transition count 205
Applied a total of 238 rules in 327 ms. Remains 236 /360 variables (removed 124) and now considering 205/311 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 236/360 places, 205/311 transitions.
RANDOM walk for 40000 steps (859 resets) in 1993 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (140 resets) in 527 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (134 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (140 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 397263 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :1 out of 4
Probabilistic random walk after 397263 steps, saw 83132 distinct states, run finished after 3008 ms. (steps per millisecond=132 ) properties seen :1
FORMULA DES-PT-20b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12945353938061335928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8792314301741328836.kers'
[2026-05-25 06:53:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12945353938061335928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8792314301741328836.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 205 rows 232 cols 921 entries
Finished phase 1 with 117 SingleSign rule and 59 generalized
[2026-05-25 06:53:45] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8792314301741328836.kers
Total runtime 3 ms.
[2026-05-25 06:53:45] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/89 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/114 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 96/210 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/216 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/217 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 204/421 variables, 217/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 20/441 variables, 19/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/441 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 324 constraints, problems are : Problem set: 0 solved, 3 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 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: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/89 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 25/114 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/210 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/216 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/217 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 204/421 variables, 217/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 27/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 20/441 variables, 19/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/441 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/441 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/441 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/441 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/441 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 333 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3363 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4256ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4381 ms.
Support contains 38 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 205/205 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 236 transition count 204
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 2 place count 235 transition count 204
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 230 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 229 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 229 transition count 198
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 23 place count 229 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 229 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 228 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 227 transition count 187
Applied a total of 26 rules in 68 ms. Remains 227 /236 variables (removed 9) and now considering 187/205 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 227/236 places, 187/205 transitions.
RANDOM walk for 40000 steps (995 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (177 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (171 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (176 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 567193 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :1 out of 3
Probabilistic random walk after 567193 steps, saw 122578 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :1
FORMULA DES-PT-20b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6261209626486516781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2847608759351086120.kers'
[2026-05-25 06:53:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6261209626486516781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2847608759351086120.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 187 rows 219 cols 777 entries
Finished phase 1 with 119 SingleSign rule and 49 generalized
[2026-05-25 06:53:57] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2847608759351086120.kers
Total runtime 3 ms.
[2026-05-25 06:53:57] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/88 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/102 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/192 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/202 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/204 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/205 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 174/379 variables, 205/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 26/405 variables, 13/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/414 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/414 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/88 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/102 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/192 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/202 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/204 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/205 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 174/379 variables, 205/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 26/405 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/405 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/405 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/405 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/414 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3798 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4324ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1065 ms.
Support contains 37 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 227 /227 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 227/227 places, 187/187 transitions.
RANDOM walk for 40000 steps (983 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (178 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (161 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 644051 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 2
Probabilistic random walk after 644051 steps, saw 139518 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2026-05-25 06:54:05] [INFO ] Invariant cache hit.
[2026-05-25 06:54:05] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/88 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/102 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/192 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/202 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/204 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/205 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 174/379 variables, 205/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 26/405 variables, 13/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/414 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/414 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/88 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/102 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/192 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/202 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/204 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/205 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 174/379 variables, 205/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 26/405 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/405 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/405 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/405 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/414 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2921 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3409ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1067 ms.
Support contains 37 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 187/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 227 /227 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 227/227 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2026-05-25 06:54:10] [INFO ] Invariant cache hit.
[2026-05-25 06:54:10] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-25 06:54:10] [INFO ] Invariant cache hit.
[2026-05-25 06:54:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 06:54:11] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2026-05-25 06:54:11] [INFO ] Redundant transitions in 14 ms returned []
Running 183 sub problems to find dead transitions.
[2026-05-25 06:54:11] [INFO ] Invariant cache hit.
[2026-05-25 06:54:11] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/225 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 1/226 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 187/413 variables, 226/285 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 12/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (OVERLAPS) 1/414 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 16 (OVERLAPS) 0/414 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 313 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 2/225 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/226 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 187/413 variables, 226/301 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 183/496 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/414 variables, and 504 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 226/227 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61084 ms. Remains : 227/227 places, 187/187 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 187
Applied a total of 1 rules in 22 ms. Remains 227 /227 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10343011793189928246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4247619345055198509.kers'
[2026-05-25 06:55:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10343011793189928246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4247619345055198509.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 187 rows 219 cols 779 entries
Finished phase 1 with 118 SingleSign rule and 50 generalized
[2026-05-25 06:55:11] [INFO ] Computed 59 invariants in 2 ms
Computed 59 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4247619345055198509.kers
Total runtime 3 ms.
[2026-05-25 06:55:11] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 06:55:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2026-05-25 06:55:11] [INFO ] [Nat]Absence check using 36 positive and 23 generalized place invariants in 26 ms returned sat
[2026-05-25 06:55:12] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 06:55:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 465 ms
TRAPS : Iteration 1
[2026-05-25 06:55:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 2
[2026-05-25 06:55:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2026-05-25 06:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
TRAPS : Iteration 3
[2026-05-25 06:55:13] [INFO ] After 2158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 06:55:14] [INFO ] After 2690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 06:55:14] [INFO ] Flatten gal took : 54 ms
[2026-05-25 06:55:14] [INFO ] Flatten gal took : 36 ms
[2026-05-25 06:55:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2434222125056493331.gal : 11 ms
[2026-05-25 06:55:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5372194002027414354.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2434222125056493331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5372194002027414354.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5372194002027414354.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 56
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :56 after 152
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :152 after 2512
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2512 after 22576
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :22576 after 47128
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :47128 after 99408
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :99408 after 5.85827e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.85827e+06 after 1.07115e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.07115e+07 after 2.04579e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.04579e+07 after 5.62209e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.59201e+08 after 5.71441e+08
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.71441e+08 after 1.9496e+09
Detected timeout of ITS tools.
[2026-05-25 06:55:29] [INFO ] Flatten gal took : 25 ms
[2026-05-25 06:55:29] [INFO ] Applying decomposition
[2026-05-25 06:55:29] [INFO ] Flatten gal took : 23 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/graph17663712244707260074.txt' '-o' '/tmp/graph17663712244707260074.bin' '-w' '/tmp/graph17663712244707260074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17663712244707260074.bin' '-l' '-1' '-v' '-w' '/tmp/graph17663712244707260074.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:55:29] [INFO ] Decomposing Gal with order
[2026-05-25 06:55:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:55:29] [INFO ] Removed a total of 108 redundant transitions.
[2026-05-25 06:55:29] [INFO ] Flatten gal took : 118 ms
[2026-05-25 06:55:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 13 ms.
[2026-05-25 06:55:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5412148853511356578.gal : 7 ms
[2026-05-25 06:55:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5186816390860328959.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5412148853511356578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5186816390860328959.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality5186816390860328959.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 424
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :424 after 848
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :848 after 152856
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.57783e+07 after 3.6162e+10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.6162e+10 after 8.97587e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8.97587e+10 after 1.69114e+11
Reachability property DES-PT-20b-ReachabilityCardinality-2024-15 is true.
Reachability property DES-PT-20b-ReachabilityCardinality-2024-13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.86633e+14,7.08027,28508,2528,755,54765,2638,473,67301,229,10501,0
Total reachable state count : 186632800872628

Verifying 2 reachability properties.
Reachability property DES-PT-20b-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2024-13,14400,7.23327,28768,88,93,54765,2638,523,67301,244,10501,0
Reachability property DES-PT-20b-ReachabilityCardinality-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2024-15,6624,12.1017,28768,110,106,54765,2638,658,67301,266,10501,0
Over-approximation ignoring read arcs solved 0 properties in 30597 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 06:55:42] [INFO ] Flatten gal took : 24 ms
[2026-05-25 06:55:42] [INFO ] Applying decomposition
[2026-05-25 06:55:42] [INFO ] Flatten gal took : 23 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/graph1301969892974872897.txt' '-o' '/tmp/graph1301969892974872897.bin' '-w' '/tmp/graph1301969892974872897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1301969892974872897.bin' '-l' '-1' '-v' '-w' '/tmp/graph1301969892974872897.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:55:42] [INFO ] Decomposing Gal with order
[2026-05-25 06:55:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:55:42] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-25 06:55:42] [INFO ] Flatten gal took : 46 ms
[2026-05-25 06:55:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2026-05-25 06:55:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality162769139472481139.gal : 17 ms
[2026-05-25 06:55:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12518428621908489915.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/ReachabilityCardinality162769139472481139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12518428621908489915.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality12518428621908489915.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 149
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :149 after 529
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :529 after 3.13912e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3.13912e+06 after 2.91578e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.91578e+09 after 8.76878e+11
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.99163e+17 after 2.46926e+17
Reachability property DES-PT-20b-ReachabilityCardinality-2024-13 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.91404e+20 after 1.93554e+20
Reachability property DES-PT-20b-ReachabilityCardinality-2024-15 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.07043e+20,258.566,140188,8926,512,260687,3422,774,566640,229,11518,0
Total reachable state count : 607043428475987934208

Verifying 2 reachability properties.
Reachability property DES-PT-20b-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2024-13,1.65919e+12,314.783,140436,176,131,260687,3422,826,566640,246,11518,0
Reachability property DES-PT-20b-ReachabilityCardinality-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2024-15,1.45567e+07,316.467,140436,156,70,260687,3422,952,566640,265,11518,0
All properties solved without resorting to model-checking.
Total runtime 449633 ms.

BK_STOP 1779692459273

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DES-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-20b, examination is ReachabilityCardinality"
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-177946993700390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;