Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900446.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyB-PT-B03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 482K Jun 5 20:08 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 MedleyB-PT-B03-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B03-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749388491694

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 13:14:52] [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]
[2025-06-08 13:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 13:14:53] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-08 13:14:53] [INFO ] Transformed 1529 places.
[2025-06-08 13:14:53] [INFO ] Transformed 2131 transitions.
[2025-06-08 13:14:53] [INFO ] Found NUPN structural information;
[2025-06-08 13:14:53] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (420 resets) in 1503 ms. (26 steps per ms) remains 10/13 properties
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (77 resets) in 582 ms. (68 steps per ms) remains 10/10 properties
[2025-06-08 13:14:54] [INFO ] Flatten gal took : 396 ms
BEST_FIRST walk for 40004 steps (78 resets) in 979 ms. (40 steps per ms) remains 10/10 properties
[2025-06-08 13:14:54] [INFO ] Flatten gal took : 192 ms
BEST_FIRST walk for 40003 steps (78 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (77 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (74 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
[2025-06-08 13:14:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12543019967346921377.gal : 122 ms
BEST_FIRST walk for 40003 steps (79 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (78 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
[2025-06-08 13:14:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1907835441316172020.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12543019967346921377.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1907835441316172020.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (77 resets) in 265 ms. (150 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (78 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
// Phase 1: matrix 2131 rows 1529 cols
[2025-06-08 13:14:54] [INFO ] Computed 6 invariants in 39 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality1907835441316172020.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1371/1529 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1529 variables, 1371/1535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1529 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2131/3660 variables, 1529/3064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :3 after 12
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :12 after 14
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :14 after 19
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :19 after 63
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :63 after 211
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :211 after 1007
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1007 after 1216
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1216 after 2174
At refinement iteration 6 (INCLUDED_ONLY) 0/3660 variables, 0/3064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :2174 after 7598
At refinement iteration 7 (OVERLAPS) 0/3660 variables, 0/3064 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3660/3660 variables, and 3064 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2799 ms.
Refiners :[Domain max(s): 1529/1529 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1529/1529 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MedleyB-PT-B03-ReachabilityCardinality-2025-01 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B03-ReachabilityCardinality-2025-11 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1371/1529 variables, 6/164 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1529 variables, 1371/1535 constraints. Problems are: Problem set: 2 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :7598 after 695131
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:59] [INFO ] Deduced a trap composed of 395 places in 1054 ms of which 447 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:00] [INFO ] Deduced a trap composed of 395 places in 928 ms of which 392 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:01] [INFO ] Deduced a trap composed of 396 places in 762 ms of which 270 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:02] [INFO ] Deduced a trap composed of 396 places in 640 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:02] [INFO ] Deduced a trap composed of 396 places in 709 ms of which 320 ms to minimize.
SMT process timed out in 8251ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 1529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Graph (trivial) has 1291 edges and 1529 vertex of which 41 / 1529 are part of one of the 8 SCC in 13 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 2227 edges and 1496 vertex of which 1489 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 926 transitions
Trivial Post-agglo rules discarded 926 transitions
Performed 926 trivial Post agglomeration. Transition count delta: 926
Iterating post reduction 0 with 929 rules applied. Total rules applied 931 place count 1489 transition count 1155
Reduce places removed 926 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 950 rules applied. Total rules applied 1881 place count 563 transition count 1131
Reduce places removed 11 places and 0 transitions.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 2 with 96 rules applied. Total rules applied 1977 place count 552 transition count 1046
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 3 with 85 rules applied. Total rules applied 2062 place count 467 transition count 1046
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 2062 place count 467 transition count 989
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 2176 place count 410 transition count 989
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 2219 place count 367 transition count 946
Iterating global reduction 4 with 43 rules applied. Total rules applied 2262 place count 367 transition count 946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2262 place count 367 transition count 945
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2264 place count 366 transition count 945
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2278 place count 352 transition count 595
Iterating global reduction 4 with 14 rules applied. Total rules applied 2292 place count 352 transition count 595
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2293 place count 351 transition count 594
Iterating global reduction 4 with 1 rules applied. Total rules applied 2294 place count 351 transition count 594
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2295 place count 350 transition count 593
Iterating global reduction 4 with 1 rules applied. Total rules applied 2296 place count 350 transition count 593
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2328 place count 334 transition count 577
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2329 place count 334 transition count 576
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2334 place count 329 transition count 571
Iterating global reduction 5 with 5 rules applied. Total rules applied 2339 place count 329 transition count 571
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2343 place count 325 transition count 567
Iterating global reduction 5 with 4 rules applied. Total rules applied 2347 place count 325 transition count 567
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2351 place count 321 transition count 563
Iterating global reduction 5 with 4 rules applied. Total rules applied 2355 place count 321 transition count 563
Performed 12 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 2379 place count 309 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2383 place count 309 transition count 575
Free-agglomeration rule applied 52 times.
Iterating global reduction 5 with 52 rules applied. Total rules applied 2435 place count 309 transition count 523
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 2487 place count 257 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 6 with 36 rules applied. Total rules applied 2523 place count 257 transition count 487
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2525 place count 257 transition count 487
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 2526 place count 257 transition count 486
Applied a total of 2526 rules in 415 ms. Remains 257 /1529 variables (removed 1272) and now considering 486/2131 (removed 1645) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 257/1529 places, 486/2131 transitions.
RANDOM walk for 40000 steps (2375 resets) in 512 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (291 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (296 resets) in 98 ms. (404 steps per ms) remains 7/8 properties
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (295 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (300 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (298 resets) in 65 ms. (606 steps per ms) remains 5/7 properties
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (298 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (298 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
// Phase 1: matrix 486 rows 257 cols
[2025-06-08 13:15:03] [INFO ] Computed 5 invariants in 4 ms
[2025-06-08 13:15:03] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 155/214 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 449/663 variables, 214/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 63/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 42/705 variables, 19/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 23/728 variables, 15/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/728 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 8/736 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/736 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/740 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/740 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/740 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 3/743 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/743 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/743 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 335 constraints, problems are : Problem set: 0 solved, 5 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 257/257 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 155/214 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:04] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:04] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 449/663 variables, 214/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 63/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 42/705 variables, 19/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 23/728 variables, 15/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/728 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 8/736 variables, 5/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/736 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/740 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/740 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/743 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/743 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/743 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 743/743 variables, and 345 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2327 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 257/257 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3205ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 59 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 486/486 transitions.
Graph (trivial) has 122 edges and 257 vertex of which 8 / 257 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 643 edges and 253 vertex of which 251 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 251 transition count 424
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 62 rules applied. Total rules applied 117 place count 199 transition count 414
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 192 transition count 414
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 124 place count 192 transition count 408
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 136 place count 186 transition count 408
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 181 transition count 387
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 181 transition count 387
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 162 place count 173 transition count 379
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 166 place count 173 transition count 375
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 169 place count 170 transition count 372
Iterating global reduction 4 with 3 rules applied. Total rules applied 172 place count 170 transition count 372
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 168 transition count 370
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 168 transition count 370
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 185 place count 168 transition count 361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 186 place count 167 transition count 360
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 167 transition count 360
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 193 place count 167 transition count 354
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 197 place count 165 transition count 354
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 202 place count 165 transition count 349
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 217 place count 165 transition count 334
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 233 place count 150 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 240 place count 150 transition count 326
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 150 transition count 326
Applied a total of 241 rules in 86 ms. Remains 150 /257 variables (removed 107) and now considering 326/486 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 150/257 places, 326/486 transitions.
RANDOM walk for 40000 steps (2300 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (348 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (351 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (345 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (352 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (356 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 884486 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 5
Probabilistic random walk after 884486 steps, saw 163976 distinct states, run finished after 3006 ms. (steps per millisecond=294 ) properties seen :0
// Phase 1: matrix 326 rows 150 cols
[2025-06-08 13:15:10] [INFO ] Computed 5 invariants in 2 ms
[2025-06-08 13:15:10] [INFO ] State equation strengthened by 127 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 315/447 variables, 132/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 83/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 24/471 variables, 14/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 43/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/476 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:10] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:11] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:11] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/476 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/476 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 285 constraints, problems are : Problem set: 0 solved, 5 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 150/150 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 315/447 variables, 132/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 83/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 24/471 variables, 14/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 43/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/476 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/476 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 289 constraints, problems are : Problem set: 0 solved, 5 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 150/150 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1668ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 70 ms.
Support contains 38 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 326/326 transitions.
Graph (trivial) has 45 edges and 150 vertex of which 4 / 150 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 148 transition count 304
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 130 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 128 transition count 302
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 126 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 126 transition count 300
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 3 with 10 rules applied. Total rules applied 55 place count 121 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 121 transition count 291
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 63 place count 117 transition count 287
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 117 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 117 transition count 286
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 74 place count 117 transition count 280
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 80 place count 111 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 93 place count 111 transition count 267
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 111 transition count 267
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 96 place count 111 transition count 266
Applied a total of 96 rules in 48 ms. Remains 111 /150 variables (removed 39) and now considering 266/326 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 111/150 places, 266/326 transitions.
RANDOM walk for 40000 steps (2346 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (382 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2157506 steps, run visited all 1 properties in 2572 ms. (steps per millisecond=838 )
Probabilistic random walk after 2157506 steps, saw 400094 distinct states, run finished after 2575 ms. (steps per millisecond=837 ) properties seen :1
FORMULA MedleyB-PT-B03-ReachabilityCardinality-2025-13 TRUE 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 21969 ms.

BK_STOP 1749388515006

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="MedleyB-PT-B03"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B03, 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 r254-tall-174931339900446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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