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.r154-tall-174876825400277.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 Parking-PT-864, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825400277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 427K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748842837197

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:40:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:40:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:40:38] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-06-02 05:40:38] [INFO ] Transformed 1185 places.
[2025-06-02 05:40:38] [INFO ] Transformed 1697 transitions.
[2025-06-02 05:40:38] [INFO ] Found NUPN structural information;
[2025-06-02 05:40:38] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 275 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1185/1185 places, 1697/1697 transitions.
Ensure Unique test removed 688 transitions
Reduce isomorphic transitions removed 688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 720 rules applied. Total rules applied 720 place count 1185 transition count 977
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 752 place count 1153 transition count 977
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 752 place count 1153 transition count 945
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 816 place count 1121 transition count 945
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 912 place count 1073 transition count 897
Applied a total of 912 rules in 159 ms. Remains 1073 /1185 variables (removed 112) and now considering 897/1697 (removed 800) transitions.
// Phase 1: matrix 897 rows 1073 cols
[2025-06-02 05:40:38] [INFO ] Computed 280 invariants in 39 ms
[2025-06-02 05:40:40] [INFO ] Implicit Places using invariants in 1057 ms returned [151, 158, 164, 170, 177, 184, 190, 196, 228, 230, 271, 278, 284, 290, 297, 304, 310, 316, 348, 350, 391, 398, 404, 410, 417, 424, 430, 436, 468, 470, 511, 518, 524, 530, 537, 544, 550, 556, 588, 590, 631, 638, 644, 650, 657, 664, 670, 676, 708, 710, 751, 758, 764, 770, 777, 784, 790, 796, 828, 830, 871, 878, 884, 890, 897, 904, 910, 916, 948, 950, 991, 998, 1004, 1010, 1017, 1024, 1030, 1036, 1068, 1070]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1091 ms to find 80 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 993/1185 places, 897/1697 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 921 transition count 825
Applied a total of 144 rules in 24 ms. Remains 921 /993 variables (removed 72) and now considering 825/897 (removed 72) transitions.
// Phase 1: matrix 825 rows 921 cols
[2025-06-02 05:40:40] [INFO ] Computed 200 invariants in 5 ms
[2025-06-02 05:40:40] [INFO ] Implicit Places using invariants in 454 ms returned []
[2025-06-02 05:40:40] [INFO ] Invariant cache hit.
[2025-06-02 05:40:40] [INFO ] State equation strengthened by 344 read => feed constraints.
[2025-06-02 05:40:43] [INFO ] Implicit Places using invariants and state equation in 3270 ms returned []
Implicit Place search using SMT with State Equation took 3728 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 921/1185 places, 825/1697 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5022 ms. Remains : 921/1185 places, 825/1697 transitions.
Discarding 288 transitions out of 825. Remains 537
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (156 resets) in 3235 ms. (12 steps per ms) remains 186/536 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 186/186 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 186/186 properties
[2025-06-02 05:40:44] [INFO ] Invariant cache hit.
[2025-06-02 05:40:44] [INFO ] State equation strengthened by 344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 523/881 variables, 180/538 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 523/1061 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/1746 variables, and 1061 constraints, problems are : Problem set: 0 solved, 186 unsolved in 5026 ms.
Refiners :[Domain max(s): 881/921 constraints, Positive P Invariants (semi-flows): 180/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 523/881 variables, 180/538 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 523/1061 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 881/1746 variables, and 1061 constraints, problems are : Problem set: 0 solved, 186 unsolved in 5013 ms.
Refiners :[Domain max(s): 881/921 constraints, Positive P Invariants (semi-flows): 180/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 0/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 10191ms problems are : Problem set: 0 solved, 186 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 358 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 825/825 transitions.
Free-agglomeration rule applied 92 times.
Iterating global reduction 0 with 92 rules applied. Total rules applied 92 place count 921 transition count 733
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 0 with 92 rules applied. Total rules applied 184 place count 829 transition count 733
Applied a total of 184 rules in 116 ms. Remains 829 /921 variables (removed 92) and now considering 733/825 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 829/921 places, 733/825 transitions.
RANDOM walk for 4000000 steps (15643 resets) in 68248 ms. (58 steps per ms) remains 119/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
// Phase 1: matrix 733 rows 829 cols
[2025-06-02 05:41:14] [INFO ] Computed 200 invariants in 3 ms
[2025-06-02 05:41:14] [INFO ] State equation strengthened by 376 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 238/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 465/703 variables, 127/365 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 465/830 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 126/829 variables, 73/903 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 126/1029 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 733/1562 variables, 829/1858 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1562 variables, 376/2234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/1562 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 2234 constraints, problems are : Problem set: 0 solved, 119 unsolved in 32883 ms.
Refiners :[Domain max(s): 829/829 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 829/829 constraints, ReadFeed: 376/376 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 238/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 465/703 variables, 127/365 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 465/830 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 126/829 variables, 73/903 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 126/1029 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 733/1562 variables, 829/1858 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1562 variables, 376/2234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 119/2353 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/1562 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
No progress, stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 2353 constraints, problems are : Problem set: 0 solved, 119 unsolved in 45016 ms.
Refiners :[Domain max(s): 829/829 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 829/829 constraints, ReadFeed: 376/376 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 77947ms problems are : Problem set: 0 solved, 119 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 238 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 733/733 transitions.
Free-agglomeration rule applied 53 times.
Iterating global reduction 0 with 53 rules applied. Total rules applied 53 place count 829 transition count 680
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 106 place count 776 transition count 680
Applied a total of 106 rules in 83 ms. Remains 776 /829 variables (removed 53) and now considering 680/733 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 776/829 places, 680/733 transitions.
RANDOM walk for 4000000 steps (7602 resets) in 55067 ms. (72 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 119/119 properties
Interrupted probabilistic random walk after 4431966 steps, run timeout after 48001 ms. (steps per millisecond=92 ) properties seen :72 out of 119
Probabilistic random walk after 4431966 steps, saw 510053 distinct states, run finished after 48007 ms. (steps per millisecond=92 ) properties seen :72
// Phase 1: matrix 680 rows 776 cols
[2025-06-02 05:43:36] [INFO ] Computed 200 invariants in 7 ms
[2025-06-02 05:43:36] [INFO ] State equation strengthened by 441 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 407/501 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 407/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 275/776 variables, 146/701 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 275/976 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 680/1456 variables, 776/1752 constraints. Problems are: Problem set: 0 solved, 47 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1456 variables, 441/2193 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1456 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/1456 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1456/1456 variables, and 2193 constraints, problems are : Problem set: 0 solved, 47 unsolved in 6998 ms.
Refiners :[Domain max(s): 776/776 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 776/776 constraints, ReadFeed: 441/441 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 407/501 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 407/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 275/776 variables, 146/701 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 275/976 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 680/1456 variables, 776/1752 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1456 variables, 441/2193 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1456 variables, 47/2240 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1456 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/1456 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1456/1456 variables, and 2240 constraints, problems are : Problem set: 0 solved, 47 unsolved in 11531 ms.
Refiners :[Domain max(s): 776/776 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 776/776 constraints, ReadFeed: 441/441 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 18565ms problems are : Problem set: 0 solved, 47 unsolved
Fused 47 Parikh solutions to 46 different solutions.
Parikh walk visited 0 properties in 4810 ms.
Support contains 94 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 680/680 transitions.
Free-agglomeration rule applied 72 times.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 776 transition count 608
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 144 place count 704 transition count 608
Applied a total of 144 rules in 59 ms. Remains 704 /776 variables (removed 72) and now considering 608/680 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 704/776 places, 608/680 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30710 ms. (130 steps per ms) remains 35/47 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1958 ms. (204 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1966 ms. (203 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2027 ms. (197 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1969 ms. (203 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2003 ms. (199 steps per ms) remains 30/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1958 ms. (204 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2027 ms. (197 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2033 ms. (196 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2021 ms. (197 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2029 ms. (197 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1938 ms. (206 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1894 ms. (211 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1970 ms. (202 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2032 ms. (196 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1849 ms. (216 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2081 ms. (192 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2026 ms. (197 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1947 ms. (205 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2057 ms. (194 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2127 ms. (187 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2090 ms. (191 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1916 ms. (208 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1900 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2111 ms. (189 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1960 ms. (203 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2013 ms. (198 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1971 ms. (202 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1995 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2000 ms. (199 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1956 ms. (204 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1966 ms. (203 steps per ms) remains 25/25 properties
// Phase 1: matrix 608 rows 704 cols
[2025-06-02 05:44:34] [INFO ] Computed 200 invariants in 2 ms
[2025-06-02 05:44:34] [INFO ] State equation strengthened by 513 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 407/457 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 407/489 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 247/704 variables, 168/657 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 247/904 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 608/1312 variables, 704/1608 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 513/2121 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1312 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/1312 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 2121 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2960 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 704/704 constraints, ReadFeed: 513/513 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 407/457 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 407/489 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 247/704 variables, 168/657 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 247/904 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 608/1312 variables, 704/1608 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 513/2121 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1312 variables, 25/2146 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1312 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/1312 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 2146 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4661 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 704/704 constraints, ReadFeed: 513/513 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 7642ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 3 properties in 5405 ms.
Support contains 44 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 608/608 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 704 transition count 583
Reduce places removed 25 places and 0 transitions.
Graph (complete) has 1386 edges and 679 vertex of which 604 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Iterating post reduction 0 with 26 rules applied. Total rules applied 51 place count 604 transition count 527
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 65 place count 604 transition count 513
Applied a total of 65 rules in 51 ms. Remains 604 /704 variables (removed 100) and now considering 513/608 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 604/704 places, 513/608 transitions.
RANDOM walk for 4000000 steps (8 resets) in 45827 ms. (87 steps per ms) remains 14/22 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 16131 ms. (247 steps per ms) remains 13/14 properties
BEST_FIRST walk for 3538814 steps (7 resets) in 14931 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3795568 steps (8 resets) in 16525 ms. (229 steps per ms) remains 12/13 properties
BEST_FIRST walk for 3683349 steps (8 resets) in 16153 ms. (228 steps per ms) remains 11/12 properties
BEST_FIRST walk for 3954506 steps (8 resets) in 17340 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 3837913 steps (8 resets) in 16157 ms. (237 steps per ms) remains 11/11 properties
BEST_FIRST walk for 3892096 steps (8 resets) in 16315 ms. (238 steps per ms) remains 10/11 properties
BEST_FIRST walk for 3930564 steps (8 resets) in 16710 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3634810 steps (7 resets) in 16633 ms. (218 steps per ms) remains 9/10 properties
BEST_FIRST walk for 3753884 steps (8 resets) in 15443 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 3798120 steps (8 resets) in 15465 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 3647073 steps (7 resets) in 15317 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 3782033 steps (8 resets) in 15488 ms. (244 steps per ms) remains 9/9 properties
// Phase 1: matrix 513 rows 604 cols
[2025-06-02 05:46:07] [INFO ] Computed 182 invariants in 2 ms
[2025-06-02 05:46:07] [INFO ] State equation strengthened by 468 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 291/309 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 291/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 295/604 variables, 168/491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 295/786 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 513/1117 variables, 604/1390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1117 variables, 468/1858 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1117 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1117 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1117/1117 variables, and 1858 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1070 ms.
Refiners :[Domain max(s): 604/604 constraints, Positive P Invariants (semi-flows): 182/182 constraints, State Equation: 604/604 constraints, ReadFeed: 468/468 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 291/309 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 291/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 295/604 variables, 168/491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 295/786 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 513/1117 variables, 604/1390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1117 variables, 468/1858 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1117 variables, 9/1867 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1117 variables, 0/1867 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1117 variables, 0/1867 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1117/1117 variables, and 1867 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1507 ms.
Refiners :[Domain max(s): 604/604 constraints, Positive P Invariants (semi-flows): 182/182 constraints, State Equation: 604/604 constraints, ReadFeed: 468/468 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2593ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 6 properties in 3052 ms.
Support contains 6 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 513/513 transitions.
Graph (complete) has 1228 edges and 604 vertex of which 448 are kept as prefixes of interest. Removing 156 places using SCC suffix rule.0 ms
Discarding 156 places :
Also discarding 120 output transitions
Drop transitions (Output transitions of discarded places.) removed 120 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 448 transition count 373
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 448 transition count 365
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 37 place count 440 transition count 365
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 440 transition count 354
Reduce places removed 11 places and 0 transitions.
Graph (complete) has 849 edges and 429 vertex of which 348 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.1 ms
Discarding 81 places :
Also discarding 62 output transitions
Drop transitions (Output transitions of discarded places.) removed 62 transitions
Iterating post reduction 1 with 12 rules applied. Total rules applied 60 place count 348 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 348 transition count 284
Applied a total of 68 rules in 22 ms. Remains 348 /604 variables (removed 256) and now considering 284/513 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 348/604 places, 284/513 transitions.
RANDOM walk for 1622 steps (0 resets) in 21 ms. (73 steps per ms) remains 0/3 properties
Able to resolve query QuasiLiveness after proving 537 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 335093 ms.
ITS solved all properties within timeout

BK_STOP 1748843173579

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 QuasiLiveness -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="Parking-PT-864"
export BK_EXAMINATION="QuasiLiveness"
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 Parking-PT-864, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-174876825400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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