About the Execution of 2024-gold for DES-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15691.270 | 203320.00 | 318167.00 | 899.30 | F | normal |
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.r070-smll-174854076400178.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 DES-PT-10a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076400178
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 43K 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 1748651880907
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 00:38:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 00:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:38:03] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-05-31 00:38:03] [INFO ] Transformed 155 places.
[2025-05-31 00:38:04] [INFO ] Transformed 112 transitions.
[2025-05-31 00:38:04] [INFO ] Found NUPN structural information;
[2025-05-31 00:38:04] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 409 ms.
Structural test allowed to assert that 44 places are NOT stable. Took 15 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
RANDOM walk for 40000 steps (896 resets) in 3114 ms. (12 steps per ms) remains 22/111 properties
BEST_FIRST walk for 4003 steps (15 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (16 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (17 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (18 resets) in 59 ms. (66 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (19 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (19 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (15 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (19 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
// Phase 1: matrix 98 rows 155 cols
[2025-05-31 00:38:05] [INFO ] Computed 59 invariants in 20 ms
[2025-05-31 00:38:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 48/70 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 48/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 55/125 variables, 34/111 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 55/166 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 22/147 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 22/206 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 97/244 variables, 147/353 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 9/253 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/253 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 370 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2259 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 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, 22/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 48/70 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 48/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 55/125 variables, 34/111 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 55/166 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-31 00:38:08] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 22/147 variables, 18/185 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 22/207 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 97/244 variables, 147/354 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 22/377 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 9/253 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-31 00:38:10] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2025-05-31 00:38:10] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2025-05-31 00:38:10] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-05-31 00:38:10] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-05-31 00:38:11] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 5/398 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-31 00:38:12] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/253 variables, and 399 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5014 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints]
After SMT, in 7355ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 154 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 154 transition count 95
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 154 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 153 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 152 transition count 94
Applied a total of 10 rules in 124 ms. Remains 152 /155 variables (removed 3) and now considering 94/98 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 152/155 places, 94/98 transitions.
RANDOM walk for 4000000 steps (54486 resets) in 21296 ms. (187 steps per ms) remains 11/22 properties
BEST_FIRST walk for 4000003 steps (9070 resets) in 5212 ms. (767 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (9150 resets) in 5213 ms. (767 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (9125 resets) in 5206 ms. (768 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (9088 resets) in 5562 ms. (719 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000003 steps (9084 resets) in 5906 ms. (677 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (9127 resets) in 5107 ms. (783 steps per ms) remains 7/10 properties
BEST_FIRST walk for 4000003 steps (9064 resets) in 4998 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (9113 resets) in 4818 ms. (830 steps per ms) remains 7/7 properties
// Phase 1: matrix 94 rows 152 cols
[2025-05-31 00:38:30] [INFO ] Computed 60 invariants in 11 ms
[2025-05-31 00:38:30] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 35/99 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 11/223 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/224 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 12/236 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/236 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/236 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 10/246 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 7 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 35/99 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-05-31 00:38:31] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
[2025-05-31 00:38:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 11/223 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1/224 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/224 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 12/236 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 10/246 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/246 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 223 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1762ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 1029 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 15 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 152/152 places, 94/94 transitions.
RANDOM walk for 4000000 steps (54452 resets) in 8719 ms. (458 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (9149 resets) in 4847 ms. (825 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4751830 steps, run timeout after 9001 ms. (steps per millisecond=527 ) properties seen :0 out of 1
Probabilistic random walk after 4751830 steps, saw 632218 distinct states, run finished after 9007 ms. (steps per millisecond=527 ) properties seen :0
// Phase 1: matrix 94 rows 152 cols
[2025-05-31 00:38:46] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 00:38:46] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/224 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/225 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/237 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 9/246 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/224 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/237 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/246 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 13 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-05-31 00:38:46] [INFO ] Invariant cache hit.
[2025-05-31 00:38:46] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-05-31 00:38:46] [INFO ] Invariant cache hit.
[2025-05-31 00:38:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:38:47] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2025-05-31 00:38:47] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
[2025-05-31 00:38:47] [INFO ] Invariant cache hit.
[2025-05-31 00:38:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 94/245 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:38:50] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:38:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-05-31 00:38:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:38:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 3 ms to minimize.
[2025-05-31 00:38:52] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-05-31 00:38:52] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:38:53] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:38:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/246 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 224 constraints, problems are : Problem set: 0 solved, 91 unsolved in 11160 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 2/151 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 94/245 variables, 151/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 91/314 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
[2025-05-31 00:39:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2025-05-31 00:39:15] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:19] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 3 ms to minimize.
[2025-05-31 00:39:19] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 322 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 17/17 constraints]
After SMT, in 41244ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 41250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41756 ms. Remains : 152/152 places, 94/94 transitions.
RANDOM walk for 400000 steps (5478 resets) in 2716 ms. (147 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-05-31 00:39:29] [INFO ] Invariant cache hit.
[2025-05-31 00:39:29] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-31 00:39:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-31 00:39:29] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-31 00:39:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:39:29] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:39:29] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 00:39:29] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (54653 resets) in 11070 ms. (361 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (9142 resets) in 4439 ms. (900 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6084702 steps, run timeout after 12001 ms. (steps per millisecond=507 ) properties seen :0 out of 1
Probabilistic random walk after 6084702 steps, saw 777791 distinct states, run finished after 12002 ms. (steps per millisecond=506 ) properties seen :0
[2025-05-31 00:39:45] [INFO ] Invariant cache hit.
[2025-05-31 00:39:45] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/224 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/225 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/237 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 9/246 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/224 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/237 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/246 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-05-31 00:39:45] [INFO ] Invariant cache hit.
[2025-05-31 00:39:46] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-31 00:39:46] [INFO ] Invariant cache hit.
[2025-05-31 00:39:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:39:46] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2025-05-31 00:39:46] [INFO ] Redundant transitions in 3 ms returned []
Running 91 sub problems to find dead transitions.
[2025-05-31 00:39:46] [INFO ] Invariant cache hit.
[2025-05-31 00:39:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2025-05-31 00:39:48] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 94/245 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:50] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:51] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 3 ms to minimize.
[2025-05-31 00:39:51] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:53] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2025-05-31 00:39:53] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2025-05-31 00:39:53] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:55] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:39:56] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/246 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 224 constraints, problems are : Problem set: 0 solved, 91 unsolved in 13704 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 2/151 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 94/245 variables, 151/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 91/314 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:18] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2025-05-31 00:40:18] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 322 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 17/17 constraints]
After SMT, in 43768ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 43771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44324 ms. Remains : 152/152 places, 94/94 transitions.
RANDOM walk for 400000 steps (5464 resets) in 914 ms. (437 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-05-31 00:40:30] [INFO ] Invariant cache hit.
[2025-05-31 00:40:30] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2025-05-31 00:40:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2025-05-31 00:40:30] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-31 00:40:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:40:30] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:40:30] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 00:40:30] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (537 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (90 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1568999 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :0 out of 1
Probabilistic random walk after 1568999 steps, saw 219627 distinct states, run finished after 3001 ms. (steps per millisecond=522 ) properties seen :0
[2025-05-31 00:40:33] [INFO ] Invariant cache hit.
[2025-05-31 00:40:33] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/224 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/225 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/237 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 9/246 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/224 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/237 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/246 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 152/152 places, 94/94 transitions.
RANDOM walk for 40000 steps (558 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1585064 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :0 out of 1
Probabilistic random walk after 1585064 steps, saw 221723 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
[2025-05-31 00:40:37] [INFO ] Invariant cache hit.
[2025-05-31 00:40:37] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/224 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/225 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/237 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 9/246 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/88 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/122 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/131 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/224 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/237 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/246 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/246 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-05-31 00:40:37] [INFO ] Invariant cache hit.
[2025-05-31 00:40:37] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-31 00:40:37] [INFO ] Invariant cache hit.
[2025-05-31 00:40:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:40:38] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2025-05-31 00:40:38] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
[2025-05-31 00:40:38] [INFO ] Invariant cache hit.
[2025-05-31 00:40:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:39] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-05-31 00:40:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 94/245 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:40] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:41] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2025-05-31 00:40:41] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/246 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 224 constraints, problems are : Problem set: 0 solved, 91 unsolved in 8942 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 2/151 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 94/245 variables, 151/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 91/314 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:40:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2025-05-31 00:41:01] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 12 ms to minimize.
[2025-05-31 00:41:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-05-31 00:41:04] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2025-05-31 00:41:04] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 16 (OVERLAPS) 0/246 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 322 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 17/17 constraints]
After SMT, in 38980ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 38982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39510 ms. Remains : 152/152 places, 94/94 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 16 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2025-05-31 00:41:17] [INFO ] Computed 60 invariants in 5 ms
[2025-05-31 00:41:17] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:41:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-05-31 00:41:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-31 00:41:17] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:41:17] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2025-05-31 00:41:17] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2025-05-31 00:41:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
TRAPS : Iteration 1
[2025-05-31 00:41:17] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:41:17] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 527 ms.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 18 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 00:41:17] [INFO ] Invariant cache hit.
[2025-05-31 00:41:17] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:41:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-05-31 00:41:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-31 00:41:17] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:41:17] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:41:17] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 333 ms.
Unable to solve all queries for examination StableMarking. Remains :1 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/StableMarking.xml in 4 ms.
Working with output stream class java.io.PrintStream
Total runtime 194404 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-10a
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 155
TRANSITIONS: 112
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 552
NUPN UNITS: 60
LOADING TIME: 0.613
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.054
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.087
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 839
MODEL NAME: /home/mcc/execution/model
155 places, 112 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StableMarking FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1748652084227
--------------------
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 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="DES-PT-10a"
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 DES-PT-10a, 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 r070-smll-174854076400178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a 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 '
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 ;