Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900000295.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DES-PT-40a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 83K Mar 24 05:37 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 DES-PT-40a-ReachabilityFireability-00
FORMULA_NAME DES-PT-40a-ReachabilityFireability-01
FORMULA_NAME DES-PT-40a-ReachabilityFireability-02
FORMULA_NAME DES-PT-40a-ReachabilityFireability-03
FORMULA_NAME DES-PT-40a-ReachabilityFireability-04
FORMULA_NAME DES-PT-40a-ReachabilityFireability-05
FORMULA_NAME DES-PT-40a-ReachabilityFireability-06
FORMULA_NAME DES-PT-40a-ReachabilityFireability-07
FORMULA_NAME DES-PT-40a-ReachabilityFireability-08
FORMULA_NAME DES-PT-40a-ReachabilityFireability-09
FORMULA_NAME DES-PT-40a-ReachabilityFireability-10
FORMULA_NAME DES-PT-40a-ReachabilityFireability-11
FORMULA_NAME DES-PT-40a-ReachabilityFireability-12
FORMULA_NAME DES-PT-40a-ReachabilityFireability-13
FORMULA_NAME DES-PT-40a-ReachabilityFireability-14
FORMULA_NAME DES-PT-40a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591192073829

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 13:47:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 13:47:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 13:47:57] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2020-06-03 13:47:57] [INFO ] Transformed 274 places.
[2020-06-03 13:47:57] [INFO ] Transformed 231 transitions.
[2020-06-03 13:47:57] [INFO ] Found NUPN structural information;
[2020-06-03 13:47:57] [INFO ] Parsed PT model containing 274 places and 231 transitions in 212 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 214 resets, run finished after 199 ms. (steps per millisecond=50 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA DES-PT-40a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DES-PT-40a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 217 rows 274 cols
[2020-06-03 13:47:58] [INFO ] Computed 59 place invariants in 42 ms
[2020-06-03 13:47:58] [INFO ] [Real]Absence check using 34 positive place invariants in 54 ms returned sat
[2020-06-03 13:47:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 13:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:47:58] [INFO ] [Real]Absence check using state equation in 114 ms returned unsat
[2020-06-03 13:47:58] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 13:47:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 67 ms returned sat
[2020-06-03 13:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:47:59] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2020-06-03 13:47:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 13:48:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2020-06-03 13:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:01] [INFO ] [Nat]Absence check using state equation in 876 ms returned sat
[2020-06-03 13:48:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 13:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 13:48:01] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 36 ms.
[2020-06-03 13:48:03] [INFO ] Added : 190 causal constraints over 38 iterations in 2303 ms. Result :sat
[2020-06-03 13:48:03] [INFO ] Deduced a trap composed of 18 places in 111 ms
[2020-06-03 13:48:03] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 13:48:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 13:48:04] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 13:48:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 13:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:04] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2020-06-03 13:48:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 13:48:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2020-06-03 13:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:05] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2020-06-03 13:48:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 13:48:05] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 31 ms.
[2020-06-03 13:48:07] [INFO ] Added : 172 causal constraints over 35 iterations in 1651 ms. Result :sat
[2020-06-03 13:48:07] [INFO ] Deduced a trap composed of 19 places in 162 ms
[2020-06-03 13:48:07] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-06-03 13:48:08] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-06-03 13:48:08] [INFO ] Deduced a trap composed of 9 places in 159 ms
[2020-06-03 13:48:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1170 ms
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-06-03 13:48:08] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 13:48:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-06-03 13:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:09] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2020-06-03 13:48:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 13:48:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 13:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:10] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2020-06-03 13:48:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 13:48:10] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-06-03 13:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2020-06-03 13:48:10] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 47 ms.
[2020-06-03 13:48:11] [INFO ] Added : 158 causal constraints over 32 iterations in 1714 ms. Result :sat
[2020-06-03 13:48:12] [INFO ] Deduced a trap composed of 17 places in 146 ms
[2020-06-03 13:48:12] [INFO ] Deduced a trap composed of 11 places in 102 ms
[2020-06-03 13:48:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-03 13:48:12] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 13:48:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 13:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:13] [INFO ] [Real]Absence check using state equation in 1360 ms returned sat
[2020-06-03 13:48:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 13:48:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 163 ms returned sat
[2020-06-03 13:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:16] [INFO ] [Nat]Absence check using state equation in 1779 ms returned sat
[2020-06-03 13:48:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2020-06-03 13:48:16] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 41 ms.
[2020-06-03 13:48:18] [INFO ] Added : 137 causal constraints over 28 iterations in 2140 ms. Result :sat
[2020-06-03 13:48:18] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-06-03 13:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 13:48:18] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-06-03 13:48:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 13:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:19] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2020-06-03 13:48:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 13:48:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 86 ms returned sat
[2020-06-03 13:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:21] [INFO ] [Nat]Absence check using state equation in 1017 ms returned sat
[2020-06-03 13:48:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 13:48:21] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 41 ms.
[2020-06-03 13:48:23] [INFO ] Added : 173 causal constraints over 35 iterations in 2391 ms. Result :sat
[2020-06-03 13:48:23] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 13:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 13:48:24] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 13:48:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2020-06-03 13:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:24] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2020-06-03 13:48:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 13:48:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 13:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:25] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2020-06-03 13:48:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 13:48:25] [INFO ] Deduced a trap composed of 10 places in 139 ms
[2020-06-03 13:48:25] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-06-03 13:48:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2020-06-03 13:48:25] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 23 ms.
[2020-06-03 13:48:27] [INFO ] Added : 79 causal constraints over 17 iterations in 1380 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 13:48:27] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 13:48:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 13:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:27] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2020-06-03 13:48:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 13:48:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 13:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:28] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2020-06-03 13:48:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 13:48:28] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 33 ms.
[2020-06-03 13:48:30] [INFO ] Added : 152 causal constraints over 31 iterations in 1725 ms. Result :sat
[2020-06-03 13:48:30] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-06-03 13:48:30] [INFO ] Deduced a trap composed of 9 places in 98 ms
[2020-06-03 13:48:31] [INFO ] Deduced a trap composed of 19 places in 81 ms
[2020-06-03 13:48:31] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-06-03 13:48:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 692 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 13:48:31] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 13:48:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 13:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:33] [INFO ] [Real]Absence check using state equation in 2143 ms returned sat
[2020-06-03 13:48:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 13:48:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 80 ms returned sat
[2020-06-03 13:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:34] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2020-06-03 13:48:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 13:48:34] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 30 ms.
[2020-06-03 13:48:36] [INFO ] Added : 91 causal constraints over 19 iterations in 1285 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 13:48:36] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-06-03 13:48:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 13:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:37] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2020-06-03 13:48:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:48:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-06-03 13:48:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 170 ms returned sat
[2020-06-03 13:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:48:38] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2020-06-03 13:48:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 13:48:38] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-06-03 13:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2020-06-03 13:48:38] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 25 ms.
[2020-06-03 13:48:40] [INFO ] Added : 83 causal constraints over 17 iterations in 1220 ms. Result :sat
[2020-06-03 13:48:40] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2020-06-03 13:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
FORMULA DES-PT-40a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 36000 steps, including 756 resets, run finished after 267 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 54500 steps, including 1034 resets, run finished after 299 ms. (steps per millisecond=182 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 125200 steps, including 2994 resets, run finished after 625 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 46900 steps, including 890 resets, run finished after 235 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 152600 steps, including 3563 resets, run finished after 754 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 110200 steps, including 2832 resets, run finished after 586 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 135500 steps, including 3185 resets, run finished after 675 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 209400 steps, including 5105 resets, run finished after 1088 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 174400 steps, including 4503 resets, run finished after 853 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 48 out of 274 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 274 transition count 215
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 273 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 273 transition count 214
Applied a total of 8 rules in 142 ms. Remains 273 /274 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/274 places, 214/217 transitions.
Incomplete random walk after 1000000 steps, including 14680 resets, run finished after 4906 ms. (steps per millisecond=203 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3152 resets, run finished after 2444 ms. (steps per millisecond=409 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6040 resets, run finished after 2351 ms. (steps per millisecond=425 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6423 resets, run finished after 2219 ms. (steps per millisecond=450 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2609 resets, run finished after 2563 ms. (steps per millisecond=390 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5415 resets, run finished after 2450 ms. (steps per millisecond=408 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3319 resets, run finished after 2515 ms. (steps per millisecond=397 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6404 resets, run finished after 2278 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2819 resets, run finished after 3472 ms. (steps per millisecond=288 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3307 resets, run finished after 3002 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8513926 steps, run timeout after 30001 ms. (steps per millisecond=283 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8513926 steps, saw 1023388 distinct states, run finished after 30001 ms. (steps per millisecond=283 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 214 rows 273 cols
[2020-06-03 13:49:43] [INFO ] Computed 61 place invariants in 13 ms
[2020-06-03 13:49:44] [INFO ] [Real]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-06-03 13:49:44] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 13:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:45] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2020-06-03 13:49:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:49:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 13:49:45] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 84 ms returned sat
[2020-06-03 13:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:46] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2020-06-03 13:49:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 13:49:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2020-06-03 13:49:46] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2020-06-03 13:49:46] [INFO ] Deduced a trap composed of 18 places in 105 ms
[2020-06-03 13:49:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2020-06-03 13:49:46] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 34 ms.
[2020-06-03 13:49:48] [INFO ] Added : 159 causal constraints over 32 iterations in 1816 ms. Result :sat
[2020-06-03 13:49:48] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2020-06-03 13:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 13:49:48] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-06-03 13:49:48] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 13:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:49] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2020-06-03 13:49:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:49:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-06-03 13:49:50] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 109 ms returned sat
[2020-06-03 13:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:50] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2020-06-03 13:49:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2020-06-03 13:49:50] [INFO ] Deduced a trap composed of 7 places in 51 ms
[2020-06-03 13:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2020-06-03 13:49:50] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 28 ms.
[2020-06-03 13:49:52] [INFO ] Added : 171 causal constraints over 35 iterations in 1633 ms. Result :sat
[2020-06-03 13:49:52] [INFO ] Deduced a trap composed of 16 places in 119 ms
[2020-06-03 13:49:52] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-06-03 13:49:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 13:49:52] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-06-03 13:49:52] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 13:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:53] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2020-06-03 13:49:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:49:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 13:49:53] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 141 ms returned sat
[2020-06-03 13:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:54] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2020-06-03 13:49:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:49:54] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-06-03 13:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-06-03 13:49:55] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 25 ms.
[2020-06-03 13:49:56] [INFO ] Added : 164 causal constraints over 33 iterations in 1722 ms. Result :sat
[2020-06-03 13:49:56] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2020-06-03 13:49:57] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2020-06-03 13:49:57] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-06-03 13:49:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 580 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 13:49:57] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-06-03 13:49:57] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 13:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:58] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-06-03 13:49:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:49:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 42 ms returned sat
[2020-06-03 13:49:58] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 121 ms returned sat
[2020-06-03 13:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:49:59] [INFO ] [Nat]Absence check using state equation in 1157 ms returned sat
[2020-06-03 13:50:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 36 ms returned sat
[2020-06-03 13:50:00] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 32 ms.
[2020-06-03 13:50:02] [INFO ] Added : 165 causal constraints over 33 iterations in 2249 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 13:50:02] [INFO ] [Real]Absence check using 36 positive place invariants in 60 ms returned sat
[2020-06-03 13:50:02] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 13:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:04] [INFO ] [Real]Absence check using state equation in 1494 ms returned sat
[2020-06-03 13:50:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:50:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 13:50:04] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 121 ms returned sat
[2020-06-03 13:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:05] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2020-06-03 13:50:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2020-06-03 13:50:05] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 21 ms.
[2020-06-03 13:50:07] [INFO ] Added : 173 causal constraints over 35 iterations in 2043 ms. Result :sat
[2020-06-03 13:50:07] [INFO ] Deduced a trap composed of 7 places in 41 ms
[2020-06-03 13:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 13:50:07] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 13:50:07] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 13:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:07] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2020-06-03 13:50:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:50:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 13:50:08] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 75 ms returned sat
[2020-06-03 13:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:08] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2020-06-03 13:50:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:50:08] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 28 ms.
[2020-06-03 13:50:09] [INFO ] Added : 77 causal constraints over 16 iterations in 1076 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 13:50:10] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 13:50:10] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 13:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:10] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2020-06-03 13:50:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:50:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 13:50:10] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 190 ms returned sat
[2020-06-03 13:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:11] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2020-06-03 13:50:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2020-06-03 13:50:11] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 32 ms.
[2020-06-03 13:50:13] [INFO ] Added : 147 causal constraints over 30 iterations in 1752 ms. Result :sat
[2020-06-03 13:50:13] [INFO ] Deduced a trap composed of 17 places in 119 ms
[2020-06-03 13:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:50:14] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 13:50:14] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 13:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:16] [INFO ] [Real]Absence check using state equation in 2135 ms returned sat
[2020-06-03 13:50:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:50:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-06-03 13:50:16] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 69 ms returned sat
[2020-06-03 13:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:17] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2020-06-03 13:50:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-06-03 13:50:17] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 23 ms.
[2020-06-03 13:50:19] [INFO ] Added : 186 causal constraints over 38 iterations in 2103 ms. Result :sat
[2020-06-03 13:50:19] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-03 13:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 13:50:19] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-06-03 13:50:19] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 13:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:22] [INFO ] [Real]Absence check using state equation in 2642 ms returned sat
[2020-06-03 13:50:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:50:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 13:50:22] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 62 ms returned sat
[2020-06-03 13:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:50:24] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2020-06-03 13:50:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 33 ms returned sat
[2020-06-03 13:50:24] [INFO ] Computed and/alt/rep : 213/956/213 causal constraints in 30 ms.
[2020-06-03 13:50:26] [INFO ] Added : 128 causal constraints over 26 iterations in 1851 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
Incomplete Parikh walk after 97600 steps, including 1705 resets, run finished after 510 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 198000 steps, including 3427 resets, run finished after 1029 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 118300 steps, including 2049 resets, run finished after 588 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 42200 steps, including 795 resets, run finished after 207 ms. (steps per millisecond=203 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 166000 steps, including 2954 resets, run finished after 824 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 162200 steps, including 2826 resets, run finished after 811 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 130900 steps, including 2285 resets, run finished after 648 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 207200 steps, including 3611 resets, run finished after 1077 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 64800 steps, including 1196 resets, run finished after 329 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 48 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 22 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 45 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2020-06-03 13:50:32] [INFO ] Computed 61 place invariants in 10 ms
[2020-06-03 13:50:33] [INFO ] Implicit Places using invariants in 965 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 968 ms to find 1 implicit places.
[2020-06-03 13:50:33] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:50:33] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 13:50:34] [INFO ] Dead Transitions using invariants and state equation in 840 ms returned []
Starting structural reductions, iteration 1 : 272/273 places, 214/214 transitions.
Applied a total of 0 rules in 78 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2020-06-03 13:50:34] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:50:34] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 13:50:35] [INFO ] Dead Transitions using invariants and state equation in 974 ms returned []
Finished structural reductions, in 2 iterations. Remains : 272/273 places, 214/214 transitions.
Incomplete random walk after 1000000 steps, including 14661 resets, run finished after 4867 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3197 resets, run finished after 2381 ms. (steps per millisecond=419 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6048 resets, run finished after 2263 ms. (steps per millisecond=441 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6411 resets, run finished after 2132 ms. (steps per millisecond=469 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2616 resets, run finished after 2592 ms. (steps per millisecond=385 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5428 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3293 resets, run finished after 2334 ms. (steps per millisecond=428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6419 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2819 resets, run finished after 3235 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3270 resets, run finished after 2809 ms. (steps per millisecond=355 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8742511 steps, run timeout after 30001 ms. (steps per millisecond=291 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8742511 steps, saw 1050235 distinct states, run finished after 30001 ms. (steps per millisecond=291 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:51:32] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 13:51:32] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:51:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 13:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:33] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2020-06-03 13:51:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 13:51:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 85 ms returned sat
[2020-06-03 13:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:34] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2020-06-03 13:51:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 13:51:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 13:51:34] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-06-03 13:51:35] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2020-06-03 13:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2020-06-03 13:51:35] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 17 ms.
[2020-06-03 13:51:37] [INFO ] Added : 189 causal constraints over 38 iterations in 2373 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 13:51:37] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 13:51:37] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 13:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:38] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2020-06-03 13:51:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 13:51:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 59 ms returned sat
[2020-06-03 13:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:39] [INFO ] [Nat]Absence check using state equation in 841 ms returned sat
[2020-06-03 13:51:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:51:39] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 23 ms.
[2020-06-03 13:51:41] [INFO ] Added : 171 causal constraints over 35 iterations in 1836 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 13:51:41] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:51:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 38 ms returned sat
[2020-06-03 13:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:41] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2020-06-03 13:51:41] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:51:42] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2020-06-03 13:51:42] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2020-06-03 13:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2020-06-03 13:51:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:51:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 59 ms returned sat
[2020-06-03 13:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:43] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2020-06-03 13:51:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:51:43] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 25 ms.
[2020-06-03 13:51:45] [INFO ] Added : 149 causal constraints over 30 iterations in 1709 ms. Result :sat
[2020-06-03 13:51:45] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-06-03 13:51:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 13:51:45] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:51:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 13:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:46] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2020-06-03 13:51:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:51:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 73 ms returned sat
[2020-06-03 13:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:48] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2020-06-03 13:51:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 13:51:48] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 28 ms.
[2020-06-03 13:51:50] [INFO ] Added : 128 causal constraints over 26 iterations in 2492 ms. Result :sat
[2020-06-03 13:51:50] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 13:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 13:51:50] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:51:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 13:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:52] [INFO ] [Real]Absence check using state equation in 1372 ms returned sat
[2020-06-03 13:51:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 13:51:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2020-06-03 13:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:53] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2020-06-03 13:51:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:51:53] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-06-03 13:51:53] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-06-03 13:51:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2020-06-03 13:51:53] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 25 ms.
[2020-06-03 13:51:55] [INFO ] Added : 167 causal constraints over 34 iterations in 1711 ms. Result :sat
[2020-06-03 13:51:55] [INFO ] Deduced a trap composed of 6 places in 52 ms
[2020-06-03 13:51:55] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2020-06-03 13:51:55] [INFO ] Deduced a trap composed of 7 places in 44 ms
[2020-06-03 13:51:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 13:51:55] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:51:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 13:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:56] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2020-06-03 13:51:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 13:51:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 71 ms returned sat
[2020-06-03 13:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:57] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2020-06-03 13:51:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-06-03 13:51:57] [INFO ] Deduced a trap composed of 10 places in 68 ms
[2020-06-03 13:51:57] [INFO ] Deduced a trap composed of 12 places in 91 ms
[2020-06-03 13:51:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2020-06-03 13:51:57] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 23 ms.
[2020-06-03 13:51:58] [INFO ] Added : 78 causal constraints over 16 iterations in 755 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 13:51:58] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 13:51:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2020-06-03 13:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:59] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2020-06-03 13:51:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:51:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:51:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2020-06-03 13:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:51:59] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-06-03 13:51:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:52:00] [INFO ] Deduced a trap composed of 22 places in 177 ms
[2020-06-03 13:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2020-06-03 13:52:00] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 23 ms.
[2020-06-03 13:52:01] [INFO ] Added : 161 causal constraints over 33 iterations in 1886 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 13:52:02] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 13:52:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2020-06-03 13:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:04] [INFO ] [Real]Absence check using state equation in 2605 ms returned sat
[2020-06-03 13:52:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 13:52:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 73 ms returned sat
[2020-06-03 13:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:05] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2020-06-03 13:52:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 13:52:05] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 29 ms.
[2020-06-03 13:52:07] [INFO ] Added : 90 causal constraints over 18 iterations in 1238 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 13:52:07] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 13:52:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 64 ms returned sat
[2020-06-03 13:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:10] [INFO ] [Real]Absence check using state equation in 2693 ms returned sat
[2020-06-03 13:52:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 13:52:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 160 ms returned sat
[2020-06-03 13:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:11] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2020-06-03 13:52:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-06-03 13:52:11] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 27 ms.
[2020-06-03 13:52:13] [INFO ] Added : 88 causal constraints over 18 iterations in 2180 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 49400 steps, including 869 resets, run finished after 307 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 45600 steps, including 867 resets, run finished after 229 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153500 steps, including 2723 resets, run finished after 771 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 49000 steps, including 854 resets, run finished after 246 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 152200 steps, including 2653 resets, run finished after 754 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 132500 steps, including 2113 resets, run finished after 655 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 131000 steps, including 2067 resets, run finished after 656 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 207700 steps, including 3628 resets, run finished after 1056 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 78600 steps, including 1370 resets, run finished after 395 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 48 out of 272 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 18 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 18 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:52:19] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 13:52:20] [INFO ] Implicit Places using invariants in 1135 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:52:20] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 13:52:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 13:52:22] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 3372 ms to find 0 implicit places.
[2020-06-03 13:52:22] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:52:22] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 13:52:23] [INFO ] Dead Transitions using invariants and state equation in 821 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 100000 steps, including 1475 resets, run finished after 547 ms. (steps per millisecond=182 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:52:23] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 13:52:24] [INFO ] [Real]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 13:52:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2020-06-03 13:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:25] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2020-06-03 13:52:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 13:52:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2020-06-03 13:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:26] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2020-06-03 13:52:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 13:52:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-06-03 13:52:26] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-06-03 13:52:26] [INFO ] Deduced a trap composed of 20 places in 164 ms
[2020-06-03 13:52:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2020-06-03 13:52:26] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 23 ms.
[2020-06-03 13:52:29] [INFO ] Added : 189 causal constraints over 38 iterations in 2339 ms. Result :sat
[2020-06-03 13:52:29] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 13:52:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 13:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:29] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2020-06-03 13:52:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 13:52:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 13:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:30] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2020-06-03 13:52:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:52:30] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 29 ms.
[2020-06-03 13:52:32] [INFO ] Added : 171 causal constraints over 35 iterations in 1827 ms. Result :sat
[2020-06-03 13:52:32] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:52:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2020-06-03 13:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:33] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2020-06-03 13:52:33] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:52:33] [INFO ] Deduced a trap composed of 6 places in 226 ms
[2020-06-03 13:52:33] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-06-03 13:52:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2020-06-03 13:52:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 13:52:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 13:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:35] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2020-06-03 13:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:52:35] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 24 ms.
[2020-06-03 13:52:36] [INFO ] Added : 149 causal constraints over 30 iterations in 1765 ms. Result :sat
[2020-06-03 13:52:36] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 13:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2020-06-03 13:52:37] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 13:52:37] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 13:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:38] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2020-06-03 13:52:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 13:52:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 70 ms returned sat
[2020-06-03 13:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:39] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2020-06-03 13:52:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 13:52:39] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 29 ms.
[2020-06-03 13:52:42] [INFO ] Added : 128 causal constraints over 26 iterations in 2475 ms. Result :sat
[2020-06-03 13:52:42] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 13:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2020-06-03 13:52:42] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 13:52:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 13:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:43] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2020-06-03 13:52:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 13:52:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 13:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:44] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2020-06-03 13:52:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:52:44] [INFO ] Deduced a trap composed of 10 places in 182 ms
[2020-06-03 13:52:45] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2020-06-03 13:52:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2020-06-03 13:52:45] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 29 ms.
[2020-06-03 13:52:46] [INFO ] Added : 167 causal constraints over 34 iterations in 1639 ms. Result :sat
[2020-06-03 13:52:46] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-06-03 13:52:46] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2020-06-03 13:52:47] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2020-06-03 13:52:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2020-06-03 13:52:47] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:52:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 13:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:47] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2020-06-03 13:52:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 13:52:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 102 ms returned sat
[2020-06-03 13:52:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:48] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2020-06-03 13:52:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 13:52:48] [INFO ] Deduced a trap composed of 10 places in 100 ms
[2020-06-03 13:52:48] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-06-03 13:52:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2020-06-03 13:52:48] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 28 ms.
[2020-06-03 13:52:49] [INFO ] Added : 78 causal constraints over 16 iterations in 754 ms. Result :sat
[2020-06-03 13:52:49] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-06-03 13:52:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2020-06-03 13:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:50] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2020-06-03 13:52:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 13:52:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2020-06-03 13:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:51] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2020-06-03 13:52:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:52:51] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2020-06-03 13:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2020-06-03 13:52:51] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 23 ms.
[2020-06-03 13:52:53] [INFO ] Added : 161 causal constraints over 33 iterations in 1922 ms. Result :sat
[2020-06-03 13:52:53] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 13:52:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 13:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:56] [INFO ] [Real]Absence check using state equation in 2518 ms returned sat
[2020-06-03 13:52:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:52:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 13:52:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 73 ms returned sat
[2020-06-03 13:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:52:57] [INFO ] [Nat]Absence check using state equation in 1014 ms returned sat
[2020-06-03 13:52:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 13:52:57] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 23 ms.
[2020-06-03 13:52:58] [INFO ] Added : 90 causal constraints over 18 iterations in 1240 ms. Result :sat
[2020-06-03 13:52:58] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:52:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 13:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:01] [INFO ] [Real]Absence check using state equation in 2760 ms returned sat
[2020-06-03 13:53:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 13:53:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 146 ms returned sat
[2020-06-03 13:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:03] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2020-06-03 13:53:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-06-03 13:53:03] [INFO ] Computed and/alt/rep : 213/954/213 causal constraints in 30 ms.
[2020-06-03 13:53:05] [INFO ] Added : 88 causal constraints over 18 iterations in 2129 ms. Result :sat
Applied a total of 0 rules in 18 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2020-06-03 13:53:05] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 13:53:05] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 13:53:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 13:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:06] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2020-06-03 13:53:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 13:53:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 91 ms returned sat
[2020-06-03 13:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:07] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2020-06-03 13:53:07] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-06-03 13:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2020-06-03 13:53:07] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 23 ms.
[2020-06-03 13:53:09] [INFO ] Added : 166 causal constraints over 34 iterations in 1707 ms. Result :sat
[2020-06-03 13:53:09] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2020-06-03 13:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:53:09] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 13:53:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 13:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:10] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2020-06-03 13:53:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:53:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 13:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:11] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2020-06-03 13:53:11] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 22 ms.
[2020-06-03 13:53:13] [INFO ] Added : 171 causal constraints over 35 iterations in 1599 ms. Result :sat
[2020-06-03 13:53:13] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2020-06-03 13:53:13] [INFO ] Deduced a trap composed of 18 places in 81 ms
[2020-06-03 13:53:13] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-06-03 13:53:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 467 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 13:53:13] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 13:53:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2020-06-03 13:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:14] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2020-06-03 13:53:14] [INFO ] Deduced a trap composed of 6 places in 41 ms
[2020-06-03 13:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2020-06-03 13:53:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 13:53:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2020-06-03 13:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:15] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2020-06-03 13:53:15] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 29 ms.
[2020-06-03 13:53:17] [INFO ] Added : 159 causal constraints over 32 iterations in 1831 ms. Result :sat
[2020-06-03 13:53:17] [INFO ] Deduced a trap composed of 6 places in 98 ms
[2020-06-03 13:53:17] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 13:53:17] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-03 13:53:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 13:53:17] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 13:53:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 13:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:19] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2020-06-03 13:53:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 13:53:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2020-06-03 13:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:20] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2020-06-03 13:53:20] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 28 ms.
[2020-06-03 13:53:22] [INFO ] Added : 93 causal constraints over 19 iterations in 1626 ms. Result :sat
[2020-06-03 13:53:22] [INFO ] Deduced a trap composed of 12 places in 75 ms
[2020-06-03 13:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 13:53:22] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 13:53:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 13:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:23] [INFO ] [Real]Absence check using state equation in 1435 ms returned sat
[2020-06-03 13:53:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 13:53:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2020-06-03 13:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:24] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2020-06-03 13:53:24] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 44 ms.
[2020-06-03 13:53:26] [INFO ] Added : 156 causal constraints over 32 iterations in 1766 ms. Result :sat
[2020-06-03 13:53:26] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-06-03 13:53:26] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-06-03 13:53:26] [INFO ] Deduced a trap composed of 17 places in 62 ms
[2020-06-03 13:53:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 13:53:27] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:53:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 13:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:27] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2020-06-03 13:53:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 13:53:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 13:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:28] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2020-06-03 13:53:28] [INFO ] Deduced a trap composed of 10 places in 118 ms
[2020-06-03 13:53:28] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2020-06-03 13:53:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2020-06-03 13:53:28] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 26 ms.
[2020-06-03 13:53:29] [INFO ] Added : 78 causal constraints over 16 iterations in 886 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 13:53:29] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 13:53:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 13:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:30] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2020-06-03 13:53:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 13:53:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 13:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:31] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2020-06-03 13:53:31] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 30 ms.
[2020-06-03 13:53:33] [INFO ] Added : 151 causal constraints over 31 iterations in 1773 ms. Result :sat
[2020-06-03 13:53:33] [INFO ] Deduced a trap composed of 21 places in 114 ms
[2020-06-03 13:53:33] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-06-03 13:53:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 13:53:33] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 13:53:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 13:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:36] [INFO ] [Real]Absence check using state equation in 2478 ms returned sat
[2020-06-03 13:53:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 13:53:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 74 ms returned sat
[2020-06-03 13:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:37] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2020-06-03 13:53:37] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 32 ms.
[2020-06-03 13:53:38] [INFO ] Added : 113 causal constraints over 23 iterations in 1598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:53:39] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 13:53:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 13:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:41] [INFO ] [Real]Absence check using state equation in 2636 ms returned sat
[2020-06-03 13:53:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:53:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 13:53:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 154 ms returned sat
[2020-06-03 13:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:53:43] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2020-06-03 13:53:43] [INFO ] Computed and/alt/rep : 213/953/213 causal constraints in 22 ms.
[2020-06-03 13:53:45] [INFO ] Added : 84 causal constraints over 17 iterations in 2068 ms. Result :sat
[2020-06-03 13:53:45] [INFO ] Deduced a trap composed of 10 places in 66 ms
[2020-06-03 13:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 13:53:45] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2020-06-03 13:53:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 13:53:46] [INFO ] Flatten gal took : 122 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-40a @ 3570 seconds

