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.r098-tall-177955695600566.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 DLCround-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695600566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.7K Mar 6 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 6 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:23 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 813K 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 DLCround-PT-06b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779634138868

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 14:49:00] [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-24 14:49:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 14:49:00] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2026-05-24 14:49:00] [INFO ] Transformed 2340 places.
[2026-05-24 14:49:00] [INFO ] Transformed 3456 transitions.
[2026-05-24 14:49:00] [INFO ] Found NUPN structural information;
[2026-05-24 14:49:00] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1928 ms. (20 steps per ms) remains 3/13 properties
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 3/3 properties
[2026-05-24 14:49:01] [INFO ] Flatten gal took : 457 ms
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18250723608189872972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11866709829337722188.kers'
[2026-05-24 14:49:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18250723608189872972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11866709829337722188.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3456 rows 2340 cols 9288 entries
Finished phase 1 with 2231 SingleSign rule and 0 generalized
[2026-05-24 14:49:01] [INFO ] Computed 109 invariants in 16 ms
Computed 109 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-11866709829337722188.kers
Total runtime 21 ms.
[2026-05-24 14:49:01] [INFO ] Flatten gal took : 200 ms
[2026-05-24 14:49:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17956259495878564451.gal : 157 ms
[2026-05-24 14:49:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9871219232640892299.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/ReachabilityCardinality17956259495878564451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9871219232640892299.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 ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality9871219232640892299.prop.
At refinement iteration 2 (OVERLAPS) 2169/2220 variables, 97/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2220 variables, 2169/2317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2220 variables, 0/2317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 120/2340 variables, 12/2329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2340 variables, 120/2449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3456/5796 variables, 2340/4789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5796/5796 variables, and 4789 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2836 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 2340/2340 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/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2169/2220 variables, 97/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2220 variables, 2169/2317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 36
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :36 after 1583
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1583 after 21886
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :21886 after 23123
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :23123 after 33758
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :33758 after 103849
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :103849 after 1.13271e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.13271e+06 after 2.01676e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/2220 variables, 1/2318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.01676e+06 after 4.17096e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.17096e+07 after 1.65976e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/2220 variables, 0/2318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 120/2340 variables, 12/2330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 120/2450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.65976e+08 after 7.33626e+08
At refinement iteration 8 (INCLUDED_ONLY) 0/2340 variables, 0/2450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3456/5796 variables, 2340/4790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :7.33626e+08 after 1.19048e+10
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5796/5796 variables, and 4793 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5015 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 2340/2340 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8074ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 2340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Graph (trivial) has 2123 edges and 2340 vertex of which 330 / 2340 are part of one of the 30 SCC in 16 ms
Free SCC test removed 300 places
Drop transitions (Empty/Sink Transition effects.) removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 893 transitions
Trivial Post-agglo rules discarded 893 transitions
Performed 893 trivial Post agglomeration. Transition count delta: 893
Iterating post reduction 0 with 893 rules applied. Total rules applied 894 place count 2040 transition count 2224
Reduce places removed 893 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 947 rules applied. Total rules applied 1841 place count 1147 transition count 2170
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 32 rules applied. Total rules applied 1873 place count 1123 transition count 2162
Reduce places removed 4 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 3 with 34 rules applied. Total rules applied 1907 place count 1119 transition count 2132
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 34 rules applied. Total rules applied 1941 place count 1089 transition count 2128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1942 place count 1088 transition count 2128
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1942 place count 1088 transition count 2117
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1964 place count 1077 transition count 2117
Discarding 262 places :
Symmetric choice reduction at 6 with 262 rule applications. Total rules 2226 place count 815 transition count 1855
Iterating global reduction 6 with 262 rules applied. Total rules applied 2488 place count 815 transition count 1855
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 106 Pre rules applied. Total rules applied 2488 place count 815 transition count 1749
Deduced a syphon composed of 106 places in 4 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 6 with 212 rules applied. Total rules applied 2700 place count 709 transition count 1749
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 2742 place count 667 transition count 1347
Iterating global reduction 6 with 42 rules applied. Total rules applied 2784 place count 667 transition count 1347
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2796 place count 667 transition count 1335
Performed 166 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 7 with 332 rules applied. Total rules applied 3128 place count 501 transition count 1163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3130 place count 501 transition count 1161
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3134 place count 497 transition count 1121
Iterating global reduction 8 with 4 rules applied. Total rules applied 3138 place count 497 transition count 1121
Performed 61 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 8 with 122 rules applied. Total rules applied 3260 place count 436 transition count 1600
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 8 with 83 rules applied. Total rules applied 3343 place count 436 transition count 1517
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 3356 place count 423 transition count 1253
Iterating global reduction 9 with 13 rules applied. Total rules applied 3369 place count 423 transition count 1253
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 3384 place count 423 transition count 1238
Drop transitions (Redundant composition of simpler transitions.) removed 103 transitions
Redundant transition composition rules discarded 103 transitions
Iterating global reduction 10 with 103 rules applied. Total rules applied 3487 place count 423 transition count 1135
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 3491 place count 419 transition count 1090
Iterating global reduction 10 with 4 rules applied. Total rules applied 3495 place count 419 transition count 1090
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3499 place count 419 transition count 1086
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3501 place count 418 transition count 1085
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3503 place count 416 transition count 1065
Iterating global reduction 11 with 2 rules applied. Total rules applied 3505 place count 416 transition count 1065
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3507 place count 416 transition count 1063
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3515 place count 412 transition count 1085
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3518 place count 412 transition count 1082
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 13 with 15 rules applied. Total rules applied 3533 place count 412 transition count 1067
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3535 place count 411 transition count 1073
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3536 place count 411 transition count 1072
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 3537 place count 411 transition count 1071
Free-agglomeration rule applied 167 times with reduction of 63 identical transitions.
Iterating global reduction 14 with 167 rules applied. Total rules applied 3704 place count 411 transition count 841
Reduce places removed 167 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 219 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 223 transitions.
Graph (complete) has 711 edges and 244 vertex of which 233 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 391 rules applied. Total rules applied 4095 place count 233 transition count 618
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 4101 place count 233 transition count 612
Discarding 17 places :
Symmetric choice reduction at 16 with 17 rule applications. Total rules 4118 place count 216 transition count 567
Iterating global reduction 16 with 17 rules applied. Total rules applied 4135 place count 216 transition count 567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 4137 place count 215 transition count 566
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 16 with 44 rules applied. Total rules applied 4181 place count 215 transition count 522
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 4183 place count 215 transition count 538
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 4200 place count 213 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 4204 place count 213 transition count 519
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 4207 place count 213 transition count 519
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 4208 place count 213 transition count 519
Applied a total of 4208 rules in 707 ms. Remains 213 /2340 variables (removed 2127) and now considering 519/3456 (removed 2937) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 714 ms. Remains : 213/2340 places, 519/3456 transitions.
RANDOM walk for 40000 steps (8 resets) in 844 ms. (47 steps per ms) remains 2/3 properties
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 14:49:10] [INFO ] Flow matrix only has 315 transitions (discarded 204 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6104062157181990839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6954193785716889185.kers'
[2026-05-24 14:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6104062157181990839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6954193785716889185.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 315 rows 177 cols 1189 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-24 14:49:10] [INFO ] Computed 84 invariants in 5 ms
Computed 84 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6954193785716889185.kers
Total runtime 6 ms.
[2026-05-24 14:49:10] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/96 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/180 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/213 variables, 33/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 315/528 variables, 213/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 81/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/528 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 213/213 constraints, ReadFeed: 81/81 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/96 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/180 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/213 variables, 33/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 315/528 variables, 213/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 81/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/528 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 213/213 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 11252 ms.

BK_STOP 1779634151373

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DLCround-PT-06b"
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 DLCround-PT-06b, 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 r098-tall-177955695600566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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