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.r488-tall-171631132000118.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 Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132000118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.9M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-03
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-05
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717186282162

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:11:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:11:23] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2024-05-31 20:11:23] [INFO ] Transformed 500 places.
[2024-05-31 20:11:23] [INFO ] Transformed 10200 transitions.
[2024-05-31 20:11:23] [INFO ] Found NUPN structural information;
[2024-05-31 20:11:23] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2978 ms. (13 steps per ms) remains 6/11 properties
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
[2024-05-31 20:11:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-31 20:11:25] [INFO ] Computed 300 invariants in 29 ms
[2024-05-31 20:11:25] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 98/170 variables, 68/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 98/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 12/182 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 50/232 variables, 41/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 50/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 18/250 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 200/450 variables, 250/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 100/550 variables, 100/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 300/850 variables, 200/950 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/850 variables, 200/1150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/850 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 50/900 variables, 100/1250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/900 variables, 50/1300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/900 variables, 50/1350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/900 variables, 50/1400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1449 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 8 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 98/170 variables, 68/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 98/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:11:29] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:11:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 13/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:11:31] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:11:32] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:11:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:11:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 12/182 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 12/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 182/900 variables, and 335 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5012 ms.
Refiners :[Domain max(s): 182/500 constraints, Positive P Invariants (semi-flows): 82/200 constraints, Generalized P Invariants (flows): 9/100 constraints, State Equation: 0/500 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 62/62 constraints]
After SMT, in 6725ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 830 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 849 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1199 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 154732 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :1 out of 6
Probabilistic random walk after 154732 steps, saw 142901 distinct states, run finished after 3007 ms. (steps per millisecond=51 ) properties seen :1
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-31 20:11:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:11:37] [INFO ] Invariant cache hit.
[2024-05-31 20:11:37] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 86/148 variables, 59/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 86/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/158 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 10/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 47/205 variables, 37/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 47/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 20/225 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 180/405 variables, 225/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 110/515 variables, 100/685 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 330/845 variables, 220/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/845 variables, 220/1125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/845 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 55/900 variables, 110/1235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/900 variables, 55/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/900 variables, 55/1345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/900 variables, 55/1400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 5 unsolved in 830 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 86/148 variables, 59/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 86/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 10/158 variables, 10/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 10/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 47/205 variables, 37/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 47/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 20/225 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/225 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 180/405 variables, 225/629 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/405 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 110/515 variables, 100/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/515 variables, 5/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/515 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 330/845 variables, 220/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 220/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 5/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-31 20:11:43] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-31 20:11:43] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:11:43] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-31 20:11:43] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2024-05-31 20:11:43] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:11:44] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-31 20:11:44] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-31 20:11:44] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-31 20:11:44] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-31 20:11:44] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-31 20:11:44] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-31 20:11:45] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-31 20:11:45] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-31 20:11:45] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-31 20:11:45] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-31 20:11:45] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-31 20:11:45] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-31 20:11:46] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-31 20:11:46] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 20/1199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:46] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:11:46] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-31 20:11:46] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:11:46] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:11:47] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:11:48] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/845 variables, 20/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:11:49] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:11:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:11:51] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/845 variables, 20/1239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:51] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:11:51] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:11:51] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2024-05-31 20:11:51] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:11:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:11:53] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/845 variables, 20/1259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:54] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:11:54] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:11:54] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-31 20:11:54] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:11:54] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2024-05-31 20:11:55] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:11:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/845 variables, 20/1279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:57] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:11:57] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:11:57] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-31 20:11:57] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:11:57] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:11:57] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:11:58] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/845 variables, 20/1299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:11:59] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:12:00] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:12:01] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/845 variables, 20/1319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:12:03] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:12:03] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:12:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:12:03] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/845 variables, 9/1328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:03] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:12:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:12:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/845 variables, 5/1333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:04] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/845 variables, 1/1334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/845 variables, 1/1335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/845 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 55/900 variables, 110/1445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/900 variables, 55/1500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/900 variables, 55/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/900 variables, 55/1610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:06] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/900 variables, 2/1612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/900 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
At refinement iteration 48 (OVERLAPS) 0/900 variables, 1/1613 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:12:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/900 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/900 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 0/900 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/900 variables, and 1614 constraints, problems are : Problem set: 0 solved, 5 unsolved in 30398 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 209/209 constraints]
After SMT, in 31371ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 6052 ms.
Support contains 24 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 437 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1074 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 219372 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 219372 steps, saw 201793 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-31 20:12:18] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:12:18] [INFO ] Invariant cache hit.
[2024-05-31 20:12:18] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 36/60 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/65 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/88 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 23/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 12/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 80/180 variables, 100/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 160/340 variables, 100/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 480/820 variables, 320/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/820 variables, 320/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/820 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 80/900 variables, 160/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/900 variables, 80/1240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/900 variables, 80/1320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/900 variables, 80/1400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:18] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/60 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:12:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/65 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 23/88 variables, 17/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/100 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 80/180 variables, 100/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/180 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 160/340 variables, 100/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 480/820 variables, 320/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/820 variables, 320/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/820 variables, 2/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:12:20] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:12:21] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/820 variables, 20/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:12:22] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:12:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/820 variables, 20/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:12:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:12:25] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/820 variables, 20/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:12:26] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:12:27] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/820 variables, 20/1090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:12:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/820 variables, 9/1099 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/820 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 80/900 variables, 160/1259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/900 variables, 80/1339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/900 variables, 80/1419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/900 variables, 80/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/900 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/900 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/900 variables, and 1499 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10763 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 97/97 constraints]
After SMT, in 11310ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1074 ms.
Support contains 24 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 523 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 399 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:12:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:12:31] [INFO ] Invariant cache hit.
[2024-05-31 20:12:38] [INFO ] Implicit Places using invariants in 7365 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 7395 ms to find 99 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 334 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8129 ms. Remains : 401/500 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1281 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 276740 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 276740 steps, saw 254060 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-31 20:12:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2024-05-31 20:12:42] [INFO ] Computed 201 invariants in 3 ms
[2024-05-31 20:12:42] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/61 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 37/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/80 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 19/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 80/161 variables, 81/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 160/321 variables, 100/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 400/721 variables, 240/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/721 variables, 240/783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/721 variables, 80/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/721 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 80/801 variables, 80/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/801 variables, 80/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/801 variables, 80/1103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/801 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/801 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 1103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 401/401 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/61 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 37/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:12:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/80 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 19/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/81 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 80/161 variables, 81/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 160/321 variables, 100/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 400/721 variables, 240/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/721 variables, 240/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/721 variables, 80/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:44] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:12:44] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:12:44] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-31 20:12:44] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-31 20:12:44] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-31 20:12:44] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-31 20:12:45] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/721 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:12:46] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:12:47] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/721 variables, 20/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:12:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:12:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/721 variables, 20/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:12:50] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/721 variables, 20/953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:12:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:12:52] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/721 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:12:53] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:12:54] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/721 variables, 20/993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:12:55] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2024-05-31 20:12:56] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/721 variables, 17/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/721 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 80/801 variables, 80/1090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/801 variables, 80/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/801 variables, 80/1250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/801 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/801 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 801/801 variables, and 1250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 14097 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 401/401 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 145/145 constraints]
After SMT, in 14571ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 939 ms.
Support contains 24 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 341 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 401/401 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 324 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:12:58] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:12:58] [INFO ] Invariant cache hit.
[2024-05-31 20:13:00] [INFO ] Implicit Places using invariants in 1418 ms returned []
Implicit Place search using SMT only with invariants took 1420 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:13:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:13:00] [INFO ] Invariant cache hit.
[2024-05-31 20:13:00] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49653ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49752ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51539 ms. Remains : 401/401 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 605 edges and 401 vertex of which 81 are kept as prefixes of interest. Removing 320 places using SCC suffix rule.2 ms
Discarding 320 places :
Also discarding 8160 output transitions
Drop transitions (Output transitions of discarded places.) removed 8160 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 1960 transitions
Reduce isomorphic transitions removed 1960 transitions.
Iterating post reduction 0 with 1961 rules applied. Total rules applied 1962 place count 80 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1974 place count 72 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1978 place count 72 transition count 72
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 1989 place count 72 transition count 61
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 2022 place count 50 transition count 50
Applied a total of 2022 rules in 104 ms. Remains 50 /401 variables (removed 351) and now considering 50/10200 (removed 10150) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 50 rows 50 cols
[2024-05-31 20:13:50] [INFO ] Computed 25 invariants in 1 ms
[2024-05-31 20:13:50] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 20:13:50] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-31 20:13:50] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 20:13:50] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 20:13:50] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
[2024-05-31 20:13:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 20:13:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 401 places, 10200 transitions and 70201 arcs took 53 ms.
[2024-05-31 20:13:51] [INFO ] Flatten gal took : 646 ms
Total runtime 148073 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Dekker-PT-100-ReachabilityCardinality-2024-02
Could not compute solution for formula : Dekker-PT-100-ReachabilityCardinality-2024-13

BK_STOP 1717186431719

--------------------
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:
++ 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
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name Dekker-PT-100-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/2096/inv_0_
rfs formula name Dekker-PT-100-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/2096/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Dekker-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 Dekker-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132000118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;