Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r530-tall-171683779800648.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is ShieldRVt-PT-050B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779800648
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 614K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717228469171

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:54:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 07:54:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:54:30] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-06-01 07:54:30] [INFO ] Transformed 2503 places.
[2024-06-01 07:54:30] [INFO ] Transformed 2503 transitions.
[2024-06-01 07:54:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:54:30] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 340 ms.
Structural test allowed to assert that 1001 places are NOT stable. Took 28 ms.
RANDOM walk for 40000 steps (8 resets) in 4313 ms. (9 steps per ms) remains 1144/1502 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 122 steps (8 resets) in 20 ms. (5 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1144/1144 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1144/1144 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-06-01 07:54:32] [INFO ] Computed 201 invariants in 35 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1144 variables, 1144/1144 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1144/5006 variables, and 1144 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 5098 ms.
Refiners :[Domain max(s): 1144/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 1144/1144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1144 variables, 1144/1144 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/5006 variables, and 1144 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 5029 ms.
Refiners :[Domain max(s): 1144/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 0/1144 constraints, Known Traps: 0/0 constraints]
After SMT, in 10590ms problems are : Problem set: 0 solved, 1144 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1144 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 496 place count 2503 transition count 2007
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 498 rules applied. Total rules applied 994 place count 2007 transition count 2005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 995 place count 2006 transition count 2005
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 995 place count 2006 transition count 1955
Deduced a syphon composed of 50 places in 9 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1095 place count 1956 transition count 1955
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1174 place count 1877 transition count 1876
Iterating global reduction 3 with 79 rules applied. Total rules applied 1253 place count 1877 transition count 1876
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 1253 place count 1877 transition count 1844
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1317 place count 1845 transition count 1844
Performed 414 Post agglomeration using F-continuation condition.Transition count delta: 414
Deduced a syphon composed of 414 places in 10 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 3 with 828 rules applied. Total rules applied 2145 place count 1431 transition count 1430
Renaming transitions due to excessive name length > 1024 char.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 33 places in 9 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2211 place count 1398 transition count 1460
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2212 place count 1398 transition count 1459
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2215 place count 1398 transition count 1456
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2218 place count 1395 transition count 1456
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2220 place count 1395 transition count 1454
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2221 place count 1395 transition count 1454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2222 place count 1394 transition count 1453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2223 place count 1393 transition count 1453
Applied a total of 2223 rules in 854 ms. Remains 1393 /2503 variables (removed 1110) and now considering 1453/2503 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 865 ms. Remains : 1393/2503 places, 1453/2503 transitions.
RANDOM walk for 2067928 steps (523 resets) in 120011 ms. (17 steps per ms) remains 641/1144 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (9 resets) in 46 ms. (85 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 641/641 properties
// Phase 1: matrix 1453 rows 1393 cols
[2024-06-01 07:55:15] [INFO ] Computed 200 invariants in 6 ms
[2024-06-01 07:55:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 180/821 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 3 (OVERLAPS) 825/1646 variables, 821/918 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1646/2846 variables, and 918 constraints, problems are : Problem set: 0 solved, 641 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 97/200 constraints, State Equation: 821/1393 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 180/821 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-01 07:56:06] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 40 ms to minimize.
[2024-06-01 07:56:07] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:56:07] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:56:07] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 15 ms to minimize.
[2024-06-01 07:56:07] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:56:08] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:56:08] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:56:08] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:56:09] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:56:09] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:56:09] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:56:09] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:56:10] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:56:10] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:56:10] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:56:11] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:56:11] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:56:12] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:56:12] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:56:12] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-01 07:56:12] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 4 ms to minimize.
[2024-06-01 07:56:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 14 ms to minimize.
[2024-06-01 07:56:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:56:14] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:56:14] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:56:14] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:56:14] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:56:15] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:56:16] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:56:16] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:56:16] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:56:17] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:56:17] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:56:17] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:56:17] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:56:18] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:56:18] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:56:18] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:56:18] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:56:18] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-01 07:56:18] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:56:19] [INFO ] Deduced a trap composed of 80 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:56:19] [INFO ] Deduced a trap composed of 114 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:56:19] [INFO ] Deduced a trap composed of 94 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:56:19] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:56:20] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:56:20] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:56:20] [INFO ] Deduced a trap composed of 94 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:56:20] [INFO ] Deduced a trap composed of 88 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:56:20] [INFO ] Deduced a trap composed of 94 places in 202 ms of which 5 ms to minimize.
[2024-06-01 07:56:20] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:56:21] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:56:22] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:56:22] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:56:22] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:56:23] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 5 ms to minimize.
[2024-06-01 07:56:23] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:56:24] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:56:24] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:56:24] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-01 07:56:25] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:56:26] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:56:27] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 3 ms to minimize.
[2024-06-01 07:56:28] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:56:30] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:56:30] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:56:30] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:56:31] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:56:31] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:56:31] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:56:31] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-01 07:56:34] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:56:34] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:56:34] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:56:34] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:56:35] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:56:36] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:56:37] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:56:37] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:56:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:56:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:56:39] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:56:39] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:56:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:56:39] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:56:40] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-01 07:56:42] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:56:42] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:56:42] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:56:43] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:56:43] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:56:43] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:56:43] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/2846 variables, and 204 constraints, problems are : Problem set: 0 solved, 641 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 97/200 constraints, State Equation: 0/1393 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/641 constraints, Known Traps: 107/107 constraints]
After SMT, in 90219ms problems are : Problem set: 0 solved, 641 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 641 out of 1393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1393/1393 places, 1453/1453 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 1393 transition count 1320
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 1260 transition count 1320
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 266 place count 1260 transition count 1250
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 406 place count 1190 transition count 1250
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 445 place count 1151 transition count 1211
Iterating global reduction 2 with 39 rules applied. Total rules applied 484 place count 1151 transition count 1211
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 484 place count 1151 transition count 1172
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 562 place count 1112 transition count 1172
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 764 place count 1011 transition count 1071
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 852 place count 967 transition count 1112
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 859 place count 967 transition count 1105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 866 place count 960 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 868 place count 960 transition count 1103
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 870 place count 960 transition count 1103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 871 place count 960 transition count 1102
Applied a total of 871 rules in 164 ms. Remains 960 /1393 variables (removed 433) and now considering 1102/1453 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 960/1393 places, 1102/1453 transitions.
RANDOM walk for 2789099 steps (746 resets) in 120012 ms. (23 steps per ms) remains 503/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (9 resets) in 38 ms. (102 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 503/503 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 503/503 properties
// Phase 1: matrix 1102 rows 960 cols
[2024-06-01 07:57:16] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 07:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 110/613 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 615/1228 variables, 613/686 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1228 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 42/1270 variables, 17/703 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1270 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 32/1302 variables, 7/710 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Error getting values : (error "ParserException while parsing response: ((t17 1.0)
(t18 1.0)
(t20 0.0)
(t21 0.0)
(t22 1.0)
(t23 (/ 161.0 162.0))
(t24 (/ 161.0 162.0))
(t25 0.0)
(t26 (/ 1.0 162.0))
(t27 0.0)
(t32 0.0)
(t34 0.0)
(t35 (/ 161.0 162.0))
(t70 0.0)
(t71 0.0)
(t72 (/ 5.0 54.0))
(t73 0.0)
(t81 0.0)
(t85 0.0)
(t87 0.0)
(t89 (/ 1.0 162.0))
(t90 (/ 1.0 162.0))
(t91 (/ 1.0 162.0))
(t92 (/ 1.0 162.0))
(t93 (/ 1.0 162.0))
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 (/ 5.0 54.0))
(t100 (/ 5.0 54.0))
(t101 0.0)
(t103 0.0)
(t104 0.0)
(t105 (/ 1.0 162.0))
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 (/ 1.0 162.0))
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 (/ 2.0 81.0))
(t120 (/ 2.0 81.0))
(t121 (/ 1.0 54.0))
(t122 (/ 1.0 54.0))
(t123 0.0)
(t124 (/ 1.0 162.0))
(t125 0.0)
(t126 0.0)
(t127 (/ 5.0 54.0))
(t128 (/ 5.0 54.0))
(t129 (/ 5.0 54.0))
(t130 (/ 7.0 81.0))
(t131 (/ 2.0 27.0))
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 (/ 1.0 54.0))
(t136 (/ 1.0 54.0))
(t137 (/ 1.0 81.0))
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 (/ 1.0 162.0))
(t142 (/ 1.0 162.0))
(t143 (/ 1.0 162.0))
(t144 (/ 1.0 162.0))
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 (/ 2.0 27.0))
(t150 (/ 5.0 81.0))
(t151 (/ 4.0 81.0))
(t152 (/ 7.0 162.0))
(t153 0.0)
(t154 (/ 1.0 162.0))
(t155 0.0)
(t156 0.0)
(t157 (/ 2.0 27.0))
(t158 (/ 11.0 162.0))
(t159 (/ 1.0 18.0))
(t160 (/ 4.0 81.0))
(t161 0.0)
(t162 (/ 1.0 162.0))
(t163 0.0)
(t164 0.0)
(t165 (/ 5.0 162.0))
(t166 (/ 1.0 54.0))
(t167 (/ 1.0 81.0))
(t168 0.0)
(t169 (/ 1.0 162.0))
(t170 0.0)
(t171 (/ 1.0 27.0))
(t172 (/ 5.0 162.0))
(t173 (/ 1.0 54.0))
(t174 (/ 1.0 81.0))
(t175 0.0)
(t176 (/ 1.0 162.0))
(t177 0.0)
(t178 0.0)
(t179 (/ 1.0 27.0))
(t180 (/ 5.0 81.0))
(t181 (/ 4.0 81.0))
(t182 (/ 7.0 162.0))
(t183 0.0)
(t184 (/ 1.0 162.0))
(t185 0.0)
(t186 (/ 5.0 162.0))
(t187 (/ 1.0 27.0))
(t188 (/ 5.0 162.0))
(t189 (/ 1.0 54.0))
(t190 (/ 1.0 81.0))
(t191 0.0)
(t192 (/ 1.0 162.0))
(t193 0.0)
(t194 0.0)
(t195 (/ 5.0 162.0))
(t196 (/ 1.0 54.0))
(t197 (/ 1.0 81.0))
(t198 0.0)
(t199 (/ 1.0 162.0))
(t200 0.0)
(t201 (/ 2.0 27.0))
(t202 (/ 11.0 162.0))
(t203 (/ 1.0 18.0))
(t204 (/ 4.0 81.0))
(t205 0.0)
(t206 (/ 1.0 162.0))
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 (/ 11.0 81.0))
(t211 (/ 10.0 81.0))
(t212 (/ 19.0 162.0))
(t213 (/ 17.0 162.0))
(t214 (/ 1.0 162.0))
(t215 0.0)
(t216 (/ 23.0 162.0))
(t217 0.0)
(t218 (/ 11.0 162.0))
(t219 (/ 1.0 18.0))
(t220 (/ 4.0 81.0))
(t221 0.0)
(t222 (/ 1.0 162.0))
(t223 0.0)
(t224 (/ 2.0 27.0))
(t225 (/ 17.0 162.0))
(t226 (/ 5.0 54.0))
(t227 (/ 7.0 81.0))
(t228 0.0)
(t229 (/ 1.0 162.0))
(t230 0.0)
(t231 (/ 23.0 162.0))
(t232 (/ 17.0 162.0))
(t233 (/ 5.0 54.0))
(t234 (/ 7.0 81.0))
(t235 0.0)
(t236 (/ 1.0 162.0))
(t237 0.0)
(t238 (/ 2.0 27.0))
(t239 (/ 1.0 27.0))
(t240 (/ 5.0 81.0))
(t241 (/ 4.0 81.0))
(t242 (/ 7.0 162.0))
(t243 0.0)
(t244 (/ 1.0 162.0))
(t245 0.0)
(t246 (/ 5.0 162.0))
(t247 (/ 1.0 27.0))
(t248 (/ 5.0 162.0))
(t249 (/ 1.0 54.0))
(t250 (/ 1.0 81.0))
(t251 0.0)
(t252 (/ 1.0 162.0))
(t253 0.0)
(t254 0.0)
(t255 (/ 5.0 162.0))
(t256 (/ 1.0 54.0))
(t257 (/ 1.0 81.0))
(t258 0.0)
(t259 (/ 1.0 162.0))
(t260 0.0)
(t261 (/ 29.0 162.0))
(t262 (/ 14.0 81.0))
(t263 (/ 13.0 81.0))
(t264 (/ 25.0 162.0))
(t265 0.0)
(t266 (/ 1.0 162.0))
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 (/ 11.0 81.0))
(t271 (/ 10.0 81.0))
(t272 (/ 19.0 162.0))
(t273 0.0)
(t274 (/ 1.0 162.0))
(t275 0.0)
(t276 (/ 23.0 162.0))
(t277 0.0)
(t278 (/ 11.0 162.0))
(t279 (/ 1.0 18.0))
(t280 (/ 4.0 81.0))
(t281 0.0)
(t282 (/ 1.0 162.0))
(t283 0.0)
(t284 (/ 2.0 27.0))
(t285 (/ 17.0 162.0))
(t286 (/ 5.0 54.0))
(t287 (/ 7.0 81.0))
(t288 0.0)
(t289 (/ 1.0 162.0))
(t290 0.0)
(t291 (/ 23.0 162.0))
(t292 (/ 17.0 81.0))
(t293 (/ 16.0 81.0))
(t294 (/ 31.0 162.0))
(t295 0.0)
(t296 (/ 1.0 162.0))
(t297 0.0)
(t298 (/ 2.0 27.0))
(t299 (/ 1.0 27.0))
(t300 (/ 5.0 81.0))
(t301 (/ 4.0 81.0))
(t302 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1302/2062 variables, and 710 constraints, problems are : Problem set: 0 solved, 503 unsolved in 75021 ms.
Refiners :[Positive P Invariants (semi-flows): 80/200 constraints, State Equation: 630/960 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 110/613 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:58:39] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:58:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:58:40] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:58:41] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:58:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:58:42] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:58:42] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 3 ms to minimize.
[2024-06-01 07:58:42] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:58:42] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:58:42] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:58:49] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:58:51] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:58:51] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:58:51] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:58:51] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:58:54] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:58:55] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:58:56] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:58:57] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:58:57] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:59:00] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:59:00] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:59:00] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:59:00] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 124 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 138 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:59:07] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 5 ms to minimize.
[2024-06-01 07:59:09] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:59:09] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:59:09] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:59:11] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:59:11] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:59:13] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:59:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:59:17] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:59:17] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:59:17] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:59:17] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:59:18] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:59:18] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:18] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:59:19] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:59:20] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:59:20] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:20] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:59:20] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:20] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:59:22] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:59:23] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:59:24] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:59:25] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:59:26] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:59:27] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:59:27] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:59:27] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:59:27] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:27] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:59:27] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 126 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 126 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/613 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:36] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:59:36] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:59:36] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:59:36] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:59:36] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:59:36] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:59:37] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:59:39] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:59:39] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:59:39] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:59:39] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/613 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:59:41] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:59:42] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:59:42] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:59:42] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:59:42] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:59:42] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:59:42] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:59:43] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 3 ms to minimize.
[2024-06-01 07:59:43] [INFO ] Deduced a trap composed of 130 places in 81 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/613 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 07:59:45] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:59:45] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:59:45] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:59:45] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:59:46] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 3 ms to minimize.
[2024-06-01 07:59:46] [INFO ] Deduced a trap composed of 110 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:59:46] [INFO ] Deduced a trap composed of 110 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 150171ms, After SMT, problems are : Problem set: 0 solved, 503 unsolved
Fused 503 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 503 out of 960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 960/960 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 960 transition count 1064
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 922 transition count 1064
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 76 place count 922 transition count 1047
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 110 place count 905 transition count 1047
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 899 transition count 1041
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 899 transition count 1041
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 122 place count 899 transition count 1035
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 134 place count 893 transition count 1035
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 214 place count 853 transition count 995
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 240 place count 840 transition count 1005
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 840 transition count 1004
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 840 transition count 1001
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 247 place count 837 transition count 1001
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 837 transition count 1000
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 837 transition count 1000
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 837 transition count 999
Applied a total of 250 rules in 106 ms. Remains 837 /960 variables (removed 123) and now considering 999/1102 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 837/960 places, 999/1102 transitions.
RANDOM walk for 3599758 steps (975 resets) in 120004 ms. (29 steps per ms) remains 494/503 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 414 ms. (96 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 476 ms. (83 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 503 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (9 resets) in 370 ms. (107 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 431 ms. (92 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (8 resets) in 364 ms. (109 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (9 resets) in 510 ms. (78 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 504 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 400 ms. (99 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (9 resets) in 481 ms. (82 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 446 ms. (89 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 372 ms. (107 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 506 ms. (78 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 430 ms. (92 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 420 ms. (95 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 547 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 502 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (9 resets) in 457 ms. (87 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (9 resets) in 452 ms. (88 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 494/494 properties
Interrupted probabilistic random walk after 4775410 steps, run timeout after 108001 ms. (steps per millisecond=44 ) properties seen :224 out of 494
Probabilistic random walk after 4775410 steps, saw 1224946 distinct states, run finished after 108005 ms. (steps per millisecond=44 ) properties seen :224
// Phase 1: matrix 999 rows 837 cols
[2024-06-01 08:02:10] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 08:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 168/438 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 463/901 variables, 438/491 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 188/1089 variables, 91/582 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1089 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1089 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 59/1148 variables, 19/605 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1148 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1148 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 58/1206 variables, 64/672 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1206 variables, 4/676 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1206 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 14 (OVERLAPS) 18/1224 variables, 8/684 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1224 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1224 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 17 (OVERLAPS) 18/1242 variables, 8/696 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1242 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1242 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 20 (OVERLAPS) 20/1262 variables, 8/708 constraints. Problems are: Problem set: 0 solved, 270 unsolved
SMT process timed out in 90055ms, After SMT, problems are : Problem set: 0 solved, 270 unsolved
Fused 270 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 270 out of 837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 837/837 places, 999/999 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 837 transition count 935
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 773 transition count 935
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 128 place count 773 transition count 899
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 200 place count 737 transition count 899
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 208 place count 729 transition count 891
Iterating global reduction 2 with 8 rules applied. Total rules applied 216 place count 729 transition count 891
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 216 place count 729 transition count 883
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 232 place count 721 transition count 883
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 340 place count 667 transition count 829
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 396 place count 639 transition count 847
Applied a total of 396 rules in 51 ms. Remains 639 /837 variables (removed 198) and now considering 847/999 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 639/837 places, 847/999 transitions.
RANDOM walk for 2817989 steps (802 resets) in 120004 ms. (23 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40002 steps (8 resets) in 329 ms. (121 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 341 ms. (116 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40002 steps (9 resets) in 350 ms. (113 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (9 resets) in 332 ms. (120 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 349 ms. (114 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40002 steps (9 resets) in 324 ms. (123 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 355 ms. (112 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 332 ms. (120 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 332 ms. (120 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 316 ms. (126 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (9 resets) in 348 ms. (114 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 354 ms. (112 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 328 ms. (121 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (10 resets) in 369 ms. (108 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (9 resets) in 322 ms. (123 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 409 ms. (97 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (9 resets) in 337 ms. (118 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 324 ms. (123 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 298 ms. (133 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 270/270 properties
BEST_FIRST walk for 40004 steps (9 resets) in 370 ms. (107 steps per ms) remains 270/270 properties
Interrupted probabilistic random walk after 5711523 steps, run timeout after 105001 ms. (steps per millisecond=54 ) properties seen :266 out of 270
Probabilistic random walk after 5711523 steps, saw 1557838 distinct states, run finished after 105002 ms. (steps per millisecond=54 ) properties seen :266
// Phase 1: matrix 847 rows 639 cols
[2024-06-01 08:06:00] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 08:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 55/106 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 35/141 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 38/179 variables, 36/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 48/227 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 26/253 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 47/300 variables, 34/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/304 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 47/351 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/351 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/351 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 28/379 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/379 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/379 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 47/426 variables, 34/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/426 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/426 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 4/430 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/430 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/430 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 47/477 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/477 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/477 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 28/505 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/505 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/505 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 47/552 variables, 34/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/552 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/552 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 4/556 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/556 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/556 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 46/602 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/602 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/602 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 28/630 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/630 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/630 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 45/675 variables, 34/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/675 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/675 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 4/679 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/679 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/679 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 48/727 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/727 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/727 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 26/753 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/753 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/753 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 44/797 variables, 32/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/797 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/797 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 38/835 variables, 18/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/835 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/835 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 18/853 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/853 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/853 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 32/885 variables, 24/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/885 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/885 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 18/903 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/903 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/903 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (OVERLAPS) 19/922 variables, 8/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/922 variables, 4/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/922 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 18/940 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/940 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/940 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (OVERLAPS) 21/961 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/961 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/961 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (OVERLAPS) 22/983 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/983 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/983 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (OVERLAPS) 22/1005 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1005 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1005 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (OVERLAPS) 22/1027 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1027 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1027 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (OVERLAPS) 22/1049 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1049 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1049 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (OVERLAPS) 22/1071 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1071 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1071 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (OVERLAPS) 22/1093 variables, 8/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1093 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1093 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (OVERLAPS) 22/1115 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1115 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1115 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (OVERLAPS) 22/1137 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1137 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1137 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (OVERLAPS) 22/1159 variables, 8/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1159 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1159 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (OVERLAPS) 22/1181 variables, 8/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1181 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1181 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 121 (OVERLAPS) 22/1203 variables, 8/673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1203 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1203 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 124 (OVERLAPS) 22/1225 variables, 8/685 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1225 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1225 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 127 (OVERLAPS) 19/1244 variables, 8/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1244 variables, 4/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1244 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 130 (OVERLAPS) 18/1262 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1262 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1262 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 133 (OVERLAPS) 21/1283 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1283 variables, 4/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1283 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1283 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 137 (OVERLAPS) 22/1305 variables, 8/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1305 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1305 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 140 (OVERLAPS) 22/1327 variables, 8/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1327 variables, 4/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1327 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 143 (OVERLAPS) 22/1349 variables, 8/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1349 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1349 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 146 (OVERLAPS) 22/1371 variables, 8/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1371 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1371 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 149 (OVERLAPS) 22/1393 variables, 8/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1393 variables, 4/786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1393 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 152 (OVERLAPS) 22/1415 variables, 8/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1415 variables, 4/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1415 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 155 (OVERLAPS) 22/1437 variables, 8/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1437 variables, 4/810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1437 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 158 (OVERLAPS) 22/1459 variables, 8/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1459 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1459 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 161 (OVERLAPS) 19/1478 variables, 8/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1478 variables, 4/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1478 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 164 (OVERLAPS) 8/1486 variables, 4/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1486 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1486 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 167 (OVERLAPS) 0/1486 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 840 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2544 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 639/639 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 55/106 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 35/141 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 38/179 variables, 36/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/179 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 48/227 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 26/253 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 47/300 variables, 34/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/300 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/304 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/304 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 47/351 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/351 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/351 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 28/379 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/379 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/379 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 47/426 variables, 34/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/426 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/426 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 4/430 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/430 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/430 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 47/477 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/477 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/477 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 28/505 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/505 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/505 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 47/552 variables, 34/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/552 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/552 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 4/556 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/556 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/556 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 46/602 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/602 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/602 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 28/630 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/630 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/630 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 45/675 variables, 34/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/675 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/675 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 4/679 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/679 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/679 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 48/727 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/727 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/727 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 26/753 variables, 6/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/753 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/753 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 44/797 variables, 32/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/797 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:06:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/797 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/797 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 38/835 variables, 18/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/835 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/835 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 18/853 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/853 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/853 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 32/885 variables, 24/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/885 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/885 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 18/903 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/903 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/903 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 19/922 variables, 8/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/922 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/922 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (OVERLAPS) 18/940 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/940 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/940 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 21/961 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/961 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/961 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (OVERLAPS) 22/983 variables, 8/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/983 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/983 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (OVERLAPS) 22/1005 variables, 8/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1005 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1005 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (OVERLAPS) 22/1027 variables, 8/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1027 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1027 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (OVERLAPS) 22/1049 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1049 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1049 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (OVERLAPS) 22/1071 variables, 8/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1071 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1071 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (OVERLAPS) 22/1093 variables, 8/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1093 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1093 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (OVERLAPS) 22/1115 variables, 8/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1115 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1115 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (OVERLAPS) 22/1137 variables, 8/642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1137 variables, 4/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1137 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (OVERLAPS) 22/1159 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1159 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1159 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 120 (OVERLAPS) 22/1181 variables, 8/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1181 variables, 4/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1181 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 123 (OVERLAPS) 22/1203 variables, 8/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1203 variables, 4/682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1203 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 126 (OVERLAPS) 22/1225 variables, 8/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1225 variables, 4/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1225 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 129 (OVERLAPS) 19/1244 variables, 8/702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1244 variables, 4/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1244 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 132 (OVERLAPS) 18/1262 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1262 variables, 4/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1262 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 135 (OVERLAPS) 21/1283 variables, 8/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1283 variables, 4/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1283 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1283 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 139 (OVERLAPS) 22/1305 variables, 8/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1305 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1305 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 142 (OVERLAPS) 22/1327 variables, 8/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1327 variables, 4/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1327 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 145 (OVERLAPS) 22/1349 variables, 8/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1349 variables, 4/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1349 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 148 (OVERLAPS) 22/1371 variables, 8/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1371 variables, 4/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1371 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 151 (OVERLAPS) 22/1393 variables, 8/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1393 variables, 4/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1393 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 154 (OVERLAPS) 22/1415 variables, 8/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1415 variables, 4/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1415 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 157 (OVERLAPS) 22/1437 variables, 8/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1437 variables, 4/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1437 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 160 (OVERLAPS) 22/1459 variables, 8/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1459 variables, 4/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1459 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 163 (OVERLAPS) 19/1478 variables, 8/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1478 variables, 4/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1478 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 166 (OVERLAPS) 8/1486 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1486 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1486 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 169 (OVERLAPS) 0/1486 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1486/1486 variables, and 845 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 639/639 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 6156ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 639 transition count 788
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 580 transition count 788
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 118 place count 580 transition count 747
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 200 place count 539 transition count 747
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 221 place count 518 transition count 726
Iterating global reduction 2 with 21 rules applied. Total rules applied 242 place count 518 transition count 726
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 242 place count 518 transition count 705
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 284 place count 497 transition count 705
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 408 place count 435 transition count 643
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 470 place count 404 transition count 665
Applied a total of 470 rules in 43 ms. Remains 404 /639 variables (removed 235) and now considering 665/847 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 404/639 places, 665/847 transitions.
RANDOM walk for 4000000 steps (1030 resets) in 60988 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3996261 steps (111 resets) in 17213 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3961219 steps (102 resets) in 16326 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3919008 steps (95 resets) in 16449 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3863823 steps (104 resets) in 16570 ms. (233 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1672470 steps, run visited all 4 properties in 23992 ms. (steps per millisecond=69 )
Probabilistic random walk after 1672470 steps, saw 924816 distinct states, run finished after 24016 ms. (steps per millisecond=69 ) properties seen :4
Able to resolve query StableMarking after proving 1503 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 760818 ms.
ITS solved all properties within timeout

BK_STOP 1717229231205

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-050B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r530-tall-171683779800648"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;