Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200246.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 MedleyA-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 184K May 29 14:32 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 MedleyA-PT-19-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748884754229

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 17:19:16] [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-02 17:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:19:17] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2025-06-02 17:19:17] [INFO ] Transformed 272 places.
[2025-06-02 17:19:17] [INFO ] Transformed 586 transitions.
[2025-06-02 17:19:17] [INFO ] Found NUPN structural information;
[2025-06-02 17:19:17] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (18 resets) in 3041 ms. (13 steps per ms) remains 11/13 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 17:19:18] [INFO ] Flatten gal took : 273 ms
[2025-06-02 17:19:18] [INFO ] Flatten gal took : 309 ms
BEST_FIRST walk for 40001 steps (17 resets) in 1326 ms. (30 steps per ms) remains 11/11 properties
[2025-06-02 17:19:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1993409463907905413.gal : 188 ms
BEST_FIRST walk for 40004 steps (22 resets) in 764 ms. (52 steps per ms) remains 11/11 properties
[2025-06-02 17:19:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2731280744926232028.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1993409463907905413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2731280744926232028.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 ...328
BEST_FIRST walk for 40001 steps (11 resets) in 578 ms. (69 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality2731280744926232028.prop.
BEST_FIRST walk for 40001 steps (13 resets) in 343 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (17 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :11 after 23
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :23 after 63
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :63 after 408
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :408 after 528
Reachability property MedleyA-PT-19-ReachabilityCardinality-2025-01 is true.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :528 after 856
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :856 after 1113
BEST_FIRST walk for 40001 steps (19 resets) in 291 ms. (136 steps per ms) remains 11/11 properties
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :1113 after 2679
BEST_FIRST walk for 40001 steps (20 resets) in 250 ms. (159 steps per ms) remains 10/11 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :2679 after 3330
BEST_FIRST walk for 40003 steps (13 resets) in 406 ms. (98 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :3330 after 6405
BEST_FIRST walk for 40002 steps (25 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 358 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 381 ms. (104 steps per ms) remains 10/10 properties
// Phase 1: matrix 583 rows 269 cols
[2025-06-02 17:19:20] [INFO ] Computed 24 invariants in 47 ms
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/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 103/152 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 103/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Reachability property MedleyA-PT-19-ReachabilityCardinality-2025-14 is true.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-19-ReachabilityCardinality-2025-12 is true.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 5 (OVERLAPS) 9/161 variables, 1/162 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 9/171 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-00 does not hold.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :6405 after 7.26556e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 105/266 variables, 13/184 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 105/289 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/269 variables, 1/290 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 3/293 constraints. Problems are: Problem set: 3 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :7.26556e+07 after 7.26744e+07
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 583/852 variables, 269/562 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/852 variables, 0/562 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/852 variables, 0/562 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 562 constraints, problems are : Problem set: 3 solved, 7 unsolved in 1655 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 111/137 variables, 8/34 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 111/145 constraints. Problems are: Problem set: 3 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :7.26744e+07 after 1.36197e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/145 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 13/150 variables, 2/147 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 13/160 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 116/266 variables, 13/173 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 116/289 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:22] [INFO ] Deduced a trap composed of 34 places in 398 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:23] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:23] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:23] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:23] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:24] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:24] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:24] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:24] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:24] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:25] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:25] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:25] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Reachability property MedleyA-PT-19-ReachabilityCardinality-2025-09 is true.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1.36197e+08 after 5.89576e+08
[2025-06-02 17:19:25] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 14/303 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:25] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:26] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 46 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 2/305 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/305 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/269 variables, 1/306 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 3/309 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 0/309 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 583/852 variables, 269/578 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 6/584 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/852 variables, and 584 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5018 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6948ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 264 transition count 548
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 37 rules applied. Total rules applied 69 place count 233 transition count 542
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 230 transition count 539
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 78 place count 227 transition count 539
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 78 place count 227 transition count 531
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 94 place count 219 transition count 531
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 157 place count 156 transition count 456
Iterating global reduction 4 with 63 rules applied. Total rules applied 220 place count 156 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 220 place count 156 transition count 455
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 155 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 224 place count 153 transition count 451
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 153 transition count 451
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 282 place count 125 transition count 423
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 286 place count 125 transition count 419
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 300 place count 118 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 329 place count 118 transition count 429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 117 transition count 428
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 335 place count 117 transition count 424
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 339 place count 113 transition count 424
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 353 place count 113 transition count 598
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 403 place count 99 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 405 place count 99 transition count 560
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 417 place count 99 transition count 560
Applied a total of 417 rules in 514 ms. Remains 99 /269 variables (removed 170) and now considering 560/583 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 99/269 places, 560/583 transitions.
RANDOM walk for 40000 steps (3097 resets) in 3183 ms. (12 steps per ms) remains 4/6 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (592 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (558 resets) in 141 ms. (281 steps per ms) remains 1/4 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 17:19:28] [INFO ] Flow matrix only has 484 transitions (discarded 76 similar events)
// Phase 1: matrix 484 rows 99 cols
[2025-06-02 17:19:28] [INFO ] Computed 23 invariants in 5 ms
[2025-06-02 17:19:28] [INFO ] State equation strengthened by 217 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/53 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/96 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/98 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 484/582 variables, 98/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 217/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/583 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/583 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 99/99 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/53 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/96 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:28] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:29] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/98 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 484/582 variables, 98/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 217/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/583 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/583 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 99/99 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 560/560 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 97 transition count 558
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 97 transition count 556
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 95 transition count 556
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 94 transition count 553
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 94 transition count 553
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 24 place count 87 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 87 transition count 534
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 87 transition count 573
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 84 transition count 573
Applied a total of 42 rules in 207 ms. Remains 84 /99 variables (removed 15) and now considering 573/560 (removed -13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 84/99 places, 573/560 transitions.
RANDOM walk for 40000 steps (3808 resets) in 659 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (741 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 760954 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 760954 steps, saw 139561 distinct states, run finished after 3013 ms. (steps per millisecond=252 ) properties seen :0
[2025-06-02 17:19:33] [INFO ] Flow matrix only has 485 transitions (discarded 88 similar events)
// Phase 1: matrix 485 rows 84 cols
[2025-06-02 17:19:33] [INFO ] Computed 23 invariants in 3 ms
[2025-06-02 17:19:33] [INFO ] State equation strengthened by 255 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/43 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/81 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/83 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 485/568 variables, 83/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 255/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/569 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/569 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/569 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 84/84 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/43 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/81 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:33] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/83 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:34] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 485/568 variables, 83/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 255/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/569 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/569 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/569 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 84/84 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 9 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 573/573 transitions.
Applied a total of 0 rules in 25 ms. Remains 84 /84 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 84/84 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 573/573 transitions.
Applied a total of 0 rules in 25 ms. Remains 84 /84 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2025-06-02 17:19:34] [INFO ] Flow matrix only has 485 transitions (discarded 88 similar events)
[2025-06-02 17:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:19:34] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 17:19:34] [INFO ] Flow matrix only has 485 transitions (discarded 88 similar events)
[2025-06-02 17:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:19:34] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-02 17:19:35] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:19:35] [INFO ] Redundant transitions in 91 ms returned []
Running 571 sub problems to find dead transitions.
[2025-06-02 17:19:35] [INFO ] Flow matrix only has 485 transitions (discarded 88 similar events)
[2025-06-02 17:19:35] [INFO ] Invariant cache hit.
[2025-06-02 17:19:36] [INFO ] State equation strengthened by 255 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-07 does not hold.
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :5.89576e+08 after 1.90917e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-15 does not hold.
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-11 does not hold.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.90917e+09 after 7.10952e+09
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/84 variables, 9/23 constraints. Problems are: Problem set: 102 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:43] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:43] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:43] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:44] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :7.10952e+09 after 7.44636e+09
[2025-06-02 17:19:44] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:44] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:44] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 7/30 constraints. Problems are: Problem set: 102 solved, 469 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :7.44636e+09 after 8.69506e+09
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/30 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 5 (OVERLAPS) 485/569 variables, 84/114 constraints. Problems are: Problem set: 102 solved, 469 unsolved
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :8.69506e+09 after 2.54174e+10
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 255/369 constraints. Problems are: Problem set: 102 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 369 constraints, problems are : Problem set: 102 solved, 469 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 84/84 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 102 solved, 469 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 14/14 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 2/84 variables, 9/23 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 7/30 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/30 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 5 (OVERLAPS) 485/569 variables, 84/114 constraints. Problems are: Problem set: 102 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 255/369 constraints. Problems are: Problem set: 102 solved, 469 unsolved
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :2.54174e+10 after 4.70988e+10
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 469/838 constraints. Problems are: Problem set: 102 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 838 constraints, problems are : Problem set: 102 solved, 469 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 84/84 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 469/571 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61581ms problems are : Problem set: 102 solved, 469 unsolved
Search for dead transitions found 102 dead transitions in 61604ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) removed 102 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/84 places, 471/573 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 471
Applied a total of 3 rules in 36 ms. Remains 81 /84 variables (removed 3) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 81 cols
[2025-06-02 17:20:37] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:37] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 17:20:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-02 17:20:38] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/84 places, 471/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64095 ms. Remains : 81/84 places, 471/573 transitions.
RANDOM walk for 40000 steps (3855 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (737 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1013480 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1013480 steps, saw 184731 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2025-06-02 17:20:41] [INFO ] Invariant cache hit.
[2025-06-02 17:20:41] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/70 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/80 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 471/551 variables, 80/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 241/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/552 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/552 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 81/81 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:42] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/70 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/80 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 471/551 variables, 80/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 241/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/552 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/552 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 81/81 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 471/471 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 81/81 places, 471/471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 471/471 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2025-06-02 17:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 17:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-02 17:20:44] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:20:44] [INFO ] Redundant transitions in 53 ms returned []
Running 469 sub problems to find dead transitions.
[2025-06-02 17:20:44] [INFO ] Invariant cache hit.
[2025-06-02 17:20:44] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 2/81 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:49] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:49] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:49] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:49] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:50] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:50] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:50] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (OVERLAPS) 471/552 variables, 81/108 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 241/349 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 349 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 81/81 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 2/81 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (OVERLAPS) 471/552 variables, 81/108 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 241/349 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 469/818 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 818 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 81/81 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60713ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62073 ms. Remains : 81/81 places, 471/471 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 36 edges and 81 vertex of which 5 / 81 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 409 edges and 78 vertex of which 68 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 68 transition count 417
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 67 transition count 385
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 67 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 1 with 26 rules applied. Total rules applied 68 place count 67 transition count 359
Free-agglomeration rule applied 4 times with reduction of 4 identical transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 67 transition count 351
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 120 place count 63 transition count 307
Free-agglomeration rule (complex) applied 5 times with reduction of 36 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 63 transition count 335
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 174 place count 58 transition count 291
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 195 place count 58 transition count 291
Applied a total of 195 rules in 55 ms. Remains 58 /81 variables (removed 23) and now considering 291/471 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 58 cols
[2025-06-02 17:21:44] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:21:44] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:21:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 17:21:45] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-02 17:21:45] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 17:21:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 17:21:45] [INFO ] After 37ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 17:21:45] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:21:45] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:21:45] [INFO ] Flatten gal took : 55 ms
[2025-06-02 17:21:45] [INFO ] Flatten gal took : 46 ms
[2025-06-02 17:21:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1364676673835053930.gal : 20 ms
[2025-06-02 17:21:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15635652227235474910.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1364676673835053930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15635652227235474910.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
Loading property file /tmp/ReachabilityCardinality15635652227235474910.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 61
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :61 after 701
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :701 after 6689
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6689 after 11281
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-03 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,592501,0.147591,7576,2,439,12,5730,6,0,528,2772,0
Total reachable state count : 592501

Verifying 1 reachability properties.
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-19-ReachabilityCardinality-2025-03,1440,0.155394,7832,2,93,12,5730,7,0,554,2772,0
Over-approximation ignoring read arcs solved 0 properties in 798 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 17:21:45] [INFO ] Flatten gal took : 73 ms
[2025-06-02 17:21:45] [INFO ] Applying decomposition
[2025-06-02 17:21:46] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5261893888045456380.txt' '-o' '/tmp/graph5261893888045456380.bin' '-w' '/tmp/graph5261893888045456380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5261893888045456380.bin' '-l' '-1' '-v' '-w' '/tmp/graph5261893888045456380.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:21:46] [INFO ] Decomposing Gal with order
[2025-06-02 17:21:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:21:46] [INFO ] Removed a total of 1408 redundant transitions.
[2025-06-02 17:21:46] [INFO ] Flatten gal took : 234 ms
[2025-06-02 17:21:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 46 ms.
[2025-06-02 17:21:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality270999573329039893.gal : 22 ms
[2025-06-02 17:21:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8964938764742560336.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality270999573329039893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8964938764742560336.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality8964938764742560336.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 160
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :160 after 368
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :368 after 892
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :892 after 239600
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :239600 after 1.64921e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.05706e+09 after 1.88235e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.22116e+13,10.0927,190492,4693,243,271095,1690,1132,1.16787e+06,112,20863,0
Total reachable state count : 22211581521061

Verifying 1 reachability properties.
Invariant property MedleyA-PT-19-ReachabilityCardinality-2025-03 does not hold.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-19-ReachabilityCardinality-2025-03,5.91031e+09,10.2096,190492,1512,232,271095,1690,1150,1.16787e+06,120,20863,6854
All properties solved without resorting to model-checking.
Total runtime 160537 ms.

BK_STOP 1748884917232

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r128-smll-174876524200246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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