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.r135-tall-171631130400115.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 greatspnxred
Input is Dekker-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130400115
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716334307145

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:31:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 23:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:31:48] [INFO ] Load time of PNML (sax parser for PT used): 465 ms
[2024-05-21 23:31:48] [INFO ] Transformed 500 places.
[2024-05-21 23:31:48] [INFO ] Transformed 10200 transitions.
[2024-05-21 23:31:48] [INFO ] Found NUPN structural information;
[2024-05-21 23:31:49] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 355 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:31:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-21 23:31:49] [INFO ] Computed 300 invariants in 30 ms
[2024-05-21 23:31:57] [INFO ] Implicit Places using invariants in 7714 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 269, 272, 275, 278, 281, 284, 290, 293, 296, 299, 302, 305, 311, 314, 317, 320, 323, 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, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 455, 458, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 7763 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 409/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 341 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8483 ms. Remains : 409/500 places, 10200/10200 transitions.
Support contains 45 out of 409 places after structural reductions.
[2024-05-21 23:31:59] [INFO ] Flatten gal took : 823 ms
[2024-05-21 23:31:59] [INFO ] Flatten gal took : 400 ms
[2024-05-21 23:32:00] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 43 out of 409 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (8 resets) in 3302 ms. (12 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
[2024-05-21 23:32:01] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-21 23:32:01] [INFO ] Computed 209 invariants in 3 ms
[2024-05-21 23:32:02] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 13 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/24 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/49 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 188/237 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 478/715 variables, 290/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 290/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 86/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 94/809 variables, 102/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 94/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 8/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 94/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/809 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 1133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1926 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/24 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/49 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 188/237 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 478/715 variables, 290/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 290/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 86/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 3/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:32:04] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 2 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 5 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 5 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/715 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:32:09] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
SMT process timed out in 7158ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 540 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 409/409 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1250 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2024-05-21 23:32:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:10] [INFO ] Invariant cache hit.
[2024-05-21 23:32:10] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/16 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 192/225 variables, 100/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 488/713 variables, 296/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/713 variables, 296/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 88/824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/713 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 96/809 variables, 104/928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 96/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 8/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 96/1128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/809 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 1128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 698 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:10] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/16 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/17 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/33 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 192/225 variables, 100/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 488/713 variables, 296/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 296/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/713 variables, 88/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/713 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 96/809 variables, 104/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 96/1028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 8/1036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/809 variables, 96/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/809 variables, 20/1152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/809 variables, 20/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:32:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/809 variables, 20/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/809 variables, 17/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/809 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/809 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8247 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 80/80 constraints]
After SMT, in 9024ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 864 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 545 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 545 ms. Remains : 409/409 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1189 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
[2024-05-21 23:32:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:21] [INFO ] Invariant cache hit.
[2024-05-21 23:32:21] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/17 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 196/213 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 498/711 variables, 302/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/711 variables, 302/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/711 variables, 90/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 98/809 variables, 106/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 98/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 8/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 98/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/809 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 1127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 493 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/17 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 196/213 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 498/711 variables, 302/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/711 variables, 302/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/711 variables, 90/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/711 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 98/809 variables, 106/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 98/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 8/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 98/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/809 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 1128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 17 ms.
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0)||!p1) U !(F(!G(p0))||F(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 82 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:22] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:22] [INFO ] Invariant cache hit.
[2024-05-21 23:32:24] [INFO ] Implicit Places using invariants in 2085 ms returned [218, 245, 260, 275, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2093 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 84 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2260 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), p0, true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 2536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 871 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:26] [INFO ] Invariant cache hit.
[2024-05-21 23:32:28] [INFO ] Implicit Places using invariants in 2107 ms returned [218, 245, 260, 275, 288, 373, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2126 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 457 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3455 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-01
Product exploration explored 100000 steps with 990 reset in 2222 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-01 finished in 5806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:31] [INFO ] Invariant cache hit.
[2024-05-21 23:32:33] [INFO ] Implicit Places using invariants in 2173 ms returned [218, 245, 260, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2184 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2362 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-02
Product exploration explored 100000 steps with 34350 reset in 1923 ms.
Stack based approach found an accepted trace after 36 steps with 11 reset with depth 15 and stack size 15 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-02 finished in 4413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 440 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:35] [INFO ] Invariant cache hit.
[2024-05-21 23:32:37] [INFO ] Implicit Places using invariants in 2156 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2164 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 439 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3045 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 2132 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 5251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(p2)))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:40] [INFO ] Invariant cache hit.
[2024-05-21 23:32:42] [INFO ] Implicit Places using invariants in 2115 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2123 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2296 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 2470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:43] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:43] [INFO ] Invariant cache hit.
[2024-05-21 23:32:45] [INFO ] Implicit Places using invariants in 2138 ms returned [218, 245, 260, 275, 288, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2147 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 84 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2318 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 134 steps with 0 reset in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-05 finished in 2441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 87 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:45] [INFO ] Invariant cache hit.
[2024-05-21 23:32:47] [INFO ] Implicit Places using invariants in 2145 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2154 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2327 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 2296 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 104 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 4809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:50] [INFO ] Invariant cache hit.
[2024-05-21 23:32:52] [INFO ] Implicit Places using invariants in 2233 ms returned [218, 245, 260, 275, 288, 373, 380, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2243 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2419 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-11
Product exploration explored 100000 steps with 3985 reset in 2209 ms.
Stack based approach found an accepted trace after 133 steps with 3 reset with depth 38 and stack size 38 in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-11 finished in 4803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((p1||X(((p1 U !p2) U (p1&&(p1 U !p2)))))))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 497 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:32:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:32:55] [INFO ] Invariant cache hit.
[2024-05-21 23:32:57] [INFO ] Implicit Places using invariants in 2103 ms returned [218, 245, 275, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2111 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 486 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3094 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-12
Product exploration explored 100000 steps with 989 reset in 2261 ms.
Stack based approach found an accepted trace after 170 steps with 3 reset with depth 23 and stack size 23 in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-12 finished in 5481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&F(p2))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 84 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:33:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:33:00] [INFO ] Invariant cache hit.
[2024-05-21 23:33:02] [INFO ] Implicit Places using invariants in 2173 ms returned [260, 275, 288, 373, 380, 403, 406]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2181 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2354 ms. Remains : 402/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-13 finished in 2604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(p1)&&p0))||X(X(F(p2)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:33:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:33:03] [INFO ] Invariant cache hit.
[2024-05-21 23:33:05] [INFO ] Implicit Places using invariants in 2161 ms returned [218, 245, 260, 275, 288, 373, 380, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2169 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2345 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14
Product exploration explored 100000 steps with 18012 reset in 2230 ms.
Stack based approach found an accepted trace after 516 steps with 95 reset with depth 59 and stack size 59 in 12 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 4854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 87 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:33:08] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:33:08] [INFO ] Invariant cache hit.
[2024-05-21 23:33:10] [INFO ] Implicit Places using invariants in 2293 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2302 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 87 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2477 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 2206 ms.
Product exploration explored 100000 steps with 0 reset in 2332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 723 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1565 ms. (25 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
[2024-05-21 23:33:17] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 23:33:17] [INFO ] Computed 200 invariants in 6 ms
[2024-05-21 23:33:17] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 459 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
SMT process timed out in 5616ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 385 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1183 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 169175 steps, run timeout after 3002 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 169175 steps, saw 156126 distinct states, run finished after 3010 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-21 23:33:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:33:26] [INFO ] Invariant cache hit.
[2024-05-21 23:33:27] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 455 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 18/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 96/800 variables, 96/990 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/800 variables, 96/1086 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/800 variables, 96/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10250 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 78/78 constraints]
After SMT, in 10810ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 782 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 346 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 352 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:33:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:33:39] [INFO ] Invariant cache hit.
[2024-05-21 23:33:40] [INFO ] Implicit Places using invariants in 1530 ms returned []
Implicit Place search using SMT only with invariants took 1536 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:33:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:33:40] [INFO ] Invariant cache hit.
[2024-05-21 23:33:40] [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 48949ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50985 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 35 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-21 23:34:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 23:34:29] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:34:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 23:34:30] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 23:34:30] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 23:34:30] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 971 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 85 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:34:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 23:34:31] [INFO ] Computed 200 invariants in 5 ms
[2024-05-21 23:34:32] [INFO ] Implicit Places using invariants in 1504 ms returned []
Implicit Place search using SMT only with invariants took 1506 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:34:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:34:33] [INFO ] Invariant cache hit.
[2024-05-21 23:34:33] [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 48773ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 48869ms
Finished structural reductions in LTL mode , in 1 iterations and 50492 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 631 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1442 ms. (27 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
[2024-05-21 23:35:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:35:23] [INFO ] Invariant cache hit.
[2024-05-21 23:35:23] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 361 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
SMT process timed out in 5475ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 365 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 992 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 256540 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 256540 steps, saw 235693 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-21 23:35:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:35:32] [INFO ] Invariant cache hit.
[2024-05-21 23:35:32] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 352 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11340 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11754ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 335 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 386 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 366 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:35:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:35:45] [INFO ] Invariant cache hit.
[2024-05-21 23:35:46] [INFO ] Implicit Places using invariants in 1548 ms returned []
Implicit Place search using SMT only with invariants took 1555 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:35:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:35:47] [INFO ] Invariant cache hit.
[2024-05-21 23:35:47] [INFO ] State equation strengthened by 100 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 50531ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 50654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52606 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 12 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-21 23:36:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 23:36:37] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:36:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-21 23:36:37] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 23:36:37] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 23:36:37] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 140 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 926 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2211 ms.
Product exploration explored 100000 steps with 0 reset in 2336 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 599 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:36:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 23:36:44] [INFO ] Computed 200 invariants in 2 ms
[2024-05-21 23:36:44] [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 51101ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 51186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51808 ms. Remains : 400/400 places, 10200/10200 transitions.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 102 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:37:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:37:36] [INFO ] Invariant cache hit.
[2024-05-21 23:37:37] [INFO ] Implicit Places using invariants in 1569 ms returned []
Implicit Place search using SMT only with invariants took 1575 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:37:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:37:37] [INFO ] Invariant cache hit.
[2024-05-21 23:37:37] [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 51242ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 51328ms
Finished structural reductions in LTL mode , in 1 iterations and 53028 ms. Remains : 400/400 places, 10200/10200 transitions.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 321473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Found a Lengthening insensitive property : Dekker-PT-100-LTLCardinality-15
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 212 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:38:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-21 23:38:30] [INFO ] Computed 209 invariants in 4 ms
[2024-05-21 23:38:32] [INFO ] Implicit Places using invariants in 2104 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2114 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 187 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2517 ms. Remains : 400/409 places, 10200/10200 transitions.
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 2245 ms.
Product exploration explored 100000 steps with 0 reset in 2258 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 764 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1127 ms. (35 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2024-05-21 23:38:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 23:38:38] [INFO ] Computed 200 invariants in 2 ms
[2024-05-21 23:38:38] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 355 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 2/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
SMT process timed out in 5501ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 360 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1664 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 335017 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 335017 steps, saw 307345 distinct states, run finished after 3005 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-21 23:38:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:38:47] [INFO ] Invariant cache hit.
[2024-05-21 23:38:47] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11220 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11664ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 295 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 330 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 330 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:39:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:39:00] [INFO ] Invariant cache hit.
[2024-05-21 23:39:01] [INFO ] Implicit Places using invariants in 1440 ms returned []
Implicit Place search using SMT only with invariants took 1446 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:39:01] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:39:01] [INFO ] Invariant cache hit.
[2024-05-21 23:39:02] [INFO ] State equation strengthened by 100 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)timeout

