Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097600395.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097600395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 5.9M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620578059151

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 16:34:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-09 16:34:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:34:21] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2021-05-09 16:34:21] [INFO ] Transformed 500 places.
[2021-05-09 16:34:21] [INFO ] Transformed 10200 transitions.
[2021-05-09 16:34:21] [INFO ] Found NUPN structural information;
[2021-05-09 16:34:21] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 487 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 80 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 302 ms. (steps per millisecond=33 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 1, 0]
FORMULA Dekker-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0]
[2021-05-09 16:34:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2021-05-09 16:34:21] [INFO ] Computed 300 place invariants in 29 ms
[2021-05-09 16:34:22] [INFO ] [Real]Absence check using 200 positive place invariants in 85 ms returned sat
[2021-05-09 16:34:22] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 45 ms returned sat
[2021-05-09 16:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:22] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2021-05-09 16:34:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:34:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 76 ms returned sat
[2021-05-09 16:34:22] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:23] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-09 16:34:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-09 16:34:23] [INFO ] [Nat]Added 100 Read/Feed constraints in 53 ms returned sat
[2021-05-09 16:34:23] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2021-05-09 16:34:23] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 5 places in 84 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2021-05-09 16:34:24] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 5 places in 61 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:25] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:26] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2838 ms
[2021-05-09 16:34:26] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 189 ms.
[2021-05-09 16:34:27] [INFO ] Added : 85 causal constraints over 17 iterations in 1287 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-09 16:34:27] [INFO ] [Real]Absence check using 200 positive place invariants in 71 ms returned sat
[2021-05-09 16:34:27] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 42 ms returned sat
[2021-05-09 16:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:28] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2021-05-09 16:34:28] [INFO ] [Real]Added 100 Read/Feed constraints in 33 ms returned sat
[2021-05-09 16:34:28] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2021-05-09 16:34:28] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:34:28] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2021-05-09 16:34:28] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:29] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:30] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:34:31] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:34:31] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 2897 ms
[2021-05-09 16:34:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:34:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2021-05-09 16:34:31] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 39 ms returned sat
[2021-05-09 16:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:32] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2021-05-09 16:34:32] [INFO ] [Nat]Added 100 Read/Feed constraints in 31 ms returned sat
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2021-05-09 16:34:32] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:33] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 16:34:34] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:34] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 2766 ms
[2021-05-09 16:34:35] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 144 ms.
[2021-05-09 16:34:36] [INFO ] Added : 100 causal constraints over 20 iterations in 1503 ms. Result :(error "Failed to check-sat")
[2021-05-09 16:34:36] [INFO ] [Real]Absence check using 200 positive place invariants in 70 ms returned sat
[2021-05-09 16:34:36] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:37] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2021-05-09 16:34:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:34:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 68 ms returned sat
[2021-05-09 16:34:37] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 40 ms returned sat
[2021-05-09 16:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:37] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2021-05-09 16:34:37] [INFO ] [Nat]Added 100 Read/Feed constraints in 31 ms returned sat
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2021-05-09 16:34:38] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:34:39] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:34:39] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1865 ms
[2021-05-09 16:34:39] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 136 ms.
[2021-05-09 16:34:41] [INFO ] Added : 101 causal constraints over 21 iterations in 1609 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 58 ms.
[2021-05-09 16:34:41] [INFO ] [Real]Absence check using 200 positive place invariants in 72 ms returned sat
[2021-05-09 16:34:41] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 40 ms returned sat
[2021-05-09 16:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:42] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2021-05-09 16:34:42] [INFO ] [Real]Added 100 Read/Feed constraints in 51 ms returned sat
[2021-05-09 16:34:42] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2021-05-09 16:34:42] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2021-05-09 16:34:42] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2021-05-09 16:34:42] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:34:42] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2021-05-09 16:34:43] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 45 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 52 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 50 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2021-05-09 16:34:44] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 5 places in 52 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 5 places in 45 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:34:45] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:45] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 3120 ms
[2021-05-09 16:34:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:34:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 71 ms returned sat
[2021-05-09 16:34:45] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:46] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2021-05-09 16:34:46] [INFO ] [Nat]Added 100 Read/Feed constraints in 50 ms returned sat
[2021-05-09 16:34:46] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2021-05-09 16:34:46] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2021-05-09 16:34:46] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2021-05-09 16:34:46] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:34:46] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:34:46] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:47] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 5 places in 48 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 5 places in 45 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:34:48] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 5 places in 49 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:49] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 40 trap constraints in 3274 ms
[2021-05-09 16:34:49] [INFO ] [Real]Absence check using 200 positive place invariants in 73 ms returned sat
[2021-05-09 16:34:49] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:50] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2021-05-09 16:34:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:34:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 70 ms returned sat
[2021-05-09 16:34:50] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 39 ms returned sat
[2021-05-09 16:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:34:50] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2021-05-09 16:34:50] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 6 places in 51 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:34:51] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 6 places in 51 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:34:52] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:34:53] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 2102 ms
[2021-05-09 16:34:53] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 164 ms.
[2021-05-09 16:34:54] [INFO ] Added : 101 causal constraints over 21 iterations in 1648 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 23100 steps, including 98 resets, run finished after 1301 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23100 steps, including 98 resets, run finished after 1208 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 863 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 19408 ms. (steps per millisecond=51 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3911 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3587 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3647 ms. (steps per millisecond=274 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3796 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 4498762 steps, run timeout after 30001 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 4498762 steps, saw 25386 distinct states, run finished after 30002 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0]
[2021-05-09 16:36:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2021-05-09 16:36:02] [INFO ] Computed 300 place invariants in 9 ms
[2021-05-09 16:36:02] [INFO ] [Real]Absence check using 200 positive place invariants in 75 ms returned sat
[2021-05-09 16:36:02] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 42 ms returned sat
[2021-05-09 16:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:03] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2021-05-09 16:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:36:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 70 ms returned sat
[2021-05-09 16:36:03] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:04] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2021-05-09 16:36:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-09 16:36:04] [INFO ] [Nat]Added 100 Read/Feed constraints in 53 ms returned sat
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2021-05-09 16:36:04] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 5 places in 53 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2021-05-09 16:36:05] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 6 places in 36 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:36:06] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:36:06] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2620 ms
[2021-05-09 16:36:06] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 147 ms.
[2021-05-09 16:36:08] [INFO ] Added : 101 causal constraints over 21 iterations in 1619 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2021-05-09 16:36:08] [INFO ] [Real]Absence check using 200 positive place invariants in 71 ms returned sat
[2021-05-09 16:36:08] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 39 ms returned sat
[2021-05-09 16:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:09] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2021-05-09 16:36:09] [INFO ] [Real]Added 100 Read/Feed constraints in 32 ms returned sat
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2021-05-09 16:36:09] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:10] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:36:11] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:36:12] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:36:12] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 2842 ms
[2021-05-09 16:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:36:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2021-05-09 16:36:12] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:12] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2021-05-09 16:36:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 31 ms returned sat
[2021-05-09 16:36:12] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:13] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:14] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:36:15] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:36:15] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 2767 ms
[2021-05-09 16:36:15] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 135 ms.
[2021-05-09 16:36:17] [INFO ] Added : 101 causal constraints over 21 iterations in 1623 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-09 16:36:17] [INFO ] [Real]Absence check using 200 positive place invariants in 95 ms returned sat
[2021-05-09 16:36:17] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 42 ms returned sat
[2021-05-09 16:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:18] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2021-05-09 16:36:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:36:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2021-05-09 16:36:18] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:18] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2021-05-09 16:36:18] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2021-05-09 16:36:18] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:19] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:36:20] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:36:20] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1902 ms
[2021-05-09 16:36:20] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 130 ms.
[2021-05-09 16:36:22] [INFO ] Added : 101 causal constraints over 21 iterations in 1569 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-09 16:36:22] [INFO ] [Real]Absence check using 200 positive place invariants in 73 ms returned sat
[2021-05-09 16:36:22] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2021-05-09 16:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:23] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2021-05-09 16:36:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:36:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2021-05-09 16:36:23] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 39 ms returned sat
[2021-05-09 16:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:36:23] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2021-05-09 16:36:23] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:36:24] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 6 places in 52 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:36:25] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:36:26] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 2098 ms
[2021-05-09 16:36:26] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 135 ms.
[2021-05-09 16:36:27] [INFO ] Added : 101 causal constraints over 21 iterations in 1596 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
Incomplete Parikh walk after 23100 steps, including 98 resets, run finished after 1260 ms. (steps per millisecond=18 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23100 steps, including 98 resets, run finished after 1184 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23200 steps, including 98 resets, run finished after 1191 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23200 steps, including 98 resets, run finished after 1189 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 558 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 381 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2021-05-09 16:36:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2021-05-09 16:36:33] [INFO ] Computed 300 place invariants in 10 ms
[2021-05-09 16:36:40] [INFO ] Implicit Places using invariants in 6879 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 398, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 98 places :
Implicit Place search using SMT only with invariants took 6890 ms to find 98 implicit places.
[2021-05-09 16:36:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2021-05-09 16:36:40] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-09 16:36:51] [INFO ] Dead Transitions using invariants and state equation in 11324 ms returned []
Starting structural reductions, iteration 1 : 402/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 345 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2021-05-09 16:36:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2021-05-09 16:36:52] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-09 16:37:03] [INFO ] Dead Transitions using invariants and state equation in 11260 ms returned []
Finished structural reductions, in 2 iterations. Remains : 402/500 places, 10200/10200 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 20415 ms. (steps per millisecond=48 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3428 ms. (steps per millisecond=291 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3126 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3198 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3271 ms. (steps per millisecond=305 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 6228062 steps, run timeout after 30001 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 6228062 steps, saw 33066 distinct states, run finished after 30001 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0]
[2021-05-09 16:38:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2021-05-09 16:38:06] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-09 16:38:06] [INFO ] [Real]Absence check using 200 positive place invariants in 67 ms returned sat
[2021-05-09 16:38:06] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:07] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-09 16:38:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:38:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 64 ms returned sat
[2021-05-09 16:38:07] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:07] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2021-05-09 16:38:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-09 16:38:07] [INFO ] [Nat]Added 100 Read/Feed constraints in 53 ms returned sat
[2021-05-09 16:38:07] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2021-05-09 16:38:08] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 6 places in 127 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2021-05-09 16:38:09] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:10] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:38:10] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 2916 ms
[2021-05-09 16:38:10] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 142 ms.
[2021-05-09 16:38:12] [INFO ] Added : 101 causal constraints over 21 iterations in 1576 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2021-05-09 16:38:12] [INFO ] [Real]Absence check using 200 positive place invariants in 63 ms returned sat
[2021-05-09 16:38:12] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:12] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2021-05-09 16:38:12] [INFO ] [Real]Added 100 Read/Feed constraints in 32 ms returned sat
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:38:13] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:38:14] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:38:15] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:38:16] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:38:16] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 3423 ms
[2021-05-09 16:38:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:38:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 62 ms returned sat
[2021-05-09 16:38:16] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:16] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2021-05-09 16:38:16] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:38:17] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:38:18] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:19] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:20] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:38:20] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:20] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:20] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:38:20] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:38:20] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:38:20] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 3370 ms
[2021-05-09 16:38:20] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 131 ms.
[2021-05-09 16:38:21] [INFO ] Added : 101 causal constraints over 21 iterations in 1552 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2021-05-09 16:38:22] [INFO ] [Real]Absence check using 200 positive place invariants in 63 ms returned sat
[2021-05-09 16:38:22] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:22] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2021-05-09 16:38:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:38:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 61 ms returned sat
[2021-05-09 16:38:22] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-09 16:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:22] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2021-05-09 16:38:22] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2021-05-09 16:38:23] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-09 16:38:24] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:38:25] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:38:26] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 3679 ms
[2021-05-09 16:38:26] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 134 ms.
[2021-05-09 16:38:28] [INFO ] Added : 101 causal constraints over 21 iterations in 1574 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-09 16:38:28] [INFO ] [Real]Absence check using 200 positive place invariants in 66 ms returned sat
[2021-05-09 16:38:28] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:28] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2021-05-09 16:38:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:38:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2021-05-09 16:38:28] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:29] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2021-05-09 16:38:29] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2021-05-09 16:38:29] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2021-05-09 16:38:29] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2021-05-09 16:38:29] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2021-05-09 16:38:29] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2021-05-09 16:38:29] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:38:29] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:30] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:31] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:38:32] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:38:32] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 2846 ms
[2021-05-09 16:38:32] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 134 ms.
[2021-05-09 16:38:33] [INFO ] Added : 101 causal constraints over 21 iterations in 1547 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
Incomplete Parikh walk after 24300 steps, including 98 resets, run finished after 1277 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24100 steps, including 98 resets, run finished after 1281 ms. (steps per millisecond=18 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24300 steps, including 98 resets, run finished after 1290 ms. (steps per millisecond=18 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24400 steps, including 98 resets, run finished after 1198 ms. (steps per millisecond=20 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 402 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 402/402 places, 10200/10200 transitions.
Applied a total of 0 rules in 338 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 10200/10200 transitions.
Starting structural reductions, iteration 0 : 402/402 places, 10200/10200 transitions.
Applied a total of 0 rules in 322 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2021-05-09 16:38:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2021-05-09 16:38:39] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-09 16:38:40] [INFO ] Implicit Places using invariants in 1488 ms returned []
Implicit Place search using SMT only with invariants took 1488 ms to find 0 implicit places.
[2021-05-09 16:38:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2021-05-09 16:38:40] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-09 16:38:52] [INFO ] Dead Transitions using invariants and state equation in 11310 ms returned []
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 10200/10200 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2062 ms. (steps per millisecond=48 ) properties seen :[0, 0, 0, 0]
[2021-05-09 16:38:54] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2021-05-09 16:38:54] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-09 16:38:54] [INFO ] [Real]Absence check using 200 positive place invariants in 68 ms returned sat
[2021-05-09 16:38:54] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:54] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2021-05-09 16:38:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:38:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2021-05-09 16:38:54] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:38:55] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2021-05-09 16:38:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-09 16:38:55] [INFO ] [Nat]Added 100 Read/Feed constraints in 53 ms returned sat
[2021-05-09 16:38:55] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2021-05-09 16:38:55] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2021-05-09 16:38:55] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2021-05-09 16:38:55] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2021-05-09 16:38:55] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2021-05-09 16:38:56] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:38:57] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:38:58] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:38:58] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-09 16:38:58] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:38:58] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:38:58] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:38:58] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 2859 ms
[2021-05-09 16:38:58] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 131 ms.
[2021-05-09 16:38:59] [INFO ] Added : 101 causal constraints over 21 iterations in 1565 ms. Result :sat
[2021-05-09 16:38:59] [INFO ] [Real]Absence check using 200 positive place invariants in 64 ms returned sat
[2021-05-09 16:38:59] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:00] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2021-05-09 16:39:00] [INFO ] [Real]Added 100 Read/Feed constraints in 34 ms returned sat
[2021-05-09 16:39:00] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2021-05-09 16:39:00] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2021-05-09 16:39:00] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2021-05-09 16:39:00] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2021-05-09 16:39:00] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:39:01] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:02] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:39:03] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:39:03] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 3428 ms
[2021-05-09 16:39:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:39:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2021-05-09 16:39:03] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:04] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2021-05-09 16:39:04] [INFO ] [Nat]Added 100 Read/Feed constraints in 33 ms returned sat
[2021-05-09 16:39:04] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2021-05-09 16:39:04] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2021-05-09 16:39:04] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2021-05-09 16:39:04] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2021-05-09 16:39:04] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:39:05] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:39:06] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:39:07] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:39:07] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 3359 ms
[2021-05-09 16:39:07] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 133 ms.
[2021-05-09 16:39:09] [INFO ] Added : 101 causal constraints over 21 iterations in 1575 ms. Result :sat
[2021-05-09 16:39:09] [INFO ] [Real]Absence check using 200 positive place invariants in 63 ms returned sat
[2021-05-09 16:39:09] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:09] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2021-05-09 16:39:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:39:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 62 ms returned sat
[2021-05-09 16:39:09] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:10] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2021-05-09 16:39:10] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2021-05-09 16:39:10] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2021-05-09 16:39:10] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2021-05-09 16:39:10] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2021-05-09 16:39:10] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2021-05-09 16:39:10] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:39:10] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2021-05-09 16:39:11] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:39:12] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:39:13] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:39:13] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 3697 ms
[2021-05-09 16:39:14] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 135 ms.
[2021-05-09 16:39:15] [INFO ] Added : 101 causal constraints over 21 iterations in 1558 ms. Result :sat
[2021-05-09 16:39:15] [INFO ] [Real]Absence check using 200 positive place invariants in 65 ms returned sat
[2021-05-09 16:39:15] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-09 16:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:15] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2021-05-09 16:39:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:39:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 62 ms returned sat
[2021-05-09 16:39:16] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 16:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:16] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2021-05-09 16:39:16] [INFO ] [Nat]Added 100 Read/Feed constraints in 31 ms returned sat
[2021-05-09 16:39:16] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2021-05-09 16:39:16] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2021-05-09 16:39:16] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2021-05-09 16:39:16] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2021-05-09 16:39:17] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:39:18] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2021-05-09 16:39:19] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2021-05-09 16:39:19] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-09 16:39:19] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:39:19] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:39:19] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:39:19] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 2812 ms
[2021-05-09 16:39:19] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 131 ms.
[2021-05-09 16:39:20] [INFO ] Added : 101 causal constraints over 21 iterations in 1570 ms. Result :sat
Discarding 344 places :
Also discarding 8772 output transitions
Drop transitions removed 8772 transitions
Graph (complete) has 610 edges and 402 vertex of which 58 are kept as prefixes of interest. Removing 344 places using SCC suffix rule.18 ms
Ensure Unique test removed 2 places
Ensure Unique test removed 1372 transitions
Reduce isomorphic transitions removed 1372 transitions.
Iterating post reduction 0 with 1374 rules applied. Total rules applied 1375 place count 56 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1387 place count 48 transition count 52
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1391 place count 48 transition count 48
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 1398 place count 48 transition count 41
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 1419 place count 34 transition count 34
Applied a total of 1419 rules in 39 ms. Remains 34 /402 variables (removed 368) and now considering 34/10200 (removed 10166) transitions.
// Phase 1: matrix 34 rows 34 cols
[2021-05-09 16:39:20] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-09 16:39:20] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 16:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 16:39:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:39:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 16:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 16:39:20] [INFO ] Computed and/alt/rep : 20/26/20 causal constraints in 2 ms.
[2021-05-09 16:39:20] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-09 16:39:20] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2021-05-09 16:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 16:39:21] [INFO ] Computed and/alt/rep : 20/26/20 causal constraints in 1 ms.
[2021-05-09 16:39:21] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-09 16:39:21] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2021-05-09 16:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 16:39:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:39:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 16:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 16:39:21] [INFO ] Computed and/alt/rep : 20/26/20 causal constraints in 2 ms.
[2021-05-09 16:39:21] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-09 16:39:21] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2021-05-09 16:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 16:39:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:39:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 16:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:39:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 16:39:21] [INFO ] Computed and/alt/rep : 20/26/20 causal constraints in 1 ms.
[2021-05-09 16:39:21] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-09 16:39:21] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-09 16:39:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 84 ms.
[2021-05-09 16:39:22] [INFO ] Flatten gal took : 648 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Dekker-PT-100 @ 3570 seconds

