Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591156754537

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:59:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:59:16] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-06-03 03:59:16] [INFO ] Transformed 274 places.
[2020-06-03 03:59:16] [INFO ] Transformed 237 transitions.
[2020-06-03 03:59:16] [INFO ] Found NUPN structural information;
[2020-06-03 03:59:16] [INFO ] Parsed PT model containing 274 places and 237 transitions in 104 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100000 steps, including 1212 resets, run finished after 204 ms. (steps per millisecond=490 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 236 rows 273 cols
[2020-06-03 03:59:16] [INFO ] Computed 43 place invariants in 11 ms
[2020-06-03 03:59:17] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned unsat
[2020-06-03 03:59:17] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2020-06-03 03:59:17] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:17] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2020-06-03 03:59:17] [INFO ] Deduced a trap composed of 8 places in 109 ms
[2020-06-03 03:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-03 03:59:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2020-06-03 03:59:17] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-06-03 03:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:18] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-06-03 03:59:18] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 42 ms.
[2020-06-03 03:59:18] [INFO ] Added : 70 causal constraints over 14 iterations in 280 ms. Result :sat
[2020-06-03 03:59:18] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned unsat
[2020-06-03 03:59:18] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2020-06-03 03:59:18] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:18] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:59:18] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-06-03 03:59:18] [INFO ] Deduced a trap composed of 9 places in 64 ms
[2020-06-03 03:59:18] [INFO ] Deduced a trap composed of 14 places in 71 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 72 places in 96 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 27 places in 52 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 30 places in 85 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 70 places in 57 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 69 places in 67 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 74 places in 64 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 38 places in 48 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 75 places in 50 ms
[2020-06-03 03:59:19] [INFO ] Deduced a trap composed of 52 places in 53 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 35 places in 71 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 26 places in 87 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 47 places in 50 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 76 places in 64 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 79 places in 71 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 38 places in 98 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 24 places in 49 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 31 places in 51 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 33 places in 68 ms
[2020-06-03 03:59:20] [INFO ] Deduced a trap composed of 36 places in 45 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 14 places in 47 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 73 places in 47 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 49 places in 47 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 69 places in 191 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 25 places in 107 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 23 places in 63 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 71 places in 38 ms
[2020-06-03 03:59:21] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 70 places in 114 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 25 places in 44 ms
[2020-06-03 03:59:22] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 3426 ms
[2020-06-03 03:59:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2020-06-03 03:59:22] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:22] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 14 places in 73 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 72 places in 66 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-06-03 03:59:22] [INFO ] Deduced a trap composed of 27 places in 51 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 21 places in 48 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 68 places in 48 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 36 places in 47 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 24 places in 65 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 14 places in 52 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 69 places in 49 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 71 places in 50 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 72 places in 54 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 69 places in 62 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 38 places in 58 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 30 places in 61 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 64 places in 48 ms
[2020-06-03 03:59:23] [INFO ] Deduced a trap composed of 23 places in 44 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 71 places in 53 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 27 places in 51 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 34 places in 52 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 23 places in 50 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 20 places in 41 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 25 places in 59 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 74 places in 65 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 66 places in 53 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 69 places in 51 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 39 places in 76 ms
[2020-06-03 03:59:24] [INFO ] Deduced a trap composed of 65 places in 88 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 73 places in 46 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 68 places in 49 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 77 places in 56 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 73 places in 49 ms
[2020-06-03 03:59:25] [INFO ] Deduced a trap composed of 70 places in 66 ms
[2020-06-03 03:59:25] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 3076 ms
[2020-06-03 03:59:25] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 9 ms.
[2020-06-03 03:59:26] [INFO ] Added : 180 causal constraints over 36 iterations in 654 ms. Result :sat
[2020-06-03 03:59:26] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2020-06-03 03:59:26] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:26] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 8 places in 71 ms
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 63 places in 56 ms
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 28 places in 58 ms
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 32 places in 52 ms
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 33 places in 112 ms
[2020-06-03 03:59:26] [INFO ] Deduced a trap composed of 15 places in 71 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 39 places in 74 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 13 places in 48 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 43 places in 130 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 15 places in 309 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 22 places in 49 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 23 places in 25 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 20 places in 24 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 36 places in 23 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 41 places in 23 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 30 places in 19 ms
[2020-06-03 03:59:27] [INFO ] Deduced a trap composed of 34 places in 30 ms
[2020-06-03 03:59:27] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1584 ms
[2020-06-03 03:59:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:59:28] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:28] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 63 places in 77 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 14 places in 66 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 28 places in 78 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 20 places in 26 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 12 places in 36 ms
[2020-06-03 03:59:28] [INFO ] Deduced a trap composed of 12 places in 25 ms
[2020-06-03 03:59:29] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2020-06-03 03:59:29] [INFO ] Deduced a trap composed of 21 places in 19 ms
[2020-06-03 03:59:29] [INFO ] Deduced a trap composed of 26 places in 21 ms
[2020-06-03 03:59:29] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 876 ms
[2020-06-03 03:59:29] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2020-06-03 03:59:29] [INFO ] Added : 174 causal constraints over 36 iterations in 585 ms. Result :sat
[2020-06-03 03:59:29] [INFO ] Deduced a trap composed of 76 places in 114 ms
[2020-06-03 03:59:29] [INFO ] Deduced a trap composed of 73 places in 88 ms
[2020-06-03 03:59:29] [INFO ] Deduced a trap composed of 73 places in 42 ms
[2020-06-03 03:59:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 329 ms
[2020-06-03 03:59:30] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:59:30] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 11 ms returned sat
[2020-06-03 03:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:30] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 8 places in 44 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 14 places in 39 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 31 places in 51 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 21 places in 28 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 28 places in 27 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 21 places in 26 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2020-06-03 03:59:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 465 ms
[2020-06-03 03:59:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:59:30] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:30] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 15 places in 39 ms
[2020-06-03 03:59:30] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 14 places in 35 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 12 places in 33 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 11 places in 31 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 22 places in 33 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 25 places in 34 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 40 places in 29 ms
[2020-06-03 03:59:31] [INFO ] Deduced a trap composed of 28 places in 30 ms
[2020-06-03 03:59:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 476 ms
[2020-06-03 03:59:31] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 20 ms.
[2020-06-03 03:59:32] [INFO ] Added : 186 causal constraints over 38 iterations in 650 ms. Result :sat
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 76 places in 56 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 78 places in 54 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 75 places in 49 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 67 places in 46 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 73 places in 59 ms
[2020-06-03 03:59:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 373 ms
[2020-06-03 03:59:32] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2020-06-03 03:59:32] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:32] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 13 places in 57 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 11 places in 66 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-06-03 03:59:32] [INFO ] Deduced a trap composed of 14 places in 71 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 19 places in 62 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 77 places in 72 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 68 places in 61 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 29 places in 63 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 69 places in 57 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 68 places in 51 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 73 places in 56 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 68 places in 58 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 69 places in 44 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 68 places in 60 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 66 places in 59 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 67 places in 43 ms
[2020-06-03 03:59:33] [INFO ] Deduced a trap composed of 68 places in 54 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 66 places in 49 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 67 places in 59 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 72 places in 54 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 68 places in 51 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 66 places in 65 ms
[2020-06-03 03:59:34] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1732 ms
[2020-06-03 03:59:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-06-03 03:59:34] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:34] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 13 places in 90 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2020-06-03 03:59:34] [INFO ] Deduced a trap composed of 19 places in 54 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 77 places in 58 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 66 places in 62 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 68 places in 48 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 67 places in 58 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 70 places in 56 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 65 places in 49 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 64 places in 46 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 66 places in 46 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 71 places in 49 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 67 places in 62 ms
[2020-06-03 03:59:35] [INFO ] Deduced a trap composed of 64 places in 49 ms
[2020-06-03 03:59:36] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2020-06-03 03:59:36] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2020-06-03 03:59:36] [INFO ] Deduced a trap composed of 66 places in 54 ms
[2020-06-03 03:59:36] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1579 ms
[2020-06-03 03:59:36] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 8 ms.
[2020-06-03 03:59:36] [INFO ] Added : 174 causal constraints over 35 iterations in 623 ms. Result :sat
[2020-06-03 03:59:36] [INFO ] Deduced a trap composed of 72 places in 55 ms
[2020-06-03 03:59:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2020-06-03 03:59:36] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2020-06-03 03:59:36] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:37] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 14 places in 35 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 31 places in 40 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2020-06-03 03:59:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 398 ms
[2020-06-03 03:59:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-06-03 03:59:37] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:37] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 32 places in 38 ms
[2020-06-03 03:59:37] [INFO ] Deduced a trap composed of 20 places in 26 ms
[2020-06-03 03:59:38] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2020-06-03 03:59:38] [INFO ] Deduced a trap composed of 14 places in 27 ms
[2020-06-03 03:59:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 315 ms
[2020-06-03 03:59:38] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 10 ms.
[2020-06-03 03:59:38] [INFO ] Added : 149 causal constraints over 31 iterations in 483 ms. Result :sat
[2020-06-03 03:59:38] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:59:38] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:38] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-03 03:59:38] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2020-06-03 03:59:38] [INFO ] Deduced a trap composed of 28 places in 78 ms
[2020-06-03 03:59:38] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 12 places in 67 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 22 places in 32 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 37 places in 42 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 36 places in 37 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 21 places in 27 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 32 places in 29 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 32 places in 26 ms
[2020-06-03 03:59:39] [INFO ] Deduced a trap composed of 35 places in 24 ms
[2020-06-03 03:59:40] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1233 ms
[2020-06-03 03:59:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2020-06-03 03:59:40] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:40] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 13 places in 59 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 15 places in 63 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 66 places in 61 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 13 places in 58 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 25 places in 56 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 24 places in 57 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 70 places in 47 ms
[2020-06-03 03:59:40] [INFO ] Deduced a trap composed of 20 places in 65 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 31 places in 41 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 21 places in 41 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 23 places in 35 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 34 places in 41 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 22 places in 36 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 37 places in 42 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 41 places in 35 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 40 places in 35 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 28 places in 23 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 32 places in 26 ms
[2020-06-03 03:59:41] [INFO ] Deduced a trap composed of 34 places in 43 ms
[2020-06-03 03:59:41] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1390 ms
[2020-06-03 03:59:41] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 14 ms.
[2020-06-03 03:59:42] [INFO ] Added : 135 causal constraints over 27 iterations in 448 ms. Result :unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 03:59:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 03:59:42] [INFO ] Flatten gal took : 98 ms
[2020-06-03 03:59:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 03:59:42] [INFO ] Flatten gal took : 18 ms
FORMULA BusinessProcesses-PT-03-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:59:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2020-06-03 03:59:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-03 @ 3570 seconds

