Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900462.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-B05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.0K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:11 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 1.2M 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-B05-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B05-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749392484056

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-B05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 14:21:25] [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 14:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 14:21:25] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-06-08 14:21:25] [INFO ] Transformed 1831 places.
[2025-06-08 14:21:25] [INFO ] Transformed 3454 transitions.
[2025-06-08 14:21:25] [INFO ] Found NUPN structural information;
[2025-06-08 14:21:25] [INFO ] Parsed PT model containing 1831 places and 3454 transitions and 22350 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (355 resets) in 2021 ms. (19 steps per ms) remains 10/13 properties
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 260 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 541 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
[2025-06-08 14:21:26] [INFO ] Flatten gal took : 497 ms
BEST_FIRST walk for 40002 steps (57 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 613 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 140 ms. (283 steps per ms) remains 9/10 properties
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (61 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (57 resets) in 131 ms. (303 steps per ms) remains 9/9 properties
[2025-06-08 14:21:27] [INFO ] Flatten gal took : 418 ms
// Phase 1: matrix 3454 rows 1831 cols
[2025-06-08 14:21:27] [INFO ] Computed 7 invariants in 75 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-06-08 14:21:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4606253132637015068.gal : 193 ms
[2025-06-08 14:21:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12844160842859988415.prop : 2 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/ReachabilityCardinality4606253132637015068.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12844160842859988415.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1730/1831 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1831 variables, 1730/1838 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality12844160842859988415.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1831 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3454/5285 variables, 1831/3669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5285 variables, 0/3669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/5285 variables, 0/3669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5285/5285 variables, and 3669 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3538 ms.
Refiners :[Domain max(s): 1831/1831 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1831/1831 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1730/1831 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1831 variables, 1730/1838 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:32] [INFO ] Deduced a trap composed of 397 places in 1222 ms of which 330 ms to minimize.
Problem MedleyB-PT-B05-ReachabilityCardinality-2025-00 is UNSAT
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :17 after 19
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :19 after 20
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :20 after 227
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :227 after 1208
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1208 after 7224
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :7224 after 7989
[2025-06-08 14:21:33] [INFO ] Deduced a trap composed of 398 places in 738 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :7989 after 93035
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :93035 after 328794
[2025-06-08 14:21:34] [INFO ] Deduced a trap composed of 399 places in 715 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:34] [INFO ] Deduced a trap composed of 399 places in 664 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1831 variables, 4/1842 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:36] [INFO ] Deduced a trap composed of 397 places in 1078 ms of which 365 ms to minimize.
SMT process timed out in 9311ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 96 out of 1831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1831/1831 places, 3454/3454 transitions.
Graph (trivial) has 1619 edges and 1831 vertex of which 93 / 1831 are part of one of the 15 SCC in 11 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (complete) has 2751 edges and 1753 vertex of which 1742 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.23 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1170 transitions
Trivial Post-agglo rules discarded 1170 transitions
Performed 1170 trivial Post agglomeration. Transition count delta: 1170
Iterating post reduction 0 with 1175 rules applied. Total rules applied 1177 place count 1742 transition count 2172
Reduce places removed 1170 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2371 place count 572 transition count 2148
Reduce places removed 10 places and 0 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 2 with 82 rules applied. Total rules applied 2453 place count 562 transition count 2076
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 2525 place count 490 transition count 2076
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 2525 place count 490 transition count 2000
Deduced a syphon composed of 76 places in 3 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 2677 place count 414 transition count 2000
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 2738 place count 353 transition count 1939
Iterating global reduction 4 with 61 rules applied. Total rules applied 2799 place count 353 transition count 1939
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 2808 place count 353 transition count 1930
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2811 place count 350 transition count 1930
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2811 place count 350 transition count 1929
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2813 place count 349 transition count 1929
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2832 place count 330 transition count 690
Iterating global reduction 6 with 19 rules applied. Total rules applied 2851 place count 330 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2854 place count 330 transition count 687
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2855 place count 329 transition count 686
Iterating global reduction 7 with 1 rules applied. Total rules applied 2856 place count 329 transition count 686
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2902 place count 306 transition count 663
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2908 place count 300 transition count 657
Iterating global reduction 7 with 6 rules applied. Total rules applied 2914 place count 300 transition count 657
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2917 place count 297 transition count 654
Iterating global reduction 7 with 3 rules applied. Total rules applied 2920 place count 297 transition count 654
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2922 place count 295 transition count 652
Iterating global reduction 7 with 2 rules applied. Total rules applied 2924 place count 295 transition count 652
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2932 place count 291 transition count 653
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2934 place count 291 transition count 651
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2940 place count 291 transition count 645
Free-agglomeration rule applied 50 times.
Iterating global reduction 8 with 50 rules applied. Total rules applied 2990 place count 291 transition count 595
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 8 with 50 rules applied. Total rules applied 3040 place count 241 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 9 with 104 rules applied. Total rules applied 3144 place count 241 transition count 491
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 3149 place count 241 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 3152 place count 241 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3153 place count 240 transition count 487
Applied a total of 3153 rules in 553 ms. Remains 240 /1831 variables (removed 1591) and now considering 487/3454 (removed 2967) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 562 ms. Remains : 240/1831 places, 487/3454 transitions.
RANDOM walk for 40000 steps (1518 resets) in 300 ms. (132 steps per ms) remains 6/8 properties
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (217 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (211 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (206 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (222 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (223 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (203 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
// Phase 1: matrix 487 rows 240 cols
[2025-06-08 14:21:37] [INFO ] Computed 6 invariants in 4 ms
[2025-06-08 14:21:37] [INFO ] State equation strengthened by 110 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 151/209 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 463/672 variables, 209/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 14/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 41/713 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 96/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 14/727 variables, 11/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/727 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/727 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 727/727 variables, and 356 constraints, problems are : Problem set: 0 solved, 6 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 240/240 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 151/209 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:38] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 463/672 variables, 209/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 14/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:39] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:39] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 41/713 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 96/357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/713 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :328794 after 4.367e+06
[2025-06-08 14:21:39] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/713 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 14/727 variables, 11/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/727 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/727 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 727/727 variables, and 371 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 240/240 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3596ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 603 ms.
Support contains 57 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 487/487 transitions.
Graph (complete) has 670 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 239 transition count 455
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 41 rules applied. Total rules applied 73 place count 209 transition count 444
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 199 transition count 444
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 83 place count 199 transition count 438
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 95 place count 193 transition count 438
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 187 transition count 432
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 187 transition count 432
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 184 transition count 429
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 184 transition count 429
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 182 transition count 427
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 182 transition count 427
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 127 place count 177 transition count 422
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 174 transition count 419
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 174 transition count 419
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 172 transition count 417
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 172 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 172 transition count 416
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 170 transition count 414
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 170 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 170 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 153 place count 170 transition count 403
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 162 place count 170 transition count 394
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 171 place count 161 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 161 transition count 392
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 175 place count 161 transition count 392
Applied a total of 175 rules in 119 ms. Remains 161 /240 variables (removed 79) and now considering 392/487 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 161/240 places, 392/487 transitions.
RANDOM walk for 40000 steps (1991 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (254 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (260 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (252 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (263 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (250 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 704842 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 5
Probabilistic random walk after 704842 steps, saw 128762 distinct states, run finished after 3006 ms. (steps per millisecond=234 ) properties seen :0
// Phase 1: matrix 392 rows 161 cols
[2025-06-08 14:21:44] [INFO ] Computed 7 invariants in 3 ms
[2025-06-08 14:21:44] [INFO ] State equation strengthened by 158 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 104/161 variables, 7/7 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 14:21:44] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 392/553 variables, 161/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 158/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 327 constraints, problems are : Problem set: 0 solved, 5 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 1/1 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 104/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/8 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 14:21:45] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:45] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:45] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:45] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:45] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 10/18 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 14:21:46] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:46] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 392/553 variables, 161/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 158/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 4/344 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 14:21:47] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:47] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 2/346 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 14:21:47] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:47] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:47] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:21:47] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/553 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 350 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3583ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 194 ms.
Support contains 29 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 392/392 transitions.
Graph (trivial) has 68 edges and 161 vertex of which 2 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 160 transition count 366
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 136 transition count 364
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 51 place count 136 transition count 361
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 133 transition count 361
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 130 transition count 358
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 130 transition count 358
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 128 transition count 356
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 128 transition count 356
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 121 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 121 transition count 347
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 117 transition count 343
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 117 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 117 transition count 342
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 115 transition count 340
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 115 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 115 transition count 339
Free-agglomeration rule applied 17 times with reduction of 16 identical transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 114 place count 115 transition count 306
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 45 rules applied. Total rules applied 159 place count 97 transition count 279
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 12 rules applied. Total rules applied 171 place count 87 transition count 277
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 173 place count 85 transition count 277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 173 place count 85 transition count 274
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 179 place count 82 transition count 274
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 185 place count 76 transition count 268
Iterating global reduction 8 with 6 rules applied. Total rules applied 191 place count 76 transition count 268
Performed 11 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 213 place count 65 transition count 180
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 8 with 63 rules applied. Total rules applied 276 place count 65 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 278 place count 64 transition count 123
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 286 place count 64 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 306 place count 64 transition count 95
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 315 place count 64 transition count 86
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 324 place count 55 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 328 place count 55 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 329 place count 54 transition count 81
Applied a total of 329 rules in 62 ms. Remains 54 /161 variables (removed 107) and now considering 81/392 (removed 311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 54/161 places, 81/392 transitions.
RANDOM walk for 15518 steps (871 resets) in 152 ms. (101 steps per ms) remains 0/4 properties
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 23509 ms.

BK_STOP 1749392508839

--------------------
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-B05"
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-B05, 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-174931339900462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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