Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900000311.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-50a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 2.7K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 97K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591196663807

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:04:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:04:27] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2020-06-03 15:04:27] [INFO ] Transformed 314 places.
[2020-06-03 15:04:27] [INFO ] Transformed 271 transitions.
[2020-06-03 15:04:27] [INFO ] Found NUPN structural information;
[2020-06-03 15:04:27] [INFO ] Parsed PT model containing 314 places and 271 transitions in 222 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 228 resets, run finished after 170 ms. (steps per millisecond=58 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0]
FORMULA DES-PT-50a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 257 rows 314 cols
[2020-06-03 15:04:28] [INFO ] Computed 59 place invariants in 49 ms
[2020-06-03 15:04:28] [INFO ] [Real]Absence check using 34 positive place invariants in 61 ms returned unsat
[2020-06-03 15:04:28] [INFO ] [Real]Absence check using 34 positive place invariants in 80 ms returned sat
[2020-06-03 15:04:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 15:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:29] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2020-06-03 15:04:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:04:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 109 ms returned sat
[2020-06-03 15:04:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 15:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:30] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2020-06-03 15:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 15:04:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 15:04:31] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 56 ms.
[2020-06-03 15:04:34] [INFO ] Added : 209 causal constraints over 43 iterations in 3228 ms. Result :sat
[2020-06-03 15:04:34] [INFO ] Deduced a trap composed of 13 places in 246 ms
[2020-06-03 15:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 15:04:34] [INFO ] [Real]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:04:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 195 ms returned sat
[2020-06-03 15:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:35] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2020-06-03 15:04:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:04:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 15:04:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 99 ms returned sat
[2020-06-03 15:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:37] [INFO ] [Nat]Absence check using state equation in 941 ms returned sat
[2020-06-03 15:04:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 15:04:37] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 52 ms.
[2020-06-03 15:04:38] [INFO ] Added : 100 causal constraints over 20 iterations in 1651 ms. Result :sat
[2020-06-03 15:04:39] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-06-03 15:04:39] [INFO ] Deduced a trap composed of 9 places in 153 ms
[2020-06-03 15:04:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 15:04:39] [INFO ] [Real]Absence check using 34 positive place invariants in 155 ms returned sat
[2020-06-03 15:04:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 93 ms returned sat
[2020-06-03 15:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:39] [INFO ] [Real]Absence check using state equation in 131 ms returned unsat
[2020-06-03 15:04:40] [INFO ] [Real]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:04:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 65 ms returned sat
[2020-06-03 15:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:41] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2020-06-03 15:04:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:04:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 15:04:41] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 138 ms returned sat
[2020-06-03 15:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:43] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2020-06-03 15:04:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 15:04:43] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 69 ms.
[2020-06-03 15:04:45] [INFO ] Added : 163 causal constraints over 34 iterations in 2408 ms. Result :sat
[2020-06-03 15:04:45] [INFO ] Deduced a trap composed of 9 places in 139 ms
[2020-06-03 15:04:45] [INFO ] Deduced a trap composed of 11 places in 151 ms
[2020-06-03 15:04:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 15:04:46] [INFO ] [Real]Absence check using 34 positive place invariants in 63 ms returned sat
[2020-06-03 15:04:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2020-06-03 15:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:47] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2020-06-03 15:04:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:04:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:04:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 85 ms returned sat
[2020-06-03 15:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:48] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2020-06-03 15:04:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2020-06-03 15:04:48] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 37 ms.
[2020-06-03 15:04:50] [INFO ] Added : 141 causal constraints over 29 iterations in 1970 ms. Result :sat
[2020-06-03 15:04:50] [INFO ] Deduced a trap composed of 12 places in 150 ms
[2020-06-03 15:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 15:04:51] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 15:04:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 15:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:52] [INFO ] [Real]Absence check using state equation in 521 ms returned unsat
[2020-06-03 15:04:52] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 15:04:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 62 ms returned sat
[2020-06-03 15:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:04:57] [INFO ] [Real]Absence check using state equation in 4830 ms returned (error "Failed to check-sat")
[2020-06-03 15:04:57] [INFO ] [Real]Absence check using 34 positive place invariants in 73 ms returned sat
[2020-06-03 15:04:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 112 ms returned sat
[2020-06-03 15:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:04:59] [INFO ] [Real]Absence check using state equation in 1529 ms returned sat
[2020-06-03 15:04:59] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:04:59] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 41 ms.
[2020-06-03 15:04:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:04:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 49 ms returned sat
[2020-06-03 15:04:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 198 ms returned sat
[2020-06-03 15:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:01] [INFO ] [Nat]Absence check using state equation in 1335 ms returned sat
[2020-06-03 15:05:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:05:01] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 77 ms.
[2020-06-03 15:05:02] [INFO ] Added : 89 causal constraints over 19 iterations in 1695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-03 15:05:03] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 15:05:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 15:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:04] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2020-06-03 15:05:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:05:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-06-03 15:05:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 224 ms returned sat
[2020-06-03 15:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:06] [INFO ] [Nat]Absence check using state equation in 1386 ms returned sat
[2020-06-03 15:05:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:05:06] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 41 ms.
[2020-06-03 15:05:08] [INFO ] Added : 182 causal constraints over 37 iterations in 2366 ms. Result :sat
[2020-06-03 15:05:08] [INFO ] Deduced a trap composed of 16 places in 145 ms
[2020-06-03 15:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-06-03 15:05:09] [INFO ] [Real]Absence check using 34 positive place invariants in 80 ms returned sat
[2020-06-03 15:05:09] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 91 ms returned sat
[2020-06-03 15:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:10] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2020-06-03 15:05:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:05:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 157 ms returned sat
[2020-06-03 15:05:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 108 ms returned sat
[2020-06-03 15:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:11] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2020-06-03 15:05:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 15:05:12] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 25 ms.
[2020-06-03 15:05:14] [INFO ] Added : 209 causal constraints over 43 iterations in 2897 ms. Result :sat
[2020-06-03 15:05:15] [INFO ] Deduced a trap composed of 13 places in 264 ms
[2020-06-03 15:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 15:05:15] [INFO ] [Real]Absence check using 34 positive place invariants in 56 ms returned sat
[2020-06-03 15:05:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 86 ms returned sat
[2020-06-03 15:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:16] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2020-06-03 15:05:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:05:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 56 ms returned sat
[2020-06-03 15:05:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 247 ms returned sat
[2020-06-03 15:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:05:18] [INFO ] [Nat]Absence check using state equation in 1595 ms returned sat
[2020-06-03 15:05:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:05:18] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 37 ms.
[2020-06-03 15:05:21] [INFO ] Added : 214 causal constraints over 43 iterations in 2619 ms. Result :sat
[2020-06-03 15:05:21] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2020-06-03 15:05:21] [INFO ] Deduced a trap composed of 9 places in 132 ms
[2020-06-03 15:05:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:05:22] [INFO ] Deduced a trap composed of 3 places in 363 ms
[2020-06-03 15:05: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 (> (+ s0 s241 s242) 0)") while checking expression at index 11
FORMULA DES-PT-50a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 263400 steps, including 6643 resets, run finished after 1468 ms. (steps per millisecond=179 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 1, 0] could not realise parikh vector
FORMULA DES-PT-50a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 189900 steps, including 4592 resets, run finished after 879 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 104100 steps, including 2354 resets, run finished after 564 ms. (steps per millisecond=184 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 116400 steps, including 2657 resets, run finished after 555 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 183200 steps, including 4376 resets, run finished after 795 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 92000 steps, including 2109 resets, run finished after 424 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 263400 steps, including 6638 resets, run finished after 1106 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 42 out of 314 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 314 transition count 256
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 314 transition count 256
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 313 transition count 255
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 313 transition count 255
Applied a total of 8 rules in 218 ms. Remains 313 /314 variables (removed 1) and now considering 255/257 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/314 places, 255/257 transitions.
Incomplete random walk after 1000000 steps, including 22064 resets, run finished after 4588 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4267 resets, run finished after 2014 ms. (steps per millisecond=496 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4259 resets, run finished after 2659 ms. (steps per millisecond=376 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4284 resets, run finished after 2033 ms. (steps per millisecond=491 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8331 resets, run finished after 2642 ms. (steps per millisecond=378 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7518 resets, run finished after 2874 ms. (steps per millisecond=347 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3969 resets, run finished after 2641 ms. (steps per millisecond=378 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8344 resets, run finished after 2369 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8469538 steps, run timeout after 30001 ms. (steps per millisecond=282 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8469538 steps, saw 957285 distinct states, run finished after 30001 ms. (steps per millisecond=282 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 313 cols
[2020-06-03 15:06:19] [INFO ] Computed 60 place invariants in 25 ms
[2020-06-03 15:06:20] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 15:06:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:20] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-06-03 15:06:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 65 ms returned sat
[2020-06-03 15:06:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 221 ms returned sat
[2020-06-03 15:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:22] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2020-06-03 15:06:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 15:06:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:06:22] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 34 ms.
[2020-06-03 15:06:24] [INFO ] Added : 121 causal constraints over 25 iterations in 1993 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 15:06:24] [INFO ] [Real]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-06-03 15:06:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2020-06-03 15:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:26] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2020-06-03 15:06:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-06-03 15:06:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2020-06-03 15:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:27] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2020-06-03 15:06:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 24 ms returned sat
[2020-06-03 15:06:27] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 30 ms.
[2020-06-03 15:06:30] [INFO ] Added : 157 causal constraints over 32 iterations in 2575 ms. Result :sat
[2020-06-03 15:06:30] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-06-03 15:06:30] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2020-06-03 15:06:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 15:06:30] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 15:06:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 15:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:31] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2020-06-03 15:06:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 15:06:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2020-06-03 15:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:33] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2020-06-03 15:06:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2020-06-03 15:06:33] [INFO ] Deduced a trap composed of 13 places in 121 ms
[2020-06-03 15:06:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2020-06-03 15:06:33] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 29 ms.
[2020-06-03 15:06:35] [INFO ] Added : 120 causal constraints over 24 iterations in 2028 ms. Result :sat
[2020-06-03 15:06:35] [INFO ] Deduced a trap composed of 9 places in 140 ms
[2020-06-03 15:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 15:06:35] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 15:06:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2020-06-03 15:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:37] [INFO ] [Real]Absence check using state equation in 1787 ms returned sat
[2020-06-03 15:06:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 15:06:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 164 ms returned sat
[2020-06-03 15:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:39] [INFO ] [Nat]Absence check using state equation in 1699 ms returned sat
[2020-06-03 15:06:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 45 ms returned sat
[2020-06-03 15:06:39] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 37 ms.
[2020-06-03 15:06:41] [INFO ] Added : 133 causal constraints over 27 iterations in 2256 ms. Result :sat
[2020-06-03 15:06:42] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-06-03 15:06:42] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-06-03 15:06:42] [INFO ] Deduced a trap composed of 23 places in 168 ms
[2020-06-03 15:06:43] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2020-06-03 15:06:43] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-06-03 15:06:43] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-06-03 15:06:43] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-06-03 15:06:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1806 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 15:06:43] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 15:06:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 46 ms returned sat
[2020-06-03 15:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:45] [INFO ] [Real]Absence check using state equation in 1104 ms returned sat
[2020-06-03 15:06:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-06-03 15:06:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2020-06-03 15:06:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:46] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2020-06-03 15:06:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:06:46] [INFO ] Deduced a trap composed of 10 places in 113 ms
[2020-06-03 15:06:46] [INFO ] Deduced a trap composed of 12 places in 113 ms
[2020-06-03 15:06:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2020-06-03 15:06:46] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 29 ms.
[2020-06-03 15:06:47] [INFO ] Added : 88 causal constraints over 18 iterations in 1339 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 15:06:48] [INFO ] [Real]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 15:06:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 48 ms returned sat
[2020-06-03 15:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:49] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2020-06-03 15:06:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 15:06:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2020-06-03 15:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:50] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2020-06-03 15:06:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 25 ms returned sat
[2020-06-03 15:06:50] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 35 ms.
[2020-06-03 15:06:53] [INFO ] Added : 176 causal constraints over 36 iterations in 2652 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 15:06:53] [INFO ] [Real]Absence check using 36 positive place invariants in 69 ms returned sat
[2020-06-03 15:06:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2020-06-03 15:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:54] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2020-06-03 15:06:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:06:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 15:06:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2020-06-03 15:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:06:56] [INFO ] [Nat]Absence check using state equation in 1528 ms returned sat
[2020-06-03 15:06:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 19 ms returned sat
[2020-06-03 15:06:56] [INFO ] Computed and/alt/rep : 254/1213/254 causal constraints in 46 ms.
[2020-06-03 15:07:01] [INFO ] Added : 213 causal constraints over 43 iterations in 4292 ms. Result :sat
[2020-06-03 15:07:01] [INFO ] Deduced a trap composed of 16 places in 186 ms
[2020-06-03 15:07:01] [INFO ] Deduced a trap composed of 18 places in 130 ms
[2020-06-03 15:07:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
Incomplete Parikh walk after 186500 steps, including 5047 resets, run finished after 826 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 132400 steps, including 3330 resets, run finished after 592 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 90600 steps, including 2117 resets, run finished after 466 ms. (steps per millisecond=194 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 138000 steps, including 3703 resets, run finished after 684 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 93000 steps, including 2703 resets, run finished after 426 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 139100 steps, including 3474 resets, run finished after 643 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 156700 steps, including 3983 resets, run finished after 755 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 42 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 45 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 45 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 313 cols
[2020-06-03 15:07:06] [INFO ] Computed 60 place invariants in 18 ms
[2020-06-03 15:07:07] [INFO ] Implicit Places using invariants in 1589 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1592 ms to find 1 implicit places.
[2020-06-03 15:07:07] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:07:07] [INFO ] Computed 59 place invariants in 29 ms
[2020-06-03 15:07:09] [INFO ] Dead Transitions using invariants and state equation in 1370 ms returned []
Starting structural reductions, iteration 1 : 312/313 places, 255/255 transitions.
Applied a total of 0 rules in 26 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2020-06-03 15:07:09] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:07:09] [INFO ] Computed 59 place invariants in 15 ms
[2020-06-03 15:07:11] [INFO ] Dead Transitions using invariants and state equation in 2067 ms returned []
Finished structural reductions, in 2 iterations. Remains : 312/313 places, 255/255 transitions.
Incomplete random walk after 1000000 steps, including 22236 resets, run finished after 4358 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4288 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4341 resets, run finished after 2412 ms. (steps per millisecond=414 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4233 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8354 resets, run finished after 2800 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7502 resets, run finished after 2710 ms. (steps per millisecond=369 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3989 resets, run finished after 2663 ms. (steps per millisecond=375 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8357 resets, run finished after 2358 ms. (steps per millisecond=424 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8345854 steps, run timeout after 30001 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8345854 steps, saw 944663 distinct states, run finished after 30002 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:08:02] [INFO ] Computed 59 place invariants in 12 ms
[2020-06-03 15:08:02] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 15:08:02] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 35 ms returned sat
[2020-06-03 15:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:03] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2020-06-03 15:08:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 15:08:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 113 ms returned sat
[2020-06-03 15:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:05] [INFO ] [Nat]Absence check using state equation in 1456 ms returned sat
[2020-06-03 15:08:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 15:08:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2020-06-03 15:08:05] [INFO ] Deduced a trap composed of 13 places in 220 ms
[2020-06-03 15:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2020-06-03 15:08:05] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 28 ms.
[2020-06-03 15:08:07] [INFO ] Added : 82 causal constraints over 17 iterations in 1470 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 15:08:07] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:08:07] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 64 ms returned sat
[2020-06-03 15:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:08] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2020-06-03 15:08:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2020-06-03 15:08:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 489 ms returned sat
[2020-06-03 15:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:11] [INFO ] [Nat]Absence check using state equation in 1835 ms returned sat
[2020-06-03 15:08:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 38 ms returned sat
[2020-06-03 15:08:11] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 97 ms.
[2020-06-03 15:08:14] [INFO ] Added : 142 causal constraints over 29 iterations in 3095 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-06-03 15:08:14] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 15:08:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 15:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:15] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2020-06-03 15:08:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 113 ms returned sat
[2020-06-03 15:08:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 199 ms returned sat
[2020-06-03 15:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:17] [INFO ] [Nat]Absence check using state equation in 1372 ms returned sat
[2020-06-03 15:08:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:08:17] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 114 ms.
[2020-06-03 15:08:20] [INFO ] Added : 132 causal constraints over 27 iterations in 2659 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 15:08:20] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 15:08:20] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 78 ms returned sat
[2020-06-03 15:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:23] [INFO ] [Real]Absence check using state equation in 2918 ms returned sat
[2020-06-03 15:08:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 15:08:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 130 ms returned sat
[2020-06-03 15:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:25] [INFO ] [Nat]Absence check using state equation in 2395 ms returned sat
[2020-06-03 15:08:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2020-06-03 15:08:26] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 29 ms.
[2020-06-03 15:08:27] [INFO ] Added : 113 causal constraints over 23 iterations in 1983 ms. Result :sat
[2020-06-03 15:08:28] [INFO ] Deduced a trap composed of 16 places in 171 ms
[2020-06-03 15:08:29] [INFO ] Deduced a trap composed of 23 places in 1118 ms
[2020-06-03 15:08:29] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2020-06-03 15:08:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1696 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-03 15:08:29] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 15:08:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 15:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:30] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2020-06-03 15:08:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 15:08:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 49 ms returned sat
[2020-06-03 15:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:31] [INFO ] [Nat]Absence check using state equation in 841 ms returned sat
[2020-06-03 15:08:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 27 ms returned sat
[2020-06-03 15:08:32] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 36 ms.
[2020-06-03 15:08:33] [INFO ] Added : 88 causal constraints over 18 iterations in 1720 ms. Result :sat
[2020-06-03 15:08:33] [INFO ] Deduced a trap composed of 10 places in 117 ms
[2020-06-03 15:08:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 15:08:34] [INFO ] [Real]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 15:08:34] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 57 ms returned sat
[2020-06-03 15:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:35] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2020-06-03 15:08:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:08:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 102 ms returned sat
[2020-06-03 15:08:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:36] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2020-06-03 15:08:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2020-06-03 15:08:36] [INFO ] Deduced a trap composed of 16 places in 202 ms
[2020-06-03 15:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2020-06-03 15:08:36] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 28 ms.
[2020-06-03 15:08:39] [INFO ] Added : 184 causal constraints over 37 iterations in 2612 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 15:08:39] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:08:39] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 40 ms returned sat
[2020-06-03 15:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:40] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2020-06-03 15:08:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:08:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 15:08:40] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 127 ms returned sat
[2020-06-03 15:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:08:41] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2020-06-03 15:08:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:08:42] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-03 15:08:42] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2020-06-03 15:08:42] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-06-03 15:08:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 498 ms
[2020-06-03 15:08:42] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 30 ms.
[2020-06-03 15:08:45] [INFO ] Added : 212 causal constraints over 43 iterations in 2716 ms. Result :sat
[2020-06-03 15:08:46] [INFO ] Deduced a trap composed of 11 places in 819 ms
[2020-06-03 15:08:46] [INFO ] Deduced a trap composed of 19 places in 212 ms
[2020-06-03 15:08:46] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-06-03 15:08:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1420 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 197700 steps, including 5347 resets, run finished after 882 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 202600 steps, including 5508 resets, run finished after 912 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 88700 steps, including 1950 resets, run finished after 390 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 72900 steps, including 1709 resets, run finished after 368 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 89500 steps, including 2024 resets, run finished after 417 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 106800 steps, including 2526 resets, run finished after 475 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 32000 steps, including 601 resets, run finished after 150 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 42 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 23 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 255/255 transitions.
Starting structural reductions, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 23 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:08:50] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 15:08:51] [INFO ] Implicit Places using invariants in 1248 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:08:51] [INFO ] Computed 59 place invariants in 12 ms
[2020-06-03 15:08:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 15:08:58] [INFO ] Implicit Places using invariants and state equation in 7105 ms returned []
Implicit Place search using SMT with State Equation took 8355 ms to find 0 implicit places.
[2020-06-03 15:08:58] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:08:58] [INFO ] Computed 59 place invariants in 12 ms
[2020-06-03 15:09:00] [INFO ] Dead Transitions using invariants and state equation in 1652 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 255/255 transitions.
Incomplete random walk after 100000 steps, including 2223 resets, run finished after 428 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:09:00] [INFO ] Computed 59 place invariants in 6 ms
[2020-06-03 15:09:00] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 15:09:00] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 35 ms returned sat
[2020-06-03 15:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:01] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2020-06-03 15:09:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 15:09:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 174 ms returned sat
[2020-06-03 15:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:03] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2020-06-03 15:09:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 15:09:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-06-03 15:09:03] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2020-06-03 15:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2020-06-03 15:09:03] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 28 ms.
[2020-06-03 15:09:04] [INFO ] Added : 82 causal constraints over 17 iterations in 1305 ms. Result :sat
[2020-06-03 15:09:04] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 15:09:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 51 ms returned sat
[2020-06-03 15:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:06] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2020-06-03 15:09:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 74 ms returned sat
[2020-06-03 15:09:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 553 ms returned sat
[2020-06-03 15:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:08] [INFO ] [Nat]Absence check using state equation in 1537 ms returned sat
[2020-06-03 15:09:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 15:09:08] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 41 ms.
[2020-06-03 15:09:11] [INFO ] Added : 142 causal constraints over 29 iterations in 2320 ms. Result :sat
[2020-06-03 15:09:11] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 15:09:11] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:13] [INFO ] [Real]Absence check using state equation in 1740 ms returned sat
[2020-06-03 15:09:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 63 ms returned sat
[2020-06-03 15:09:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 208 ms returned sat
[2020-06-03 15:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:15] [INFO ] [Nat]Absence check using state equation in 1767 ms returned sat
[2020-06-03 15:09:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:09:15] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 94 ms.
[2020-06-03 15:09:17] [INFO ] Added : 132 causal constraints over 27 iterations in 2359 ms. Result :sat
[2020-06-03 15:09:18] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 15:09:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2020-06-03 15:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:20] [INFO ] [Real]Absence check using state equation in 2316 ms returned sat
[2020-06-03 15:09:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 179 ms returned sat
[2020-06-03 15:09:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 219 ms returned sat
[2020-06-03 15:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:23] [INFO ] [Nat]Absence check using state equation in 2166 ms returned sat
[2020-06-03 15:09:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-06-03 15:09:23] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 62 ms.
[2020-06-03 15:09:25] [INFO ] Added : 113 causal constraints over 23 iterations in 2325 ms. Result :sat
[2020-06-03 15:09:25] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-06-03 15:09:25] [INFO ] Deduced a trap composed of 23 places in 112 ms
[2020-06-03 15:09:25] [INFO ] Deduced a trap composed of 17 places in 101 ms
[2020-06-03 15:09:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 601 ms
[2020-06-03 15:09:26] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:09:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 15:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:27] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2020-06-03 15:09:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 62 ms returned sat
[2020-06-03 15:09:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 128 ms returned sat
[2020-06-03 15:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:29] [INFO ] [Nat]Absence check using state equation in 1818 ms returned sat
[2020-06-03 15:09:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 40 ms returned sat
[2020-06-03 15:09:29] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 90 ms.
[2020-06-03 15:09:31] [INFO ] Added : 88 causal constraints over 18 iterations in 2100 ms. Result :sat
[2020-06-03 15:09:31] [INFO ] Deduced a trap composed of 10 places in 194 ms
[2020-06-03 15:09:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2020-06-03 15:09:32] [INFO ] [Real]Absence check using 35 positive place invariants in 183 ms returned sat
[2020-06-03 15:09:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 105 ms returned sat
[2020-06-03 15:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:33] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2020-06-03 15:09:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:09:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 97 ms returned sat
[2020-06-03 15:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:35] [INFO ] [Nat]Absence check using state equation in 1612 ms returned sat
[2020-06-03 15:09:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2020-06-03 15:09:35] [INFO ] Deduced a trap composed of 16 places in 157 ms
[2020-06-03 15:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2020-06-03 15:09:35] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 31 ms.
[2020-06-03 15:09:38] [INFO ] Added : 184 causal constraints over 37 iterations in 2469 ms. Result :sat
[2020-06-03 15:09:38] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:09:38] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 41 ms returned sat
[2020-06-03 15:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:39] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2020-06-03 15:09:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 15:09:39] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 120 ms returned sat
[2020-06-03 15:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:40] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2020-06-03 15:09:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:09:40] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-03 15:09:40] [INFO ] Deduced a trap composed of 18 places in 119 ms
[2020-06-03 15:09:41] [INFO ] Deduced a trap composed of 18 places in 109 ms
[2020-06-03 15:09:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 514 ms
[2020-06-03 15:09:41] [INFO ] Computed and/alt/rep : 254/1210/254 causal constraints in 33 ms.
[2020-06-03 15:09:43] [INFO ] Added : 212 causal constraints over 43 iterations in 2770 ms. Result :sat
[2020-06-03 15:09:44] [INFO ] Deduced a trap composed of 11 places in 133 ms
[2020-06-03 15:09:44] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2020-06-03 15:09:44] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-06-03 15:09:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 562 ms
Applied a total of 0 rules in 34 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:09:44] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 15:09:44] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2020-06-03 15:09:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 61 ms returned sat
[2020-06-03 15:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:45] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2020-06-03 15:09:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 15:09:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 117 ms returned sat
[2020-06-03 15:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:46] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2020-06-03 15:09:47] [INFO ] Deduced a trap composed of 13 places in 257 ms
[2020-06-03 15:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2020-06-03 15:09:47] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 31 ms.
[2020-06-03 15:09:48] [INFO ] Added : 97 causal constraints over 20 iterations in 1548 ms. Result :sat
[2020-06-03 15:09:48] [INFO ] Deduced a trap composed of 12 places in 251 ms
[2020-06-03 15:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-03 15:09:49] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 15:09:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 51 ms returned sat
[2020-06-03 15:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:51] [INFO ] [Real]Absence check using state equation in 1849 ms returned sat
[2020-06-03 15:09:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 163 ms returned sat
[2020-06-03 15:09:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 518 ms returned sat
[2020-06-03 15:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:53] [INFO ] [Nat]Absence check using state equation in 1824 ms returned sat
[2020-06-03 15:09:53] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 77 ms.
[2020-06-03 15:09:56] [INFO ] Added : 138 causal constraints over 28 iterations in 2215 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 15:09:56] [INFO ] [Real]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 15:09:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 15:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:57] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2020-06-03 15:09:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:09:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-06-03 15:09:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 132 ms returned sat
[2020-06-03 15:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:09:58] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2020-06-03 15:09:58] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 35 ms.
[2020-06-03 15:10:00] [INFO ] Added : 129 causal constraints over 26 iterations in 1579 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-03 15:10:00] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-06-03 15:10:00] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2020-06-03 15:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:03] [INFO ] [Real]Absence check using state equation in 2584 ms returned sat
[2020-06-03 15:10:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:10:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 15:10:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 125 ms returned sat
[2020-06-03 15:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:05] [INFO ] [Nat]Absence check using state equation in 1841 ms returned sat
[2020-06-03 15:10:05] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 33 ms.
[2020-06-03 15:10:07] [INFO ] Added : 113 causal constraints over 23 iterations in 2375 ms. Result :sat
[2020-06-03 15:10:08] [INFO ] Deduced a trap composed of 16 places in 151 ms
[2020-06-03 15:10:08] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2020-06-03 15:10:08] [INFO ] Deduced a trap composed of 17 places in 131 ms
[2020-06-03 15:10:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 657 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-03 15:10:08] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:10:08] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 41 ms returned sat
[2020-06-03 15:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:09] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2020-06-03 15:10:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:10:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 15:10:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2020-06-03 15:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:10] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2020-06-03 15:10:10] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 32 ms.
[2020-06-03 15:10:11] [INFO ] Added : 88 causal constraints over 18 iterations in 1039 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 15:10:11] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 15:10:11] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2020-06-03 15:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:12] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2020-06-03 15:10:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:10:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 15:10:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 105 ms returned sat
[2020-06-03 15:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:14] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2020-06-03 15:10:14] [INFO ] Deduced a trap composed of 16 places in 205 ms
[2020-06-03 15:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2020-06-03 15:10:14] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 32 ms.
[2020-06-03 15:10:16] [INFO ] Added : 178 causal constraints over 36 iterations in 2534 ms. Result :sat
[2020-06-03 15:10:17] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-06-03 15:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 15:10:17] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2020-06-03 15:10:17] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 44 ms returned sat
[2020-06-03 15:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:18] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2020-06-03 15:10:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:10:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 15:10:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 115 ms returned sat
[2020-06-03 15:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:10:20] [INFO ] [Nat]Absence check using state equation in 1379 ms returned sat
[2020-06-03 15:10:20] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-03 15:10:20] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2020-06-03 15:10:20] [INFO ] Deduced a trap composed of 18 places in 138 ms
[2020-06-03 15:10:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 515 ms
[2020-06-03 15:10:20] [INFO ] Computed and/alt/rep : 254/1206/254 causal constraints in 32 ms.
[2020-06-03 15:10:23] [INFO ] Added : 213 causal constraints over 43 iterations in 2860 ms. Result :sat
[2020-06-03 15:10:23] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2020-06-03 15:10:23] [INFO ] Deduced a trap composed of 17 places in 94 ms
[2020-06-03 15:10:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 15:10:24] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2020-06-03 15:10:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-03 15:10:24] [INFO ] Flatten gal took : 181 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-50a @ 3570 seconds