FORMULA BusinessProcesses-PT-03-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ BusinessProcesses-PT-03

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((((1 <= p13) AND (1 <= p265)) OR ((1 <= p38) AND (1 <= p85) AND (1 <= p190) AND (1 <= p264))))",
"processed_size": 98,
"rewrites": 46
},
"net":
{
"conflict_clusters": 215,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((p216 <= 0) OR (2 <= p66) OR (p66 <= 0)) U ((1 <= p111))))",
"processed_size": 65,
"rewrites": 48
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p128))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p221))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p157))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"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 ((((p83 <= 0)) U (((1 <= p114)) OR ((1 <= p27)))))",
"processed_size": 53,
"rewrites": 48
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p181) AND (1 <= p210))))",
"processed_size": 37,
"rewrites": 46
},
"result":
{
"edges": 3099,
"markings": 2368,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E((AF(((1 <= p214))) OR EF(((1 <= p183)))) U ((1 <= p80)))",
"processed_size": 58,
"rewrites": 48
},
"net":
{
"conflict_clusters": 215,
"singleton_clusters": 0
},
"result":
{
"edges": 3038259,
"markings": 402923,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p56))",
"processed_size": 12,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p269 <= 0))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 606
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p32 <= 0))",
"processed_size": 12,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 606
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 606
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p153))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 757
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p127))",
"processed_size": 13,
"rewrites": 49
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 757
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 757
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p116))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1010
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p235))",
"processed_size": 13,
"rewrites": 49
},
"result":
{
"edges": 5653174,
"markings": 3377646,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1006
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1510
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3020
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3020
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p112 <= 0))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 46352,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(X(E(F(**)))) OR (A(G(**)) OR A(X(**)))) : E(((A(F(**)) OR E(F(**))) U **)) : E(F((E(G(**)) AND (** AND (A(X(**)) AND **))))) : E(F(**)) : (** OR E(F(**))) : (E((** U **)) OR (A(G(**)) AND A(G(E(X(**)))))) : E(F((** AND A(X(**))))) : (** OR (A(G(**)) OR (** OR (E(F(**)) OR (** OR A(F(A(X(**))))))))) : (A(X(**)) OR (E((** U **)) OR (E(F(*)) AND (E(F(*)) AND A(G(**)))))) : (A(G(**)) AND (A(G(*)) OR **)) : (E(F(A(G(**)))) OR **) : (** AND (A(G(*)) AND **)) : (A(G(A(F(*)))) OR **) : (E(F(**)) AND A(G(**))) : (E(F(**)) OR A(G(*)))"
},
"net":
{
"arcs": 630,
"conflict_clusters": 215,
"places": 273,
"places_significant": 230,
"singleton_clusters": 0,
"transitions": 236
},
"result":
{
"interim_value": "yes yes unknown yes yes yes unknown yes yes unknown yes no yes no yes ",
"preliminary_value": "yes yes unknown yes yes yes unknown yes yes unknown yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 509/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 273
lola: finding significant places
lola: 273 places, 236 transitions, 230 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: ((E (X (E (F ((((1 <= p78)) OR ((p245 <= 1) AND (1 <= p245))))))) OR A (G (((1 <= p6))))) OR A (X ((((1 <= p13) AND (1 <= p265)) OR ((1 <= p38) AND (1 <= p85) AND (1 <= p190) AND (1 <= p264)))))) : E (((A (F (((1 <= p214)))) OR E (F (((1 <= p183))))) U ((1 <= p80)))) : E (F ((((E (G (((1 <= p168)))) AND ((p193 <= 0))) AND A (X (((1 <= p107))))) AND ((1 <= p116))))) : E ((E (F (((1 <= p28) AND (1 <= p154) AND (1 <= p272)))) U E (F (((1 <= p181) AND (1 <= p210)))))) : (((1 <= p56)) OR E (F (E ((((1 <= p68)) U ((p213 <= 1) AND (1 <= p213))))))) : (E ((((p216 <= 0) OR (2 <= p66) OR (p66 <= 0)) U ((1 <= p111)))) OR A (G ((((1 <= p272) AND (1 <= p48) AND (1 <= p160) AND (1 <= p236) AND (((1 <= p75)) OR ((1 <= p26)))) AND E (X (((1 <= p158)))))))) : E (F ((((1 <= p214) AND ((p191 <= 0)) AND ((p243 <= 0))) AND A (X ((((1 <= p138)) OR ((1 <= p263)))))))) : (((((((1 <= p157)) OR A (G ((((1 <= p22) AND (1 <= p124) AND (1 <= p272)) OR ((1 <= p2)))))) OR ((1 <= p221))) OR E (F ((((1 <= p142)) OR ((p60 <= 1) AND (1 <= p60)))))) OR ((1 <= p128))) OR A (F (A (X (((1 <= p157))))))) : ((A (X (((1 <= p210)))) OR E ((((p83 <= 0)) U (((1 <= p114)) OR ((1 <= p27)))))) OR ((NOT(A (G (((1 <= p39))))) AND NOT(A (G (((1 <= p93)))))) AND E (G (A (G (((p61 <= 1) AND (1 <= p61)))))))) : (A (G ((((1 <= p238)) OR ((1 <= p91) AND (1 <= p195) AND (1 <= p268) AND (1 <= p117)) OR (p85 <= 0) OR (p190 <= 0) OR (p264 <= 0)))) AND (NOT(E (F (((p137 <= 0))))) OR ((p112 <= 0)))) : (E (F (A (G (((p127 <= 0)))))) OR ((1 <= p153))) : ((((p32 <= 0)) AND NOT(E (F (((1 <= p117) AND (1 <= p231)))))) AND ((p269 <= 0))) : (NOT(E (F (E (G (((1 <= p235))))))) OR ((1 <= p116))) : (E (F ((((1 <= p34)) OR ((1 <= p2))))) AND A (G (((p52 <= 0))))) : (A (((0 <= 0) U E (F (((1 <= p228)))))) OR A (G (NOT(E (F (((1 <= p19))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((((1 <= p78)) OR ((p245 <= 1) AND (1 <= p245))))))) OR (A (G (((1 <= p6)))) OR A (X ((((1 <= p13) AND (1 <= p265)) OR ((1 <= p38) AND (1 <= p85) AND (1 <= p190) AND (1 <= p264)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p6))))
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 (((1 <= p6))))
lola: processed formula length: 19
lola: 47 rewrites
lola: closed formula file CTLFireability.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: ((p6 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p13) AND (1 <= p265)) OR ((1 <= p38) AND (1 <= p85) AND (1 <= p190) AND (1 <= p264)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p13) AND (1 <= p265)) OR ((1 <= p38) AND (1 <= p85) AND (1 <= p190) AND (1 <= p264))))
lola: processed formula length: 98
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p78)) OR ((p245 <= 1) AND (1 <= p245)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p78)) OR ((p245 <= 1) AND (1 <= p245)))
lola: processed formula length: 48
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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 <= p78)) OR ((p245 <= 1) AND (1 <= p245)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 53 markings, 52 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((1 <= p168)))) AND (((p193 <= 0)) AND (A (X (((1 <= p107)))) AND ((1 <= p116)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EG(((1 <= p168))) AND (((p193 <= 0)) AND (AX(((1 <= p107))) AND ((1 <= p116))))))
lola: processed formula length: 85
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 387563 markings, 3286504 edges, 77513 markings/sec, 0 secs
lola: 749708 markings, 6465537 edges, 72429 markings/sec, 5 secs
lola: 1125698 markings, 9703867 edges, 75198 markings/sec, 10 secs
lola: 1411771 markings, 12784012 edges, 57215 markings/sec, 15 secs
lola: 1712139 markings, 15834622 edges, 60074 markings/sec, 20 secs
lola: 2028408 markings, 18920296 edges, 63254 markings/sec, 25 secs
lola: 2303591 markings, 22005431 edges, 55037 markings/sec, 30 secs
lola: 2544929 markings, 24970995 edges, 48268 markings/sec, 35 secs
lola: 2875114 markings, 28063240 edges, 66037 markings/sec, 40 secs
lola: 3164214 markings, 31095653 edges, 57820 markings/sec, 45 secs
lola: 3395374 markings, 34004642 edges, 46232 markings/sec, 50 secs
lola: 3711505 markings, 37104151 edges, 63226 markings/sec, 55 secs
lola: 4019030 markings, 40154040 edges, 61505 markings/sec, 60 secs
lola: 4263585 markings, 43162145 edges, 48911 markings/sec, 65 secs
lola: 4541733 markings, 46239505 edges, 55630 markings/sec, 70 secs
lola: 4823892 markings, 49301070 edges, 56432 markings/sec, 75 secs
lola: 5081940 markings, 52385269 edges, 51610 markings/sec, 80 secs
lola: 5291626 markings, 55275783 edges, 41937 markings/sec, 85 secs
lola: 5587416 markings, 58403926 edges, 59158 markings/sec, 90 secs
lola: 5868622 markings, 61445016 edges, 56241 markings/sec, 95 secs
lola: 6088426 markings, 64384262 edges, 43961 markings/sec, 100 secs
lola: 6321658 markings, 67281075 edges, 46646 markings/sec, 105 secs
lola: 6640288 markings, 70317181 edges, 63726 markings/sec, 110 secs
lola: 6921494 markings, 73300809 edges, 56241 markings/sec, 115 secs
lola: 7147684 markings, 76158954 edges, 45238 markings/sec, 120 secs
lola: 7438110 markings, 79189671 edges, 58085 markings/sec, 125 secs
lola: 7719677 markings, 82208461 edges, 56313 markings/sec, 130 secs
lola: 7938189 markings, 85081728 edges, 43702 markings/sec, 135 secs
lola: 8153324 markings, 87944355 edges, 43027 markings/sec, 140 secs
lola: 8443095 markings, 90961127 edges, 57954 markings/sec, 145 secs
lola: 8715443 markings, 93949099 edges, 54470 markings/sec, 150 secs
lola: 8926684 markings, 96787671 edges, 42248 markings/sec, 155 secs
lola: 9164376 markings, 99681282 edges, 47538 markings/sec, 160 secs
lola: 9442282 markings, 102629682 edges, 55581 markings/sec, 165 secs
lola: 9694021 markings, 105515495 edges, 50348 markings/sec, 170 secs
lola: 9901975 markings, 108322577 edges, 41591 markings/sec, 175 secs
lola: 10143275 markings, 111225228 edges, 48260 markings/sec, 180 secs
lola: 10392520 markings, 114146147 edges, 49849 markings/sec, 185 secs
lola: 10625361 markings, 117054677 edges, 46568 markings/sec, 190 secs
lola: 10817960 markings, 119861692 edges, 38520 markings/sec, 195 secs
lola: 11036535 markings, 122728516 edges, 43715 markings/sec, 200 secs
lola: 11287088 markings, 125636243 edges, 50111 markings/sec, 205 secs
lola: 11526035 markings, 128524358 edges, 47789 markings/sec, 210 secs
lola: 11716875 markings, 131310608 edges, 38168 markings/sec, 215 secs
lola: 11918884 markings, 134117848 edges, 40402 markings/sec, 220 secs
lola: 12234706 markings, 137093677 edges, 63164 markings/sec, 225 secs
lola: 12514003 markings, 140011588 edges, 55859 markings/sec, 230 secs
lola: 12740012 markings, 142819674 edges, 45202 markings/sec, 235 secs
lola: 13014389 markings, 145747724 edges, 54875 markings/sec, 240 secs
lola: 13286632 markings, 148676259 edges, 54449 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1356500 KB
lola: time consumption: 258 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p216 <= 0) OR (2 <= p66) OR (p66 <= 0)) U ((1 <= p111)))) OR (A (G (((1 <= p272) AND (1 <= p48) AND (1 <= p160) AND (1 <= p236) AND (((1 <= p75)) OR ((1 <= p26)))))) AND A (G (E (X (((1 <= p158))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p216 <= 0) OR (2 <= p66) OR (p66 <= 0)) U ((1 <= p111))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p216 <= 0) OR (2 <= p66) OR (p66 <= 0)) U ((1 <= p111))))
lola: processed formula length: 65
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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 <= p111))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 25 markings, 24 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p214) AND ((p191 <= 0)) AND ((p243 <= 0))) AND A (X ((((1 <= p138)) OR ((1 <= p263))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p214) AND ((p191 <= 0)) AND ((p243 <= 0))) AND AX((((1 <= p138)) OR ((1 <= p263))))))
lola: processed formula length: 97
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLFireability-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: 436355 markings, 3267445 edges, 87271 markings/sec, 0 secs
lola: 853538 markings, 6484431 edges, 83437 markings/sec, 5 secs
lola: 1271234 markings, 9708992 edges, 83539 markings/sec, 10 secs
lola: 1643742 markings, 12852174 edges, 74502 markings/sec, 15 secs
lola: 2006610 markings, 16002829 edges, 72574 markings/sec, 20 secs
lola: 2354858 markings, 19132671 edges, 69650 markings/sec, 25 secs
lola: 2710712 markings, 22236044 edges, 71171 markings/sec, 30 secs
lola: 3071861 markings, 25342819 edges, 72230 markings/sec, 35 secs
lola: 3383816 markings, 28354045 edges, 62391 markings/sec, 40 secs
lola: 3747299 markings, 31477584 edges, 72697 markings/sec, 45 secs
lola: 4110149 markings, 34602594 edges, 72570 markings/sec, 50 secs
lola: 4423316 markings, 37613562 edges, 62633 markings/sec, 55 secs
lola: 4752046 markings, 40711148 edges, 65746 markings/sec, 60 secs
lola: 5068571 markings, 43790355 edges, 63305 markings/sec, 65 secs
lola: 5343041 markings, 46722390 edges, 54894 markings/sec, 70 secs
lola: 5669056 markings, 49777991 edges, 65203 markings/sec, 75 secs
lola: 5981298 markings, 52796443 edges, 62448 markings/sec, 80 secs
lola: 6246946 markings, 55668405 edges, 53130 markings/sec, 85 secs
lola: 6599854 markings, 58672431 edges, 70582 markings/sec, 90 secs
lola: 6941521 markings, 61656852 edges, 68333 markings/sec, 95 secs
lola: 7248603 markings, 64581333 edges, 61416 markings/sec, 100 secs
lola: 7563407 markings, 67568620 edges, 62961 markings/sec, 105 secs
lola: 7869588 markings, 70543979 edges, 61236 markings/sec, 110 secs
lola: 8138064 markings, 73428038 edges, 53695 markings/sec, 115 secs
lola: 8458948 markings, 76427837 edges, 64177 markings/sec, 120 secs
lola: 8764409 markings, 79382759 edges, 61092 markings/sec, 125 secs
lola: 9027185 markings, 82229870 edges, 52555 markings/sec, 130 secs
lola: 9343267 markings, 85182952 edges, 63216 markings/sec, 135 secs
lola: 9652217 markings, 88121639 edges, 61790 markings/sec, 140 secs
lola: 9913935 markings, 90917505 edges, 52344 markings/sec, 145 secs
lola: 10199669 markings, 93804878 edges, 57147 markings/sec, 150 secs
lola: 10459731 markings, 96620358 edges, 52012 markings/sec, 155 secs
lola: 10717370 markings, 99411800 edges, 51528 markings/sec, 160 secs
lola: 10953848 markings, 102183349 edges, 47296 markings/sec, 165 secs
lola: 11225529 markings, 104988354 edges, 54336 markings/sec, 170 secs
lola: 11499402 markings, 107851593 edges, 54775 markings/sec, 175 secs
lola: 11741692 markings, 110659332 edges, 48458 markings/sec, 180 secs
lola: 12027652 markings, 113496820 edges, 57192 markings/sec, 185 secs
lola: 12372768 markings, 116469496 edges, 69023 markings/sec, 190 secs
lola: 12681349 markings, 119344341 edges, 61716 markings/sec, 195 secs
lola: 12997673 markings, 122248615 edges, 63265 markings/sec, 200 secs
lola: 13295077 markings, 125131783 edges, 59481 markings/sec, 205 secs
lola: 13574773 markings, 127997373 edges, 55939 markings/sec, 210 secs
lola: 13875080 markings, 130951567 edges, 60061 markings/sec, 215 secs
lola: 14170166 markings, 133847546 edges, 59017 markings/sec, 220 secs
lola: 14466708 markings, 136741038 edges, 59308 markings/sec, 225 secs
lola: 14735082 markings, 139545532 edges, 53675 markings/sec, 230 secs
lola: 15036641 markings, 142396273 edges, 60312 markings/sec, 235 secs
lola: 15333126 markings, 145257193 edges, 59297 markings/sec, 240 secs
lola: 15586628 markings, 148035203 edges, 50700 markings/sec, 245 secs
lola: 15875224 markings, 150908134 edges, 57719 markings/sec, 250 secs
lola: 16144833 markings, 153756481 edges, 53922 markings/sec, 255 secs
lola: 16388883 markings, 156571555 edges, 48810 markings/sec, 260 secs
lola: 16653107 markings, 159452599 edges, 52845 markings/sec, 265 secs
lola: 16924489 markings, 162335659 edges, 54276 markings/sec, 270 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1318576 KB
lola: time consumption: 534 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p157)) OR (A (G ((((1 <= p22) AND (1 <= p124) AND (1 <= p272)) OR ((1 <= p2))))) OR (((1 <= p221)) OR (E (F ((((1 <= p142)) OR ((p60 <= 1) AND (1 <= p60))))) OR (((1 <= p128)) OR A (F (A (X (((1 <= p157)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p128))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p128))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p221))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p221))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p157))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p157))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p142)) OR ((p60 <= 1) AND (1 <= p60)))))
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 <= p142)) OR ((p60 <= 1) AND (1 <= p60)))))
lola: processed formula length: 55
lola: 46 rewrites
lola: closed formula file CTLFireability.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 <= p142)) OR ((p60 <= 1) AND (1 <= p60)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p210)))) OR (E ((((p83 <= 0)) U (((1 <= p114)) OR ((1 <= p27))))) OR (E (F (((p39 <= 0)))) AND (E (F (((p93 <= 0)))) AND A (G (((p61 <= 1) AND (1 <= p61))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p61 <= 1) AND (1 <= p61))))
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 (((p61 <= 1) AND (1 <= p61))))
lola: processed formula length: 35
lola: 47 rewrites
lola: closed formula file CTLFireability.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: ((2 <= p61) OR (p61 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p83 <= 0)) U (((1 <= p114)) OR ((1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p83 <= 0)) U (((1 <= p114)) OR ((1 <= p27)))))
lola: processed formula length: 53
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: ========================================
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 <= p114)) OR ((1 <= p27)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 28 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p181) AND (1 <= p210))))
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 <= p181) AND (1 <= p210))))
lola: processed formula length: 37
lola: 46 rewrites
lola: closed formula file CTLFireability.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 <= p181) AND (1 <= p210))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2368 markings, 3099 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (F (((1 <= p214)))) OR E (F (((1 <= p183))))) U ((1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AF(((1 <= p214))) OR EF(((1 <= p183)))) U ((1 <= p80)))
lola: processed formula length: 58
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 402923 markings, 3038259 edges
lola: ========================================
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p56)) OR E (F (((p213 <= 1) AND (1 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p56))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p56))
lola: processed formula length: 12
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p213 <= 1) AND (1 <= p213))))
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 (((p213 <= 1) AND (1 <= p213))))
lola: processed formula length: 37
lola: 46 rewrites
lola: closed formula file CTLFireability.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: ((p213 <= 1) AND (1 <= p213))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 398 markings, 751 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p32 <= 0)) AND (A (G (((p117 <= 0) OR (p231 <= 0)))) AND ((p269 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p269 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p269 <= 0))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p32 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p32 <= 0))
lola: processed formula length: 12
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p117 <= 0) OR (p231 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p117 <= 0) OR (p231 <= 0))))
lola: processed formula length: 37
lola: 47 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 389 markings, 742 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p127 <= 0)))))) OR ((1 <= p153)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p153))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p153))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p127 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p127))
lola: processed formula length: 13
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: The predicate is possibly invariant.
lola: 37 markings, 36 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p127))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p127 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 11 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (((p235 <= 0)))))) OR ((1 <= p116)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p116))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p116))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1010 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p235 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p235))
lola: processed formula length: 13
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p235))
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p235 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-1.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-1.sara.
lola: state equation: write sara problem file to CTLFireability-12-0.sara
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1460802 markings, 2467347 edges, 292160 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2941970 markings, 4940924 edges, 296234 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 3377646 markings, 5653174 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p228)))) OR A (G (((p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p19 <= 0))))
lola: processed formula length: 20
lola: 47 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 117 markings, 116 edges
lola: ========================================
lola: subprocess 13 will run for 1510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p228))))
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 <= p228))))
lola: processed formula length: 21
lola: 46 rewrites
lola: closed formula file CTLFireability.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 <= p228))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 394 markings, 747 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p34)) OR ((1 <= p2))))) AND A (G (((p52 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p52 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p52 <= 0))))
lola: processed formula length: 20
lola: 47 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 72 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= p238)) OR ((1 <= p91) AND (1 <= p195) AND (1 <= p268) AND (1 <= p117)) OR (p85 <= 0) OR (p190 <= 0) OR (p264 <= 0)))) AND (A (G (((1 <= p137)))) OR ((p112 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p112 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p112 <= 0))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((1 <= p168)))) AND (((p193 <= 0)) AND (A (X (((1 <= p107)))) AND ((1 <= p116)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EG(((1 <= p168))) AND (((p193 <= 0)) AND (AX(((1 <= p107))) AND ((1 <= p116))))))
lola: processed formula length: 85
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 382220 markings, 3236964 edges, 76444 markings/sec, 0 secs
lola: 743832 markings, 6420394 edges, 72322 markings/sec, 5 secs
lola: 1103662 markings, 9534005 edges, 71966 markings/sec, 10 secs
lola: 1391516 markings, 12539604 edges, 57571 markings/sec, 15 secs
lola: 1679309 markings, 15535037 edges, 57559 markings/sec, 20 secs
lola: 1999687 markings, 18660264 edges, 64076 markings/sec, 25 secs
lola: 2282908 markings, 21744151 edges, 56644 markings/sec, 30 secs
lola: 2514321 markings, 24623299 edges, 46283 markings/sec, 35 secs
lola: 2843824 markings, 27758132 edges, 65901 markings/sec, 40 secs
lola: 3140140 markings, 30815441 edges, 59263 markings/sec, 45 secs
lola: 3372746 markings, 33700111 edges, 46521 markings/sec, 50 secs
lola: 3678601 markings, 36779326 edges, 61171 markings/sec, 55 secs
lola: 3992850 markings, 39862140 edges, 62850 markings/sec, 60 secs
lola: 4237411 markings, 42840621 edges, 48912 markings/sec, 65 secs
lola: 4503003 markings, 45831448 edges, 53118 markings/sec, 70 secs
lola: 4785681 markings, 48863408 edges, 56536 markings/sec, 75 secs
lola: 5045066 markings, 51888448 edges, 51877 markings/sec, 80 secs
lola: 5253212 markings, 54725206 edges, 41629 markings/sec, 85 secs
lola: 5519768 markings, 57668632 edges, 53311 markings/sec, 90 secs
lola: 5784949 markings, 60529189 edges, 53036 markings/sec, 95 secs
lola: 6023215 markings, 63459787 edges, 47653 markings/sec, 100 secs
lola: 6222451 markings, 66213233 edges, 39847 markings/sec, 105 secs
lola: 6521727 markings, 69152534 edges, 59855 markings/sec, 110 secs
lola: 6820024 markings, 72099071 edges, 59659 markings/sec, 115 secs
lola: 7048312 markings, 74900629 edges, 45658 markings/sec, 120 secs
lola: 7304103 markings, 77788597 edges, 51158 markings/sec, 125 secs
lola: 7585640 markings, 80796469 edges, 56307 markings/sec, 130 secs
lola: 7840473 markings, 83749951 edges, 50967 markings/sec, 135 secs
lola: 8049151 markings, 86577513 edges, 41736 markings/sec, 140 secs
lola: 8310081 markings, 89512748 edges, 52186 markings/sec, 145 secs
lola: 8581586 markings, 92451813 edges, 54301 markings/sec, 150 secs
lola: 8820236 markings, 95329406 edges, 47730 markings/sec, 155 secs
lola: 9021757 markings, 98104442 edges, 40304 markings/sec, 160 secs
lola: 9286029 markings, 100933853 edges, 52854 markings/sec, 165 secs
lola: 9556574 markings, 103824545 edges, 54109 markings/sec, 170 secs
lola: 9770993 markings, 106530126 edges, 42884 markings/sec, 175 secs
lola: 9967483 markings, 109249340 edges, 39298 markings/sec, 180 secs
lola: 10222470 markings, 112127384 edges, 50997 markings/sec, 185 secs
lola: 10463919 markings, 114977880 edges, 48290 markings/sec, 190 secs
lola: 10674165 markings, 117740133 edges, 42049 markings/sec, 195 secs
lola: 10860567 markings, 120484266 edges, 37280 markings/sec, 200 secs
lola: 11085678 markings, 123278134 edges, 45022 markings/sec, 205 secs
lola: 11327446 markings, 126110426 edges, 48354 markings/sec, 210 secs
lola: 11553503 markings, 128920524 edges, 45211 markings/sec, 215 secs
lola: 11740535 markings, 131640325 edges, 37406 markings/sec, 220 secs
lola: 11949378 markings, 134374985 edges, 41769 markings/sec, 225 secs
lola: 12251976 markings, 137262220 edges, 60520 markings/sec, 230 secs
lola: 12515581 markings, 140028711 edges, 52721 markings/sec, 235 secs
lola: 12736029 markings, 142768212 edges, 44090 markings/sec, 240 secs
lola: 12996667 markings, 145565519 edges, 52128 markings/sec, 245 secs
lola: 13260203 markings, 148423600 edges, 52707 markings/sec, 250 secs
lola: 13491959 markings, 151200926 edges, 46351 markings/sec, 255 secs
lola: 13690342 markings, 153918440 edges, 39677 markings/sec, 260 secs
lola: 13949015 markings, 156734455 edges, 51735 markings/sec, 265 secs
lola: 14206109 markings, 159516670 edges, 51419 markings/sec, 270 secs
lola: 14432968 markings, 162264737 edges, 45372 markings/sec, 275 secs
lola: 14628019 markings, 164944350 edges, 39010 markings/sec, 280 secs
lola: 14879357 markings, 167675885 edges, 50268 markings/sec, 285 secs
lola: 15133306 markings, 170436925 edges, 50790 markings/sec, 290 secs
lola: 15359489 markings, 173138866 edges, 45237 markings/sec, 295 secs
lola: 15551968 markings, 175763288 edges, 38496 markings/sec, 300 secs
lola: 15785380 markings, 178514276 edges, 46682 markings/sec, 305 secs
lola: 16022184 markings, 181294749 edges, 47361 markings/sec, 310 secs
lola: 16238688 markings, 183992820 edges, 43301 markings/sec, 315 secs
lola: 16421745 markings, 186656786 edges, 36611 markings/sec, 320 secs
lola: 16617206 markings, 189331686 edges, 39092 markings/sec, 325 secs
lola: 16852892 markings, 192047691 edges, 47137 markings/sec, 330 secs
lola: 17089489 markings, 194792037 edges, 47319 markings/sec, 335 secs
lola: 17278891 markings, 197466271 edges, 37880 markings/sec, 340 secs
lola: 17453603 markings, 200071743 edges, 34942 markings/sec, 345 secs
lola: 17749766 markings, 203084252 edges, 59233 markings/sec, 350 secs
lola: 18064007 markings, 206155320 edges, 62848 markings/sec, 355 secs
lola: 18373510 markings, 209190948 edges, 61901 markings/sec, 360 secs
lola: 18615622 markings, 212139648 edges, 48422 markings/sec, 365 secs
lola: 18877084 markings, 215093357 edges, 52292 markings/sec, 370 secs
lola: 19158816 markings, 218105802 edges, 56346 markings/sec, 375 secs
lola: 19417732 markings, 221114163 edges, 51783 markings/sec, 380 secs
lola: 19625117 markings, 223930472 edges, 41477 markings/sec, 385 secs
lola: 19893421 markings, 226924762 edges, 53661 markings/sec, 390 secs
lola: 20167263 markings, 229873979 edges, 54768 markings/sec, 395 secs
lola: 20406691 markings, 232823108 edges, 47886 markings/sec, 400 secs
lola: 20605798 markings, 235579285 edges, 39821 markings/sec, 405 secs
lola: 20893801 markings, 238619113 edges, 57601 markings/sec, 410 secs
lola: 21168756 markings, 241567953 edges, 54991 markings/sec, 415 secs
lola: 21388211 markings, 244464690 edges, 43891 markings/sec, 420 secs
lola: 21598823 markings, 247261651 edges, 42122 markings/sec, 425 secs
lola: 21865204 markings, 250286620 edges, 53276 markings/sec, 430 secs
lola: 22114613 markings, 253202757 edges, 49882 markings/sec, 435 secs
lola: 22316107 markings, 256076805 edges, 40299 markings/sec, 440 secs
lola: 22507642 markings, 258865451 edges, 38307 markings/sec, 445 secs
lola: 22763180 markings, 261788676 edges, 51108 markings/sec, 450 secs
lola: 23003378 markings, 264589627 edges, 48040 markings/sec, 455 secs
lola: 23209793 markings, 267421453 edges, 41283 markings/sec, 460 secs
lola: 23389550 markings, 270085467 edges, 35951 markings/sec, 465 secs
lola: 23631658 markings, 272827765 edges, 48422 markings/sec, 470 secs
lola: 23887109 markings, 275617760 edges, 51090 markings/sec, 475 secs
lola: 24119585 markings, 278358299 edges, 46495 markings/sec, 480 secs
lola: 24315824 markings, 281037117 edges, 39248 markings/sec, 485 secs
lola: 24554861 markings, 283842900 edges, 47807 markings/sec, 490 secs
lola: 24793057 markings, 286658213 edges, 47639 markings/sec, 495 secs
lola: 25015028 markings, 289451136 edges, 44394 markings/sec, 500 secs
lola: 25201212 markings, 292159453 edges, 37237 markings/sec, 505 secs
lola: 25410765 markings, 294917989 edges, 41911 markings/sec, 510 secs
lola: 25651577 markings, 297707733 edges, 48162 markings/sec, 515 secs
lola: 25884839 markings, 300492816 edges, 46652 markings/sec, 520 secs
lola: 26063897 markings, 303069735 edges, 35812 markings/sec, 525 secs
lola: 26231955 markings, 305547826 edges, 33612 markings/sec, 530 secs

lola: 26481639 markings, 308423006 edges, 49937 markings/sec, 535 secs
lola: 26725071 markings, 311288261 edges, 48686 markings/sec, 540 secs
lola: 26936110 markings, 314098732 edges, 42208 markings/sec, 545 secs
lola: 27123397 markings, 316854001 edges, 37457 markings/sec, 550 secs
lola: 27345810 markings, 319704779 edges, 44483 markings/sec, 555 secs
lola: 27570890 markings, 322565254 edges, 45016 markings/sec, 560 secs
lola: 27785902 markings, 325412257 edges, 43002 markings/sec, 565 secs
lola: 27960338 markings, 328167727 edges, 34887 markings/sec, 570 secs
lola: 28139651 markings, 330930788 edges, 35863 markings/sec, 575 secs
lola: 28371357 markings, 333776549 edges, 46341 markings/sec, 580 secs
lola: 28591743 markings, 336600146 edges, 44077 markings/sec, 585 secs
lola: 28788439 markings, 339384390 edges, 39339 markings/sec, 590 secs
lola: 28960619 markings, 342103022 edges, 34436 markings/sec, 595 secs
lola: 29169548 markings, 344877273 edges, 41786 markings/sec, 600 secs
lola: 29441599 markings, 347772686 edges, 54410 markings/sec, 605 secs
lola: 29690769 markings, 350624765 edges, 49834 markings/sec, 610 secs
lola: 29895412 markings, 353382426 edges, 40929 markings/sec, 615 secs
lola: 30127795 markings, 356193578 edges, 46477 markings/sec, 620 secs
lola: 30370972 markings, 359043209 edges, 48635 markings/sec, 625 secs
lola: 30602748 markings, 361880610 edges, 46355 markings/sec, 630 secs
lola: 30790517 markings, 364619907 edges, 37554 markings/sec, 635 secs
lola: 30991177 markings, 367394960 edges, 40132 markings/sec, 640 secs
lola: 31237774 markings, 370235172 edges, 49319 markings/sec, 645 secs
lola: 31479755 markings, 373054775 edges, 48396 markings/sec, 650 secs
lola: 31667825 markings, 375719658 edges, 37614 markings/sec, 655 secs
lola: 31843140 markings, 378337914 edges, 35063 markings/sec, 660 secs
lola: 32087786 markings, 381160339 edges, 48929 markings/sec, 665 secs
lola: 32321659 markings, 383940966 edges, 46775 markings/sec, 670 secs
lola: 32537025 markings, 386718481 edges, 43073 markings/sec, 675 secs
lola: 32721642 markings, 389430019 edges, 36923 markings/sec, 680 secs
lola: 32935025 markings, 392214188 edges, 42677 markings/sec, 685 secs
lola: 33156267 markings, 395029138 edges, 44248 markings/sec, 690 secs
lola: 33373335 markings, 397836264 edges, 43414 markings/sec, 695 secs
lola: 33549948 markings, 400560487 edges, 35323 markings/sec, 700 secs
lola: 33718667 markings, 403250163 edges, 33744 markings/sec, 705 secs
lola: 33943057 markings, 406062725 edges, 44878 markings/sec, 710 secs
lola: 34157615 markings, 408834874 edges, 42912 markings/sec, 715 secs
lola: 34363247 markings, 411605250 edges, 41126 markings/sec, 720 secs
lola: 34534746 markings, 414293966 edges, 34300 markings/sec, 725 secs
lola: 34709781 markings, 416990758 edges, 35007 markings/sec, 730 secs
lola: 35044990 markings, 420160044 edges, 67042 markings/sec, 735 secs
lola: 35366058 markings, 423302184 edges, 64214 markings/sec, 740 secs
lola: 35663224 markings, 426396938 edges, 59433 markings/sec, 745 secs
lola: 35896746 markings, 429323158 edges, 46704 markings/sec, 750 secs
lola: 36192524 markings, 432443827 edges, 59156 markings/sec, 755 secs
lola: 36478422 markings, 435506046 edges, 57180 markings/sec, 760 secs
lola: 36705293 markings, 438489631 edges, 45374 markings/sec, 765 secs
lola: 36923004 markings, 441380414 edges, 43542 markings/sec, 770 secs
lola: 37222887 markings, 444476097 edges, 59977 markings/sec, 775 secs
lola: 37494091 markings, 447500676 edges, 54241 markings/sec, 780 secs
lola: 37707429 markings, 450377251 edges, 42668 markings/sec, 785 secs
lola: 37959878 markings, 453345871 edges, 50490 markings/sec, 790 secs
lola: 38239604 markings, 456367580 edges, 55945 markings/sec, 795 secs
lola: 38498928 markings, 459403478 edges, 51865 markings/sec, 800 secs
lola: 38706828 markings, 462255122 edges, 41580 markings/sec, 805 secs
lola: 38971483 markings, 465312016 edges, 52931 markings/sec, 810 secs
lola: 39222055 markings, 468272223 edges, 50114 markings/sec, 815 secs
lola: 39449448 markings, 471269878 edges, 45479 markings/sec, 820 secs
lola: 39640560 markings, 474097703 edges, 38222 markings/sec, 825 secs
lola: 39892323 markings, 477112534 edges, 50353 markings/sec, 830 secs
lola: 40134197 markings, 480012526 edges, 48375 markings/sec, 835 secs
lola: 40367523 markings, 482986004 edges, 46665 markings/sec, 840 secs
lola: 40557942 markings, 485787533 edges, 38084 markings/sec, 845 secs
lola: 40800683 markings, 488659443 edges, 48548 markings/sec, 850 secs
lola: 41070144 markings, 491588563 edges, 53892 markings/sec, 855 secs
lola: 41314268 markings, 494463269 edges, 48825 markings/sec, 860 secs
lola: 41516862 markings, 497241107 edges, 40519 markings/sec, 865 secs
lola: 41769736 markings, 500154107 edges, 50575 markings/sec, 870 secs
lola: 42009777 markings, 503032748 edges, 48008 markings/sec, 875 secs
lola: 42236476 markings, 505919675 edges, 45340 markings/sec, 880 secs
lola: 42426112 markings, 508704850 edges, 37927 markings/sec, 885 secs
lola: 42656812 markings, 511583591 edges, 46140 markings/sec, 890 secs
lola: 42901374 markings, 514449870 edges, 48912 markings/sec, 895 secs
lola: 43129373 markings, 517295093 edges, 45600 markings/sec, 900 secs
lola: 43317312 markings, 520030103 edges, 37588 markings/sec, 905 secs
lola: 43523021 markings, 522793375 edges, 41142 markings/sec, 910 secs
lola: 43768476 markings, 525622805 edges, 49091 markings/sec, 915 secs
lola: 44008119 markings, 528469112 edges, 47929 markings/sec, 920 secs
lola: 44198033 markings, 531209545 edges, 37983 markings/sec, 925 secs
lola: 44386476 markings, 533935400 edges, 37689 markings/sec, 930 secs
lola: 44622024 markings, 536815931 edges, 47110 markings/sec, 935 secs
lola: 44844530 markings, 539666146 edges, 44501 markings/sec, 940 secs
lola: 45043302 markings, 542479875 edges, 39754 markings/sec, 945 secs
lola: 45217064 markings, 545226196 edges, 34752 markings/sec, 950 secs
lola: 45415206 markings, 548007315 edges, 39628 markings/sec, 955 secs
lola: 45634585 markings, 550773880 edges, 43876 markings/sec, 960 secs
lola: 45856479 markings, 553592846 edges, 44379 markings/sec, 965 secs
lola: 46037331 markings, 556342447 edges, 36170 markings/sec, 970 secs
lola: 46206463 markings, 559045559 edges, 33826 markings/sec, 975 secs
lola: 46454086 markings, 561886326 edges, 49525 markings/sec, 980 secs
lola: 46720445 markings, 564757502 edges, 53272 markings/sec, 985 secs
lola: 46948132 markings, 567545424 edges, 45537 markings/sec, 990 secs
lola: 47145343 markings, 570261393 edges, 39442 markings/sec, 995 secs
lola: 47395564 markings, 573118059 edges, 50044 markings/sec, 1000 secs
lola: 47631216 markings, 575938536 edges, 47130 markings/sec, 1005 secs
lola: 47851109 markings, 578745688 edges, 43979 markings/sec, 1010 secs
lola: 48036743 markings, 581469999 edges, 37127 markings/sec, 1015 secs
lola: 48259363 markings, 584273830 edges, 44524 markings/sec, 1020 secs
lola: 48500311 markings, 587095945 edges, 48190 markings/sec, 1025 secs
lola: 48729634 markings, 589908504 edges, 45865 markings/sec, 1030 secs
lola: 48915281 markings, 592618550 edges, 37129 markings/sec, 1035 secs
lola: 49110858 markings, 595345495 edges, 39115 markings/sec, 1040 secs
lola: 49356368 markings, 598151271 edges, 49102 markings/sec, 1045 secs
lola: 49597429 markings, 600955534 edges, 48212 markings/sec, 1050 secs
lola: 49788051 markings, 603651359 edges, 38124 markings/sec, 1055 secs
lola: 49965882 markings, 606309550 edges, 35566 markings/sec, 1060 secs
lola: 50197166 markings, 609144612 edges, 46257 markings/sec, 1065 secs
lola: 50411831 markings, 611920364 edges, 42933 markings/sec, 1070 secs
lola: 50617856 markings, 614697061 edges, 41205 markings/sec, 1075 secs
lola: 50789683 markings, 617390835 edges, 34365 markings/sec, 1080 secs
lola: 50965279 markings, 620097356 edges, 35119 markings/sec, 1085 secs
lola: 51195099 markings, 622892227 edges, 45964 markings/sec, 1090 secs
lola: 51412116 markings, 625657753 edges, 43403 markings/sec, 1095 secs
lola: 51601680 markings, 628376082 edges, 37913 markings/sec, 1100 secs
lola: 51770223 markings, 631040616 edges, 33709 markings/sec, 1105 secs
lola: 51984531 markings, 633854382 edges, 42862 markings/sec, 1110 secs
lola: 52269858 markings, 636907365 edges, 57065 markings/sec, 1115 secs
lola: 52552709 markings, 639955029 edges, 56570 markings/sec, 1120 secs
lola: 52821130 markings, 642980102 edges, 53684 markings/sec, 1125 secs
lola: 53035281 markings, 645857727 edges, 42830 markings/sec, 1130 secs
lola: 53281603 markings, 648838992 edges, 49264 markings/sec, 1135 secs
lola: 53535444 markings, 651816651 edges, 50768 markings/sec, 1140 secs
lola: 53774452 markings, 654817323 edges, 47802 markings/sec, 1145 secs
lola: 53970328 markings, 657667566 edges, 39175 markings/sec, 1150 secs
lola: 54198532 markings, 660600613 edges, 45641 markings/sec, 1155 secs
lola: 54449912 markings, 663541981 edges, 50276 markings/sec, 1160 secs
lola: 54689377 markings, 666489854 edges, 47893 markings/sec, 1165 secs
lola: 54882766 markings, 669302282 edges, 38678 markings/sec, 1170 secs
lola: 55095048 markings, 672159988 edges, 42456 markings/sec, 1175 secs
lola: 55353283 markings, 675133610 edges, 51647 markings/sec, 1180 secs
lola: 55597434 markings, 678068751 edges, 48830 markings/sec, 1185 secs
lola: 55790896 markings, 680895250 edges, 38692 markings/sec, 1190 secs
lola: 55989204 markings, 683710315 edges, 39662 markings/sec, 1195 secs
lola: 56234723 markings, 686727315 edges, 49104 markings/sec, 1200 secs
lola: 56466311 markings, 689635366 edges, 46318 markings/sec, 1205 secs
lola: 56659688 markings, 692542781 edges, 38675 markings/sec, 1210 secs
lola: 56833644 markings, 695315180 edges, 34791 markings/sec, 1215 secs
lola: 57059997 markings, 698270412 edges, 45271 markings/sec, 1220 secs
lola: 57283978 markings, 701123387 edges, 44796 markings/sec, 1225 secs
lola: 57499978 markings, 704026991 edges, 43200 markings/sec, 1230 secs
lola: 57677211 markings, 706803503 edges, 35447 markings/sec, 1235 secs
lola: 57856736 markings, 709569561 edges, 35905 markings/sec, 1240 secs
lola: 58107549 markings, 712401524 edges, 50163 markings/sec, 1245 secs
lola: 58352866 markings, 715253142 edges, 49063 markings/sec, 1250 secs
lola: 58547684 markings, 717996744 edges, 38964 markings/sec, 1255 secs
lola: 58728584 markings, 720703192 edges, 36180 markings/sec, 1260 secs
lola: 58960516 markings, 723546433 edges, 46386 markings/sec, 1265 secs
lola: 59177142 markings, 726348929 edges, 43325 markings/sec, 1270 secs
lola: 59384877 markings, 729157541 edges, 41547 markings/sec, 1275 secs
lola: 59558784 markings, 731879451 edges, 34781 markings/sec, 1280 secs
lola: 59741041 markings, 734641749 edges, 36451 markings/sec, 1285 secs
lola: 59971524 markings, 737472138 edges, 46097 markings/sec, 1290 secs
lola: 60195465 markings, 740292183 edges, 44788 markings/sec, 1295 secs
lola: 60382190 markings, 743049883 edges, 37345 markings/sec, 1300 secs
lola: 60553821 markings, 745760593 edges, 34326 markings/sec, 1305 secs
lola: 60757427 markings, 748532960 edges, 40721 markings/sec, 1310 secs
lola: 60976952 markings, 751318878 edges, 43905 markings/sec, 1315 secs
lola: 61192919 markings, 754102641 edges, 43193 markings/sec, 1320 secs
lola: 61368361 markings, 756797607 edges, 35088 markings/sec, 1325 secs
lola: 61533490 markings, 759439811 edges, 33026 markings/sec, 1330 secs
lola: 61742564 markings, 762242991 edges, 41815 markings/sec, 1335 secs
lola: 61944487 markings, 765014719 edges, 40385 markings/sec, 1340 secs
lola: 62142127 markings, 767797334 edges, 39528 markings/sec, 1345 secs
lola: 62305715 markings, 770496981 edges, 32718 markings/sec, 1350 secs
lola: 62462961 markings, 773177932 edges, 31449 markings/sec, 1355 secs
lola: 62662907 markings, 775965312 edges, 39989 markings/sec, 1360 secs
lola: 62864722 markings, 778731992 edges, 40363 markings/sec, 1365 secs
lola: 63064169 markings, 781510138 edges, 39889 markings/sec, 1370 secs
lola: 63229275 markings, 784214574 edges, 33021 markings/sec, 1375 secs
lola: 63386403 markings, 786890093 edges, 31426 markings/sec, 1380 secs
lola: 63597491 markings, 789638573 edges, 42218 markings/sec, 1385 secs
lola: 63835548 markings, 792430907 edges, 47611 markings/sec, 1390 secs
lola: 64057368 markings, 795187347 edges, 44364 markings/sec, 1395 secs
lola: 64242328 markings, 797874614 edges, 36992 markings/sec, 1400 secs
lola: 64437309 markings, 800583484 edges, 38996 markings/sec, 1405 secs
lola: 64662781 markings, 803385533 edges, 45094 markings/sec, 1410 secs
lola: 64885395 markings, 806174830 edges, 44523 markings/sec, 1415 secs
lola: 65068489 markings, 808901080 edges, 36619 markings/sec, 1420 secs
lola: 65237887 markings, 811579438 edges, 33880 markings/sec, 1425 secs
lola: 65441423 markings, 814339122 edges, 40707 markings/sec, 1430 secs
lola: 65658891 markings, 817103056 edges, 43494 markings/sec, 1435 secs
lola: 65873519 markings, 819868340 edges, 42926 markings/sec, 1440 secs
lola: 66048537 markings, 822553646 edges, 35004 markings/sec, 1445 secs
lola: 66214117 markings, 825201773 edges, 33116 markings/sec, 1450 secs
lola: 66429918 markings, 827950088 edges, 43160 markings/sec, 1455 secs
lola: 66643215 markings, 830675805 edges, 42659 markings/sec, 1460 secs
lola: 66848079 markings, 833390500 edges, 40973 markings/sec, 1465 secs
lola: 67015848 markings, 836031301 edges, 33554 markings/sec, 1470 secs
lola: 67185324 markings, 838665195 edges, 33895 markings/sec, 1475 secs
lola: 67394765 markings, 841432923 edges, 41888 markings/sec, 1480 secs
lola: 67591190 markings, 844159408 edges, 39285 markings/sec, 1485 secs
lola: 67783161 markings, 846901734 edges, 38394 markings/sec, 1490 secs
lola: 67941850 markings, 849561665 edges, 31738 markings/sec, 1495 secs
lola: 68096934 markings, 852195221 edges, 31017 markings/sec, 1500 secs
lola: 68298437 markings, 854941227 edges, 40301 markings/sec, 1505 secs
lola: 68495456 markings, 857650922 edges, 39404 markings/sec, 1510 secs
lola: 68689736 markings, 860371558 edges, 38856 markings/sec, 1515 secs
lola: 68850892 markings, 863018608 edges, 32231 markings/sec, 1520 secs
lola: 69004378 markings, 865630121 edges, 30697 markings/sec, 1525 secs
lola: 69261675 markings, 868563678 edges, 51459 markings/sec, 1530 secs
lola: 69580838 markings, 871690930 edges, 63833 markings/sec, 1535 secs
lola: 69903362 markings, 874802346 edges, 64505 markings/sec, 1540 secs
lola: 70155495 markings, 877822706 edges, 50427 markings/sec, 1545 secs
lola: 70410970 markings, 880797199 edges, 51095 markings/sec, 1550 secs
lola: 70704526 markings, 883893230 edges, 58711 markings/sec, 1555 secs
lola: 70969702 markings, 886945927 edges, 53035 markings/sec, 1560 secs
lola: 71184999 markings, 889839596 edges, 43059 markings/sec, 1565 secs
lola: 71453131 markings, 892868921 edges, 53626 markings/sec, 1570 secs
lola: 71730029 markings, 895854933 edges, 55380 markings/sec, 1575 secs
lola: 71973840 markings, 898838430 edges, 48762 markings/sec, 1580 secs
lola: 72178473 markings, 901657667 edges, 40927 markings/sec, 1585 secs
lola: 72471428 markings, 904753140 edges, 58591 markings/sec, 1590 secs
lola: 72750491 markings, 907767170 edges, 55813 markings/sec, 1595 secs
lola: 72970679 markings, 910696910 edges, 44038 markings/sec, 1600 secs
lola: 73194364 markings, 913582675 edges, 44737 markings/sec, 1605 secs
lola: 73460589 markings, 916628430 edges, 53245 markings/sec, 1610 secs
lola: 73710546 markings, 919607698 edges, 49991 markings/sec, 1615 secs
lola: 73909683 markings, 922500161 edges, 39827 markings/sec, 1620 secs
lola: 74109090 markings, 925343537 edges, 39881 markings/sec, 1625 secs
lola: 74374664 markings, 928360476 edges, 53115 markings/sec, 1630 secs
lola: 74625296 markings, 931300616 edges, 50126 markings/sec, 1635 secs
lola: 74825892 markings, 934170263 edges, 40119 markings/sec, 1640 secs
lola: 75018890 markings, 936965521 edges, 38600 markings/sec, 1645 secs
lola: 75294011 markings, 939886324 edges, 55024 markings/sec, 1650 secs
lola: 75566680 markings, 942822861 edges, 54534 markings/sec, 1655 secs
lola: 75776445 markings, 945617794 edges, 41953 markings/sec, 1660 secs
lola: 75990743 markings, 948427807 edges, 42860 markings/sec, 1665 secs
lola: 76248222 markings, 951359480 edges, 51496 markings/sec, 1670 secs
lola: 76497154 markings, 954275693 edges, 49786 markings/sec, 1675 secs
lola: 76693985 markings, 957080999 edges, 39366 markings/sec, 1680 secs
lola: 76884843 markings, 959862653 edges, 38172 markings/sec, 1685 secs
lola: 77139986 markings, 962780903 edges, 51029 markings/sec, 1690 secs
lola: 77388339 markings, 965677342 edges, 49671 markings/sec, 1695 secs
lola: 77590450 markings, 968469879 edges, 40422 markings/sec, 1700 secs
lola: 77776036 markings, 971221348 edges, 37117 markings/sec, 1705 secs
lola: 78018341 markings, 974085069 edges, 48461 markings/sec, 1710 secs
lola: 78255236 markings, 976920128 edges, 47379 markings/sec, 1715 secs
lola: 78477638 markings, 979737533 edges, 44480 markings/sec, 1720 secs
lola: 78663916 markings, 982469591 edges, 37256 markings/sec, 1725 secs
lola: 78877948 markings, 985280522 edges, 42806 markings/sec, 1730 secs
lola: 79102630 markings, 988131086 edges, 44936 markings/sec, 1735 secs
lola: 79323186 markings, 990982307 edges, 44111 markings/sec, 1740 secs
lola: 79502206 markings, 993745523 edges, 35804 markings/sec, 1745 secs
lola: 79673782 markings, 996469481 edges, 34315 markings/sec, 1750 secs
lola: 79901802 markings, 999324613 edges, 45604 markings/sec, 1755 secs
lola: 80118134 markings, 1002127327 edges, 43266 markings/sec, 1760 secs
lola: 80324480 markings, 1004927227 edges, 41269 markings/sec, 1765 secs
lola: 80498097 markings, 1007644580 edges, 34723 markings/sec, 1770 secs
lola: 80683238 markings, 1010385046 edges, 37028 markings/sec, 1775 secs
lola: 80956736 markings, 1013240157 edges, 54700 markings/sec, 1780 secs
lola: 81216288 markings, 1016086436 edges, 51910 markings/sec, 1785 secs
lola: 81419191 markings, 1018817632 edges, 40581 markings/sec, 1790 secs
lola: 81636289 markings, 1021579472 edges, 43420 markings/sec, 1795 secs
lola: 81883454 markings, 1024426905 edges, 49433 markings/sec, 1800 secs
lola: 82124178 markings, 1027265423 edges, 48145 markings/sec, 1805 secs
lola: 82314784 markings, 1030000870 edges, 38121 markings/sec, 1810 secs
lola: 82501187 markings, 1032714065 edges, 37281 markings/sec, 1815 secs
lola: 82749872 markings, 1035558349 edges, 49737 markings/sec, 1820 secs
lola: 82990408 markings, 1038376549 edges, 48107 markings/sec, 1825 secs
lola: 83193789 markings, 1041124858 edges, 40676 markings/sec, 1830 secs
lola: 83376199 markings, 1043815309 edges, 36482 markings/sec, 1835 secs
lola: 83603356 markings, 1046593192 edges, 45431 markings/sec, 1840 secs
lola: 83839953 markings, 1049370204 edges, 47319 markings/sec, 1845 secs
lola: 84060647 markings, 1052120252 edges, 44139 markings/sec, 1850 secs
lola: 84244614 markings, 1054797105 edges, 36793 markings/sec, 1855 secs
lola: 84440326 markings, 1057502420 edges, 39142 markings/sec, 1860 secs
lola: 84664153 markings, 1060291606 edges, 44765 markings/sec, 1865 secs
lola: 84886334 markings, 1063074945 edges, 44436 markings/sec, 1870 secs
lola: 85068209 markings, 1065787323 edges, 36375 markings/sec, 1875 secs
lola: 85237232 markings, 1068461064 edges, 33805 markings/sec, 1880 secs
lola: 85440138 markings, 1071210484 edges, 40581 markings/sec, 1885 secs
lola: 85657066 markings, 1073966385 edges, 43386 markings/sec, 1890 secs
lola: 85871070 markings, 1076721699 edges, 42801 markings/sec, 1895 secs
lola: 86045506 markings, 1079395031 edges, 34887 markings/sec, 1900 secs
lola: 86210252 markings, 1082028661 edges, 32949 markings/sec, 1905 secs
lola: 86474209 markings, 1085009345 edges, 52791 markings/sec, 1910 secs
lola: 86751759 markings, 1088028829 edges, 55510 markings/sec, 1915 secs
lola: 87025852 markings, 1091004262 edges, 54819 markings/sec, 1920 secs
lola: 87280088 markings, 1094026206 edges, 50847 markings/sec, 1925 secs
lola: 87485039 markings, 1096853437 edges, 40990 markings/sec, 1930 secs
lola: 87754937 markings, 1099925014 edges, 53980 markings/sec, 1935 secs
lola: 88008216 markings, 1102888895 edges, 50656 markings/sec, 1940 secs
lola: 88225412 markings, 1105844072 edges, 43439 markings/sec, 1945 secs
lola: 88414544 markings, 1108651016 edges, 37826 markings/sec, 1950 secs
lola: 88670932 markings, 1111670818 edges, 51278 markings/sec, 1955 secs
lola: 88916555 markings, 1114577148 edges, 49125 markings/sec, 1960 secs
lola: 89140949 markings, 1117523852 edges, 44879 markings/sec, 1965 secs
lola: 89330438 markings, 1120314613 edges, 37898 markings/sec, 1970 secs
lola: 89575288 markings, 1123285456 edges, 48970 markings/sec, 1975 secs
lola: 89818187 markings, 1126172064 edges, 48580 markings/sec, 1980 secs
lola: 90052102 markings, 1129140936 edges, 46783 markings/sec, 1985 secs
lola: 90243446 markings, 1131944497 edges, 38269 markings/sec, 1990 secs
lola: 90469103 markings, 1134884451 edges, 45131 markings/sec, 1995 secs
lola: 90698325 markings, 1137801208 edges, 45844 markings/sec, 2000 secs
lola: 90922461 markings, 1140752046 edges, 44827 markings/sec, 2005 secs
lola: 91102652 markings, 1143595439 edges, 36038 markings/sec, 2010 secs
lola: 91285018 markings, 1146395984 edges, 36473 markings/sec, 2015 secs
lola: 91525495 markings, 1149354725 edges, 48095 markings/sec, 2020 secs
lola: 91749126 markings, 1152200247 edges, 44726 markings/sec, 2025 secs
lola: 91947863 markings, 1155080006 edges, 39747 markings/sec, 2030 secs
lola: 92122246 markings, 1157828695 edges, 34877 markings/sec, 2035 secs
lola: 92335140 markings, 1160626108 edges, 42579 markings/sec, 2040 secs
lola: 92577280 markings, 1163462223 edges, 48428 markings/sec, 2045 secs
lola: 92807767 markings, 1166286134 edges, 46097 markings/sec, 2050 secs
lola: 92994782 markings, 1169014890 edges, 37403 markings/sec, 2055 secs
lola: 93191777 markings, 1171770215 edges, 39399 markings/sec, 2060 secs
lola: 93422818 markings, 1174632756 edges, 46208 markings/sec, 2065 secs
lola: 93650251 markings, 1177485829 edges, 45487 markings/sec, 2070 secs
lola: 93835818 markings, 1180256893 edges, 37113 markings/sec, 2075 secs
lola: 94008233 markings, 1182988680 edges, 34483 markings/sec, 2080 secs
lola: 94218925 markings, 1185808781 edges, 42138 markings/sec, 2085 secs
lola: 94440789 markings, 1188626063 edges, 44373 markings/sec, 2090 secs
lola: 94656114 markings, 1191440663 edges, 43065 markings/sec, 2095 secs
lola: 94830452 markings, 1194161085 edges, 34868 markings/sec, 2100 secs
lola: 95002972 markings, 1196866536 edges, 34504 markings/sec, 2105 secs
lola: 95228104 markings, 1199673372 edges, 45026 markings/sec, 2110 secs
lola: 95441144 markings, 1202434730 edges, 42608 markings/sec, 2115 secs
lola: 95644099 markings, 1205196232 edges, 40591 markings/sec, 2120 secs
lola: 95815819 markings, 1207882504 edges, 34344 markings/sec, 2125 secs
lola: 95993859 markings, 1210586808 edges, 35608 markings/sec, 2130 secs
lola: 96207376 markings, 1213405742 edges, 42703 markings/sec, 2135 secs
lola: 96407772 markings, 1216180140 edges, 40079 markings/sec, 2140 secs
lola: 96591981 markings, 1218951651 edges, 36842 markings/sec, 2145 secs
lola: 96753484 markings, 1221660425 edges, 32301 markings/sec, 2150 secs
lola: 96918196 markings, 1224381087 edges, 32942 markings/sec, 2155 secs
lola: 97131442 markings, 1227169969 edges, 42649 markings/sec, 2160 secs
lola: 97326145 markings, 1229903588 edges, 38941 markings/sec, 2165 secs
lola: 97514172 markings, 1232658494 edges, 37605 markings/sec, 2170 secs
lola: 97673377 markings, 1235330219 edges, 31841 markings/sec, 2175 secs
lola: 97834677 markings, 1238010050 edges, 32260 markings/sec, 2180 secs
lola: 98075229 markings, 1240774104 edges, 48110 markings/sec, 2185 secs
lola: 98312340 markings, 1243545439 edges, 47422 markings/sec, 2190 secs
lola: 98511041 markings, 1246245223 edges, 39740 markings/sec, 2195 secs
lola: 98691228 markings, 1248900783 edges, 36037 markings/sec, 2200 secs
lola: 98905498 markings, 1251653271 edges, 42854 markings/sec, 2205 secs
lola: 99124001 markings, 1254427578 edges, 43701 markings/sec, 2210 secs
lola: 99335984 markings, 1257195576 edges, 42397 markings/sec, 2215 secs
lola: 99508348 markings, 1259881654 edges, 34473 markings/sec, 2220 secs
lola: 99677600 markings, 1262545646 edges, 33850 markings/sec, 2225 secs
lola: 99900029 markings, 1265326147 edges, 44486 markings/sec, 2230 secs
lola: 100111059 markings, 1268058174 edges, 42206 markings/sec, 2235 secs
lola: 100313776 markings, 1270789264 edges, 40543 markings/sec, 2240 secs
lola: 100482696 markings, 1273437878 edges, 33784 markings/sec, 2245 secs
lola: 100655047 markings, 1276096992 edges, 34470 markings/sec, 2250 secs
lola: 100879177 markings, 1278830715 edges, 44826 markings/sec, 2255 secs
lola: 101088424 markings, 1281525706 edges, 41849 markings/sec, 2260 secs
lola: 101280127 markings, 1284204597 edges, 38341 markings/sec, 2265 secs
lola: 101446106 markings, 1286820528 edges, 33196 markings/sec, 2270 secs
lola: 101623685 markings, 1289471616 edges, 35516 markings/sec, 2275 secs
lola: 101830786 markings, 1292220577 edges, 41420 markings/sec, 2280 secs
lola: 102026704 markings, 1294931389 edges, 39184 markings/sec, 2285 secs
lola: 102206271 markings, 1297636803 edges, 35913 markings/sec, 2290 secs
lola: 102364361 markings, 1300283608 edges, 31618 markings/sec, 2295 secs
lola: 102524430 markings, 1302933872 edges, 32014 markings/sec, 2300 secs
lola: 102731293 markings, 1305661410 edges, 41373 markings/sec, 2305 secs
lola: 102922539 markings, 1308333828 edges, 38249 markings/sec, 2310 secs
lola: 103109985 markings, 1311028078 edges, 37489 markings/sec, 2315 secs
lola: 103265412 markings, 1313643086 edges, 31085 markings/sec, 2320 secs
lola: 103419421 markings, 1316235926 edges, 30802 markings/sec, 2325 secs
lola: 103712725 markings, 1319279700 edges, 58661 markings/sec, 2330 secs
lola: 104032149 markings, 1322392614 edges, 63885 markings/sec, 2335 secs
lola: 104343430 markings, 1325476816 edges, 62256 markings/sec, 2340 secs
lola: 104585415 markings, 1328442197 edges, 48397 markings/sec, 2345 secs
lola: 104856073 markings, 1331459679 edges, 54132 markings/sec, 2350 secs
lola: 105136960 markings, 1334496370 edges, 56177 markings/sec, 2355 secs
lola: 105394247 markings, 1337535021 edges, 51457 markings/sec, 2360 secs
lola: 105601644 markings, 1340379346 edges, 41479 markings/sec, 2365 secs
lola: 105885901 markings, 1343443123 edges, 56851 markings/sec, 2370 secs
lola: 106166427 markings, 1346435883 edges, 56105 markings/sec, 2375 secs
lola: 106390091 markings, 1349352182 edges, 44733 markings/sec, 2380 secs
lola: 106600534 markings, 1352175323 edges, 42089 markings/sec, 2385 secs
lola: 106892976 markings, 1355242165 edges, 58488 markings/sec, 2390 secs
lola: 107168498 markings, 1358246359 edges, 55104 markings/sec, 2395 secs
lola: 107383223 markings, 1361130795 edges, 42945 markings/sec, 2400 secs
lola: 107616987 markings, 1364045666 edges, 46753 markings/sec, 2405 secs
lola: 107875898 markings, 1367049299 edges, 51782 markings/sec, 2410 secs
lola: 108120454 markings, 1370027661 edges, 48911 markings/sec, 2415 secs
lola: 108316059 markings, 1372877832 edges, 39121 markings/sec, 2420 secs
lola: 108526942 markings, 1375744621 edges, 42177 markings/sec, 2425 secs
lola: 108784382 markings, 1378708272 edges, 51488 markings/sec, 2430 secs
lola: 109028603 markings, 1381625604 edges, 48844 markings/sec, 2435 secs
lola: 109223486 markings, 1384455689 edges, 38977 markings/sec, 2440 secs
lola: 109417976 markings, 1387235896 edges, 38898 markings/sec, 2445 secs
lola: 109694132 markings, 1390133246 edges, 55231 markings/sec, 2450 secs
lola: 109963188 markings, 1393045860 edges, 53811 markings/sec, 2455 secs
lola: 110169124 markings, 1395809529 edges, 41187 markings/sec, 2460 secs
lola: 110387029 markings, 1398603697 edges, 43581 markings/sec, 2465 secs
lola: 110639673 markings, 1401504930 edges, 50529 markings/sec, 2470 secs
lola: 110885875 markings, 1404401719 edges, 49240 markings/sec, 2475 secs
lola: 111078718 markings, 1407175402 edges, 38569 markings/sec, 2480 secs
lola: 111269237 markings, 1409934528 edges, 38104 markings/sec, 2485 secs
lola: 111523094 markings, 1412833230 edges, 50771 markings/sec, 2490 secs
lola: 111770105 markings, 1415710013 edges, 49402 markings/sec, 2495 secs
lola: 111970095 markings, 1418478967 edges, 39998 markings/sec, 2500 secs
lola: 112153798 markings, 1421201702 edges, 36741 markings/sec, 2505 secs
lola: 112392948 markings, 1424039121 edges, 47830 markings/sec, 2510 secs
lola: 112629058 markings, 1426854470 edges, 47222 markings/sec, 2515 secs
lola: 112849545 markings, 1429640778 edges, 44097 markings/sec, 2520 secs
lola: 113034850 markings, 1432349636 edges, 37061 markings/sec, 2525 secs
lola: 113242859 markings, 1435118827 edges, 41602 markings/sec, 2530 secs
lola: 113466865 markings, 1437945054 edges, 44801 markings/sec, 2535 secs
lola: 113687318 markings, 1440769989 edges, 44091 markings/sec, 2540 secs
lola: 113867420 markings, 1443516179 edges, 36020 markings/sec, 2545 secs
lola: 114036519 markings, 1446220537 edges, 33820 markings/sec, 2550 secs
lola: 114257563 markings, 1449038228 edges, 44209 markings/sec, 2555 secs
lola: 114474958 markings, 1451823030 edges, 43479 markings/sec, 2560 secs
lola: 114682906 markings, 1454604698 edges, 41590 markings/sec, 2565 secs
lola: 114854125 markings, 1457301207 edges, 34244 markings/sec, 2570 secs
lola: 115030127 markings, 1460013816 edges, 35200 markings/sec, 2575 secs
lola: 115298927 markings, 1462849320 edges, 53760 markings/sec, 2580 secs
lola: 115563819 markings, 1465698916 edges, 52978 markings/sec, 2585 secs
lola: 115766462 markings, 1468390449 edges, 40529 markings/sec, 2590 secs
lola: 115971247 markings, 1471112917 edges, 40957 markings/sec, 2595 secs
lola: 116222713 markings, 1473946893 edges, 50293 markings/sec, 2600 secs
lola: 116467725 markings, 1476794480 edges, 49002 markings/sec, 2605 secs
lola: 116664860 markings, 1479553559 edges, 39427 markings/sec, 2610 secs
lola: 116847040 markings, 1482272109 edges, 36436 markings/sec, 2615 secs
lola: 117093013 markings, 1485140852 edges, 49195 markings/sec, 2620 secs
lola: 117330278 markings, 1487970870 edges, 47453 markings/sec, 2625 secs
lola: 117548357 markings, 1490768525 edges, 43616 markings/sec, 2630 secs
lola: 117733398 markings, 1493485964 edges, 37008 markings/sec, 2635 secs
lola: 117955401 markings, 1496279226 edges, 44401 markings/sec, 2640 secs
lola: 118196372 markings, 1499100896 edges, 48194 markings/sec, 2645 secs
lola: 118424114 markings, 1501893674 edges, 45548 markings/sec, 2650 secs
lola: 118609368 markings, 1504596219 edges, 37051 markings/sec, 2655 secs
lola: 118802217 markings, 1507315000 edges, 38570 markings/sec, 2660 secs
lola: 119032082 markings, 1510140148 edges, 45973 markings/sec, 2665 secs
lola: 119254134 markings, 1512935217 edges, 44410 markings/sec, 2670 secs
lola: 119438110 markings, 1515649495 edges, 36795 markings/sec, 2675 secs
lola: 119608604 markings, 1518334963 edges, 34099 markings/sec, 2680 secs
lola: 119807296 markings, 1521067932 edges, 39738 markings/sec, 2685 secs
lola: 120021547 markings, 1523783068 edges, 42850 markings/sec, 2690 secs
lola: 120233960 markings, 1526486803 edges, 42483 markings/sec, 2695 secs
lola: 120410904 markings, 1529173878 edges, 35389 markings/sec, 2700 secs
lola: 120576584 markings, 1531822388 edges, 33136 markings/sec, 2705 secs
lola: 120831992 markings, 1534784367 edges, 51082 markings/sec, 2710 secs
lola: 121109819 markings, 1537806967 edges, 55565 markings/sec, 2715 secs
lola: 121387688 markings, 1540809678 edges, 55574 markings/sec, 2720 secs
lola: 121644514 markings, 1543834113 edges, 51365 markings/sec, 2725 secs
lola: 121852406 markings, 1546685381 edges, 41578 markings/sec, 2730 secs
lola: 122118539 markings, 1549745154 edges, 53227 markings/sec, 2735 secs
lola: 122370181 markings, 1552708133 edges, 50328 markings/sec, 2740 secs
lola: 122594137 markings, 1555689348 edges, 44791 markings/sec, 2745 secs
lola: 122784524 markings, 1558514991 edges, 38077 markings/sec, 2750 secs
lola: 123039148 markings, 1561541466 edges, 50925 markings/sec, 2755 secs
lola: 123285250 markings, 1564473592 edges, 49220 markings/sec, 2760 secs
lola: 123515150 markings, 1567450231 edges, 45980 markings/sec, 2765 secs
lola: 123706354 markings, 1570265813 edges, 38241 markings/sec, 2770 secs
lola: 123951801 markings, 1573260939 edges, 49089 markings/sec, 2775 secs
lola: 124199131 markings, 1576197092 edges, 49466 markings/sec, 2780 secs
lola: 124432955 markings, 1579167670 edges, 46765 markings/sec, 2785 secs
lola: 124625089 markings, 1581982348 edges, 38427 markings/sec, 2790 secs
lola: 124852840 markings, 1584948474 edges, 45550 markings/sec, 2795 secs
lola: 125084677 markings, 1587894490 edges, 46367 markings/sec, 2800 secs
lola: 125309256 markings, 1590867510 edges, 44916 markings/sec, 2805 secs
lola: 125490672 markings, 1593720653 edges, 36283 markings/sec, 2810 secs
lola: 125673928 markings, 1596539119 edges, 36651 markings/sec, 2815 secs
lola: 125916304 markings, 1599511298 edges, 48475 markings/sec, 2820 secs
lola: 126143827 markings, 1602381861 edges, 45505 markings/sec, 2825 secs
lola: 126339017 markings, 1605264819 edges, 39038 markings/sec, 2830 secs
lola: 126513237 markings, 1608021652 edges, 34844 markings/sec, 2835 secs
lola: 126733114 markings, 1610850779 edges, 43975 markings/sec, 2840 secs
lola: 126977953 markings, 1613720379 edges, 48968 markings/sec, 2845 secs
lola: 127205317 markings, 1616557224 edges, 45473 markings/sec, 2850 secs
lola: 127394435 markings, 1619310139 edges, 37824 markings/sec, 2855 secs
lola: 127598030 markings, 1622089006 edges, 40719 markings/sec, 2860 secs
lola: 127825559 markings, 1624952124 edges, 45506 markings/sec, 2865 secs
lola: 128052995 markings, 1627814228 edges, 45487 markings/sec, 2870 secs
lola: 128235097 markings, 1630575024 edges, 36420 markings/sec, 2875 secs
lola: 128404311 markings, 1633275852 edges, 33843 markings/sec, 2880 secs
lola: 128619545 markings, 1636082573 edges, 43047 markings/sec, 2885 secs
lola: 128841328 markings, 1638900260 edges, 44357 markings/sec, 2890 secs
lola: 129053627 markings, 1641716606 edges, 42460 markings/sec, 2895 secs
lola: 129225526 markings, 1644431874 edges, 34380 markings/sec, 2900 secs
lola: 129402908 markings, 1647169392 edges, 35476 markings/sec, 2905 secs
lola: 129631414 markings, 1649981934 edges, 45701 markings/sec, 2910 secs
lola: 129848168 markings, 1652771395 edges, 43351 markings/sec, 2915 secs
lola: 130044074 markings, 1655506793 edges, 39181 markings/sec, 2920 secs
lola: 130211770 markings, 1658148873 edges, 33539 markings/sec, 2925 secs
lola: 130394596 markings, 1660851834 edges, 36565 markings/sec, 2930 secs
lola: 130599536 markings, 1663592551 edges, 40988 markings/sec, 2935 secs
lola: 130798913 markings, 1666329955 edges, 39875 markings/sec, 2940 secs
lola: 130977795 markings, 1669056506 edges, 35776 markings/sec, 2945 secs
lola: 131133432 markings, 1671675015 edges, 31127 markings/sec, 2950 secs
lola: 131294175 markings, 1674329492 edges, 32149 markings/sec, 2955 secs
lola: 131504195 markings, 1677086855 edges, 42004 markings/sec, 2960 secs
lola: 131698571 markings, 1679815343 edges, 38875 markings/sec, 2965 secs
lola: 131885649 markings, 1682532397 edges, 37416 markings/sec, 2970 secs
lola: 132040003 markings, 1685137387 edges, 30871 markings/sec, 2975 secs
lola: 132198342 markings, 1687765149 edges, 31668 markings/sec, 2980 secs
lola: 132434628 markings, 1690548007 edges, 47257 markings/sec, 2985 secs
lola: 132671402 markings, 1693333819 edges, 47355 markings/sec, 2990 secs
lola: 132878104 markings, 1696070799 edges, 41340 markings/sec, 2995 secs
lola: 133058539 markings, 1698724328 edges, 36087 markings/sec, 3000 secs
lola: 133265742 markings, 1701412978 edges, 41441 markings/sec, 3005 secs
lola: 133477412 markings, 1704100665 edges, 42334 markings/sec, 3010 secs
lola: time limit reached - aborting
lola:
preliminary result: yes yes unknown yes yes yes unknown yes yes unknown yes no yes no yes
lola:
preliminary result: yes yes unknown yes yes yes unknown yes yes unknown yes no yes no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes yes unknown yes yes yes unknown yes yes unknown yes no yes no yes
lola: memory consumption: 46352 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16094288 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16094288 kB

--------------------
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="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-03, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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