FORMULA DES-PT-40a-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for ReachabilityFireability @ DES-PT-40a

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 13:53:46 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (F (((1 <= p139) AND (1 <= p164))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 1197,
"markings": 1130,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (F (((1 <= p141) AND (1 <= p164))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 1065,
"markings": 1006,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((p39 <= 0) OR (p191 <= 0) OR (p193 <= 0) OR (((p107 <= 0) OR (p188 <= 0)) AND ((p128 <= 0) OR (p164 <= 0))))))",
"processed_size": 122,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"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": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p163) AND (1 <= p135) AND (1 <= p164) AND ((p58 <= 0) OR (p267 <= 0) OR (p109 <= 0) OR (p188 <= 0) OR (p137 <= 0)))))",
"processed_size": 134,
"rewrites": 1
},
"result":
{
"edges": 1461,
"markings": 1378,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p33) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p180) AND (1 <= p185) AND (1 <= p187) AND (1 <= p212) AND (1 <= p229) AND (1 <= p139) AND (1 <= p164) AND ((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0))))))",
"processed_size": 218,
"rewrites": 1
},
"result":
{
"edges": 956,
"markings": 915,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 27,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p108) AND (1 <= p188) AND ((p222 <= 0) OR (p238 <= 0))) OR ((1 <= p35) AND (1 <= p191) AND (1 <= p193) AND (((1 <= p94) AND (1 <= p188)) OR ((1 <= p247) AND (1 <= p249))) AND (((1 <= p141) AND (1 <= p164)) OR ((1 <= p204) AND (1 <= p221) AND (1 <= p53) AND (1 <= p267)))))))",
"processed_size": 292,
"rewrites": 1
},
"result":
{
"edges": 639,
"markings": 611,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 38,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A (G (((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0) OR ((1 <= p170) AND (1 <= p263)) OR ((1 <= p149) AND (1 <= p164)) OR (((p40 <= 0) OR (p267 <= 0) OR ((1 <= p155) AND (1 <= p164))) AND ((p106 <= 0) OR (p188 <= 0) OR ((1 <= p143) AND (1 <= p164) AND (1 <= p170) AND (1 <= p263)))) OR ((1 <= p39) AND (1 <= p191) AND (1 <= p193) AND (1 <= p151) AND (1 <= p164) AND (1 <= p125)))))",
"processed_size": 387,
"rewrites": 2
},
"result":
{
"edges": 556,
"markings": 557,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1296,
"problems": 144
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 49468,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 1054,
"conflict_clusters": 43,
"places": 272,
"places_significant": 212,
"singleton_clusters": 0,
"transitions": 214
},
"result":
{
"preliminary_value": "no no yes yes yes no yes no yes ",
"value": "no no yes yes yes 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: 486/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 272
lola: finding significant places
lola: 272 places, 214 transitions, 212 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 ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: A (G ((((p102 <= 0) OR (p188 <= 0)) AND ((p103 <= 0) OR (p188 <= 0) OR (((p92 <= 0) OR (p188 <= 0)) AND ((p132 <= 0) OR (p164 <= 0))))))) : A (G (((p125 <= 0) OR (p164 <= 0) OR (p117 <= 0) OR (p188 <= 0) OR ((1 <= p204) AND (1 <= p221))))) : E (F (((1 <= p139) AND (1 <= p164)))) : E (F ((((1 <= p33) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p180) AND (1 <= p185) AND (1 <= p187) AND (1 <= p212) AND (1 <= p229) AND (1 <= p139) AND (1 <= p164) AND ((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0)))))) : E (F (((1 <= p163) AND (1 <= p135) AND (1 <= p164) AND ((p58 <= 0) OR (p267 <= 0) OR (p109 <= 0) OR (p188 <= 0) OR (p137 <= 0))))) : A (G (((p39 <= 0) OR (p191 <= 0) OR (p193 <= 0) OR (((p107 <= 0) OR (p188 <= 0)) AND ((p128 <= 0) OR (p164 <= 0)))))) : E (F (((1 <= p141) AND (1 <= p164)))) : A (G (((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0) OR ((1 <= p170) AND (1 <= p263)) OR ((1 <= p149) AND (1 <= p164)) OR (((p40 <= 0) OR (p267 <= 0) OR ((1 <= p155) AND (1 <= p164))) AND ((p106 <= 0) OR (p188 <= 0) OR ((1 <= p143) AND (1 <= p164) AND (1 <= p170) AND (1 <= p263)))) OR ((1 <= p39) AND (1 <= p191) AND (1 <= p193) AND (1 <= p151) AND (1 <= p164) AND (1 <= p125))))) : E (F ((((1 <= p108) AND (1 <= p188) AND ((p222 <= 0) OR (p238 <= 0))) OR ((1 <= p35) AND (1 <= p191) AND (1 <= p193) AND (((1 <= p94) AND (1 <= p188)) OR ((1 <= p247) AND (1 <= p249))) AND (((1 <= p141) AND (1 <= p164)) OR ((1 <= p204) AND (1 <= p221) AND (1 <= p53) AND (1 <= p267)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p139) AND (1 <= p164))))
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 <= p139) AND (1 <= p164))))
lola: processed formula length: 37
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p139) AND (1 <= p164))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1130 markings, 1197 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p141) AND (1 <= p164))))
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 <= p141) AND (1 <= p164))))
lola: processed formula length: 37
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p141) AND (1 <= p164))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1006 markings, 1065 edges
lola: ========================================
lola: subprocess 2 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p102 <= 0) OR (p188 <= 0)) AND ((p103 <= 0) OR (p188 <= 0) OR (((p92 <= 0) OR (p188 <= 0)) AND ((p132 <= 0) OR (p164 <= 0)))))))
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 ((((p102 <= 0) OR (p188 <= 0)) AND ((p103 <= 0) OR (p188 <= 0) OR (((p92 <= 0) OR (p188 <= 0)) AND ((p132 <= 0) OR (p164 <= 0)))))))
lola: processed formula length: 142
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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 <= p102) AND (1 <= p188)) OR ((1 <= p103) AND (1 <= p188) AND (((1 <= p92) AND (1 <= p188)) OR ((1 <= p132) AND (1 <= p164)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 535 markings, 534 edges
lola: ========================================
lola: subprocess 3 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p125 <= 0) OR (p164 <= 0) OR (p117 <= 0) OR (p188 <= 0) OR ((1 <= p204) AND (1 <= p221)))))
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 (((p125 <= 0) OR (p164 <= 0) OR (p117 <= 0) OR (p188 <= 0) OR ((1 <= p204) AND (1 <= p221)))))
lola: processed formula length: 103
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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 <= p125) AND (1 <= p164) AND (1 <= p117) AND (1 <= p188) AND ((p204 <= 0) OR (p221 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23758 markings, 30116 edges
lola: ========================================
lola: subprocess 4 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p39 <= 0) OR (p191 <= 0) OR (p193 <= 0) OR (((p107 <= 0) OR (p188 <= 0)) AND ((p128 <= 0) OR (p164 <= 0))))))
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 (((p39 <= 0) OR (p191 <= 0) OR (p193 <= 0) OR (((p107 <= 0) OR (p188 <= 0)) AND ((p128 <= 0) OR (p164 <= 0))))))
lola: processed formula length: 122
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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 <= p39) AND (1 <= p191) AND (1 <= p193) AND (((1 <= p107) AND (1 <= p188)) OR ((1 <= p128) AND (1 <= p164))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
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: subprocess 5 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p163) AND (1 <= p135) AND (1 <= p164) AND ((p58 <= 0) OR (p267 <= 0) OR (p109 <= 0) OR (p188 <= 0) OR (p137 <= 0)))))
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 <= p163) AND (1 <= p135) AND (1 <= p164) AND ((p58 <= 0) OR (p267 <= 0) OR (p109 <= 0) OR (p188 <= 0) OR (p137 <= 0)))))
lola: processed formula length: 134
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p163) AND (1 <= p135) AND (1 <= p164) AND ((p58 <= 0) OR (p267 <= 0) OR (p109 <= 0) OR (p188 <= 0) OR (p137 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1378 markings, 1461 edges
lola: ========================================
lola: subprocess 6 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p33) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p180) AND (1 <= p185) AND (1 <= p187) AND (1 <= p212) AND (1 <= p229) AND (1 <= p139) AND (1 <= p164) AND ((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0))))))
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 <= p33) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p180) AND (1 <= p185) AND (1 <= p187) AND (1 <= p212) AND (1 <= p229) AND (1 <= p139) AND (1 <= p164) AND ((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0))))))
lola: processed formula length: 218
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p33) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p180) AND (1 <= p185) AND (1 <= p187) AND (1 <= p212) AND (1 <= p229) AND (1 <= p139) AND (1 <= p164) AND ((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 27 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 915 markings, 956 edges
lola: ========================================
lola: subprocess 7 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p108) AND (1 <= p188) AND ((p222 <= 0) OR (p238 <= 0))) OR ((1 <= p35) AND (1 <= p191) AND (1 <= p193) AND (((1 <= p94) AND (1 <= p188)) OR ((1 <= p247) AND (1 <= p249))) AND (((1 <= p141) AND (1 <= p164)) OR ((1 <= p204) AND (1 <= p221) AND (1 <= p53) AND (1 <= p267)))))))
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 <= p108) AND (1 <= p188) AND ((p222 <= 0) OR (p238 <= 0))) OR ((1 <= p35) AND (1 <= p191) AND (1 <= p193) AND (((1 <= p94) AND (1 <= p188)) OR ((1 <= p247) AND (1 <= p249))) AND (((1 <= p141) AND (1 <= p164)) OR ((1 <= p204) AND (1 <= p221) AND (1 <= p53) AND (1 <= p267)))))))
lola: processed formula length: 292
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p108) AND (1 <= p188) AND ((p222 <= 0) OR (p238 <= 0))) OR ((1 <= p35) AND (1 <= p191) AND (1 <= p193) AND (((1 <= p94) AND (1 <= p188)) OR ((1 <= p247) AND (1 <= p249))) AND (((1 <= p141) AND (1 <= p164)) OR ((1 <= p204) AND (1 <= p221) AND (1 <= p53) AND (1 <= p267)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 38 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 611 markings, 639 edges
lola: ========================================
lola: subprocess 8 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0) OR ((1 <= p170) AND (1 <= p263)) OR ((1 <= p149) AND (1 <= p164)) OR (((p40 <= 0) OR (p267 <= 0) OR ((1 <= p155) AND (1 <= p164))) AND ((p106 <= 0) OR (p188 <= 0) OR ((1 <= p143) AND (1 <= p164) AND (1 <= p170) AND (1 <= p263)))) OR ((1 <= p39) AND (1 <= p191) AND (1 <= p193) AND (1 <= p151) AND (1 <= p164) AND (1 <= p125)))))
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 (((p195 <= 0) OR (p197 <= 0) OR (p254 <= 0) OR ((1 <= p170) AND (1 <= p263)) OR ((1 <= p149) AND (1 <= p164)) OR (((p40 <= 0) OR (p267 <= 0) OR ((1 <= p155) AND (1 <= p164))) AND ((p106 <= 0) OR (p188 <= 0) OR ((1 <= p143) AND (1 <= p164) AND (1 <= p170) AND (1 <= p263)))) OR ((1 <= p39) AND (1 <= p191) AND (1 <= p193) AND (1 <= p151) AND (1 <= p164) AND (1 <= p125)))))
lola: processed formula length: 387
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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 <= p195) AND (1 <= p197) AND (1 <= p254) AND ((p170 <= 0) OR (p263 <= 0)) AND ((p149 <= 0) OR (p164 <= 0)) AND (((1 <= p40) AND (1 <= p267) AND ((p155 <= 0) OR (p164 <= 0))) OR ((1 <= p106) AND (1 <= p188) AND ((p143 <= 0) OR (p164 <= 0) OR (p170 <= 0) OR (p263 <= 0)))) AND ((p39 <= 0) OR (p191 <= 0) OR (p193 <= 0) OR (p151 <= 0) OR (p164 <= 0) OR (p125 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1296 literals and 144 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 557 markings, 556 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes no yes
lola:
preliminary result: no no yes yes yes no yes no yes
lola: memory consumption: 49468 KB
lola: time consumption: 9 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="DES-PT-40a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is DES-PT-40a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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