FORMULA DES-PT-50a-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DES-PT-50a-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA DES-PT-50a-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for ReachabilityFireability @ DES-PT-50a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 15:10:25 2020
",
"timelimit": 3570
},
"child":
[

{
"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": 0,
"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 <= p46) AND (1 <= p231) AND (1 <= p233))))",
"processed_size": 52,
"rewrites": 1
},
"result":
{
"edges": 237,
"markings": 238,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 <= p34) AND (1 <= p231) AND (1 <= p233))))",
"processed_size": 52,
"rewrites": 1
},
"result":
{
"edges": 813,
"markings": 814,
"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": 3,
"problems": 3
},
"type": "reachability",
"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": 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": "A (G (((p167 <= 0) OR (p204 <= 0) OR ((1 <= p264) AND (1 <= p280)) OR ((1 <= p146) AND (1 <= p228)))))",
"processed_size": 105,
"rewrites": 2
},
"result":
{
"edges": 1783,
"markings": 1726,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"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": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p74) AND (1 <= p307) AND ((p181 <= 0) OR (p204 <= 0)) AND ((p184 <= 0) OR (p204 <= 0)) AND ((p264 <= 0) OR (p280 <= 0) OR (p126 <= 0) OR (p228 <= 0) OR ((1 <= p91))))))",
"processed_size": 187,
"rewrites": 1
},
"result":
{
"edges": 32900,
"markings": 27730,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 100,
"problems": 20
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p31 <= 0) OR (p231 <= 0) OR (p233 <= 0) OR ((1 <= p107) AND (1 <= p228)) OR ((1 <= p294) AND (1 <= p308) AND (1 <= p42) AND (1 <= p231) AND (1 <= p233) AND (1 <= p136) AND (1 <= p228) AND (1 <= p33)))))",
"processed_size": 214,
"rewrites": 2
},
"result":
{
"edges": 957,
"markings": 958,
"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": 60,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p190) AND (1 <= p204) AND ((p2 <= 0) OR (p231 <= 0) OR (p233 <= 0)) AND ((p143 <= 0) OR (p228 <= 0)) AND ((p287 <= 0) OR (p289 <= 0) OR (p309 <= 0) OR (p311 <= 0)))))",
"processed_size": 185,
"rewrites": 1
},
"result":
{
"edges": 427,
"markings": 416,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p124) AND (1 <= p228) AND (1 <= p1) AND (1 <= p231) AND (1 <= p233) AND ((p215 <= 0) OR (p234 <= 0) OR (p239 <= 0) OR (p241 <= 0) OR (p243 <= 0) OR (p245 <= 0) OR (p247 <= 0) OR (p249 <= 0) OR (p251 <= 0) OR (p253 <= 0)))))",
"processed_size": 245,
"rewrites": 1
},
"result":
{
"edges": 89813,
"markings": 78682,
"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": 60,
"problems": 10
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 40732,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1253,
"conflict_clusters": 42,
"places": 312,
"places_significant": 253,
"singleton_clusters": 0,
"transitions": 255
},
"result":
{
"preliminary_value": "yes no yes yes yes yes no ",
"value": "yes no 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: 567/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 312
lola: finding significant places
lola: 312 places, 255 transitions, 253 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: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: E (F (((1 <= p46) AND (1 <= p231) AND (1 <= p233)))) : A (G (((p31 <= 0) OR (p231 <= 0) OR (p233 <= 0) OR ((1 <= p107) AND (1 <= p228)) OR ((1 <= p294) AND (1 <= p308) AND (1 <= p42) AND (1 <= p231) AND (1 <= p233) AND (1 <= p136) AND (1 <= p228) AND (1 <= p33))))) : E (F (((1 <= p34) AND (1 <= p231) AND (1 <= p233)))) : E (F (((1 <= p190) AND (1 <= p204) AND ((p2 <= 0) OR (p231 <= 0) OR (p233 <= 0)) AND ((p143 <= 0) OR (p228 <= 0)) AND ((p287 <= 0) OR (p289 <= 0) OR (p309 <= 0) OR (p311 <= 0))))) : E (F (((1 <= p124) AND (1 <= p228) AND (1 <= p1) AND (1 <= p231) AND (1 <= p233) AND ((p215 <= 0) OR (p234 <= 0) OR (p239 <= 0) OR (p241 <= 0) OR (p243 <= 0) OR (p245 <= 0) OR (p247 <= 0) OR (p249 <= 0) OR (p251 <= 0) OR (p253 <= 0))))) : E (F (((1 <= p74) AND (1 <= p307) AND ((p181 <= 0) OR (p204 <= 0)) AND ((p184 <= 0) OR (p204 <= 0)) AND ((p264 <= 0) OR (p280 <= 0) OR (p126 <= 0) OR (p228 <= 0) OR ((1 <= p91)))))) : A (G (((p167 <= 0) OR (p204 <= 0) OR ((1 <= p264) AND (1 <= p280)) OR ((1 <= p146) AND (1 <= p228)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p46) AND (1 <= p231) AND (1 <= p233))))
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 <= p46) AND (1 <= p231) AND (1 <= p233))))
lola: processed formula length: 52
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 <= p46) AND (1 <= p231) AND (1 <= p233))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 238 markings, 237 edges
lola: ========================================
lola: subprocess 1 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p34) AND (1 <= p231) AND (1 <= p233))))
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 <= p34) AND (1 <= p231) AND (1 <= p233))))
lola: processed formula length: 52
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 <= p34) AND (1 <= p231) AND (1 <= p233))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 814 markings, 813 edges
lola: ========================================
lola: subprocess 2 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p167 <= 0) OR (p204 <= 0) OR ((1 <= p264) AND (1 <= p280)) OR ((1 <= p146) AND (1 <= p228)))))
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 (((p167 <= 0) OR (p204 <= 0) OR ((1 <= p264) AND (1 <= p280)) OR ((1 <= p146) AND (1 <= p228)))))
lola: processed formula length: 105
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 <= p167) AND (1 <= p204) AND ((p264 <= 0) OR (p280 <= 0)) AND ((p146 <= 0) OR (p228 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1726 markings, 1783 edges
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p74) AND (1 <= p307) AND ((p181 <= 0) OR (p204 <= 0)) AND ((p184 <= 0) OR (p204 <= 0)) AND ((p264 <= 0) OR (p280 <= 0) OR (p126 <= 0) OR (p228 <= 0) OR ((1 <= p91))))))
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 <= p74) AND (1 <= p307) AND ((p181 <= 0) OR (p204 <= 0)) AND ((p184 <= 0) OR (p204 <= 0)) AND ((p264 <= 0) OR (p280 <= 0) OR (p126 <= 0) OR (p228 <= 0) OR ((1 <= p91))))))
lola: processed formula length: 187
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 <= p74) AND (1 <= p307) AND ((p181 <= 0) OR (p204 <= 0)) AND ((p184 <= 0) OR (p204 <= 0)) AND ((p264 <= 0) OR (p280 <= 0) OR (p126 <= 0) OR (p228 <= 0) OR ((1 <= p91))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 100 literals and 20 conjunctive subformulas
sara: try reading problem file ReachabilityFireability-2-0.sara.
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: error: :2279: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
sara: error: :2279: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27730 markings, 32900 edges
lola: ========================================
lola: subprocess 4 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p31 <= 0) OR (p231 <= 0) OR (p233 <= 0) OR ((1 <= p107) AND (1 <= p228)) OR ((1 <= p294) AND (1 <= p308) AND (1 <= p42) AND (1 <= p231) AND (1 <= p233) AND (1 <= p136) AND (1 <= p228) AND (1 <= p33)))))
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 (((p31 <= 0) OR (p231 <= 0) OR (p233 <= 0) OR ((1 <= p107) AND (1 <= p228)) OR ((1 <= p294) AND (1 <= p308) AND (1 <= p42) AND (1 <= p231) AND (1 <= p233) AND (1 <= p136) AND (1 <= p228) AND (1 <= p33)))))
lola: processed formula length: 214
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 <= p31) AND (1 <= p231) AND (1 <= p233) AND ((p107 <= 0) OR (p228 <= 0)) AND ((p294 <= 0) OR (p308 <= 0) OR (p42 <= 0) OR (p231 <= 0) OR (p233 <= 0) OR (p136 <= 0) OR (p228 <= 0) OR (p33 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 60 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 958 markings, 957 edges
lola: ========================================
lola: subprocess 5 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p190) AND (1 <= p204) AND ((p2 <= 0) OR (p231 <= 0) OR (p233 <= 0)) AND ((p143 <= 0) OR (p228 <= 0)) AND ((p287 <= 0) OR (p289 <= 0) OR (p309 <= 0) OR (p311 <= 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 <= p190) AND (1 <= p204) AND ((p2 <= 0) OR (p231 <= 0) OR (p233 <= 0)) AND ((p143 <= 0) OR (p228 <= 0)) AND ((p287 <= 0) OR (p289 <= 0) OR (p309 <= 0) OR (p311 <= 0)))))
lola: processed formula length: 185
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 416 markings, 427 edges
lola: ========================================
lola: subprocess 6 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p124) AND (1 <= p228) AND (1 <= p1) AND (1 <= p231) AND (1 <= p233) AND ((p215 <= 0) OR (p234 <= 0) OR (p239 <= 0) OR (p241 <= 0) OR (p243 <= 0) OR (p245 <= 0) OR (p247 <= 0) OR (p249 <= 0) OR (p251 <= 0) OR (p253 <= 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 <= p124) AND (1 <= p228) AND (1 <= p1) AND (1 <= p231) AND (1 <= p233) AND ((p215 <= 0) OR (p234 <= 0) OR (p239 <= 0) OR (p241 <= 0) OR (p243 <= 0) OR (p245 <= 0) OR (p247 <= 0) OR (p249 <= 0) OR (p251 <= 0) OR (p253 <= 0)))))
lola: processed formula length: 245
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 <= p124) AND (1 <= p228) AND (1 <= p1) AND (1 <= p231) AND (1 <= p233) AND ((p215 <= 0) OR (p234 <= 0) OR (p239 <= 0) OR (p241 <= 0) OR (p243 <= 0) OR (p245 <= 0) OR (p247 <= 0) OR (p249 <= 0) OR (p251 <= 0) OR (p253 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 60 literals and 10 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: error: :2279: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 78682 markings, 89813 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no
lola:
preliminary result: yes no yes yes yes yes no
lola: memory consumption: 40732 KB
lola: time consumption: 10 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-50a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-50a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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