FORMULA Dekker-PT-100-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3544
rslt: Output for ReachabilityCardinality @ Dekker-PT-100

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 9 16:39:23 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p321))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p261 <= 0)) OR ((1 <= p135)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p361)) AND ((p209 <= 0)) AND ((1 <= p3)) AND ((p148 <= 0)) AND (1 <= p0))))",
"processed_size": 89,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3553
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 3,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G ((((p360 <= 0)) OR ((1 <= p387)) OR ((p351 <= 0)) OR ((1 <= p335)) OR ((p182 <= 0)) OR ((1 <= p330)) OR ((1 <= p340) AND (((p10 <= 0)) OR ((1 <= p135))) AND (((p147 <= 0)) OR ((1 <= p0)))))))",
"processed_size": 204,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 23,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 362464,
"runtime": 26.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 70302,
"conflict_clusters": 1,
"places": 402,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 10200
},
"result":
{
"preliminary_value": "no yes no yes ",
"value": "no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 10602/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 402
lola: finding significant places
lola: 402 places, 10200 transitions, 200 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p330 <= 1)
lola: LP says that atomic proposition is always true: (p340 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: A (G ((((p360 <= 0)) OR ((1 <= p387)) OR ((p351 <= 0)) OR ((1 <= p335)) OR ((p182 <= 0)) OR ((1 <= p330)) OR ((1 <= p340) AND (((p10 <= 0)) OR ((1 <= p135))) AND (((p147 <= 0)) OR ((1 <= p0))))))) : E (F (((1 <= p321)))) : A (G ((((p261 <= 0)) OR ((1 <= p135))))) : E (F ((((1 <= p361)) AND ((p209 <= 0)) AND ((1 <= p3)) AND ((p148 <= 0)) AND (1 <= p0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p321))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p321))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p321))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p261 <= 0)) OR ((1 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p261 <= 0)) OR ((1 <= p135)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p261)) AND ((p135 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p361)) AND ((p209 <= 0)) AND ((1 <= p3)) AND ((p148 <= 0)) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p361)) AND ((p209 <= 0)) AND ((1 <= p3)) AND ((p148 <= 0)) AND (1 <= p0))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p361)) AND ((p209 <= 0)) AND ((1 <= p3)) AND ((p148 <= 0)) AND (1 <= p0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: sara is running 0 secs || 65601 markings, 580680 edges, 13120 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p360 <= 0)) OR ((1 <= p387)) OR ((p351 <= 0)) OR ((1 <= p335)) OR ((p182 <= 0)) OR ((1 <= p330)) OR ((1 <= p340) AND (((p10 <= 0)) OR ((1 <= p135))) AND (((p147 <= 0)) OR ((1 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p360 <= 0)) OR ((1 <= p387)) OR ((p351 <= 0)) OR ((1 <= p335)) OR ((p182 <= 0)) OR ((1 <= p330)) OR ((1 <= p340) AND (((p10 <= 0)) OR ((1 <= p135))) AND (((p147 <= 0)) OR ((1 <= p0)))))))
lola: processed formula length: 204
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p360)) AND ((p387 <= 0)) AND ((1 <= p351)) AND ((p335 <= 0)) AND ((1 <= p182)) AND ((p330 <= 0)) AND ((p340 <= 0) OR (((1 <= p10)) AND ((p135 <= 0))) OR (((1 <= p147)) AND ((p0 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 23 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
lola: sara is running 0 secs || 65287 markings, 613350 edges, 13057 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes
lola:
preliminary result: no yes no yes
lola: memory consumption: 362464 KB
lola: time consumption: 26 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is Dekker-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097600395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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