Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266700268.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 gold2024
Input is PolyORBLF-PT-S02J04T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 223K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 295K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 312K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 906K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748899449175

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:24:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 21:24:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:24:10] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-02 21:24:10] [INFO ] Transformed 752 places.
[2025-06-02 21:24:10] [INFO ] Transformed 1572 transitions.
[2025-06-02 21:24:10] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 253 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (10 resets) in 1843 ms. (21 steps per ms) remains 22/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 58 ms. (67 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
[2025-06-02 21:24:11] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2025-06-02 21:24:12] [INFO ] Computed 54 invariants in 76 ms
[2025-06-02 21:24:12] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 14/710 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/750 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1392/2142 variables, 750/803 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2142 variables, 120/923 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2142 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/2144 variables, 2/925 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2144 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3776 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:24:17] [INFO ] Deduced a trap composed of 241 places in 362 ms of which 39 ms to minimize.
[2025-06-02 21:24:17] [INFO ] Deduced a trap composed of 428 places in 352 ms of which 5 ms to minimize.
[2025-06-02 21:24:18] [INFO ] Deduced a trap composed of 437 places in 356 ms of which 4 ms to minimize.
[2025-06-02 21:24:18] [INFO ] Deduced a trap composed of 430 places in 342 ms of which 7 ms to minimize.
[2025-06-02 21:24:18] [INFO ] Deduced a trap composed of 373 places in 298 ms of which 4 ms to minimize.
[2025-06-02 21:24:19] [INFO ] Deduced a trap composed of 437 places in 296 ms of which 4 ms to minimize.
[2025-06-02 21:24:19] [INFO ] Deduced a trap composed of 380 places in 307 ms of which 4 ms to minimize.
[2025-06-02 21:24:19] [INFO ] Deduced a trap composed of 421 places in 328 ms of which 4 ms to minimize.
[2025-06-02 21:24:20] [INFO ] Deduced a trap composed of 430 places in 292 ms of which 4 ms to minimize.
[2025-06-02 21:24:20] [INFO ] Deduced a trap composed of 456 places in 287 ms of which 4 ms to minimize.
[2025-06-02 21:24:21] [INFO ] Deduced a trap composed of 430 places in 301 ms of which 4 ms to minimize.
SMT process timed out in 9277ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 299 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2025-06-02 21:24:21] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2025-06-02 21:24:21] [INFO ] Computed 52 invariants in 30 ms
[2025-06-02 21:24:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 1 ms to minimize.
[2025-06-02 21:24:32] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2025-06-02 21:24:33] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2025-06-02 21:24:33] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2025-06-02 21:24:33] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 0 ms to minimize.
[2025-06-02 21:24:33] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:24:34] [INFO ] Deduced a trap composed of 89 places in 226 ms of which 3 ms to minimize.
[2025-06-02 21:24:35] [INFO ] Deduced a trap composed of 312 places in 228 ms of which 3 ms to minimize.
[2025-06-02 21:24:35] [INFO ] Deduced a trap composed of 288 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:24:35] [INFO ] Deduced a trap composed of 286 places in 260 ms of which 3 ms to minimize.
[2025-06-02 21:24:37] [INFO ] Deduced a trap composed of 206 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:24:37] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 3 ms to minimize.
[2025-06-02 21:24:39] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 2 ms to minimize.
[2025-06-02 21:24:39] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 3 ms to minimize.
[2025-06-02 21:24:39] [INFO ] Deduced a trap composed of 193 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1602 variables, and 70 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-02 21:24:51] [INFO ] Deduced a trap composed of 193 places in 234 ms of which 3 ms to minimize.
[2025-06-02 21:24:52] [INFO ] Deduced a trap composed of 262 places in 221 ms of which 2 ms to minimize.
[2025-06-02 21:24:52] [INFO ] Deduced a trap composed of 278 places in 215 ms of which 4 ms to minimize.
[2025-06-02 21:24:52] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:24:55] [INFO ] Deduced a trap composed of 169 places in 237 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1602 variables, and 75 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 25/25 constraints]
After SMT, in 42540ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 42558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42879 ms. Remains : 480/752 places, 1142/1412 transitions.
RANDOM walk for 4000000 steps (1430 resets) in 39715 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 1580 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (41 resets) in 1609 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (50 resets) in 1596 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1579 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (49 resets) in 1557 ms. (256 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (45 resets) in 1592 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (40 resets) in 1565 ms. (255 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 1583 ms. (252 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 1584 ms. (252 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 1576 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 1553 ms. (257 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (59 resets) in 1575 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (43 resets) in 1575 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (44 resets) in 1591 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (52 resets) in 1597 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (49 resets) in 1568 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 1708 ms. (234 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (56 resets) in 1630 ms. (245 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 1576 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (39 resets) in 1621 ms. (246 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 1602 ms. (249 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 1590 ms. (251 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 1872505 steps, run timeout after 63001 ms. (steps per millisecond=29 ) properties seen :0 out of 22
Probabilistic random walk after 1872505 steps, saw 1181051 distinct states, run finished after 63018 ms. (steps per millisecond=29 ) properties seen :0
[2025-06-02 21:26:28] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 21:26:28] [INFO ] Invariant cache hit.
[2025-06-02 21:26:28] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 19/427 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 50/477 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1600 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1600 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1600 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1602 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1602 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 652 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:26:33] [INFO ] Deduced a trap composed of 245 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:26:33] [INFO ] Deduced a trap composed of 206 places in 203 ms of which 3 ms to minimize.
[2025-06-02 21:26:33] [INFO ] Deduced a trap composed of 214 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:26:34] [INFO ] Deduced a trap composed of 206 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:26:34] [INFO ] Deduced a trap composed of 222 places in 187 ms of which 2 ms to minimize.
[2025-06-02 21:26:34] [INFO ] Deduced a trap composed of 223 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:26:34] [INFO ] Deduced a trap composed of 217 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:26:35] [INFO ] Deduced a trap composed of 226 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:26:35] [INFO ] Deduced a trap composed of 211 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:26:35] [INFO ] Deduced a trap composed of 209 places in 195 ms of which 3 ms to minimize.
[2025-06-02 21:26:35] [INFO ] Deduced a trap composed of 199 places in 201 ms of which 2 ms to minimize.
[2025-06-02 21:26:35] [INFO ] Deduced a trap composed of 206 places in 182 ms of which 3 ms to minimize.
[2025-06-02 21:26:36] [INFO ] Deduced a trap composed of 218 places in 193 ms of which 3 ms to minimize.
[2025-06-02 21:26:36] [INFO ] Deduced a trap composed of 215 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:26:36] [INFO ] Deduced a trap composed of 222 places in 186 ms of which 3 ms to minimize.
[2025-06-02 21:26:36] [INFO ] Deduced a trap composed of 254 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:26:37] [INFO ] Deduced a trap composed of 209 places in 188 ms of which 2 ms to minimize.
[2025-06-02 21:26:37] [INFO ] Deduced a trap composed of 218 places in 192 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 19/427 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 50/477 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:26:38] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2025-06-02 21:26:38] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:26:38] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:26:39] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/478 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1122/1600 variables, 478/557 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 120/677 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1600 variables, 22/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1600/1602 variables, and 699 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 28/28 constraints]
After SMT, in 48107ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 31 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 29 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2025-06-02 21:27:16] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 21:27:16] [INFO ] Invariant cache hit.
[2025-06-02 21:27:17] [INFO ] Implicit Places using invariants in 564 ms returned [3, 58, 120, 171, 248, 276, 333, 364, 372, 429]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 575 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1133
Applied a total of 18 rules in 57 ms. Remains 461 /470 variables (removed 9) and now considering 1133/1142 (removed 9) transitions.
[2025-06-02 21:27:17] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2025-06-02 21:27:17] [INFO ] Computed 42 invariants in 29 ms
[2025-06-02 21:27:17] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-06-02 21:27:17] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 21:27:17] [INFO ] Invariant cache hit.
[2025-06-02 21:27:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:27:28] [INFO ] Implicit Places using invariants and state equation in 10609 ms returned []
Implicit Place search using SMT with State Equation took 11149 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/480 places, 1133/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11811 ms. Remains : 461/480 places, 1133/1142 transitions.
RANDOM walk for 4000000 steps (1435 resets) in 35449 ms. (112 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (55 resets) in 1463 ms. (273 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (55 resets) in 1481 ms. (269 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (54 resets) in 1505 ms. (265 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (52 resets) in 1472 ms. (271 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (52 resets) in 1450 ms. (275 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 1487 ms. (268 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 1471 ms. (271 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 1510 ms. (264 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (55 resets) in 1477 ms. (270 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (63 resets) in 1448 ms. (276 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (56 resets) in 1561 ms. (256 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (60 resets) in 1454 ms. (274 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 1482 ms. (269 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (58 resets) in 1465 ms. (272 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 1858 ms. (215 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (50 resets) in 1706 ms. (234 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (46 resets) in 1751 ms. (228 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (57 resets) in 1529 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (55 resets) in 1461 ms. (273 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (62 resets) in 1456 ms. (274 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (52 resets) in 1478 ms. (270 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 1484 ms. (269 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 1898101 steps, run timeout after 54001 ms. (steps per millisecond=35 ) properties seen :0 out of 22
Probabilistic random walk after 1898101 steps, saw 1044481 distinct states, run finished after 54003 ms. (steps per millisecond=35 ) properties seen :0
[2025-06-02 21:28:41] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 21:28:41] [INFO ] Invariant cache hit.
[2025-06-02 21:28:41] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/459 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1113/1572 variables, 459/500 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1572 variables, 120/620 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1574 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1574 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 623 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2650 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:28:44] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 3 ms to minimize.
[2025-06-02 21:28:44] [INFO ] Deduced a trap composed of 225 places in 176 ms of which 2 ms to minimize.
[2025-06-02 21:28:45] [INFO ] Deduced a trap composed of 225 places in 180 ms of which 2 ms to minimize.
[2025-06-02 21:28:45] [INFO ] Deduced a trap composed of 233 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:28:45] [INFO ] Deduced a trap composed of 199 places in 180 ms of which 2 ms to minimize.
[2025-06-02 21:28:45] [INFO ] Deduced a trap composed of 231 places in 187 ms of which 7 ms to minimize.
[2025-06-02 21:28:45] [INFO ] Deduced a trap composed of 227 places in 185 ms of which 3 ms to minimize.
[2025-06-02 21:28:46] [INFO ] Deduced a trap composed of 218 places in 185 ms of which 2 ms to minimize.
[2025-06-02 21:28:46] [INFO ] Deduced a trap composed of 216 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:28:46] [INFO ] Deduced a trap composed of 219 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:28:46] [INFO ] Deduced a trap composed of 224 places in 183 ms of which 3 ms to minimize.
[2025-06-02 21:28:46] [INFO ] Deduced a trap composed of 230 places in 184 ms of which 2 ms to minimize.
[2025-06-02 21:28:47] [INFO ] Deduced a trap composed of 238 places in 187 ms of which 2 ms to minimize.
[2025-06-02 21:28:47] [INFO ] Deduced a trap composed of 220 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:28:47] [INFO ] Deduced a trap composed of 228 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:28:47] [INFO ] Deduced a trap composed of 234 places in 185 ms of which 2 ms to minimize.
[2025-06-02 21:28:47] [INFO ] Deduced a trap composed of 228 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:28:48] [INFO ] Deduced a trap composed of 230 places in 188 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:28:48] [INFO ] Deduced a trap composed of 264 places in 199 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 10/418 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 40/458 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-02 21:28:49] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:28:49] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:28:49] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:28:50] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-06-02 21:28:50] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 21:28:50] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-02 21:28:50] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 21:28:50] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-06-02 21:28:50] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/459 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1113/1572 variables, 459/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1572 variables, 120/648 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem smplace_234 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 39854ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 3420 ms.
Support contains 22 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 28 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 22 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2025-06-02 21:29:24] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 21:29:24] [INFO ] Invariant cache hit.
[2025-06-02 21:29:25] [INFO ] Implicit Places using invariants in 544 ms returned []
[2025-06-02 21:29:25] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 21:29:25] [INFO ] Invariant cache hit.
[2025-06-02 21:29:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:29:35] [INFO ] Implicit Places using invariants and state equation in 10452 ms returned []
Implicit Place search using SMT with State Equation took 11002 ms to find 0 implicit places.
[2025-06-02 21:29:35] [INFO ] Redundant transitions in 63 ms returned []
Running 1131 sub problems to find dead transitions.
[2025-06-02 21:29:35] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 21:29:35] [INFO ] Invariant cache hit.
[2025-06-02 21:29:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2025-06-02 21:29:45] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 21:29:47] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:29:47] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 4 ms to minimize.
[2025-06-02 21:29:47] [INFO ] Deduced a trap composed of 96 places in 212 ms of which 2 ms to minimize.
[2025-06-02 21:29:52] [INFO ] Deduced a trap composed of 271 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:29:52] [INFO ] Deduced a trap composed of 270 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:29:54] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:29:55] [INFO ] Deduced a trap composed of 181 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:29:55] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:29:55] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2025-06-02 21:29:57] [INFO ] Deduced a trap composed of 184 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:29:57] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:30:01] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:30:03] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 2 ms to minimize.
[2025-06-02 21:30:04] [INFO ] Deduced a trap composed of 204 places in 230 ms of which 3 ms to minimize.
[2025-06-02 21:30:04] [INFO ] Deduced a trap composed of 179 places in 233 ms of which 3 ms to minimize.
[2025-06-02 21:30:05] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:30:06] [INFO ] Deduced a trap composed of 188 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:30:06] [INFO ] Deduced a trap composed of 190 places in 201 ms of which 3 ms to minimize.
[2025-06-02 21:30:07] [INFO ] Deduced a trap composed of 206 places in 230 ms of which 3 ms to minimize.
[2025-06-02 21:30:07] [INFO ] Deduced a trap composed of 185 places in 211 ms of which 4 ms to minimize.
[2025-06-02 21:30:07] [INFO ] Deduced a trap composed of 202 places in 209 ms of which 2 ms to minimize.
SMT process timed out in 32057ms, After SMT, problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 32068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43165 ms. Remains : 461/461 places, 1133/1133 transitions.
RANDOM walk for 400000 steps (166 resets) in 5828 ms. (68 steps per ms) remains 22/22 properties
Running SMT prover for 22 properties.
[2025-06-02 21:30:09] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 21:30:09] [INFO ] Invariant cache hit.
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-02 21:30:09] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 14 ms returned sat
[2025-06-02 21:30:11] [INFO ] After 1326ms SMT Verify possible using state equation in real domain returned unsat :2 sat :20
[2025-06-02 21:30:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:30:11] [INFO ] After 549ms SMT Verify possible using 120 Read/Feed constraints in real domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2025-06-02 21:30:12] [INFO ] After 1860ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:20
[2025-06-02 21:30:12] [INFO ] After 3299ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2025-06-02 21:30:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 21:30:12] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 21:30:36] [INFO ] After 23870ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2025-06-02 21:30:43] [INFO ] After 6590ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2025-06-02 21:31:05] [INFO ] After 28859ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
[2025-06-02 21:31:10] [INFO ] After 57217ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 419756 ms.
ITS solved all properties within timeout

BK_STOP 1748899870204

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2024"
echo " Input is PolyORBLF-PT-S02J04T10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266700268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;