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-174860080800509.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 EisenbergMcGuire-PT-10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080800509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Liveness

=== Now, execution of the tool begins

BK_START 1748744862838

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 02:27:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 02:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 02:27:44] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2025-06-01 02:27:44] [INFO ] Transformed 1090 places.
[2025-06-01 02:27:44] [INFO ] Transformed 5200 transitions.
[2025-06-01 02:27:44] [INFO ] Found NUPN structural information;
[2025-06-01 02:27:44] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 478 ms.
Built sparse matrix representations for Structural reductions in 39 ms.53817KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 429 ms. Remains 1090 /1090 variables (removed 0) and now considering 5200/5200 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 444 ms. Remains : 1090/1090 places, 5200/5200 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 292 ms. Remains 1090 /1090 variables (removed 0) and now considering 5200/5200 (removed 0) transitions.
[2025-06-01 02:27:46] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2025-06-01 02:27:46] [INFO ] Computed 31 invariants in 33 ms
[2025-06-01 02:27:46] [INFO ] Implicit Places using invariants in 593 ms returned []
[2025-06-01 02:27:46] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
[2025-06-01 02:27:46] [INFO ] Invariant cache hit.
[2025-06-01 02:27:47] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2025-06-01 02:27:47] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2025-06-01 02:27:48] [INFO ] Redundant transitions in 357 ms returned []
Running 5190 sub problems to find dead transitions.
[2025-06-01 02:27:48] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
[2025-06-01 02:27:48] [INFO ] Invariant cache hit.
[2025-06-01 02:27:48] [INFO ] State equation strengthened by 1246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1090 variables, 1090/1090 constraints. Problems are: Problem set: 0 solved, 5190 unsolved
SMT process timed out in 34798ms, After SMT, problems are : Problem set: 0 solved, 5190 unsolved
Search for dead transitions found 0 dead transitions in 34863ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 37265 ms. Remains : 1090/1090 places, 5200/5200 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6146 ms (no deadlock found). (steps per millisecond=203 )
Random directed walk for 1250009 steps, including 0 resets, run took 7624 ms (no deadlock found). (steps per millisecond=163 )
[2025-06-01 02:28:36] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
[2025-06-01 02:28:36] [INFO ] Invariant cache hit.
[2025-06-01 02:28:37] [INFO ] [Real]Absence check using 21 positive place invariants in 51 ms returned sat
[2025-06-01 02:28:38] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 230 ms returned sat
[2025-06-01 02:28:41] [INFO ] [Real]Absence check using state equation in 3105 ms returned sat
[2025-06-01 02:28:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 02:28:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 45 ms returned sat
[2025-06-01 02:28:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 182 ms returned sat
[2025-06-01 02:28:45] [INFO ] [Nat]Absence check using state equation in 2906 ms returned sat
[2025-06-01 02:28:45] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2025-06-01 02:28:45] [INFO ] [Nat]Added 1246 Read/Feed constraints in 313 ms returned sat
[2025-06-01 02:28:46] [INFO ] Deduced a trap composed of 3 places in 803 ms of which 115 ms to minimize.
[2025-06-01 02:28:47] [INFO ] Deduced a trap composed of 3 places in 712 ms of which 8 ms to minimize.
[2025-06-01 02:28:48] [INFO ] Deduced a trap composed of 3 places in 751 ms of which 9 ms to minimize.
[2025-06-01 02:28:49] [INFO ] Deduced a trap composed of 3 places in 748 ms of which 8 ms to minimize.
[2025-06-01 02:28:50] [INFO ] Deduced a trap composed of 135 places in 707 ms of which 7 ms to minimize.
[2025-06-01 02:28:51] [INFO ] Deduced a trap composed of 3 places in 752 ms of which 7 ms to minimize.
[2025-06-01 02:28:52] [INFO ] Deduced a trap composed of 3 places in 743 ms of which 7 ms to minimize.
[2025-06-01 02:28:53] [INFO ] Deduced a trap composed of 182 places in 701 ms of which 6 ms to minimize.
[2025-06-01 02:28:54] [INFO ] Deduced a trap composed of 131 places in 658 ms of which 7 ms to minimize.
[2025-06-01 02:28:54] [INFO ] Deduced a trap composed of 95 places in 686 ms of which 7 ms to minimize.
[2025-06-01 02:28:55] [INFO ] Deduced a trap composed of 103 places in 690 ms of which 7 ms to minimize.
[2025-06-01 02:28:56] [INFO ] Deduced a trap composed of 84 places in 719 ms of which 7 ms to minimize.
[2025-06-01 02:28:57] [INFO ] Deduced a trap composed of 3 places in 700 ms of which 7 ms to minimize.
[2025-06-01 02:28:58] [INFO ] Deduced a trap composed of 3 places in 718 ms of which 6 ms to minimize.
[2025-06-01 02:28:59] [INFO ] Deduced a trap composed of 398 places in 677 ms of which 7 ms to minimize.
[2025-06-01 02:28:59] [INFO ] Deduced a trap composed of 68 places in 697 ms of which 7 ms to minimize.
[2025-06-01 02:29:00] [INFO ] Deduced a trap composed of 41 places in 701 ms of which 7 ms to minimize.
[2025-06-01 02:29:01] [INFO ] Deduced a trap composed of 3 places in 706 ms of which 7 ms to minimize.
[2025-06-01 02:29:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 15620 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 1080 transition count 4880
Deduced a syphon composed of 310 places in 5 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 770 transition count 4880
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 21 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 680 transition count 4790
Applied a total of 820 rules in 268 ms. Remains 680 /1090 variables (removed 410) and now considering 4790/5200 (removed 410) transitions.
[2025-06-01 02:29:01] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2025-06-01 02:29:01] [INFO ] Computed 31 invariants in 21 ms
[2025-06-01 02:29:02] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2025-06-01 02:29:02] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:29:02] [INFO ] Invariant cache hit.
[2025-06-01 02:29:03] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2025-06-01 02:29:10] [INFO ] Implicit Places using invariants and state equation in 7434 ms returned []
Implicit Place search using SMT with State Equation took 8472 ms to find 0 implicit places.
Running 4780 sub problems to find dead transitions.
[2025-06-01 02:29:10] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:29:10] [INFO ] Invariant cache hit.
[2025-06-01 02:29:10] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 680/680 constraints. Problems are: Problem set: 0 solved, 4780 unsolved
SMT process timed out in 34221ms, After SMT, problems are : Problem set: 0 solved, 4780 unsolved
Search for dead transitions found 0 dead transitions in 34268ms
Starting structural reductions in LIVENESS mode, iteration 1 : 680/1090 places, 4790/5200 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 43024 ms. Remains : 680/1090 places, 4790/5200 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 16909 ms. (2 steps per ms) remains 4100/4780 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 44 ms. (2 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4100/4100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4100/4100 properties
[2025-06-01 02:29:49] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:29:49] [INFO ] Invariant cache hit.
[2025-06-01 02:29:49] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 531/531 constraints. Problems are: Problem set: 0 solved, 4100 unsolved
SMT process timed out in 8664ms, After SMT, problems are : Problem set: 0 solved, 4100 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 531 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 244 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 680/680 places, 4790/4790 transitions.
RANDOM walk for 494410 steps (0 resets) in 120004 ms. (4 steps per ms) remains 4080/4100 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 4079/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4078/4079 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4078/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4076/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4074/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4074/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4074/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4074/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4074/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4073/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4072/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4071/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4070/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 4069/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4068/4069 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4066/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4064/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4063/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4059/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4058/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4057/4058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4057/4057 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4057/4057 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4056/4057 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4054/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 4054/4054 properties
Interrupted probabilistic random walk after 483439 steps, run timeout after 102001 ms. (steps per millisecond=4 ) properties seen :631 out of 4054
Probabilistic random walk after 483439 steps, saw 366867 distinct states, run finished after 102012 ms. (steps per millisecond=4 ) properties seen :631
[2025-06-01 02:32:14] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:32:14] [INFO ] Invariant cache hit.
[2025-06-01 02:32:14] [INFO ] State equation strengthened by 1246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 433/433 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/2600 variables, and 434 constraints, problems are : Problem set: 0 solved, 3423 unsolved in 45047 ms.
Refiners :[Domain max(s): 433/680 constraints, Positive P Invariants (semi-flows): 1/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/680 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 3423/3423 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 433/433 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
At refinement iteration 3 (OVERLAPS) 247/680 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 10/711 constraints. Problems are: Problem set: 0 solved, 3423 unsolved
[2025-06-01 02:33:45] [INFO ] Deduced a trap composed of 235 places in 430 ms of which 4 ms to minimize.
[2025-06-01 02:33:45] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 3 ms to minimize.
[2025-06-01 02:33:46] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:33:46] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:33:46] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:33:47] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 3 ms to minimize.
[2025-06-01 02:33:47] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:33:47] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 3 ms to minimize.
SMT process timed out in 93257ms, After SMT, problems are : Problem set: 0 solved, 3423 unsolved
Fused 3423 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 433 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 679 transition count 4780
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 679 transition count 4780
Applied a total of 2 rules in 251 ms. Remains 679 /680 variables (removed 1) and now considering 4780/4790 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 679/680 places, 4780/4790 transitions.
RANDOM walk for 622688 steps (0 resets) in 120004 ms. (5 steps per ms) remains 3423/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3423/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3423/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3423/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3423/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 3423/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3422/3423 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3422/3422 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3422/3422 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3422 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3421/3421 properties
Interrupted probabilistic random walk after 474958 steps, run timeout after 93001 ms. (steps per millisecond=5 ) properties seen :21 out of 3421
Probabilistic random walk after 474958 steps, saw 359427 distinct states, run finished after 93002 ms. (steps per millisecond=5 ) properties seen :21
[2025-06-01 02:35:53] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
// Phase 1: matrix 1910 rows 679 cols
[2025-06-01 02:35:53] [INFO ] Computed 31 invariants in 15 ms
[2025-06-01 02:35:53] [INFO ] State equation strengthened by 1237 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
At refinement iteration 2 (OVERLAPS) 250/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/2589 variables, and 31 constraints, problems are : Problem set: 0 solved, 3400 unsolved in 75056 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/679 constraints, ReadFeed: 0/1237 constraints, PredecessorRefiner: 3400/3400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
At refinement iteration 2 (OVERLAPS) 250/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
[2025-06-01 02:37:51] [INFO ] Deduced a trap composed of 25 places in 443 ms of which 4 ms to minimize.
[2025-06-01 02:37:52] [INFO ] Deduced a trap composed of 79 places in 415 ms of which 4 ms to minimize.
[2025-06-01 02:37:52] [INFO ] Deduced a trap composed of 19 places in 420 ms of which 3 ms to minimize.
[2025-06-01 02:37:53] [INFO ] Deduced a trap composed of 40 places in 406 ms of which 4 ms to minimize.
[2025-06-01 02:37:53] [INFO ] Deduced a trap composed of 15 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:37:54] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 3 ms to minimize.
[2025-06-01 02:37:54] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:37:54] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 2 ms to minimize.
[2025-06-01 02:37:54] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 5 ms to minimize.
[2025-06-01 02:37:54] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:37:55] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:37:55] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:37:55] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:37:56] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 4 ms to minimize.
[2025-06-01 02:37:56] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:37:56] [INFO ] Deduced a trap composed of 79 places in 328 ms of which 3 ms to minimize.
[2025-06-01 02:37:57] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 2 ms to minimize.
[2025-06-01 02:37:57] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 3 ms to minimize.
[2025-06-01 02:37:57] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:37:58] [INFO ] Deduced a trap composed of 15 places in 326 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
[2025-06-01 02:37:59] [INFO ] Deduced a trap composed of 69 places in 394 ms of which 3 ms to minimize.
[2025-06-01 02:38:00] [INFO ] Deduced a trap composed of 22 places in 399 ms of which 3 ms to minimize.
[2025-06-01 02:38:00] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 4 ms to minimize.
[2025-06-01 02:38:01] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 4 ms to minimize.
[2025-06-01 02:38:01] [INFO ] Deduced a trap composed of 65 places in 407 ms of which 3 ms to minimize.
[2025-06-01 02:38:01] [INFO ] Deduced a trap composed of 41 places in 419 ms of which 4 ms to minimize.
[2025-06-01 02:38:02] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:38:09] [INFO ] Deduced a trap composed of 95 places in 474 ms of which 3 ms to minimize.
[2025-06-01 02:38:09] [INFO ] Deduced a trap composed of 70 places in 459 ms of which 3 ms to minimize.
[2025-06-01 02:38:10] [INFO ] Deduced a trap composed of 107 places in 449 ms of which 4 ms to minimize.
[2025-06-01 02:38:11] [INFO ] Deduced a trap composed of 96 places in 465 ms of which 5 ms to minimize.
[2025-06-01 02:38:12] [INFO ] Deduced a trap composed of 101 places in 430 ms of which 3 ms to minimize.
[2025-06-01 02:38:12] [INFO ] Deduced a trap composed of 103 places in 411 ms of which 4 ms to minimize.
[2025-06-01 02:38:13] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 3 ms to minimize.
[2025-06-01 02:38:13] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 3 ms to minimize.
[2025-06-01 02:38:14] [INFO ] Deduced a trap composed of 119 places in 484 ms of which 3 ms to minimize.
[2025-06-01 02:38:14] [INFO ] Deduced a trap composed of 131 places in 457 ms of which 4 ms to minimize.
[2025-06-01 02:38:14] [INFO ] Deduced a trap composed of 115 places in 466 ms of which 5 ms to minimize.
[2025-06-01 02:38:15] [INFO ] Deduced a trap composed of 25 places in 457 ms of which 4 ms to minimize.
[2025-06-01 02:38:15] [INFO ] Deduced a trap composed of 117 places in 453 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
[2025-06-01 02:38:17] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 2 ms to minimize.
[2025-06-01 02:38:17] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 2 ms to minimize.
[2025-06-01 02:38:20] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:38:20] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2025-06-01 02:38:20] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2025-06-01 02:38:25] [INFO ] Deduced a trap composed of 3 places in 459 ms of which 4 ms to minimize.
[2025-06-01 02:38:26] [INFO ] Deduced a trap composed of 128 places in 428 ms of which 3 ms to minimize.
SMT process timed out in 153343ms, After SMT, problems are : Problem set: 0 solved, 3400 unsolved
Fused 3400 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 429 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 4780/4780 transitions.
Applied a total of 0 rules in 210 ms. Remains 679 /679 variables (removed 0) and now considering 4780/4780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 679/679 places, 4780/4780 transitions.
RANDOM walk for 622002 steps (0 resets) in 120004 ms. (5 steps per ms) remains 3398/3400 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 3398/3398 properties
Interrupted probabilistic random walk after 477235 steps, run timeout after 93001 ms. (steps per millisecond=5 ) properties seen :0 out of 3398
Probabilistic random walk after 477235 steps, saw 361051 distinct states, run finished after 93002 ms. (steps per millisecond=5 ) properties seen :0
[2025-06-01 02:40:31] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:40:31] [INFO ] Invariant cache hit.
[2025-06-01 02:40:31] [INFO ] State equation strengthened by 1237 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 2 (OVERLAPS) 250/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/2589 variables, and 31 constraints, problems are : Problem set: 0 solved, 3398 unsolved in 90050 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/679 constraints, ReadFeed: 0/1237 constraints, PredecessorRefiner: 3398/3398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 2 (OVERLAPS) 250/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:42:45] [INFO ] Deduced a trap composed of 25 places in 451 ms of which 3 ms to minimize.
[2025-06-01 02:42:45] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 4 ms to minimize.
[2025-06-01 02:42:46] [INFO ] Deduced a trap composed of 51 places in 408 ms of which 4 ms to minimize.
[2025-06-01 02:42:46] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:42:46] [INFO ] Deduced a trap composed of 29 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:42:47] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 4 ms to minimize.
[2025-06-01 02:42:47] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:42:47] [INFO ] Deduced a trap composed of 17 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:42:48] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:42:48] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2025-06-01 02:42:48] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:42:48] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:42:49] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 3 ms to minimize.
[2025-06-01 02:42:49] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:42:49] [INFO ] Deduced a trap composed of 66 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:42:50] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:42:50] [INFO ] Deduced a trap composed of 39 places in 308 ms of which 3 ms to minimize.
[2025-06-01 02:42:50] [INFO ] Deduced a trap composed of 64 places in 289 ms of which 2 ms to minimize.
[2025-06-01 02:42:51] [INFO ] Deduced a trap composed of 65 places in 304 ms of which 3 ms to minimize.
[2025-06-01 02:42:51] [INFO ] Deduced a trap composed of 53 places in 318 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:42:53] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 2 ms to minimize.
[2025-06-01 02:42:53] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:42:53] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 2 ms to minimize.
[2025-06-01 02:42:53] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:42:53] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2025-06-01 02:42:54] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:42:54] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:42:54] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:43:07] [INFO ] Deduced a trap composed of 133 places in 486 ms of which 4 ms to minimize.
[2025-06-01 02:43:08] [INFO ] Deduced a trap composed of 116 places in 450 ms of which 4 ms to minimize.
[2025-06-01 02:43:08] [INFO ] Deduced a trap composed of 114 places in 460 ms of which 4 ms to minimize.
[2025-06-01 02:43:09] [INFO ] Deduced a trap composed of 139 places in 464 ms of which 4 ms to minimize.
[2025-06-01 02:43:09] [INFO ] Deduced a trap composed of 124 places in 464 ms of which 3 ms to minimize.
[2025-06-01 02:43:10] [INFO ] Deduced a trap composed of 121 places in 474 ms of which 5 ms to minimize.
[2025-06-01 02:43:10] [INFO ] Deduced a trap composed of 81 places in 474 ms of which 4 ms to minimize.
[2025-06-01 02:43:11] [INFO ] Deduced a trap composed of 80 places in 462 ms of which 4 ms to minimize.
[2025-06-01 02:43:11] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:43:11] [INFO ] Deduced a trap composed of 119 places in 428 ms of which 4 ms to minimize.
[2025-06-01 02:43:12] [INFO ] Deduced a trap composed of 115 places in 427 ms of which 4 ms to minimize.
[2025-06-01 02:43:12] [INFO ] Deduced a trap composed of 131 places in 436 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:43:14] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 2 ms to minimize.
[2025-06-01 02:43:14] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:43:15] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:43:15] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:43:15] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:43:15] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 2 ms to minimize.
[2025-06-01 02:43:16] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2025-06-01 02:43:16] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 2 ms to minimize.
[2025-06-01 02:43:16] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:43:16] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:43:16] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2025-06-01 02:43:19] [INFO ] Deduced a trap composed of 34 places in 446 ms of which 3 ms to minimize.
[2025-06-01 02:43:22] [INFO ] Deduced a trap composed of 79 places in 455 ms of which 3 ms to minimize.
[2025-06-01 02:43:22] [INFO ] Deduced a trap composed of 89 places in 498 ms of which 4 ms to minimize.
[2025-06-01 02:43:23] [INFO ] Deduced a trap composed of 85 places in 471 ms of which 3 ms to minimize.
[2025-06-01 02:43:23] [INFO ] Deduced a trap composed of 22 places in 447 ms of which 3 ms to minimize.
[2025-06-01 02:43:32] [INFO ] Deduced a trap composed of 148 places in 436 ms of which 4 ms to minimize.
[2025-06-01 02:43:33] [INFO ] Deduced a trap composed of 151 places in 478 ms of which 4 ms to minimize.
[2025-06-01 02:43:33] [INFO ] Deduced a trap composed of 164 places in 448 ms of which 4 ms to minimize.
[2025-06-01 02:43:34] [INFO ] Deduced a trap composed of 147 places in 426 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/2589 variables, and 91 constraints, problems are : Problem set: 0 solved, 3398 unsolved in 90054 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/679 constraints, ReadFeed: 0/1237 constraints, PredecessorRefiner: 0/3398 constraints, Known Traps: 60/60 constraints]
After SMT, in 182951ms problems are : Problem set: 0 solved, 3398 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 429 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 4780/4780 transitions.
Applied a total of 0 rules in 202 ms. Remains 679 /679 variables (removed 0) and now considering 4780/4780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 679/679 places, 4780/4780 transitions.
RANDOM walk for 281510 steps (0 resets) in 120004 ms. (2 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 146 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 156 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 3398/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 3398/3398 properties
Interrupted probabilistic random walk after 471328 steps, run timeout after 96001 ms. (steps per millisecond=4 ) properties seen :0 out of 3398
Probabilistic random walk after 471328 steps, saw 356601 distinct states, run finished after 96005 ms. (steps per millisecond=4 ) properties seen :0
[2025-06-01 02:45:42] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:45:42] [INFO ] Invariant cache hit.
[2025-06-01 02:45:42] [INFO ] State equation strengthened by 1237 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 2 (OVERLAPS) 250/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:47:22] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 4 ms to minimize.
[2025-06-01 02:47:23] [INFO ] Deduced a trap composed of 56 places in 433 ms of which 4 ms to minimize.
[2025-06-01 02:47:23] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 4 ms to minimize.
[2025-06-01 02:47:24] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 4 ms to minimize.
[2025-06-01 02:47:24] [INFO ] Deduced a trap composed of 33 places in 446 ms of which 3 ms to minimize.
[2025-06-01 02:47:24] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 4 ms to minimize.
[2025-06-01 02:47:25] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 4 ms to minimize.
[2025-06-01 02:47:25] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 3 ms to minimize.
[2025-06-01 02:47:26] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:47:26] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 1 ms to minimize.
[2025-06-01 02:47:26] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:47:26] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:47:26] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 4 ms to minimize.
[2025-06-01 02:47:26] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/2589 variables, and 45 constraints, problems are : Problem set: 0 solved, 3398 unsolved in 105053 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/679 constraints, ReadFeed: 0/1237 constraints, PredecessorRefiner: 3398/3398 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 2 (OVERLAPS) 250/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:48:13] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:48:14] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 3 ms to minimize.
[2025-06-01 02:48:14] [INFO ] Deduced a trap composed of 90 places in 426 ms of which 4 ms to minimize.
[2025-06-01 02:48:14] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 2 ms to minimize.
[2025-06-01 02:48:15] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 3 ms to minimize.
[2025-06-01 02:48:15] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:48:15] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 3 ms to minimize.
[2025-06-01 02:48:16] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:48:16] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:48:16] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:48:24] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:48:24] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2025-06-01 02:48:25] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2025-06-01 02:48:30] [INFO ] Deduced a trap composed of 125 places in 480 ms of which 4 ms to minimize.
[2025-06-01 02:48:30] [INFO ] Deduced a trap composed of 121 places in 449 ms of which 3 ms to minimize.
[2025-06-01 02:48:31] [INFO ] Deduced a trap composed of 153 places in 412 ms of which 4 ms to minimize.
[2025-06-01 02:48:31] [INFO ] Deduced a trap composed of 145 places in 425 ms of which 4 ms to minimize.
[2025-06-01 02:48:31] [INFO ] Deduced a trap composed of 129 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:48:32] [INFO ] Deduced a trap composed of 114 places in 408 ms of which 3 ms to minimize.
[2025-06-01 02:48:32] [INFO ] Deduced a trap composed of 111 places in 434 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:48:34] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 4 ms to minimize.
[2025-06-01 02:48:35] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 4 ms to minimize.
[2025-06-01 02:48:35] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 4 ms to minimize.
[2025-06-01 02:48:35] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 1 ms to minimize.
[2025-06-01 02:48:42] [INFO ] Deduced a trap composed of 111 places in 444 ms of which 3 ms to minimize.
[2025-06-01 02:48:42] [INFO ] Deduced a trap composed of 90 places in 462 ms of which 3 ms to minimize.
[2025-06-01 02:48:43] [INFO ] Deduced a trap composed of 118 places in 431 ms of which 4 ms to minimize.
[2025-06-01 02:48:43] [INFO ] Deduced a trap composed of 85 places in 429 ms of which 4 ms to minimize.
[2025-06-01 02:48:43] [INFO ] Deduced a trap composed of 94 places in 418 ms of which 3 ms to minimize.
[2025-06-01 02:48:44] [INFO ] Deduced a trap composed of 97 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:48:44] [INFO ] Deduced a trap composed of 100 places in 385 ms of which 3 ms to minimize.
[2025-06-01 02:48:45] [INFO ] Deduced a trap composed of 67 places in 444 ms of which 4 ms to minimize.
[2025-06-01 02:48:45] [INFO ] Deduced a trap composed of 90 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:48:45] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 3 ms to minimize.
[2025-06-01 02:48:46] [INFO ] Deduced a trap composed of 99 places in 403 ms of which 4 ms to minimize.
[2025-06-01 02:48:46] [INFO ] Deduced a trap composed of 86 places in 408 ms of which 4 ms to minimize.
[2025-06-01 02:48:47] [INFO ] Deduced a trap composed of 78 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:48:47] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 4 ms to minimize.
[2025-06-01 02:48:48] [INFO ] Deduced a trap composed of 116 places in 454 ms of which 4 ms to minimize.
[2025-06-01 02:48:48] [INFO ] Deduced a trap composed of 78 places in 433 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:48:50] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2025-06-01 02:48:52] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:48:56] [INFO ] Deduced a trap composed of 43 places in 446 ms of which 4 ms to minimize.
[2025-06-01 02:48:57] [INFO ] Deduced a trap composed of 138 places in 440 ms of which 3 ms to minimize.
[2025-06-01 02:48:57] [INFO ] Deduced a trap composed of 131 places in 420 ms of which 3 ms to minimize.
[2025-06-01 02:48:58] [INFO ] Deduced a trap composed of 114 places in 417 ms of which 4 ms to minimize.
[2025-06-01 02:48:59] [INFO ] Deduced a trap composed of 114 places in 357 ms of which 4 ms to minimize.
[2025-06-01 02:49:00] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 3 ms to minimize.
[2025-06-01 02:49:01] [INFO ] Deduced a trap composed of 109 places in 420 ms of which 3 ms to minimize.
[2025-06-01 02:49:01] [INFO ] Deduced a trap composed of 149 places in 448 ms of which 3 ms to minimize.
[2025-06-01 02:49:01] [INFO ] Deduced a trap composed of 22 places in 443 ms of which 3 ms to minimize.
[2025-06-01 02:49:02] [INFO ] Deduced a trap composed of 144 places in 434 ms of which 4 ms to minimize.
[2025-06-01 02:49:02] [INFO ] Deduced a trap composed of 111 places in 450 ms of which 6 ms to minimize.
[2025-06-01 02:49:03] [INFO ] Deduced a trap composed of 156 places in 434 ms of which 4 ms to minimize.
[2025-06-01 02:49:03] [INFO ] Deduced a trap composed of 136 places in 409 ms of which 3 ms to minimize.
[2025-06-01 02:49:04] [INFO ] Deduced a trap composed of 119 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:49:04] [INFO ] Deduced a trap composed of 120 places in 412 ms of which 4 ms to minimize.
[2025-06-01 02:49:05] [INFO ] Deduced a trap composed of 129 places in 415 ms of which 4 ms to minimize.
[2025-06-01 02:49:05] [INFO ] Deduced a trap composed of 134 places in 416 ms of which 4 ms to minimize.
[2025-06-01 02:49:05] [INFO ] Deduced a trap composed of 154 places in 415 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 3398 unsolved
[2025-06-01 02:49:07] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 2 ms to minimize.
[2025-06-01 02:49:08] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
[2025-06-01 02:49:15] [INFO ] Deduced a trap composed of 117 places in 426 ms of which 3 ms to minimize.
[2025-06-01 02:49:15] [INFO ] Deduced a trap composed of 102 places in 429 ms of which 4 ms to minimize.
[2025-06-01 02:49:16] [INFO ] Deduced a trap composed of 81 places in 430 ms of which 3 ms to minimize.
[2025-06-01 02:49:16] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 4 ms to minimize.
SMT process timed out in 213609ms, After SMT, problems are : Problem set: 0 solved, 3398 unsolved
Fused 3398 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 429 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 4780/4780 transitions.
Applied a total of 0 rules in 212 ms. Remains 679 /679 variables (removed 0) and now considering 4780/4780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 679/679 places, 4780/4780 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 4780/4780 transitions.
Applied a total of 0 rules in 202 ms. Remains 679 /679 variables (removed 0) and now considering 4780/4780 (removed 0) transitions.
[2025-06-01 02:49:16] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:49:16] [INFO ] Invariant cache hit.
[2025-06-01 02:49:17] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-01 02:49:17] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:49:17] [INFO ] Invariant cache hit.
[2025-06-01 02:49:17] [INFO ] State equation strengthened by 1237 read => feed constraints.
[2025-06-01 02:49:19] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2025-06-01 02:49:19] [INFO ] Redundant transitions in 171 ms returned []
Running 4770 sub problems to find dead transitions.
[2025-06-01 02:49:19] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:49:19] [INFO ] Invariant cache hit.
[2025-06-01 02:49:19] [INFO ] State equation strengthened by 1237 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/679 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4770 unsolved
SMT process timed out in 33885ms, After SMT, problems are : Problem set: 0 solved, 4770 unsolved
Search for dead transitions found 0 dead transitions in 33923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36515 ms. Remains : 679/679 places, 4780/4780 transitions.
RANDOM walk for 400000 steps (8 resets) in 9535 ms. (41 steps per ms) remains 209/429 properties
Running SMT prover for 209 properties.
[2025-06-01 02:49:55] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:49:56] [INFO ] Invariant cache hit.
[2025-06-01 02:49:56] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2025-06-01 02:49:56] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-06-01 02:49:56] [INFO ] After 601ms SMT Verify possible using state equation in real domain returned unsat :0 sat :209
[2025-06-01 02:49:56] [INFO ] State equation strengthened by 1237 read => feed constraints.
[2025-06-01 02:49:58] [INFO ] After 1847ms SMT Verify possible using 1237 Read/Feed constraints in real domain returned unsat :0 sat :209
TRAPS : Iteration 0
[2025-06-01 02:50:17] [INFO ] After 20891ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:209
[2025-06-01 02:50:17] [INFO ] After 21750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:209
[2025-06-01 02:50:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2025-06-01 02:50:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-06-01 02:50:18] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :209
[2025-06-01 02:50:20] [INFO ] After 2194ms SMT Verify possible using 1237 Read/Feed constraints in natural domain returned unsat :0 sat :209
TRAPS : Iteration 0
[2025-06-01 02:50:21] [INFO ] Deduced a trap composed of 3 places in 480 ms of which 4 ms to minimize.
[2025-06-01 02:50:21] [INFO ] Deduced a trap composed of 3 places in 466 ms of which 4 ms to minimize.
[2025-06-01 02:50:22] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 3 ms to minimize.
[2025-06-01 02:50:22] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:50:22] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 2 ms to minimize.
[2025-06-01 02:50:23] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:50:23] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2025-06-01 02:50:23] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:50:23] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:50:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2888 ms
[2025-06-01 02:50:23] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:50:24] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2025-06-01 02:50:24] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2025-06-01 02:50:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 636 ms
[2025-06-01 02:50:24] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2025-06-01 02:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-01 02:50:24] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:50:25] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2025-06-01 02:50:25] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:50:25] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2025-06-01 02:50:25] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-01 02:50:26] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 3 ms to minimize.
[2025-06-01 02:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2025-06-01 02:50:26] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-01 02:50:27] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 02:50:28] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-01 02:50:30] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:50:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 02:50:30] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:50:31] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:50:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2025-06-01 02:50:33] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2025-06-01 02:50:34] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2025-06-01 02:50:35] [INFO ] Deduced a trap composed of 139 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:50:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2025-06-01 02:50:35] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:50:36] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2025-06-01 02:50:36] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:50:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 633 ms
[2025-06-01 02:50:37] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 1 ms to minimize.
[2025-06-01 02:50:37] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:50:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2025-06-01 02:50:37] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:50:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-06-01 02:50:38] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:50:38] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:50:38] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:50:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 553 ms
[2025-06-01 02:50:40] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:50:41] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2025-06-01 02:50:41] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 1 ms to minimize.
[2025-06-01 02:50:41] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2025-06-01 02:50:42] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:50:42] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 4 ms to minimize.
[2025-06-01 02:50:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2025-06-01 02:50:42] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:50:42] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:50:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2025-06-01 02:50:43] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-01 02:50:44] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:50:44] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:50:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2025-06-01 02:50:49] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:50:49] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:50:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2025-06-01 02:50:50] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:50:50] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2025-06-01 02:50:50] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:50:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2025-06-01 02:50:50] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2025-06-01 02:50:51] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2025-06-01 02:50:51] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 1 ms to minimize.
[2025-06-01 02:50:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2025-06-01 02:50:52] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:50:52] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:50:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
TRAPS : Iteration 1
[2025-06-01 02:50:53] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2025-06-01 02:50:54] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:50:54] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:50:54] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:50:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 586 ms
[2025-06-01 02:50:55] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-06-01 02:50:56] [INFO ] Deduced a trap composed of 117 places in 437 ms of which 4 ms to minimize.
[2025-06-01 02:50:57] [INFO ] Deduced a trap composed of 128 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 972 ms
[2025-06-01 02:50:59] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-01 02:51:02] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-01 02:51:02] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:51:02] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:51:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2025-06-01 02:51:03] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:51:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 02:51:03] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2025-06-01 02:51:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:51:04] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2025-06-01 02:51:06] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-01 02:51:07] [INFO ] Deduced a trap composed of 151 places in 396 ms of which 3 ms to minimize.
[2025-06-01 02:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2025-06-01 02:51:17] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:51:17] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2025-06-01 02:51:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
TRAPS : Iteration 2
[2025-06-01 02:51:38] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:51:38] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:51:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
TRAPS : Iteration 3
[2025-06-01 02:51:42] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-01 02:51:59] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
TRAPS : Iteration 4
[2025-06-01 02:52:02] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:52:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2025-06-01 02:52:02] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:52:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
TRAPS : Iteration 5
[2025-06-01 02:52:42] [INFO ] After 143674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :209
[2025-06-01 02:52:45] [INFO ] After 147309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :209
RANDOM walk for 272888 steps (0 resets) in 120004 ms. (2 steps per ms) remains 3397/3398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 176 ms. (22 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 170 ms. (23 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 179 ms. (22 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3397/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 3396/3397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 175 ms. (22 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 170 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 156 ms. (25 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 159 ms. (25 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 3396/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3395/3396 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 177 ms. (22 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 225 ms. (17 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 193 ms. (20 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 233 ms. (17 steps per ms) remains 3395/3395 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3395/3395 properties
Interrupted probabilistic random walk after 528660 steps, run timeout after 105001 ms. (steps per millisecond=5 ) properties seen :10 out of 3395
Probabilistic random walk after 528660 steps, saw 398492 distinct states, run finished after 105002 ms. (steps per millisecond=5 ) properties seen :10
[2025-06-01 02:55:05] [INFO ] Flow matrix only has 1910 transitions (discarded 2870 similar events)
[2025-06-01 02:55:05] [INFO ] Invariant cache hit.
[2025-06-01 02:55:05] [INFO ] State equation strengthened by 1237 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3385 unsolved
At refinement iteration 2 (OVERLAPS) 253/679 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/679 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3385 unsolved
[2025-06-01 02:56:44] [INFO ] Deduced a trap composed of 25 places in 427 ms of which 4 ms to minimize.
[2025-06-01 02:56:45] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:56:45] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 3 ms to minimize.
[2025-06-01 02:56:45] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 2 ms to minimize.
[2025-06-01 02:56:46] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:56:46] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:56:46] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:56:46] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 2 ms to minimize.
[2025-06-01 02:56:47] [INFO ] Deduced a trap composed of 92 places in 221 ms of which 2 ms to minimize.
[2025-06-01 02:56:47] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:56:47] [INFO ] Deduced a trap composed of 81 places in 274 ms of which 2 ms to minimize.
[2025-06-01 02:56:47] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:56:48] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:56:48] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:56:48] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:56:48] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2025-06-01 02:56:49] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 2 ms to minimize.
[2025-06-01 02:56:49] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:56:49] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:56:49] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3385 unsolved
[2025-06-01 02:56:51] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 3 ms to minimize.
[2025-06-01 02:56:52] [INFO ] Deduced a trap composed of 22 places in 404 ms of which 4 ms to minimize.
[2025-06-01 02:56:52] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 3 ms to minimize.
[2025-06-01 02:56:52] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:56:55] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 2 ms to minimize.
[2025-06-01 02:57:02] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:57:02] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2025-06-01 02:57:04] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2025-06-01 02:57:04] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:57:04] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:57:07] [INFO ] Deduced a trap composed of 145 places in 493 ms of which 4 ms to minimize.
[2025-06-01 02:57:08] [INFO ] Deduced a trap composed of 155 places in 488 ms of which 3 ms to minimize.
SMT process timed out in 123231ms, After SMT, problems are : Problem set: 0 solved, 3385 unsolved
Fused 3385 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 426 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 4780/4780 transitions.
Applied a total of 0 rules in 201 ms. Remains 679 /679 variables (removed 0) and now considering 4780/4780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 679/679 places, 4780/4780 transitions.
RANDOM walk for 269200 steps (0 resets) in 120004 ms. (2 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 159 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 180 ms. (22 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 210 ms. (18 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 193 ms. (20 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 179 ms. (22 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 170 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 3385/3385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 3385/3385 properties

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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="Liveness"
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 EisenbergMcGuire-PT-10, examination is Liveness"
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-174860080800509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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