Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366100286.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 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 201K 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 ASLink-PT-01a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779470345153

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 17:19:06] [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-22 17:19:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:19:06] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2026-05-22 17:19:06] [INFO ] Transformed 431 places.
[2026-05-22 17:19:06] [INFO ] Transformed 735 transitions.
[2026-05-22 17:19:06] [INFO ] Found NUPN structural information;
[2026-05-22 17:19:06] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (739 resets) in 1397 ms. (28 steps per ms) remains 4/14 properties
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 17:19:07] [INFO ] Flatten gal took : 134 ms
BEST_FIRST walk for 40002 steps (265 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
[2026-05-22 17:19:07] [INFO ] Flatten gal took : 54 ms
BEST_FIRST walk for 40002 steps (319 resets) in 362 ms. (110 steps per ms) remains 4/4 properties
[2026-05-22 17:19:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1331523008756633274.gal : 60 ms
[2026-05-22 17:19:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2399316078373458416.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1331523008756633274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2399316078373458416.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (272 resets) in 382 ms. (104 steps per ms) remains 4/4 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 ...328
BEST_FIRST walk for 40002 steps (269 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality2399316078373458416.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1285428313427125948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2923836050092802629.kers'
[2026-05-22 17:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1285428313427125948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2923836050092802629.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 728 rows 427 cols 2779 entries
Finished phase 1 with 142 SingleSign rule and 209 generalized
[2026-05-22 17:19:07] [INFO ] Computed 80 invariants in 3 ms
Computed 80 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2923836050092802629.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 70
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :70 after 270
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :270 after 1675
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1675 after 5670
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5670 after 6105
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 79/154 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 79/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 15/169 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 15/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ASLink-PT-01a-ReachabilityCardinality-2024-05 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6105 after 29932
At refinement iteration 9 (OVERLAPS) 254/423 variables, 58/242 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 254/496 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/496 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8/431 variables, 7/503 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 8/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Reachability property ASLink-PT-01a-ReachabilityCardinality-2024-02 is true.
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :29932 after 81277
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 942 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1119 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 78/109 variables, 6/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 78/115 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD size :81277 after 164369
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/141 variables, 8/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 32/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 271/412 variables, 54/209 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 271/480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 1/481 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/481 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/431 variables, 12/493 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 19/512 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/512 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/943 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 944 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2855 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4094ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 425 transition count 701
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 61 place count 398 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 397 transition count 700
Reachability property ASLink-PT-01a-ReachabilityCardinality-2024-01 is true.
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 4096
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 397 transition count 676
SDD size :164369 after 1.54577e+06
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 118 place count 365 transition count 676
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 364 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 364 transition count 675
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 121 place count 363 transition count 675
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 361 transition count 665
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 360 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 360 transition count 663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 359 transition count 663
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 130 place count 358 transition count 655
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 358 transition count 655
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 357 transition count 647
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 357 transition count 647
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 356 transition count 639
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 356 transition count 639
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 355 transition count 631
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 355 transition count 631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 354 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 354 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 353 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 353 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 352 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 352 transition count 607
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 147 place count 350 transition count 605
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 150 place count 350 transition count 602
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 153 place count 347 transition count 602
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 155 place count 347 transition count 600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 157 place count 345 transition count 600
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 158 place count 345 transition count 600
Applied a total of 158 rules in 287 ms. Remains 345 /431 variables (removed 86) and now considering 600/728 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 345/431 places, 600/728 transitions.
RANDOM walk for 40000 steps (944 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (361 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.54577e+06 after 2.5137e+06
Interrupted probabilistic random walk after 759762 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 759762 steps, saw 263818 distinct states, run finished after 3009 ms. (steps per millisecond=252 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-397155826709245720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-517950462964321106.kers'
[2026-05-22 17:19:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-397155826709245720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-517950462964321106.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 600 rows 343 cols 2348 entries
Finished phase 1 with 76 SingleSign rule and 205 generalized
[2026-05-22 17:19:15] [INFO ] Computed 64 invariants in 3 ms
Computed 64 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-517950462964321106.kers
Total runtime 4 ms.
[2026-05-22 17:19:15] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/118 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/329 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/345 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 600/945 variables, 345/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/945 variables, 9/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/945 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/945 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 945/945 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 345/345 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/0 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/118 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/329 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/345 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 600/945 variables, 345/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/945 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/945 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 945/945 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 345/345 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2579ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 24 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 600/600 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 345 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 344 transition count 599
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 344 transition count 598
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 343 transition count 598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 342 transition count 590
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 342 transition count 590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 341 transition count 582
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 341 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 340 transition count 574
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 340 transition count 574
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 339 transition count 566
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 339 transition count 566
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 338 transition count 558
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 338 transition count 558
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 337 transition count 550
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 337 transition count 550
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 336 transition count 542
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 336 transition count 542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 335 transition count 534
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 335 transition count 534
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 2 with 2 rules applied. Total rules applied 22 place count 334 transition count 533
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 334 transition count 533
Applied a total of 23 rules in 96 ms. Remains 334 /345 variables (removed 11) and now considering 533/600 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 334/345 places, 533/600 transitions.
RANDOM walk for 40000 steps (916 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (341 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.5137e+06 after 2.83682e+06
Interrupted probabilistic random walk after 771288 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 771288 steps, saw 271512 distinct states, run finished after 3004 ms. (steps per millisecond=256 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12604151970663902321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10366013595162729242.kers'
[2026-05-22 17:19:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12604151970663902321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10366013595162729242.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 533 rows 332 cols 2087 entries
Finished phase 1 with 67 SingleSign rule and 203 generalized
[2026-05-22 17:19:21] [INFO ] Computed 64 invariants in 9 ms
Computed 64 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10366013595162729242.kers
Total runtime 10 ms.
[2026-05-22 17:19:21] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/135 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/322 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/334 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 533/867 variables, 334/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/867 variables, 9/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/867 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/867 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 867/867 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 334/334 constraints, ReadFeed: 9/9 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/135 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/322 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/334 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 533/867 variables, 334/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/867 variables, 9/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/867 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/867 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/867 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 867/867 variables, and 409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 334/334 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 24 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 533/533 transitions.
Applied a total of 0 rules in 11 ms. Remains 334 /334 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 334/334 places, 533/533 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 533/533 transitions.
Applied a total of 0 rules in 11 ms. Remains 334 /334 variables (removed 0) and now considering 533/533 (removed 0) transitions.
[2026-05-22 17:19:23] [INFO ] Invariant cache hit.
[2026-05-22 17:19:24] [INFO ] Implicit Places using invariants in 295 ms returned [1, 19, 20, 22, 51, 69, 132, 142, 161, 172, 173, 174, 175, 176, 195, 197, 200, 218, 219, 220, 221, 234, 240, 246, 252, 258, 264, 270, 276, 282, 288, 294, 333]
[2026-05-22 17:19:24] [INFO ] Actually due to overlaps returned [195, 176, 51, 200, 175, 219, 174, 197, 218, 1, 173, 19, 20, 69, 172, 221, 264, 282, 294, 333, 22, 161, 220, 234, 240, 246, 252, 258, 270, 276, 288]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 309 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 303/334 places, 533/533 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 301 transition count 507
Reduce places removed 26 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 33 rules applied. Total rules applied 61 place count 275 transition count 500
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 268 transition count 500
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 68 place count 268 transition count 486
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 97 place count 253 transition count 486
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 109 place count 249 transition count 478
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 117 place count 241 transition count 478
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 128 place count 230 transition count 467
Iterating global reduction 5 with 11 rules applied. Total rules applied 139 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 142 place count 230 transition count 464
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 144 place count 228 transition count 462
Iterating global reduction 6 with 2 rules applied. Total rules applied 146 place count 228 transition count 462
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 174 place count 214 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 214 transition count 447
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 177 place count 214 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 179 place count 212 transition count 445
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 189 place count 212 transition count 435
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 200 place count 201 transition count 435
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 202 place count 201 transition count 435
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 205 place count 201 transition count 435
Applied a total of 205 rules in 74 ms. Remains 201 /303 variables (removed 102) and now considering 435/533 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17168997870655349169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15196221408745063671.kers'
[2026-05-22 17:19:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17168997870655349169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15196221408745063671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 435 rows 201 cols 1717 entries
Finished phase 1 with 70 SingleSign rule and 106 generalized
[2026-05-22 17:19:24] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15196221408745063671.kers
Total runtime 6 ms.
[2026-05-22 17:19:24] [INFO ] Implicit Places using invariants in 140 ms returned [76, 100, 110, 116, 121, 197]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 141 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 195/334 places, 435/533 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 195 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 194 transition count 434
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 193 transition count 433
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 193 transition count 433
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 191 transition count 431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 190 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 190 transition count 429
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 190 transition count 427
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 188 transition count 427
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 188 transition count 427
Applied a total of 15 rules in 29 ms. Remains 188 /195 variables (removed 7) and now considering 427/435 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11028286795430494284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-873785226835594283.kers'
[2026-05-22 17:19:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11028286795430494284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-873785226835594283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 427 rows 188 cols 1684 entries
Finished phase 1 with 74 SingleSign rule and 95 generalized
[2026-05-22 17:19:24] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-873785226835594283.kers
Total runtime 2 ms.
[2026-05-22 17:19:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-22 17:19:24] [INFO ] Invariant cache hit.
[2026-05-22 17:19:24] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 188/334 places, 427/533 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 976 ms. Remains : 188/334 places, 427/533 transitions.
RANDOM walk for 40000 steps (1052 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (387 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 717558 steps, run visited all 1 properties in 1838 ms. (steps per millisecond=390 )
Probabilistic random walk after 717558 steps, saw 238176 distinct states, run finished after 1845 ms. (steps per millisecond=388 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 20192 ms.

BK_STOP 1779470366912

--------------------
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r002-oct2-177944366100286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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