Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 139K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620517367024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 23:42:48] [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]
[2021-05-08 23:42:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 23:42:48] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-08 23:42:48] [INFO ] Transformed 519 places.
[2021-05-08 23:42:48] [INFO ] Transformed 470 transitions.
[2021-05-08 23:42:48] [INFO ] Found NUPN structural information;
[2021-05-08 23:42:48] [INFO ] Parsed PT model containing 519 places and 470 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 82 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0]
FORMULA DES-PT-60b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 470 rows 519 cols
[2021-05-08 23:42:49] [INFO ] Computed 65 place invariants in 39 ms
[2021-05-08 23:42:49] [INFO ] [Real]Absence check using 39 positive place invariants in 40 ms returned sat
[2021-05-08 23:42:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2021-05-08 23:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:50] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2021-05-08 23:42:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 48 ms returned sat
[2021-05-08 23:42:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2021-05-08 23:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:51] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2021-05-08 23:42:51] [INFO ] Deduced a trap composed of 12 places in 287 ms
[2021-05-08 23:42:51] [INFO ] Deduced a trap composed of 38 places in 76 ms
[2021-05-08 23:42:51] [INFO ] Deduced a trap composed of 40 places in 63 ms
[2021-05-08 23:42:51] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2021-05-08 23:42:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 641 ms
[2021-05-08 23:42:52] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 34 ms.
[2021-05-08 23:42:55] [INFO ] Added : 420 causal constraints over 84 iterations in 3180 ms. Result :unknown
[2021-05-08 23:42:55] [INFO ] [Real]Absence check using 39 positive place invariants in 31 ms returned sat
[2021-05-08 23:42:55] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2021-05-08 23:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:56] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2021-05-08 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2021-05-08 23:42:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2021-05-08 23:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:57] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2021-05-08 23:42:57] [INFO ] Deduced a trap composed of 13 places in 188 ms
[2021-05-08 23:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2021-05-08 23:42:57] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 34 ms.
[2021-05-08 23:43:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t456 0) (and (and (> t43 0) (< o43 o456)) (or (and (> t430 0) (< o430 o456)) (and (> t432 0) (< o432 o456)))))") while checking expression at index 1
[2021-05-08 23:43:01] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 23:43:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned unsat
[2021-05-08 23:43:01] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 23:43:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2021-05-08 23:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:02] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2021-05-08 23:43:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2021-05-08 23:43:03] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 64 ms returned sat
[2021-05-08 23:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:04] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2021-05-08 23:43:04] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2021-05-08 23:43:04] [INFO ] Deduced a trap composed of 12 places in 223 ms
[2021-05-08 23:43:04] [INFO ] Deduced a trap composed of 13 places in 168 ms
[2021-05-08 23:43:05] [INFO ] Deduced a trap composed of 51 places in 192 ms
[2021-05-08 23:43:05] [INFO ] Deduced a trap composed of 14 places in 157 ms
[2021-05-08 23:43:05] [INFO ] Deduced a trap composed of 18 places in 167 ms
[2021-05-08 23:43:05] [INFO ] Deduced a trap composed of 48 places in 195 ms
[2021-05-08 23:43:05] [INFO ] Deduced a trap composed of 31 places in 156 ms
[2021-05-08 23:43:05] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2021-05-08 23:43:06] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2021-05-08 23:43:06] [INFO ] Deduced a trap composed of 21 places in 92 ms
[2021-05-08 23:43:06] [INFO ] Deduced a trap composed of 24 places in 91 ms
[2021-05-08 23:43:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2107 ms
[2021-05-08 23:43:06] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 27 ms.
[2021-05-08 23:43:07] [INFO ] Added : 205 causal constraints over 41 iterations in 1581 ms. Result :(error "Failed to check-sat")
[2021-05-08 23:43:07] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2021-05-08 23:43:08] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2021-05-08 23:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:09] [INFO ] [Real]Absence check using state equation in 1709 ms returned sat
[2021-05-08 23:43:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 41 ms returned sat
[2021-05-08 23:43:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2021-05-08 23:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:11] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2021-05-08 23:43:11] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2021-05-08 23:43:11] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2021-05-08 23:43:11] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2021-05-08 23:43:11] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2021-05-08 23:43:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 497 ms
[2021-05-08 23:43:11] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 37 ms.
[2021-05-08 23:43:14] [INFO ] Added : 305 causal constraints over 61 iterations in 3083 ms. Result :unknown
[2021-05-08 23:43:14] [INFO ] [Real]Absence check using 39 positive place invariants in 31 ms returned sat
[2021-05-08 23:43:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2021-05-08 23:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:17] [INFO ] [Real]Absence check using state equation in 2094 ms returned sat
[2021-05-08 23:43:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 41 ms returned sat
[2021-05-08 23:43:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 118 ms returned sat
[2021-05-08 23:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:18] [INFO ] [Nat]Absence check using state equation in 1678 ms returned sat
[2021-05-08 23:43:19] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2021-05-08 23:43:19] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2021-05-08 23:43:19] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2021-05-08 23:43:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2021-05-08 23:43:19] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 29 ms.
[2021-05-08 23:43:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t439 0) (and (and (> t32 0) (< o32 o439)) (and (> t26 0) (< o26 o439))))") while checking expression at index 5
[2021-05-08 23:43:22] [INFO ] [Real]Absence check using 39 positive place invariants in 83 ms returned sat
[2021-05-08 23:43:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2021-05-08 23:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:23] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2021-05-08 23:43:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 45 ms returned sat
[2021-05-08 23:43:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2021-05-08 23:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:24] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2021-05-08 23:43:24] [INFO ] Deduced a trap composed of 12 places in 117 ms
[2021-05-08 23:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2021-05-08 23:43:24] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 35 ms.
[2021-05-08 23:43:28] [INFO ] Added : 175 causal constraints over 35 iterations in 3715 ms. Result :(error "Failed to check-sat")
[2021-05-08 23:43:28] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2021-05-08 23:43:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2021-05-08 23:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:29] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2021-05-08 23:43:29] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2021-05-08 23:43:29] [INFO ] Deduced a trap composed of 12 places in 124 ms
[2021-05-08 23:43:29] [INFO ] Deduced a trap composed of 8 places in 110 ms
[2021-05-08 23:43:29] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2021-05-08 23:43:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 549 ms
[2021-05-08 23:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2021-05-08 23:43:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2021-05-08 23:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:30] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2021-05-08 23:43:30] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2021-05-08 23:43:31] [INFO ] Deduced a trap composed of 35 places in 128 ms
[2021-05-08 23:43:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2021-05-08 23:43:31] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 28 ms.
[2021-05-08 23:43:34] [INFO ] Added : 417 causal constraints over 85 iterations in 3518 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 23:43:34] [INFO ] [Real]Absence check using 39 positive place invariants in 28 ms returned sat
[2021-05-08 23:43:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2021-05-08 23:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:35] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2021-05-08 23:43:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:35] [INFO ] [Nat]Absence check using 39 positive place invariants in 41 ms returned sat
[2021-05-08 23:43:35] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2021-05-08 23:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:36] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2021-05-08 23:43:36] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2021-05-08 23:43:37] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2021-05-08 23:43:37] [INFO ] Deduced a trap composed of 8 places in 108 ms
[2021-05-08 23:43:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
[2021-05-08 23:43:37] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 23 ms.
[2021-05-08 23:43:40] [INFO ] Added : 340 causal constraints over 68 iterations in 3556 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-08 23:43:40] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2021-05-08 23:43:40] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2021-05-08 23:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:41] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2021-05-08 23:43:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:43:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 40 ms returned sat
[2021-05-08 23:43:41] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2021-05-08 23:43:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:43:42] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2021-05-08 23:43:42] [INFO ] Deduced a trap composed of 12 places in 125 ms
[2021-05-08 23:43:42] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2021-05-08 23:43:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2021-05-08 23:43:42] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 27 ms.
[2021-05-08 23:43:46] [INFO ] Added : 455 causal constraints over 91 iterations in 3797 ms. Result :(error "Solver has unexpectedly terminated")
FORMULA DES-PT-60b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 893800 steps, including 9405 resets, run finished after 3030 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 417500 steps, including 4638 resets, run finished after 1374 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 834500 steps, including 8635 resets, run finished after 2789 ms. (steps per millisecond=299 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 30 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 508 transition count 445
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 490 transition count 445
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 490 transition count 437
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 482 transition count 437
Symmetric choice reduction at 2 with 19 rule applications. Total rules 74 place count 482 transition count 437
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 112 place count 463 transition count 418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 463 transition count 417
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 462 transition count 417
Symmetric choice reduction at 2 with 13 rule applications. Total rules 127 place count 462 transition count 417
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 153 place count 449 transition count 404
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 167 place count 449 transition count 390
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 447 transition count 389
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 170 place count 447 transition count 386
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 176 place count 444 transition count 386
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 296 place count 384 transition count 326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 382 transition count 326
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 301 place count 382 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 381 transition count 325
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 303 place count 381 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 304 place count 380 transition count 324
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 306 place count 380 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 307 place count 379 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 308 place count 378 transition count 323
Applied a total of 308 rules in 251 ms. Remains 378 /519 variables (removed 141) and now considering 323/470 (removed 147) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/519 places, 323/470 transitions.
Incomplete random walk after 1000000 steps, including 25049 resets, run finished after 3650 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4802 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5034 resets, run finished after 1442 ms. (steps per millisecond=693 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4774 resets, run finished after 1299 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4714 resets, run finished after 1364 ms. (steps per millisecond=733 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4670 resets, run finished after 1360 ms. (steps per millisecond=735 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5091 resets, run finished after 1321 ms. (steps per millisecond=757 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4822 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5059 resets, run finished after 1270 ms. (steps per millisecond=787 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4854 resets, run finished after 1306 ms. (steps per millisecond=765 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 13915801 steps, run timeout after 30001 ms. (steps per millisecond=463 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 13915801 steps, saw 1634242 distinct states, run finished after 30001 ms. (steps per millisecond=463 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 323 rows 378 cols
[2021-05-08 23:44:39] [INFO ] Computed 60 place invariants in 9 ms
[2021-05-08 23:44:39] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:44:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:40] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2021-05-08 23:44:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:44:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:44:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 106 ms returned sat
[2021-05-08 23:44:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:41] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2021-05-08 23:44:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 23:44:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 23:44:41] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2021-05-08 23:44:41] [INFO ] Deduced a trap composed of 10 places in 59 ms
[2021-05-08 23:44:41] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2021-05-08 23:44:41] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2021-05-08 23:44:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2021-05-08 23:44:41] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 24 ms.
[2021-05-08 23:44:43] [INFO ] Added : 251 causal constraints over 51 iterations in 1780 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 23:44:43] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:44:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 23:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:45] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2021-05-08 23:44:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:44:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:44:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2021-05-08 23:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:46] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2021-05-08 23:44:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2021-05-08 23:44:46] [INFO ] Deduced a trap composed of 12 places in 85 ms
[2021-05-08 23:44:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2021-05-08 23:44:46] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 20 ms.
[2021-05-08 23:44:48] [INFO ] Added : 189 causal constraints over 38 iterations in 2726 ms. Result :sat
[2021-05-08 23:44:49] [INFO ] Deduced a trap composed of 7 places in 29 ms
[2021-05-08 23:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 23:44:49] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:44:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2021-05-08 23:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:50] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2021-05-08 23:44:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:44:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-08 23:44:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2021-05-08 23:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:51] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2021-05-08 23:44:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:44:51] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2021-05-08 23:44:51] [INFO ] Deduced a trap composed of 21 places in 114 ms
[2021-05-08 23:44:51] [INFO ] Deduced a trap composed of 12 places in 51 ms
[2021-05-08 23:44:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
[2021-05-08 23:44:51] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 30 ms.
[2021-05-08 23:44:53] [INFO ] Added : 296 causal constraints over 60 iterations in 2403 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 23:44:54] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:44:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 23:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:54] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2021-05-08 23:44:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:44:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:44:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2021-05-08 23:44:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:55] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2021-05-08 23:44:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2021-05-08 23:44:55] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2021-05-08 23:44:56] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-08 23:44:56] [INFO ] Deduced a trap composed of 7 places in 29 ms
[2021-05-08 23:44:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2021-05-08 23:44:56] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 34 ms.
[2021-05-08 23:44:57] [INFO ] Added : 181 causal constraints over 37 iterations in 1562 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 23:44:57] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:44:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 23:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:44:58] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2021-05-08 23:44:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:44:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 50 ms returned sat
[2021-05-08 23:44:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2021-05-08 23:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:00] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2021-05-08 23:45:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2021-05-08 23:45:00] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2021-05-08 23:45:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-08 23:45:00] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 15 ms.
[2021-05-08 23:45:07] [INFO ] Added : 80 causal constraints over 16 iterations in 7169 ms. Result :unknown
[2021-05-08 23:45:07] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:45:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:07] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-08 23:45:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 165 ms returned sat
[2021-05-08 23:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:08] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2021-05-08 23:45:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2021-05-08 23:45:08] [INFO ] Deduced a trap composed of 7 places in 48 ms
[2021-05-08 23:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-08 23:45:08] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 17 ms.
[2021-05-08 23:45:12] [INFO ] Added : 258 causal constraints over 52 iterations in 3175 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 23:45:12] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:12] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2021-05-08 23:45:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-08 23:45:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 130 ms returned sat
[2021-05-08 23:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:13] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2021-05-08 23:45:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:45:13] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 17 ms.
[2021-05-08 23:45:17] [INFO ] Added : 183 causal constraints over 37 iterations in 3858 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-08 23:45:17] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:18] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-08 23:45:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:45:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2021-05-08 23:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:19] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2021-05-08 23:45:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 23:45:19] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2021-05-08 23:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2021-05-08 23:45:19] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 17 ms.
[2021-05-08 23:45:20] [INFO ] Added : 192 causal constraints over 39 iterations in 1673 ms. Result :sat
[2021-05-08 23:45:20] [INFO ] Deduced a trap composed of 28 places in 82 ms
[2021-05-08 23:45:21] [INFO ] Deduced a trap composed of 23 places in 78 ms
[2021-05-08 23:45:21] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2021-05-08 23:45:21] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2021-05-08 23:45:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 23:45:21] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:22] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2021-05-08 23:45:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2021-05-08 23:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:22] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2021-05-08 23:45:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:45:22] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 20 ms.
[2021-05-08 23:45:25] [INFO ] Added : 309 causal constraints over 62 iterations in 3089 ms. Result :sat
[2021-05-08 23:45:26] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2021-05-08 23:45:26] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2021-05-08 23:45:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 339200 steps, including 11490 resets, run finished after 1294 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 212200 steps, including 7221 resets, run finished after 809 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 92900 steps, including 3032 resets, run finished after 349 ms. (steps per millisecond=266 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 327000 steps, including 11111 resets, run finished after 1261 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 329000 steps, including 11157 resets, run finished after 1249 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 90700 steps, including 2944 resets, run finished after 345 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 321200 steps, including 10881 resets, run finished after 1241 ms. (steps per millisecond=258 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 100700 steps, including 3236 resets, run finished after 385 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 336800 steps, including 11485 resets, run finished after 1302 ms. (steps per millisecond=258 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 30 out of 378 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 378/378 places, 323/323 transitions.
Applied a total of 0 rules in 13 ms. Remains 378 /378 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 323/323 transitions.
Starting structural reductions, iteration 0 : 378/378 places, 323/323 transitions.
Applied a total of 0 rules in 12 ms. Remains 378 /378 variables (removed 0) and now considering 323/323 (removed 0) transitions.
// Phase 1: matrix 323 rows 378 cols
[2021-05-08 23:45:34] [INFO ] Computed 60 place invariants in 8 ms
[2021-05-08 23:45:35] [INFO ] Implicit Places using invariants in 888 ms returned []
// Phase 1: matrix 323 rows 378 cols
[2021-05-08 23:45:35] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 23:45:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 23:45:38] [INFO ] Implicit Places using invariants and state equation in 2781 ms returned []
Implicit Place search using SMT with State Equation took 3671 ms to find 0 implicit places.
[2021-05-08 23:45:38] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 323 rows 378 cols
[2021-05-08 23:45:38] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 23:45:39] [INFO ] Dead Transitions using invariants and state equation in 740 ms returned []
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 323/323 transitions.
Incomplete random walk after 100000 steps, including 2517 resets, run finished after 369 ms. (steps per millisecond=271 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 323 rows 378 cols
[2021-05-08 23:45:39] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 23:45:39] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:45:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:40] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2021-05-08 23:45:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:45:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2021-05-08 23:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:40] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2021-05-08 23:45:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 23:45:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:45:41] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2021-05-08 23:45:41] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2021-05-08 23:45:41] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2021-05-08 23:45:41] [INFO ] Deduced a trap composed of 10 places in 29 ms
[2021-05-08 23:45:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 270 ms
[2021-05-08 23:45:41] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 19 ms.
[2021-05-08 23:45:43] [INFO ] Added : 251 causal constraints over 51 iterations in 1799 ms. Result :sat
[2021-05-08 23:45:43] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 23:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:44] [INFO ] [Real]Absence check using state equation in 1409 ms returned sat
[2021-05-08 23:45:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-08 23:45:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2021-05-08 23:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:45] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2021-05-08 23:45:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2021-05-08 23:45:45] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2021-05-08 23:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2021-05-08 23:45:45] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 19 ms.
[2021-05-08 23:45:48] [INFO ] Added : 189 causal constraints over 38 iterations in 2730 ms. Result :sat
[2021-05-08 23:45:48] [INFO ] Deduced a trap composed of 7 places in 32 ms
[2021-05-08 23:45:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2021-05-08 23:45:48] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:49] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2021-05-08 23:45:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:45:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2021-05-08 23:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:50] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2021-05-08 23:45:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:45:50] [INFO ] Deduced a trap composed of 21 places in 119 ms
[2021-05-08 23:45:50] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2021-05-08 23:45:51] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2021-05-08 23:45:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2021-05-08 23:45:51] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 16 ms.
[2021-05-08 23:45:53] [INFO ] Added : 296 causal constraints over 60 iterations in 2327 ms. Result :sat
[2021-05-08 23:45:53] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-08 23:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:54] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2021-05-08 23:45:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2021-05-08 23:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:55] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2021-05-08 23:45:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2021-05-08 23:45:55] [INFO ] Deduced a trap composed of 11 places in 44 ms
[2021-05-08 23:45:55] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2021-05-08 23:45:55] [INFO ] Deduced a trap composed of 7 places in 31 ms
[2021-05-08 23:45:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2021-05-08 23:45:55] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 18 ms.
[2021-05-08 23:45:56] [INFO ] Added : 181 causal constraints over 37 iterations in 1546 ms. Result :sat
[2021-05-08 23:45:57] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 23:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:57] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2021-05-08 23:45:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:45:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:45:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 23:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:45:59] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2021-05-08 23:45:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2021-05-08 23:45:59] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2021-05-08 23:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-08 23:45:59] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 19 ms.
[2021-05-08 23:46:06] [INFO ] Added : 80 causal constraints over 16 iterations in 7183 ms. Result :unknown
[2021-05-08 23:46:06] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:07] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2021-05-08 23:46:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 163 ms returned sat
[2021-05-08 23:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:08] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2021-05-08 23:46:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:46:08] [INFO ] Deduced a trap composed of 7 places in 41 ms
[2021-05-08 23:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-08 23:46:08] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 16 ms.
[2021-05-08 23:46:11] [INFO ] Added : 258 causal constraints over 52 iterations in 3221 ms. Result :sat
[2021-05-08 23:46:11] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:12] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2021-05-08 23:46:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:46:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 130 ms returned sat
[2021-05-08 23:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:12] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2021-05-08 23:46:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:46:13] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 17 ms.
[2021-05-08 23:46:16] [INFO ] Added : 183 causal constraints over 37 iterations in 3840 ms. Result :sat
[2021-05-08 23:46:16] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:17] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2021-05-08 23:46:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2021-05-08 23:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:18] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2021-05-08 23:46:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2021-05-08 23:46:18] [INFO ] Deduced a trap composed of 12 places in 100 ms
[2021-05-08 23:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2021-05-08 23:46:18] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 17 ms.
[2021-05-08 23:46:20] [INFO ] Added : 192 causal constraints over 39 iterations in 1596 ms. Result :sat
[2021-05-08 23:46:20] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2021-05-08 23:46:20] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2021-05-08 23:46:20] [INFO ] Deduced a trap composed of 23 places in 73 ms
[2021-05-08 23:46:20] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2021-05-08 23:46:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 488 ms
[2021-05-08 23:46:20] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:21] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2021-05-08 23:46:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2021-05-08 23:46:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:21] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2021-05-08 23:46:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:46:21] [INFO ] Computed and/alt/rep : 320/1500/320 causal constraints in 17 ms.
[2021-05-08 23:46:24] [INFO ] Added : 309 causal constraints over 62 iterations in 3039 ms. Result :sat
[2021-05-08 23:46:25] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2021-05-08 23:46:25] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2021-05-08 23:46:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
Applied a total of 0 rules in 11 ms. Remains 378 /378 variables (removed 0) and now considering 323/323 (removed 0) transitions.
// Phase 1: matrix 323 rows 378 cols
[2021-05-08 23:46:25] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 23:46:25] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2021-05-08 23:46:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2021-05-08 23:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:26] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2021-05-08 23:46:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:46:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 104 ms returned sat
[2021-05-08 23:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:27] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2021-05-08 23:46:27] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2021-05-08 23:46:27] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-08 23:46:27] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2021-05-08 23:46:27] [INFO ] Deduced a trap composed of 10 places in 28 ms
[2021-05-08 23:46:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 246 ms
[2021-05-08 23:46:27] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 16 ms.
[2021-05-08 23:46:28] [INFO ] Added : 252 causal constraints over 51 iterations in 1595 ms. Result :sat
[2021-05-08 23:46:28] [INFO ] Deduced a trap composed of 7 places in 26 ms
[2021-05-08 23:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 23:46:29] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:46:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 23:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:30] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2021-05-08 23:46:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-08 23:46:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 111 ms returned sat
[2021-05-08 23:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:31] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2021-05-08 23:46:31] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2021-05-08 23:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2021-05-08 23:46:31] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 19 ms.
[2021-05-08 23:46:33] [INFO ] Added : 221 causal constraints over 45 iterations in 2150 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 23:46:33] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 23:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:34] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2021-05-08 23:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-08 23:46:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2021-05-08 23:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:35] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 9 places in 148 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 20 places in 124 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 11 places in 29 ms
[2021-05-08 23:46:36] [INFO ] Deduced a trap composed of 7 places in 28 ms
[2021-05-08 23:46:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 756 ms
[2021-05-08 23:46:36] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 18 ms.
[2021-05-08 23:46:38] [INFO ] Added : 294 causal constraints over 59 iterations in 2209 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 23:46:39] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:46:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-08 23:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:39] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2021-05-08 23:46:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2021-05-08 23:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:40] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2021-05-08 23:46:40] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2021-05-08 23:46:40] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2021-05-08 23:46:40] [INFO ] Deduced a trap composed of 7 places in 42 ms
[2021-05-08 23:46:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2021-05-08 23:46:41] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 15 ms.
[2021-05-08 23:46:44] [INFO ] Added : 184 causal constraints over 37 iterations in 3135 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-08 23:46:44] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:46:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 23:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:44] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2021-05-08 23:46:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:46:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2021-05-08 23:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:46] [INFO ] [Nat]Absence check using state equation in 1395 ms returned sat
[2021-05-08 23:46:46] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2021-05-08 23:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-08 23:46:46] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 19 ms.
[2021-05-08 23:46:49] [INFO ] Added : 252 causal constraints over 51 iterations in 2748 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 23:46:49] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:49] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2021-05-08 23:46:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:46:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 164 ms returned sat
[2021-05-08 23:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:50] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2021-05-08 23:46:51] [INFO ] Deduced a trap composed of 7 places in 49 ms
[2021-05-08 23:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-08 23:46:51] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 16 ms.
[2021-05-08 23:46:54] [INFO ] Added : 256 causal constraints over 52 iterations in 3040 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 23:46:54] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:54] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2021-05-08 23:46:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 23:46:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 130 ms returned sat
[2021-05-08 23:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:55] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2021-05-08 23:46:55] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 20 ms.
[2021-05-08 23:46:57] [INFO ] Added : 184 causal constraints over 37 iterations in 2103 ms. Result :sat
[2021-05-08 23:46:57] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2021-05-08 23:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 23:46:58] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:58] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2021-05-08 23:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:46:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:46:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2021-05-08 23:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:46:59] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2021-05-08 23:46:59] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2021-05-08 23:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2021-05-08 23:46:59] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 14 ms.
[2021-05-08 23:47:01] [INFO ] Added : 208 causal constraints over 42 iterations in 1562 ms. Result :sat
[2021-05-08 23:47:01] [INFO ] Deduced a trap composed of 7 places in 32 ms
[2021-05-08 23:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 23:47:01] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:47:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:47:01] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2021-05-08 23:47:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:47:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 23:47:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2021-05-08 23:47:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:47:02] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2021-05-08 23:47:02] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2021-05-08 23:47:02] [INFO ] Deduced a trap composed of 7 places in 47 ms
[2021-05-08 23:47:02] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2021-05-08 23:47:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2021-05-08 23:47:02] [INFO ] Computed and/alt/rep : 320/1496/320 causal constraints in 15 ms.
[2021-05-08 23:47:06] [INFO ] Added : 258 causal constraints over 52 iterations in 3308 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-08 23:47:06] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2021-05-08 23:47:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2021-05-08 23:47:06] [INFO ] Flatten gal took : 82 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-60b @ 3570 seconds

