About the Execution of 2024-gold for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15692.950 | 1800000.00 | 2862378.00 | 2971.60 | [undef] | Time out reached |
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.r084-tall-174860080400312.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 DoubleExponent-PT-020, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080400312
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 340K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748736485849
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:08:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 00:08:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:08:07] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-01 00:08:07] [INFO ] Transformed 1064 places.
[2025-06-01 00:08:07] [INFO ] Transformed 998 transitions.
[2025-06-01 00:08:07] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 221 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1060 transition count 758
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 484 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 484 place count 820 transition count 718
Deduced a syphon composed of 40 places in 43 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 564 place count 780 transition count 718
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 5 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 932 place count 596 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 10 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1008 place count 558 transition count 534
Applied a total of 1008 rules in 184 ms. Remains 558 /1064 variables (removed 506) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2025-06-01 00:08:07] [INFO ] Invariants computation overflowed in 57 ms
[2025-06-01 00:08:08] [INFO ] Implicit Places using invariants in 536 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2025-06-01 00:08:08] [INFO ] Invariants computation overflowed in 15 ms
[2025-06-01 00:08:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 00:08:15] [INFO ] Implicit Places using invariants and state equation in 7017 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7586 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 556/1064 places, 534/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 556 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 555 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 552 transition count 530
Applied a total of 8 rules in 29 ms. Remains 552 /556 variables (removed 4) and now considering 530/534 (removed 4) transitions.
// Phase 1: matrix 530 rows 552 cols
[2025-06-01 00:08:15] [INFO ] Computed 99 invariants in 68 ms
[2025-06-01 00:08:15] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-06-01 00:08:15] [INFO ] Invariant cache hit.
[2025-06-01 00:08:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 00:08:27] [INFO ] Implicit Places using invariants and state equation in 11281 ms returned []
Implicit Place search using SMT with State Equation took 11761 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 552/1064 places, 530/998 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 19578 ms. Remains : 552/1064 places, 530/998 transitions.
Discarding 118 transitions out of 530. Remains 412
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4906 resets) in 2454 ms. (16 steps per ms) remains 397/411 properties
BEST_FIRST walk for 401 steps (29 resets) in 16 ms. (23 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (25 resets) in 24 ms. (16 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (25 resets) in 14 ms. (26 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (26 resets) in 53 ms. (7 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (28 resets) in 82 ms. (4 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (31 resets) in 78 ms. (5 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 80 ms. (4 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (27 resets) in 20 ms. (19 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (32 resets) in 20 ms. (19 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (30 resets) in 22 ms. (17 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (31 resets) in 35 ms. (11 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (26 resets) in 13 ms. (28 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (27 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (24 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (24 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (30 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 13 ms. (28 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (30 resets) in 13 ms. (28 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (27 resets) in 12 ms. (31 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (32 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (27 resets) in 12 ms. (31 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (24 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (27 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (30 resets) in 19 ms. (20 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (29 resets) in 16 ms. (23 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (32 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (31 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (27 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (30 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 16 ms. (23 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (27 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (29 resets) in 14 ms. (26 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (31 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (32 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (31 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (29 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (32 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (27 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (30 resets) in 8 ms. (44 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (31 resets) in 8 ms. (44 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (28 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (27 resets) in 8 ms. (44 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (26 resets) in 8 ms. (44 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (34 resets) in 8 ms. (44 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
Interrupted probabilistic random walk after 63697 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :35 out of 397
Probabilistic random walk after 63697 steps, saw 31854 distinct states, run finished after 3018 ms. (steps per millisecond=21 ) properties seen :35
[2025-06-01 00:08:31] [INFO ] Invariant cache hit.
[2025-06-01 00:08:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1082 variables, and 83 constraints, problems are : Problem set: 0 solved, 362 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 83/97 constraints, State Equation: 0/552 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 15/503 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/1082 variables, and 89 constraints, problems are : Problem set: 0 solved, 362 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 89/97 constraints, State Equation: 0/552 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/362 constraints, Known Traps: 0/0 constraints]
After SMT, in 10271ms problems are : Problem set: 0 solved, 362 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 488 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 552 transition count 525
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 547 transition count 525
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 547 transition count 525
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 546 transition count 524
Applied a total of 19 rules in 72 ms. Remains 546 /552 variables (removed 6) and now considering 524/530 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 546/552 places, 524/530 transitions.
RANDOM walk for 4000000 steps (513333 resets) in 75612 ms. (52 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3439 resets) in 506 ms. (78 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3429 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3336 resets) in 489 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3403 resets) in 494 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3427 resets) in 495 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3458 resets) in 499 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3431 resets) in 495 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40003 steps (3430 resets) in 488 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3403 resets) in 508 ms. (78 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3411 resets) in 507 ms. (78 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40003 steps (3429 resets) in 496 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3398 resets) in 498 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3427 resets) in 603 ms. (66 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40003 steps (3358 resets) in 495 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3413 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3374 resets) in 490 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 489 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3416 resets) in 576 ms. (69 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3401 resets) in 512 ms. (77 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3352 resets) in 489 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3431 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3437 resets) in 489 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3418 resets) in 505 ms. (79 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3410 resets) in 496 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 488 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 487 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3369 resets) in 491 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3371 resets) in 491 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3397 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3445 resets) in 496 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3361 resets) in 495 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3339 resets) in 499 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3415 resets) in 498 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3420 resets) in 498 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3367 resets) in 501 ms. (79 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 497 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 500 ms. (79 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3402 resets) in 492 ms. (81 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40003 steps (3375 resets) in 499 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40003 steps (3392 resets) in 495 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3356 resets) in 497 ms. (80 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 503 ms. (79 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40000 steps (3413 resets) in 627 ms. (63 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3376 resets) in 669 ms. (59 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3359 resets) in 614 ms. (65 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40002 steps (3401 resets) in 685 ms. (58 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 648 ms. (61 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40003 steps (3368 resets) in 636 ms. (62 steps per ms) remains 362/362 properties
Interrupted probabilistic random walk after 2898100 steps, run timeout after 78001 ms. (steps per millisecond=37 ) properties seen :19 out of 362
Probabilistic random walk after 2898100 steps, saw 1449134 distinct states, run finished after 78001 ms. (steps per millisecond=37 ) properties seen :19
// Phase 1: matrix 524 rows 546 cols
[2025-06-01 00:10:26] [INFO ] Invariants computation overflowed in 68 ms
[2025-06-01 00:10:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 462/925 variables, 463/463 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/925 variables, 34/497 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/925 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 39/964 variables, 24/521 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/964 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 964/1070 variables, and 523 constraints, problems are : Problem set: 0 solved, 343 unsolved in 45020 ms.
Refiners :[State Equation: 487/546 constraints, ReadFeed: 36/42 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 462/925 variables, 463/463 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/925 variables, 34/497 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/925 variables, 318/815 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/1070 variables, and 815 constraints, problems are : Problem set: 0 solved, 343 unsolved in 45029 ms.
Refiners :[State Equation: 463/546 constraints, ReadFeed: 34/42 constraints, PredecessorRefiner: 318/343 constraints, Known Traps: 0/0 constraints]
After SMT, in 90195ms problems are : Problem set: 0 solved, 343 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 463 out of 546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 546/546 places, 524/524 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 546 transition count 522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 544 transition count 522
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 544 transition count 522
Applied a total of 8 rules in 40 ms. Remains 544 /546 variables (removed 2) and now considering 522/524 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 544/546 places, 522/524 transitions.
RANDOM walk for 4000000 steps (513073 resets) in 70048 ms. (57 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3336 resets) in 474 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3334 resets) in 474 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3350 resets) in 473 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3374 resets) in 469 ms. (85 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3414 resets) in 466 ms. (85 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3386 resets) in 473 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3329 resets) in 479 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3398 resets) in 477 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3413 resets) in 473 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3358 resets) in 468 ms. (85 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3395 resets) in 473 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3327 resets) in 478 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3349 resets) in 472 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3407 resets) in 463 ms. (86 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 474 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3375 resets) in 483 ms. (82 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3373 resets) in 476 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3407 resets) in 470 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 477 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3414 resets) in 470 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3397 resets) in 474 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3364 resets) in 473 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3364 resets) in 476 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3369 resets) in 471 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 468 ms. (85 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3364 resets) in 476 ms. (83 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3426 resets) in 474 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3358 resets) in 470 ms. (84 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 459 ms. (86 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 619 ms. (64 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3337 resets) in 917 ms. (43 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3450 resets) in 670 ms. (59 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3345 resets) in 664 ms. (60 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 760 ms. (52 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3371 resets) in 698 ms. (57 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3380 resets) in 724 ms. (55 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 914 ms. (43 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3408 resets) in 666 ms. (59 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 745 ms. (53 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3381 resets) in 737 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 730 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3336 resets) in 776 ms. (51 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3392 resets) in 691 ms. (57 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 1028 ms. (38 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3312 resets) in 691 ms. (57 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3408 resets) in 1040 ms. (38 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3324 resets) in 681 ms. (58 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3438 resets) in 983 ms. (40 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3397 resets) in 709 ms. (56 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3363 resets) in 692 ms. (57 steps per ms) remains 343/343 properties
Interrupted probabilistic random walk after 2657606 steps, run timeout after 81001 ms. (steps per millisecond=32 ) properties seen :0 out of 343
Probabilistic random walk after 2657606 steps, saw 1328881 distinct states, run finished after 81001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 522 rows 544 cols
[2025-06-01 00:13:44] [INFO ] Computed 99 invariants in 54 ms
[2025-06-01 00:13:44] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 37/500 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 30/530 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (OVERLAPS) 3/533 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (OVERLAPS) 521/1054 variables, 533/630 constraints. Problems are: Problem set: 0 solved, 343 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 44/674 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 11 (OVERLAPS) 11/1065 variables, 10/684 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1065 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1065 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1066/1066 variables, and 687 constraints, problems are : Problem set: 0 solved, 343 unsolved in 75017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 544/544 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 37/500 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 30/530 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (OVERLAPS) 3/533 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (OVERLAPS) 521/1054 variables, 533/630 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 44/674 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 333/1007 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1054/1066 variables, and 1007 constraints, problems are : Problem set: 0 solved, 343 unsolved in 75032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 533/544 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 333/343 constraints, Known Traps: 0/0 constraints]
After SMT, in 150177ms problems are : Problem set: 0 solved, 343 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 463 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 522/522 transitions.
Applied a total of 0 rules in 21 ms. Remains 544 /544 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 544/544 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 522/522 transitions.
Applied a total of 0 rules in 12 ms. Remains 544 /544 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2025-06-01 00:16:14] [INFO ] Invariant cache hit.
[2025-06-01 00:16:14] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-01 00:16:14] [INFO ] Invariant cache hit.
[2025-06-01 00:16:15] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:16:16] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned [173, 243, 445, 515]
[2025-06-01 00:16:16] [INFO ] Actually due to overlaps returned [243, 173]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2134 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/544 places, 522/522 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 541 transition count 521
Applied a total of 2 rules in 35 ms. Remains 541 /542 variables (removed 1) and now considering 521/522 (removed 1) transitions.
// Phase 1: matrix 521 rows 541 cols
[2025-06-01 00:16:16] [INFO ] Invariants computation overflowed in 35 ms
[2025-06-01 00:16:17] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 521 rows 541 cols
[2025-06-01 00:16:17] [INFO ] Invariants computation overflowed in 33 ms
[2025-06-01 00:16:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:16:18] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned [442, 512]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1158 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 539/544 places, 521/522 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 538 transition count 520
Applied a total of 2 rules in 26 ms. Remains 538 /539 variables (removed 1) and now considering 520/521 (removed 1) transitions.
// Phase 1: matrix 520 rows 538 cols
[2025-06-01 00:16:18] [INFO ] Invariants computation overflowed in 33 ms
[2025-06-01 00:16:18] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 520 rows 538 cols
[2025-06-01 00:16:18] [INFO ] Invariants computation overflowed in 32 ms
[2025-06-01 00:16:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:16:23] [INFO ] Implicit Places using invariants and state equation in 4940 ms returned []
Implicit Place search using SMT with State Equation took 5077 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 538/544 places, 520/522 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8444 ms. Remains : 538/544 places, 520/522 transitions.
RANDOM walk for 4000000 steps (576804 resets) in 99485 ms. (40 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3637 resets) in 729 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3690 resets) in 843 ms. (47 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3658 resets) in 766 ms. (52 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3629 resets) in 721 ms. (55 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 782 ms. (51 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3674 resets) in 821 ms. (48 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3616 resets) in 777 ms. (51 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3644 resets) in 798 ms. (50 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3627 resets) in 689 ms. (57 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3658 resets) in 726 ms. (55 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3680 resets) in 755 ms. (52 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3707 resets) in 757 ms. (52 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3635 resets) in 755 ms. (52 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 804 ms. (49 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 828 ms. (48 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3669 resets) in 736 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 658 ms. (60 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3670 resets) in 725 ms. (55 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3680 resets) in 719 ms. (55 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3696 resets) in 769 ms. (51 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 795 ms. (50 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3626 resets) in 897 ms. (44 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3641 resets) in 782 ms. (51 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3689 resets) in 801 ms. (49 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3659 resets) in 712 ms. (56 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40004 steps (3675 resets) in 789 ms. (50 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3642 resets) in 735 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3635 resets) in 926 ms. (43 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3676 resets) in 805 ms. (49 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3600 resets) in 748 ms. (53 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3656 resets) in 743 ms. (53 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 822 ms. (48 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3700 resets) in 748 ms. (53 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 824 ms. (48 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 732 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3669 resets) in 800 ms. (49 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3628 resets) in 721 ms. (55 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3613 resets) in 901 ms. (44 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3676 resets) in 736 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3678 resets) in 709 ms. (56 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3602 resets) in 889 ms. (44 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3679 resets) in 746 ms. (53 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3680 resets) in 742 ms. (53 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 697 ms. (57 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3667 resets) in 917 ms. (43 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 729 ms. (54 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3628 resets) in 812 ms. (49 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40000 steps (3674 resets) in 807 ms. (49 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (3669 resets) in 763 ms. (52 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (3707 resets) in 865 ms. (46 steps per ms) remains 343/343 properties
Probably explored full state space saw : 637204 states, properties seen :0
Probabilistic random walk after 1274449 steps, saw 637204 distinct states, run finished after 36440 ms. (steps per millisecond=34 ) properties seen :0
Interrupted probabilistic random walk after 4105737 steps, run timeout after 123001 ms. (steps per millisecond=33 ) properties seen :2 out of 343
Exhaustive walk after 4105737 steps, saw 2052945 distinct states, run finished after 123001 ms. (steps per millisecond=33 ) properties seen :2
// Phase 1: matrix 520 rows 538 cols
[2025-06-01 00:19:44] [INFO ] Invariants computation overflowed in 35 ms
[2025-06-01 00:19:44] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 456/916 variables, 460/460 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 34/494 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 55/971 variables, 25/519 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 341 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 70/1041 variables, 37/558 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 8/566 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1041 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 90122ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Fused 341 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 460 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 520/520 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 538 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 536 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 536 transition count 518
Applied a total of 5 rules in 26 ms. Remains 536 /538 variables (removed 2) and now considering 518/520 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 536/538 places, 518/520 transitions.
RANDOM walk for 3853688 steps (555989 resets) in 119325 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 839 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 761 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 812 ms. (49 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 826 ms. (48 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3676 resets) in 956 ms. (41 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3561 resets) in 885 ms. (45 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3605 resets) in 878 ms. (45 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3660 resets) in 790 ms. (50 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3754 resets) in 714 ms. (55 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3671 resets) in 785 ms. (50 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3704 resets) in 631 ms. (63 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 624 ms. (64 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3679 resets) in 1187 ms. (33 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3609 resets) in 598 ms. (66 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3667 resets) in 716 ms. (55 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 645 ms. (61 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3581 resets) in 959 ms. (41 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3694 resets) in 669 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3715 resets) in 711 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3638 resets) in 837 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3691 resets) in 706 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 704 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3647 resets) in 705 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 1129 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3652 resets) in 678 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3722 resets) in 756 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3703 resets) in 637 ms. (62 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3613 resets) in 709 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3677 resets) in 1224 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3654 resets) in 683 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 697 ms. (57 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3609 resets) in 707 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3710 resets) in 854 ms. (46 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 805 ms. (49 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 673 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3616 resets) in 663 ms. (60 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3659 resets) in 637 ms. (62 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3704 resets) in 686 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3619 resets) in 695 ms. (57 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3623 resets) in 718 ms. (55 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3712 resets) in 1149 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3692 resets) in 736 ms. (54 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3724 resets) in 1033 ms. (38 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3675 resets) in 682 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3685 resets) in 893 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 758 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3670 resets) in 640 ms. (62 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3629 resets) in 706 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 677 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3688 resets) in 623 ms. (64 steps per ms) remains 341/341 properties
Interrupted probabilistic random walk after 4326786 steps, run timeout after 126001 ms. (steps per millisecond=34 ) properties seen :0 out of 341
Probabilistic random walk after 4326786 steps, saw 2163169 distinct states, run finished after 126001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 518 rows 536 cols
[2025-06-01 00:24:03] [INFO ] Computed 95 invariants in 55 ms
[2025-06-01 00:24:03] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 49/509 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 13/522 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 4/526 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (OVERLAPS) 517/1043 variables, 526/619 constraints. Problems are: Problem set: 0 solved, 341 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1043 variables, 44/663 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1043 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 11 (OVERLAPS) 10/1053 variables, 9/672 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1053 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1053 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 14 (OVERLAPS) 1/1054 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1054/1054 variables, and 675 constraints, problems are : Problem set: 0 solved, 341 unsolved in 105024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 93/93 constraints, State Equation: 536/536 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 49/509 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 13/522 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 4/526 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (OVERLAPS) 517/1043 variables, 526/620 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1043 variables, 44/664 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1043 variables, 332/996 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1043/1054 variables, and 996 constraints, problems are : Problem set: 0 solved, 341 unsolved in 105019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 93/93 constraints, State Equation: 526/536 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 332/341 constraints, Known Traps: 1/1 constraints]
After SMT, in 210150ms problems are : Problem set: 0 solved, 341 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 460 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 518/518 transitions.
Applied a total of 0 rules in 9 ms. Remains 536 /536 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 536/536 places, 518/518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 518/518 transitions.
Applied a total of 0 rules in 8 ms. Remains 536 /536 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2025-06-01 00:27:33] [INFO ] Invariant cache hit.
[2025-06-01 00:27:33] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-01 00:27:33] [INFO ] Invariant cache hit.
[2025-06-01 00:27:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:27:40] [INFO ] Implicit Places using invariants and state equation in 6710 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6855 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 535/536 places, 518/518 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 535 transition count 518
Applied a total of 1 rules in 17 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
// Phase 1: matrix 518 rows 535 cols
[2025-06-01 00:27:40] [INFO ] Computed 94 invariants in 40 ms
[2025-06-01 00:27:40] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-01 00:27:40] [INFO ] Invariant cache hit.
[2025-06-01 00:27:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:27:42] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 535/536 places, 518/518 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9038 ms. Remains : 535/536 places, 518/518 transitions.
RANDOM walk for 4000000 steps (576936 resets) in 68251 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3646 resets) in 677 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3661 resets) in 932 ms. (42 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3676 resets) in 1168 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 1143 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3762 resets) in 829 ms. (48 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3737 resets) in 1165 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3646 resets) in 1119 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3664 resets) in 942 ms. (42 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3632 resets) in 979 ms. (40 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3649 resets) in 902 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3719 resets) in 893 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3615 resets) in 1135 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3663 resets) in 857 ms. (46 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40004 steps (3684 resets) in 955 ms. (41 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3642 resets) in 913 ms. (43 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3681 resets) in 949 ms. (42 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3605 resets) in 903 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40004 steps (3605 resets) in 1081 ms. (36 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3609 resets) in 1106 ms. (36 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3626 resets) in 1125 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3701 resets) in 841 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3649 resets) in 1213 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3643 resets) in 848 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3703 resets) in 1125 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 1171 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3622 resets) in 829 ms. (48 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3598 resets) in 1152 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3598 resets) in 808 ms. (49 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3686 resets) in 1231 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 889 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3707 resets) in 971 ms. (41 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3718 resets) in 1100 ms. (36 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 1185 ms. (33 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3648 resets) in 977 ms. (40 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 1156 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3664 resets) in 1107 ms. (36 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3649 resets) in 915 ms. (43 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 1214 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3710 resets) in 1210 ms. (33 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 1185 ms. (33 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3625 resets) in 1214 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3706 resets) in 1218 ms. (32 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3612 resets) in 924 ms. (43 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3711 resets) in 868 ms. (46 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3667 resets) in 1127 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3641 resets) in 1118 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3705 resets) in 1170 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3582 resets) in 1060 ms. (37 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3731 resets) in 1128 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3724 resets) in 921 ms. (43 steps per ms) remains 341/341 properties
Interrupted probabilistic random walk after 3033965 steps, run timeout after 96001 ms. (steps per millisecond=31 ) properties seen :0 out of 341
Probabilistic random walk after 3033965 steps, saw 1516916 distinct states, run finished after 96001 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-01 00:29:50] [INFO ] Invariant cache hit.
[2025-06-01 00:29:50] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 53/513 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 12/525 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 517/1042 variables, 525/618 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 44/662 constraints. Problems are: Problem set: 0 solved, 341 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (OVERLAPS) 10/1052 variables, 9/671 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1052 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1052 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 13 (OVERLAPS) 1/1053 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1053 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 15 (OVERLAPS) 0/1053 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 674 constraints, problems are : Problem set: 0 solved, 341 unsolved in 120032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 535/535 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 53/513 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 12/525 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 517/1042 variables, 525/618 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 44/662 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 332/994 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1053 variables, and 994 constraints, problems are : Problem set: 0 solved, 341 unsolved in 120023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 525/535 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 332/341 constraints, Known Traps: 1/1 constraints]
After SMT, in 240108ms problems are : Problem set: 0 solved, 341 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 460 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 518/518 transitions.
Applied a total of 0 rules in 13 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 535/535 places, 518/518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 518/518 transitions.
Applied a total of 0 rules in 10 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2025-06-01 00:33:50] [INFO ] Invariant cache hit.
[2025-06-01 00:33:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-01 00:33:50] [INFO ] Invariant cache hit.
[2025-06-01 00:33:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:33:52] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2025-06-01 00:33:52] [INFO ] Redundant transitions in 25 ms returned []
Running 517 sub problems to find dead transitions.
[2025-06-01 00:33:53] [INFO ] Invariant cache hit.
[2025-06-01 00:33:53] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (OVERLAPS) 518/1052 variables, 534/628 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 44/672 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 517 unsolved
SMT process timed out in 30121ms, After SMT, problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 30128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32354 ms. Remains : 535/535 places, 518/518 transitions.
RANDOM walk for 400000 steps (57826 resets) in 19064 ms. (20 steps per ms) remains 460/460 properties
Running SMT prover for 460 properties.
[2025-06-01 00:34:28] [INFO ] Invariant cache hit.
[2025-06-01 00:34:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:34:28] [INFO ] [Real]Absence check using 2 positive and 92 generalized place invariants in 38 ms returned sat
[2025-06-01 00:34:32] [INFO ] After 3357ms SMT Verify possible using state equation in real domain returned unsat :0 sat :460
[2025-06-01 00:34:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 00:34:39] [INFO ] After 7651ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :460
TRAPS : Iteration 0
[2025-06-01 00:35:06] [INFO ] After 33862ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:460
[2025-06-01 00:35:06] [INFO ] After 37652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:460
[2025-06-01 00:35:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:35:06] [INFO ] [Nat]Absence check using 2 positive and 92 generalized place invariants in 39 ms returned sat
[2025-06-01 00:35:10] [INFO ] After 3883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :460
[2025-06-01 00:35:35] [INFO ] After 25530ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :460
TRAPS : Iteration 0
[2025-06-01 00:35:36] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 4 ms to minimize.
[2025-06-01 00:35:36] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 2 ms to minimize.
[2025-06-01 00:35:36] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2025-06-01 00:35:36] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 15 ms to minimize.
[2025-06-01 00:35:36] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2025-06-01 00:35:37] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2025-06-01 00:35:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1149 ms
[2025-06-01 00:35:37] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:35:37] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:35:37] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:38] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2025-06-01 00:35:39] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:35:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1576 ms
[2025-06-01 00:35:40] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2025-06-01 00:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-06-01 00:35:40] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:35:40] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2025-06-01 00:35:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-01 00:35:42] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:35:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-01 00:35:42] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:35:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-01 00:35:43] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-01 00:35:44] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:35:44] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:35:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2025-06-01 00:35:45] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-01 00:35:45] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:35:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-01 00:35:46] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:35:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2025-06-01 00:35:47] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:35:47] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 5 ms to minimize.
[2025-06-01 00:35:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2025-06-01 00:35:47] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:35:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2025-06-01 00:35:50] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:35:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-06-01 00:35:51] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-06-01 00:35:51] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2025-06-01 00:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 3 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2025-06-01 00:35:53] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2025-06-01 00:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2025-06-01 00:35:53] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-06-01 00:35:54] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2025-06-01 00:35:54] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2025-06-01 00:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 00:35:55] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-01 00:35:55] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-06-01 00:35:56] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:35:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-01 00:35:56] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 00:35:57] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-01 00:35:57] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:35:57] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2025-06-01 00:35:57] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:35:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 4 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-06-01 00:35:59] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2025-06-01 00:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-06-01 00:35:59] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2025-06-01 00:36:00] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:36:00] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 0 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 375 ms
[2025-06-01 00:36:03] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-06-01 00:36:04] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-06-01 00:36:05] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-01 00:36:07] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-06-01 00:36:08] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:36:08] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:36:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2025-06-01 00:36:15] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2025-06-01 00:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3516 ms
[2025-06-01 00:36:25] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2025-06-01 00:36:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
TRAPS : Iteration 1
[2025-06-01 00:36:47] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2025-06-01 00:36:51] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:36:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2025-06-01 00:36:54] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:36:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-06-01 00:36:54] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2025-06-01 00:36:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2025-06-01 00:36:55] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:36:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-06-01 00:36:56] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 2
[2025-06-01 00:37:41] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-01 00:37:43] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 00:37:44] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:37:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 3
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DoubleExponent-PT-020, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080400312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;