(s362 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 49016ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50896 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 10 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-21 23:39:50] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 23:39:51] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:39:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 23:39:51] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 23:39:51] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 23:39:51] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 81 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 993 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:39:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 23:39:52] [INFO ] Computed 200 invariants in 3 ms
[2024-05-21 23:39:54] [INFO ] Implicit Places using invariants in 1521 ms returned []
Implicit Place search using SMT only with invariants took 1521 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:39:54] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:39:54] [INFO ] Invariant cache hit.
[2024-05-21 23:39:54] [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 50377ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 50480ms
Finished structural reductions in LTL mode , in 1 iterations and 52117 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 737 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 963 ms. (41 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
[2024-05-21 23:40:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:40:45] [INFO ] Invariant cache hit.
[2024-05-21 23:40:46] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 461 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/800 variables, and 844 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Domain max(s): 304/400 constraints, Positive P Invariants (semi-flows): 104/200 constraints, State Equation: 304/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 28/28 constraints]
After SMT, in 5539ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 351 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1099 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2024-05-21 23:40:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:40:52] [INFO ] Invariant cache hit.
[2024-05-21 23:40:52] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 373 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11356 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11794ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 341 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 356 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 987 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 254621 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 254621 steps, saw 233942 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 23:41:08] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:41:08] [INFO ] Invariant cache hit.
[2024-05-21 23:41:08] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11280 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 11710ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 373 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 355 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:41:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:41:20] [INFO ] Invariant cache hit.
[2024-05-21 23:41:22] [INFO ] Implicit Places using invariants in 1507 ms returned []
Implicit Place search using SMT only with invariants took 1508 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:41:22] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:41:22] [INFO ] Invariant cache hit.
[2024-05-21 23:41:22] [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 50764ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 50865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52752 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 9 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-21 23:42:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 23:42:13] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:42:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 23:42:13] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 23:42:13] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 23:42:13] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 74 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 1038 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2270 ms.
Product exploration explored 100000 steps with 0 reset in 2399 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 449 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:42:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 23:42:20] [INFO ] Computed 200 invariants in 5 ms
[2024-05-21 23:42:20] [INFO ] State equation strengthened by 100 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49772ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49859ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50324 ms. Remains : 400/400 places, 10200/10200 transitions.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 85 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:43:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:43:10] [INFO ] Invariant cache hit.
[2024-05-21 23:43:11] [INFO ] Implicit Places using invariants in 1465 ms returned []
Implicit Place search using SMT only with invariants took 1469 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-21 23:43:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-21 23:43:11] [INFO ] Invariant cache hit.
[2024-05-21 23:43:11] [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 49058ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49142ms
Finished structural reductions in LTL mode , in 1 iterations and 50715 ms. Remains : 400/400 places, 10200/10200 transitions.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 331749 ms.
[2024-05-21 23:44:01] [INFO ] Flatten gal took : 390 ms
[2024-05-21 23:44:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 23:44:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 409 places, 10200 transitions and 71009 arcs took 59 ms.
Total runtime 733455 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 409
TRANSITIONS: 10200
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.328s, Sys 0.025s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.042s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3606
MODEL NAME: /home/mcc/execution/410/model
409 places, 10200 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Dekker-PT-100-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716335076763

--------------------
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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Dekker-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631130400115"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;