FORMULA DES-PT-60b-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3324
rslt: Output for ReachabilityFireability @ DES-PT-60b

{
"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": "Sat May 8 23:47:07 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 <= p64) AND (1 <= p373))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 238485,
"markings": 215768,
"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 <= p210) AND (1 <= p248))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 282436,
"markings": 245298,
"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": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p81) AND ((p240 <= 0)) AND (1 <= p373))))",
"processed_size": 54,
"rewrites": 1
},
"result":
{
"edges": 168411,
"markings": 152851,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"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": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p168 <= 0) OR (p277 <= 0)) AND ((p126 <= 0) OR (p277 <= 0)))))",
"processed_size": 73,
"rewrites": 2
},
"result":
{
"edges": 13248,
"markings": 10290,
"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": 4,
"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": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p67 <= 0) OR (p373 <= 0) OR ((1 <= p24) AND (1 <= p281)))))",
"processed_size": 69,
"rewrites": 2
},
"result":
{
"edges": 226119,
"markings": 204665,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"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": 2,
"adisj": 3,
"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": "E (F (((1 <= p164) AND (1 <= p277) AND ((p356 <= 0) OR (((p132 <= 0)) AND ((p289 <= 0) OR (p371 <= 0)))))))",
"processed_size": 109,
"rewrites": 1
},
"result":
{
"edges": 18468,
"markings": 14638,
"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": 11,
"problems": 3
},
"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": 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": "E (F ((((1 <= p82) AND (1 <= p373)) OR ((1 <= p44) AND (1 <= p281) AND (1 <= p244) AND (1 <= p260)))))",
"processed_size": 103,
"rewrites": 1
},
"result":
{
"edges": 67913343,
"markings": 31102315,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1663
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "E (F ((((1 <= p105) AND (1 <= p373)) OR ((1 <= p347) AND (1 <= p362) AND (1 <= p34) AND (1 <= p281)))))",
"processed_size": 104,
"rewrites": 1
},
"result":
{
"edges": 307763,
"markings": 188045,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p163) AND (1 <= p277) AND ((p222 <= 0) OR (p248 <= 0) OR (p81 <= 0) OR (p373 <= 0)) AND ((p242 <= 0) OR ((1 <= p313) AND (1 <= p331))))))",
"processed_size": 154,
"rewrites": 1
},
"result":
{
"edges": 19773,
"markings": 15725,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 36,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 33388,
"runtime": 246.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1454,
"conflict_clusters": 66,
"places": 378,
"places_significant": 318,
"singleton_clusters": 0,
"transitions": 323
},
"result":
{
"preliminary_value": "yes yes no yes yes yes yes yes no ",
"value": "yes yes no yes yes yes yes yes no "
},
"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: 701/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 378
lola: finding significant places
lola: 378 places, 323 transitions, 318 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: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p313 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p362 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p356 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p371 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: E (F (((1 <= p64) AND (1 <= p373)))) : E (F (((1 <= p163) AND (1 <= p277) AND ((p222 <= 0) OR (p248 <= 0) OR (p81 <= 0) OR (p373 <= 0)) AND ((p242 <= 0) OR ((1 <= p313) AND (1 <= p331)))))) : A (G (((p67 <= 0) OR (p373 <= 0) OR ((1 <= p24) AND (1 <= p281))))) : E (F ((((1 <= p105) AND (1 <= p373)) OR ((1 <= p347) AND (1 <= p362) AND (1 <= p34) AND (1 <= p281))))) : E (F ((((1 <= p82) AND (1 <= p373)) OR ((1 <= p44) AND (1 <= p281) AND (1 <= p244) AND (1 <= p260))))) : E (F (((1 <= p81) AND ((p240 <= 0)) AND (1 <= p373)))) : E (F (((1 <= p164) AND (1 <= p277) AND ((p356 <= 0) OR (((p132 <= 0)) AND ((p289 <= 0) OR (p371 <= 0))))))) : E (F (((1 <= p210) AND (1 <= p248)))) : A (G ((((p168 <= 0) OR (p277 <= 0)) AND ((p126 <= 0) OR (p277 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p64) AND (1 <= p373))))
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 <= p64) AND (1 <= p373))))
lola: processed formula length: 36
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 <= p64) AND (1 <= p373))
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
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 215768 markings, 238485 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p210) AND (1 <= p248))))
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 <= p210) AND (1 <= p248))))
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 <= p210) AND (1 <= p248))
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
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 245298 markings, 282436 edges
lola: ========================================
lola: subprocess 2 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p81) AND ((p240 <= 0)) AND (1 <= p373))))
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 <= p81) AND ((p240 <= 0)) AND (1 <= p373))))
lola: processed formula length: 54
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 <= p81) AND ((p240 <= 0)) AND (1 <= p373))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 152851 markings, 168411 edges
lola: ========================================
lola: subprocess 3 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p168 <= 0) OR (p277 <= 0)) AND ((p126 <= 0) OR (p277 <= 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 ((((p168 <= 0) OR (p277 <= 0)) AND ((p126 <= 0) OR (p277 <= 0)))))
lola: processed formula length: 73
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 <= p168) AND (1 <= p277)) OR ((1 <= p126) AND (1 <= p277)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 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: 10290 markings, 13248 edges
lola: ========================================
lola: subprocess 4 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p67 <= 0) OR (p373 <= 0) OR ((1 <= p24) AND (1 <= p281)))))
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 (((p67 <= 0) OR (p373 <= 0) OR ((1 <= p24) AND (1 <= p281)))))
lola: processed formula length: 69
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 <= p67) AND (1 <= p373) AND ((p24 <= 0) OR (p281 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 204665 markings, 226119 edges
lola: ========================================
lola: subprocess 5 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p164) AND (1 <= p277) AND ((p356 <= 0) OR (((p132 <= 0)) AND ((p289 <= 0) OR (p371 <= 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 <= p164) AND (1 <= p277) AND ((p356 <= 0) OR (((p132 <= 0)) AND ((p289 <= 0) OR (p371 <= 0)))))))
lola: processed formula length: 109
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 <= p164) AND (1 <= p277) AND ((p356 <= 0) OR (((p132 <= 0)) AND ((p289 <= 0) OR (p371 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 3 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.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14638 markings, 18468 edges
lola: ========================================
lola: subprocess 6 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p82) AND (1 <= p373)) OR ((1 <= p44) AND (1 <= p281) AND (1 <= p244) AND (1 <= p260)))))
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 <= p82) AND (1 <= p373)) OR ((1 <= p44) AND (1 <= p281) AND (1 <= p244) AND (1 <= p260)))))
lola: processed formula length: 103
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 <= p82) AND (1 <= p373)) OR ((1 <= p44) AND (1 <= p281) AND (1 <= p244) AND (1 <= p260)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 655217 markings, 1405329 edges, 131043 markings/sec, 0 secs
lola: sara is running 5 secs || 1290062 markings, 2795217 edges, 126969 markings/sec, 5 secs
lola: sara is running 10 secs || 1866516 markings, 4173010 edges, 115291 markings/sec, 10 secs
lola: sara is running 15 secs || 2467233 markings, 5543146 edges, 120143 markings/sec, 15 secs
lola: sara is running 20 secs || 3137761 markings, 6974747 edges, 134106 markings/sec, 20 secs
lola: sara is running 25 secs || 3800932 markings, 8404839 edges, 132634 markings/sec, 25 secs
lola: sara is running 30 secs || 4445839 markings, 9836606 edges, 128981 markings/sec, 30 secs
lola: sara is running 35 secs || 5083897 markings, 11263906 edges, 127612 markings/sec, 35 secs
lola: sara is running 40 secs || 5764934 markings, 12731151 edges, 136207 markings/sec, 40 secs
lola: sara is running 45 secs || 6447516 markings, 14172031 edges, 136516 markings/sec, 45 secs
lola: sara is running 50 secs || 7119567 markings, 15639856 edges, 134410 markings/sec, 50 secs
lola: sara is running 55 secs || 7779800 markings, 17070314 edges, 132047 markings/sec, 55 secs
lola: sara is running 60 secs || 8444134 markings, 18500325 edges, 132867 markings/sec, 60 secs
lola: sara is running 65 secs || 9131492 markings, 19981905 edges, 137472 markings/sec, 65 secs
lola: sara is running 70 secs || 9796333 markings, 21437407 edges, 132968 markings/sec, 70 secs
lola: sara is running 75 secs || 10454202 markings, 22903948 edges, 131574 markings/sec, 75 secs
lola: sara is running 80 secs || 11135477 markings, 24391735 edges, 136255 markings/sec, 80 secs
lola: sara is running 85 secs || 11801529 markings, 25816234 edges, 133210 markings/sec, 85 secs
lola: sara is running 90 secs || 12467963 markings, 27267262 edges, 133287 markings/sec, 90 secs
lola: sara is running 95 secs || 13080775 markings, 28715929 edges, 122562 markings/sec, 95 secs
lola: sara is running 100 secs || 13812638 markings, 30201239 edges, 146373 markings/sec, 100 secs
lola: sara is running 105 secs || 14454602 markings, 31657361 edges, 128393 markings/sec, 105 secs
lola: sara is running 110 secs || 15128011 markings, 33098230 edges, 134682 markings/sec, 110 secs
lola: sara is running 115 secs || 15762763 markings, 34539545 edges, 126950 markings/sec, 115 secs
lola: sara is running 120 secs || 16449554 markings, 36013738 edges, 137358 markings/sec, 120 secs
lola: sara is running 125 secs || 17101361 markings, 37480657 edges, 130361 markings/sec, 125 secs
lola: sara is running 130 secs || 17785639 markings, 38914860 edges, 136856 markings/sec, 130 secs
lola: sara is running 135 secs || 18437351 markings, 40360189 edges, 130342 markings/sec, 135 secs
lola: sara is running 140 secs || 19078005 markings, 41812978 edges, 128131 markings/sec, 140 secs
lola: sara is running 145 secs || 19776506 markings, 43304255 edges, 139700 markings/sec, 145 secs
lola: sara is running 150 secs || 20430656 markings, 44734207 edges, 130830 markings/sec, 150 secs
lola: sara is running 155 secs || 21095033 markings, 46177039 edges, 132875 markings/sec, 155 secs
lola: sara is running 160 secs || 21714601 markings, 47617897 edges, 123914 markings/sec, 160 secs
lola: sara is running 165 secs || 22428708 markings, 49101130 edges, 142821 markings/sec, 165 secs
lola: sara is running 170 secs || 23070410 markings, 50555967 edges, 128340 markings/sec, 170 secs
lola: sara is running 175 secs || 23758690 markings, 52007293 edges, 137656 markings/sec, 175 secs
lola: sara is running 180 secs || 24394843 markings, 53447721 edges, 127231 markings/sec, 180 secs
lola: sara is running 185 secs || 25068776 markings, 54902366 edges, 134787 markings/sec, 185 secs
lola: sara is running 190 secs || 25796699 markings, 56378242 edges, 145585 markings/sec, 190 secs
lola: sara is running 195 secs || 26455773 markings, 57821509 edges, 131815 markings/sec, 195 secs
lola: sara is running 200 secs || 27127478 markings, 59268725 edges, 134341 markings/sec, 200 secs
lola: sara is running 205 secs || 27765032 markings, 60685138 edges, 127511 markings/sec, 205 secs
lola: sara is running 210 secs || 28400381 markings, 62120118 edges, 127070 markings/sec, 210 secs
lola: sara is running 215 secs || 29091027 markings, 63580774 edges, 138129 markings/sec, 215 secs
lola: sara is running 220 secs || 29736896 markings, 65039135 edges, 129174 markings/sec, 220 secs
lola: sara is running 225 secs || 30403213 markings, 66472913 edges, 133263 markings/sec, 225 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31102315 markings, 67913343 edges
lola: sara is running 230 secs || 31102315 markings, 67913343 edges, 139820 markings/sec, 230 secs
lola: ========================================
lola: subprocess 7 will run for 1663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p105) AND (1 <= p373)) OR ((1 <= p347) AND (1 <= p362) AND (1 <= p34) AND (1 <= p281)))))
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 <= p105) AND (1 <= p373)) OR ((1 <= p347) AND (1 <= p362) AND (1 <= p34) AND (1 <= p281)))))
lola: processed formula length: 104
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 <= p105) AND (1 <= p373)) OR ((1 <= p347) AND (1 <= p362) AND (1 <= p34) AND (1 <= p281)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 188045 markings, 307763 edges
lola: ========================================
lola: subprocess 8 will run for 3324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p163) AND (1 <= p277) AND ((p222 <= 0) OR (p248 <= 0) OR (p81 <= 0) OR (p373 <= 0)) AND ((p242 <= 0) OR ((1 <= p313) AND (1 <= p331))))))
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 <= p277) AND ((p222 <= 0) OR (p248 <= 0) OR (p81 <= 0) OR (p373 <= 0)) AND ((p242 <= 0) OR ((1 <= p313) AND (1 <= p331))))))
lola: processed formula length: 154
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 <= p277) AND ((p222 <= 0) OR (p248 <= 0) OR (p81 <= 0) OR (p373 <= 0)) AND ((p242 <= 0) OR ((1 <= p313) AND (1 <= p331))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15725 markings, 19773 edges
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes yes yes no
lola:
preliminary result: yes yes no yes yes yes yes yes no
lola: ========================================
lola: memory consumption: 33388 KB
lola: time consumption: 246 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-60b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is DES-PT-60b, 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 r075-tall-162039097200080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b 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 ;