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.r186-oct2-158987938500099.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 RefineWMG-PT-050050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 110K Mar 24 05:38 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 n0-CTLCardinality-00
FORMULA_NAME n0-CTLCardinality-01
FORMULA_NAME n0-CTLCardinality-02
FORMULA_NAME n0-CTLCardinality-03
FORMULA_NAME n0-CTLCardinality-04
FORMULA_NAME n0-CTLCardinality-05
FORMULA_NAME n0-CTLCardinality-06
FORMULA_NAME n0-CTLCardinality-07
FORMULA_NAME n0-CTLCardinality-08
FORMULA_NAME n0-CTLCardinality-09
FORMULA_NAME n0-CTLCardinality-10
FORMULA_NAME n0-CTLCardinality-11
FORMULA_NAME n0-CTLCardinality-12
FORMULA_NAME n0-CTLCardinality-13
FORMULA_NAME n0-CTLCardinality-14
FORMULA_NAME n0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591227367257

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:36:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:36:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:36:08] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-03 23:36:08] [INFO ] Transformed 254 places.
[2020-06-03 23:36:08] [INFO ] Transformed 203 transitions.
[2020-06-03 23:36:08] [INFO ] Parsed PT model containing 254 places and 203 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Incomplete random walk after 100013 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=571 ) properties seen :[1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:36:08] [INFO ] Computed 102 place invariants in 5 ms
[2020-06-03 23:36:09] [INFO ] [Real]Absence check using 102 positive place invariants in 43 ms returned sat
[2020-06-03 23:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:09] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-03 23:36:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 28 ms returned sat
[2020-06-03 23:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:12] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:12] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:12] [INFO ] Added : 111 causal constraints over 23 iterations in 311 ms. Result :sat
[2020-06-03 23:36:12] [INFO ] [Real]Absence check using 102 positive place invariants in 27 ms returned sat
[2020-06-03 23:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:12] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:36:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:13] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:13] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2020-06-03 23:36:13] [INFO ] Added : 70 causal constraints over 14 iterations in 175 ms. Result :sat
[2020-06-03 23:36:13] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:13] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-06-03 23:36:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:13] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:14] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2020-06-03 23:36:14] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:36:14] [INFO ] Added : 102 causal constraints over 21 iterations in 245 ms. Result :sat
[2020-06-03 23:36:14] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:14] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:36:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:14] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:14] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:36:14] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:36:15] [INFO ] Added : 104 causal constraints over 21 iterations in 251 ms. Result :sat
[2020-06-03 23:36:15] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:15] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-06-03 23:36:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:15] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:15] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-06-03 23:36:15] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 6 ms.
[2020-06-03 23:36:15] [INFO ] Added : 102 causal constraints over 21 iterations in 243 ms. Result :sat
[2020-06-03 23:36:15] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:15] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:36:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:15] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:16] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:36:16] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:16] [INFO ] Added : 100 causal constraints over 20 iterations in 238 ms. Result :sat
[2020-06-03 23:36:16] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:16] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:36:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:16] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:16] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:36:16] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:17] [INFO ] Added : 109 causal constraints over 22 iterations in 293 ms. Result :sat
[2020-06-03 23:36:17] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:17] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-03 23:36:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:17] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:17] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-06-03 23:36:17] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 17 ms.
[2020-06-03 23:36:17] [INFO ] Added : 102 causal constraints over 21 iterations in 273 ms. Result :sat
[2020-06-03 23:36:17] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2020-06-03 23:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:17] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:36:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:17] [INFO ] [Nat]Absence check using 102 positive place invariants in 20 ms returned sat
[2020-06-03 23:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:18] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-03 23:36:18] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:36:18] [INFO ] Added : 62 causal constraints over 13 iterations in 143 ms. Result :sat
[2020-06-03 23:36:18] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:18] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:18] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:18] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-03 23:36:18] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:18] [INFO ] Added : 96 causal constraints over 20 iterations in 229 ms. Result :sat
[2020-06-03 23:36:18] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-06-03 23:36:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:36:19] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:19] [INFO ] Added : 49 causal constraints over 10 iterations in 110 ms. Result :sat
[2020-06-03 23:36:19] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-03 23:36:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-06-03 23:36:19] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:20] [INFO ] Added : 101 causal constraints over 21 iterations in 262 ms. Result :sat
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-03 23:36:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:20] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-03 23:36:20] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:36:20] [INFO ] Added : 88 causal constraints over 18 iterations in 246 ms. Result :sat
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-03 23:36:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 29 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:21] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 23:36:21] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:21] [INFO ] Added : 88 causal constraints over 18 iterations in 225 ms. Result :sat
[2020-06-03 23:36:21] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:21] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:21] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:21] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:21] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:36:21] [INFO ] Added : 53 causal constraints over 11 iterations in 129 ms. Result :sat
[2020-06-03 23:36:21] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:22] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:36:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:22] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:22] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:36:22] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:36:22] [INFO ] Added : 87 causal constraints over 18 iterations in 220 ms. Result :sat
[2020-06-03 23:36:22] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:22] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-03 23:36:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:22] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:22] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:36:22] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:36:23] [INFO ] Added : 100 causal constraints over 20 iterations in 234 ms. Result :sat
[2020-06-03 23:36:23] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:23] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 23:36:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:23] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:23] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-03 23:36:23] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:23] [INFO ] Added : 62 causal constraints over 13 iterations in 151 ms. Result :sat
[2020-06-03 23:36:23] [INFO ] Flatten gal took : 63 ms
[2020-06-03 23:36:23] [INFO ] Flatten gal took : 12 ms
[2020-06-03 23:36:23] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 23:36:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-050050 @ 3570 seconds

FORMULA n0-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1678
rslt: Output for CTLCardinality @ RefineWMG-PT-050050

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p116 <= p120)",
"processed_size": 14,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p78)))",
"processed_size": 18,
"rewrites": 21
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 230
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"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": "AX(EF((1 <= p82)))",
"processed_size": 18,
"rewrites": 22
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "AX(EG((p171 <= p201)))",
"processed_size": 22,
"rewrites": 22
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 2650,
"markings": 2600,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(2 <= p118)",
"processed_size": 11,
"rewrites": 23
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "A (G (((2 <= p218) OR (p138 <= p166))))",
"processed_size": 40,
"rewrites": 22
},
"result":
{
"edges": 105,
"markings": 88,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p29)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "AX(((3 <= p129) AND (p95 <= p44)))",
"processed_size": 34,
"rewrites": 21
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 ((3 <= p30)))",
"processed_size": 18,
"rewrites": 21
},
"result":
{
"edges": 137,
"markings": 138,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 358
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "EX((p98 <= p134))",
"processed_size": 17,
"rewrites": 21
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p236 <= p11)))",
"processed_size": 21,
"rewrites": 22
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 358
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p236 + 1 <= p18)))",
"processed_size": 25,
"rewrites": 21
},
"result":
{
"edges": 63,
"markings": 60,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 403
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p233 <= p67)))",
"processed_size": 21,
"rewrites": 22
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 461
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p248) AND (p167 <= p160))))",
"processed_size": 40,
"rewrites": 21
},
"result":
{
"edges": 52,
"markings": 53,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G ((((p24 <= p69) OR (p42 <= p239) OR (p223 <= p116) OR (p142 <= p75)) AND (((1 <= p31) AND (p203 <= p140)) OR ((p84 <= p166) AND (2 <= p161))))))",
"processed_size": 153,
"rewrites": 22
},
"result":
{
"edges": 249,
"markings": 199,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 828
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "((p84 + 1 <= p152) OR (p150 <= 2))",
"processed_size": 35,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p107)))",
"processed_size": 19,
"rewrites": 22
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p114 <= p231) OR (1 <= p23)) AND ((p167 <= p16) OR (3 <= p228)))",
"processed_size": 69,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p5 <= p144)))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 169,
"markings": 170,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p110) OR (p122 <= p25) OR (p21 + 1 <= p117))",
"processed_size": 51,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p116 <= p120)",
"processed_size": 14,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p78)))",
"processed_size": 18,
"rewrites": 21
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p110) OR (p122 <= p25) OR (p21 + 1 <= p117))",
"processed_size": 51,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p202 <= 1)",
"processed_size": 11,
"rewrites": 24
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 21,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3724,
"runtime": 1892.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : (E(F(A(X(**)))) AND (E(F(**)) OR (** OR E(F(*))))) : A(G(E((** U **)))) : E(X(A(G(*)))) : E(F(**)) : (A(G(**)) AND (** AND **)) : (A(G(A(F(**)))) OR (** OR (** OR **))) : (A(G(**)) AND **) : (A(X(E(F(**)))) AND A(X(E(G(**))))) : A(G(**)) : A(G(**)) : (A(X(E(G(**)))) OR E(F(E(G(**))))) : E(F((A(F(**)) AND **))) : (** OR (A(G(**)) OR A(X(**)))) : (E(X(*)) AND (E(F(**)) AND (** OR A(F(**)))))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "yes no unknown unknown unknown yes no no no yes no no yes unknown no yes ",
"value": "yes no unknown unknown unknown yes no no no yes no no yes unknown 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: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 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 CTLCardinality.xml
lola: E (F (A (F ((p236 + 1 <= p18))))) : A (G ((p236 <= p11))) : (E (F (A (X ((1 <= p70))))) AND ((E (F ((1 <= p78))) OR (p116 <= p120)) OR NOT(A (G ((p52 <= p150)))))) : A (G (E (((p136 <= p205) U (p0 <= p191))))) : NOT(A (X (E (F ((2 <= p118)))))) : E (F (((2 <= p248) AND (p167 <= p160)))) : ((A (G ((p5 <= p144))) AND ((p114 <= p231) OR (1 <= p23))) AND ((p167 <= p16) OR (3 <= p228))) : (((A (G (A (F ((2 <= p202))))) OR (1 <= p110)) OR (p122 <= p25)) OR (p21 + 1 <= p117)) : (A (G ((1 <= p107))) AND ((p84 + 1 <= p152) OR (p150 <= 2))) : A (X ((E (F ((1 <= p82))) AND E (G ((p171 <= p201)))))) : A (G ((p233 <= p67))) : A (G ((((p24 <= p69) OR (p42 <= p239) OR (p223 <= p116) OR (p142 <= p75)) AND (((1 <= p31) AND (p203 <= p140)) OR ((p84 <= p166) AND (2 <= p161)))))) : (A (X (E (G ((2 <= p190))))) OR E (F (E (G ((2 <= p118)))))) : E (F ((A (F ((p172 <= p190))) AND ((p243 <= p136) OR (p86 <= p36) OR ((1 <= p17) AND (1 <= p158)))))) : (((1 <= p29) OR A (G (((2 <= p218) OR (p138 <= p166))))) OR A (X (((3 <= p129) AND (p95 <= p44))))) : ((NOT(A (X ((p134 + 1 <= p98)))) AND E (F ((3 <= p30)))) AND (((p186 <= 1) OR (p115 <= 2)) OR A (F ((2 <= p67)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((1 <= p70))))) AND (E (F ((1 <= p78))) OR ((p116 <= p120) OR E (F ((p150 + 1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p116 <= p120)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p116 <= p120)
lola: processed formula length: 14
lola: 20 rewrites
lola: closed formula file CTLCardinality.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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p78)))
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 <= p78)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p70)))))
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(AX((1 <= p70)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file CTLCardinality.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).
lola: 1995040 markings, 3012442 edges, 399008 markings/sec, 0 secs
lola: 4074844 markings, 6152940 edges, 415961 markings/sec, 5 secs
lola: 6171520 markings, 9318934 edges, 419335 markings/sec, 10 secs
lola: 8247003 markings, 12452930 edges, 415097 markings/sec, 15 secs
lola: 10284137 markings, 15529009 edges, 407427 markings/sec, 20 secs
lola: 12263860 markings, 18518380 edges, 395945 markings/sec, 25 secs
lola: 14207805 markings, 21453737 edges, 388789 markings/sec, 30 secs
lola: 16199597 markings, 24461349 edges, 398358 markings/sec, 35 secs
lola: 18223724 markings, 27517773 edges, 404825 markings/sec, 40 secs
lola: 20288054 markings, 30634882 edges, 412866 markings/sec, 45 secs
lola: 22311089 markings, 33689708 edges, 404607 markings/sec, 50 secs
lola: 24269932 markings, 36647509 edges, 391769 markings/sec, 55 secs
lola: 26219388 markings, 39591239 edges, 389891 markings/sec, 60 secs
lola: 28207176 markings, 42598967 edges, 397558 markings/sec, 65 secs
lola: 30044294 markings, 45367301 edges, 367424 markings/sec, 70 secs
lola: 31656274 markings, 47800973 edges, 322396 markings/sec, 75 secs
lola: 33477807 markings, 50552000 edges, 364307 markings/sec, 80 secs
lola: 34267674 markings, 51744111 edges, 157973 markings/sec, 85 secs
lola: 35395628 markings, 53447338 edges, 225591 markings/sec, 90 secs
lola: 35421457 markings, 53486333 edges, 5166 markings/sec, 95 secs
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: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p118 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((p118 <= 1)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLCardinality.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).
lola: 2518258 markings, 3802519 edges, 503652 markings/sec, 0 secs
lola: 5041224 markings, 7612212 edges, 504593 markings/sec, 5 secs
lola: 7580751 markings, 11446870 edges, 507905 markings/sec, 10 secs
lola: 10024590 markings, 15137087 edges, 488768 markings/sec, 15 secs
lola: 12437334 markings, 18780338 edges, 482549 markings/sec, 20 secs
lola: 14893487 markings, 22489130 edges, 491231 markings/sec, 25 secs
lola: 17372873 markings, 26232964 edges, 495877 markings/sec, 30 secs
lola: 19859773 markings, 29988192 edges, 497380 markings/sec, 35 secs
lola: 22337069 markings, 33728935 edges, 495459 markings/sec, 40 secs
lola: 24747929 markings, 37369316 edges, 482172 markings/sec, 45 secs
lola: 27134381 markings, 40972873 edges, 477290 markings/sec, 50 secs
lola: 29605300 markings, 44703961 edges, 494184 markings/sec, 55 secs
lola: 32066411 markings, 48420219 edges, 492222 markings/sec, 60 secs
lola: 34586699 markings, 52225842 edges, 504058 markings/sec, 65 secs
lola: 37040582 markings, 55931217 edges, 490777 markings/sec, 70 secs
lola: 39447175 markings, 59565206 edges, 481319 markings/sec, 75 secs
lola: 41898379 markings, 63266504 edges, 490241 markings/sec, 80 secs
lola: 44358139 markings, 66980741 edges, 491952 markings/sec, 85 secs
lola: 46833825 markings, 70719015 edges, 495137 markings/sec, 90 secs
lola: 48749981 markings, 73612562 edges, 383231 markings/sec, 95 secs
lola: 49091340 markings, 74128002 edges, 68272 markings/sec, 100 secs
lola: 51279611 markings, 77432219 edges, 437654 markings/sec, 105 secs
lola: 51394723 markings, 77605982 edges, 23022 markings/sec, 110 secs
lola: 51394723 markings, 77605982 edges, 0 markings/sec, 115 secs
lola: 51394723 markings, 77605982 edges, 0 markings/sec, 120 secs
lola: 51394723 markings, 77605982 edges, 0 markings/sec, 125 secs
lola: 51394723 markings, 77605982 edges, 0 markings/sec, 130 secs
lola: 51448089 markings, 77686591 edges, 10673 markings/sec, 135 secs
lola: 53266611 markings, 80432695 edges, 363704 markings/sec, 140 secs
lola: 55423755 markings, 83689833 edges, 431429 markings/sec, 145 secs
lola: 56405408 markings, 85172122 edges, 196331 markings/sec, 150 secs
lola: 57154871 markings, 86303805 edges, 149893 markings/sec, 155 secs
lola: 57154871 markings, 86303805 edges, 0 markings/sec, 160 secs
lola: 57162747 markings, 86315683 edges, 1575 markings/sec, 165 secs
lola: 59394194 markings, 89685179 edges, 446289 markings/sec, 170 secs
lola: 59503205 markings, 89849762 edges, 21802 markings/sec, 175 secs
lola: 59503205 markings, 89849762 edges, 0 markings/sec, 180 secs
lola: 59503702 markings, 89850511 edges, 99 markings/sec, 185 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((1 <= p82))))) AND A (X (E (G ((p171 <= p201))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p82)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((1 <= p82)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file CTLCardinality.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).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p171 <= p201)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((p171 <= p201)))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file CTLCardinality.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).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2600 markings, 2650 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((2 <= p190))))) OR E (F (E (G ((2 <= p118))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (2 <= p118)
lola: processed formula length: 11
lola: 23 rewrites
lola: closed formula file CTLCardinality.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 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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p118)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (p118 <= 1)
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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p29) OR (A (G (((2 <= p218) OR (p138 <= p166)))) OR A (X (((3 <= p129) AND (p95 <= p44))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p218) OR (p138 <= p166))))
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 (((2 <= p218) OR (p138 <= p166))))
lola: processed formula length: 40
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: ((p218 <= 1) AND (p166 + 1 <= p138))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 88 markings, 105 edges
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p29)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLCardinality.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 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p129) AND (p95 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((3 <= p129) AND (p95 <= p44)))
lola: processed formula length: 34
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((p98 <= p134))) AND (E (F ((3 <= p30))) AND (((p186 <= 1) OR (p115 <= 2)) OR A (F ((2 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p186 <= 1) OR (p115 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p186 <= 1) OR (p115 <= 2))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p30)))
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 ((3 <= p30)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (3 <= p30)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p98 <= p134)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p98 <= p134))
lola: processed formula length: 17
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p236 <= p11)))
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 ((p236 <= p11)))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (p11 + 1 <= p236)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p236 + 1 <= p18)))
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 ((p236 + 1 <= p18)))
lola: processed formula length: 25
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (p236 + 1 <= p18)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 60 markings, 63 edges
lola: ========================================
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p233 <= p67)))
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 ((p233 <= p67)))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (p67 + 1 <= p233)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p248) AND (p167 <= p160))))
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 (((2 <= p248) AND (p167 <= p160))))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((2 <= p248) AND (p167 <= p160))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 10 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p24 <= p69) OR (p42 <= p239) OR (p223 <= p116) OR (p142 <= p75)) AND (((1 <= p31) AND (p203 <= p140)) OR ((p84 <= p166) AND (2 <= p161))))))
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 ((((p24 <= p69) OR (p42 <= p239) OR (p223 <= p116) OR (p142 <= p75)) AND (((1 <= p31) AND (p203 <= p140)) OR ((p84 <= p166) AND (2 <= p161))))))
lola: processed formula length: 153
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (((p69 + 1 <= p24) AND (p239 + 1 <= p42) AND (p116 + 1 <= p223) AND (p75 + 1 <= p142)) OR (((p31 <= 0) OR (p140 + 1 <= p203)) AND ((p166 + 1 <= p84) OR (p161 <= 1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 199 markings, 249 edges
lola: ========================================
lola: subprocess 11 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((p136 <= p205) U (p0 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((p136 <= p205) U (p0 <= p191)))
lola: processed formula length: 36
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 1668796 markings, 4188633 edges, 333759 markings/sec, 0 secs
lola: 3346751 markings, 8400279 edges, 335591 markings/sec, 5 secs
lola: 5001638 markings, 12554042 edges, 330977 markings/sec, 10 secs
lola: 6698006 markings, 16811920 edges, 339274 markings/sec, 15 secs
lola: 8363211 markings, 20991585 edges, 333041 markings/sec, 20 secs
lola: 9992290 markings, 25080588 edges, 325816 markings/sec, 25 secs
lola: 11593911 markings, 29100667 edges, 320324 markings/sec, 30 secs
lola: 13190365 markings, 33107763 edges, 319291 markings/sec, 35 secs
lola: 14825169 markings, 37211143 edges, 326961 markings/sec, 40 secs
lola: 16464857 markings, 41326761 edges, 327938 markings/sec, 45 secs
lola: 18120999 markings, 45483640 edges, 331228 markings/sec, 50 secs
lola: 19759122 markings, 49595322 edges, 327625 markings/sec, 55 secs
lola: 21431796 markings, 53793749 edges, 334535 markings/sec, 60 secs
lola: 23079450 markings, 57929376 edges, 329531 markings/sec, 65 secs
lola: 24713146 markings, 62029949 edges, 326739 markings/sec, 70 secs
lola: 26308680 markings, 66034739 edges, 319107 markings/sec, 75 secs
lola: 27924021 markings, 70089266 edges, 323068 markings/sec, 80 secs
lola: 29576792 markings, 74237669 edges, 330554 markings/sec, 85 secs
lola: 31230820 markings, 78389286 edges, 330806 markings/sec, 90 secs
lola: 32897378 markings, 82572375 edges, 333312 markings/sec, 95 secs
lola: 34600287 markings, 86846630 edges, 340582 markings/sec, 100 secs
lola: 36222184 markings, 90917609 edges, 324379 markings/sec, 105 secs
lola: 37855818 markings, 95018041 edges, 326727 markings/sec, 110 secs
lola: 39503940 markings, 99154850 edges, 329624 markings/sec, 115 secs
lola: 41158657 markings, 103308199 edges, 330943 markings/sec, 120 secs
lola: 42829583 markings, 107502196 edges, 334185 markings/sec, 125 secs
lola: 44507058 markings, 111712657 edges, 335495 markings/sec, 130 secs
lola: 46178983 markings, 115909204 edges, 334385 markings/sec, 135 secs
lola: 47852744 markings, 120110664 edges, 334752 markings/sec, 140 secs
lola: 48113020 markings, 120767321 edges, 52055 markings/sec, 145 secs
lola: 49702718 markings, 124754568 edges, 317940 markings/sec, 150 secs
lola: 51009743 markings, 128035843 edges, 261405 markings/sec, 155 secs
lola: 51660138 markings, 129666903 edges, 130079 markings/sec, 160 secs
lola: 51660138 markings, 129666903 edges, 0 markings/sec, 165 secs
lola: 52681093 markings, 132229491 edges, 204191 markings/sec, 170 secs
lola: 53494943 markings, 134272245 edges, 162770 markings/sec, 175 secs
lola: 53580141 markings, 134486112 edges, 17040 markings/sec, 180 secs
lola: 53580141 markings, 134486112 edges, 0 markings/sec, 185 secs
lola: 53580141 markings, 134486112 edges, 0 markings/sec, 190 secs
lola: 54248003 markings, 136162435 edges, 133572 markings/sec, 195 secs
lola: 55183145 markings, 138509670 edges, 187028 markings/sec, 200 secs
lola: 56245046 markings, 141175042 edges, 212380 markings/sec, 205 secs
lola: 56341793 markings, 141417832 edges, 19349 markings/sec, 210 secs
lola: 56341793 markings, 141417832 edges, 0 markings/sec, 215 secs
lola: 56341793 markings, 141417832 edges, 0 markings/sec, 220 secs
lola: 56347531 markings, 141432251 edges, 1148 markings/sec, 225 secs
lola: 56648027 markings, 142186480 edges, 60099 markings/sec, 230 secs
lola: 57227671 markings, 143641397 edges, 115929 markings/sec, 235 secs
lola: 58226451 markings, 146148319 edges, 199756 markings/sec, 240 secs
lola: 59652082 markings, 149727235 edges, 285126 markings/sec, 245 secs
lola: 59676763 markings, 149788623 edges, 4936 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((p172 <= p190))) AND ((p243 <= p136) OR (p86 <= p36) OR ((1 <= p17) AND (1 <= p158))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF((p172 <= p190)) AND ((p243 <= p136) OR (p86 <= p36) OR ((1 <= p17) AND (1 <= p158)))))
lola: processed formula length: 95
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 1180395 markings, 4143045 edges, 236079 markings/sec, 0 secs
lola: 2368705 markings, 8314102 edges, 237662 markings/sec, 5 secs
lola: 3551079 markings, 12464128 edges, 236475 markings/sec, 10 secs
lola: 4738412 markings, 16631805 edges, 237467 markings/sec, 15 secs
lola: 5942178 markings, 20856967 edges, 240753 markings/sec, 20 secs
lola: 7141989 markings, 25068323 edges, 239962 markings/sec, 25 secs
lola: 8291019 markings, 29101331 edges, 229806 markings/sec, 30 secs
lola: 9441532 markings, 33139729 edges, 230103 markings/sec, 35 secs
lola: 10565038 markings, 37083245 edges, 224701 markings/sec, 40 secs
lola: 11688843 markings, 41027736 edges, 224761 markings/sec, 45 secs
lola: 12810435 markings, 44964561 edges, 224318 markings/sec, 50 secs
lola: 13947956 markings, 48957268 edges, 227504 markings/sec, 55 secs
lola: 15112575 markings, 53045089 edges, 232924 markings/sec, 60 secs
lola: 16269969 markings, 57107427 edges, 231479 markings/sec, 65 secs
lola: 17433999 markings, 61193260 edges, 232806 markings/sec, 70 secs
lola: 18586797 markings, 65239592 edges, 230560 markings/sec, 75 secs
lola: 19750617 markings, 69324569 edges, 232764 markings/sec, 80 secs
lola: 20919630 markings, 73427740 edges, 233803 markings/sec, 85 secs
lola: 22062477 markings, 77439246 edges, 228569 markings/sec, 90 secs
lola: 23193962 markings, 81410737 edges, 226297 markings/sec, 95 secs
lola: 24324367 markings, 85378450 edges, 226081 markings/sec, 100 secs
lola: 25450785 markings, 89332090 edges, 225284 markings/sec, 105 secs
lola: 26560011 markings, 93225547 edges, 221845 markings/sec, 110 secs
lola: 27702759 markings, 97236620 edges, 228550 markings/sec, 115 secs
lola: 28862330 markings, 101306737 edges, 231914 markings/sec, 120 secs
lola: 30012429 markings, 105343559 edges, 230020 markings/sec, 125 secs
lola: 31169519 markings, 109404931 edges, 231418 markings/sec, 130 secs
lola: 32326095 markings, 113464468 edges, 231315 markings/sec, 135 secs
lola: 33496953 markings, 117574213 edges, 234172 markings/sec, 140 secs
lola: 34693827 markings, 121775255 edges, 239375 markings/sec, 145 secs
lola: 35859319 markings, 125866158 edges, 233098 markings/sec, 150 secs
lola: 37003208 markings, 129881179 edges, 228778 markings/sec, 155 secs
lola: 38160131 markings, 133942013 edges, 231385 markings/sec, 160 secs
lola: 39281838 markings, 137879211 edges, 224341 markings/sec, 165 secs
lola: 40409326 markings, 141836704 edges, 225498 markings/sec, 170 secs
lola: 41611074 markings, 146054834 edges, 240350 markings/sec, 175 secs
lola: 42793790 markings, 150206150 edges, 236543 markings/sec, 180 secs
lola: 43960741 markings, 154302138 edges, 233390 markings/sec, 185 secs
lola: 45129849 markings, 158405629 edges, 233822 markings/sec, 190 secs
lola: 46278703 markings, 162438169 edges, 229771 markings/sec, 195 secs
lola: 47472606 markings, 166628788 edges, 238781 markings/sec, 200 secs
lola: 48111700 markings, 168872093 edges, 127819 markings/sec, 205 secs
lola: 48539609 markings, 170374476 edges, 85582 markings/sec, 210 secs
lola: 49627949 markings, 174195794 edges, 217668 markings/sec, 215 secs
lola: 50303699 markings, 176565912 edges, 135150 markings/sec, 220 secs
lola: 51041669 markings, 179156189 edges, 147594 markings/sec, 225 secs
lola: 51041669 markings, 179156189 edges, 0 markings/sec, 230 secs
lola: 51457166 markings, 180614621 edges, 83099 markings/sec, 235 secs
lola: 51991799 markings, 182491149 edges, 106927 markings/sec, 240 secs
lola: 51991799 markings, 182491149 edges, 0 markings/sec, 245 secs
lola: 52481223 markings, 184209044 edges, 97885 markings/sec, 250 secs
lola: 53187239 markings, 186687127 edges, 141203 markings/sec, 255 secs
lola: 53187239 markings, 186687127 edges, 0 markings/sec, 260 secs
lola: 53428413 markings, 187533685 edges, 48235 markings/sec, 265 secs
lola: 53948669 markings, 189359763 edges, 104051 markings/sec, 270 secs
lola: 53948669 markings, 189359763 edges, 0 markings/sec, 275 secs
lola: 53959912 markings, 189399247 edges, 2249 markings/sec, 280 secs
lola: 55085049 markings, 193348412 edges, 225027 markings/sec, 285 secs
lola: 55209903 markings, 193786712 edges, 24971 markings/sec, 290 secs
lola: 55295654 markings, 194087635 edges, 17150 markings/sec, 295 secs
lola: 55821481 markings, 195933249 edges, 105165 markings/sec, 300 secs
lola: 56238770 markings, 197397943 edges, 83458 markings/sec, 305 secs
lola: 56238770 markings, 197397943 edges, 0 markings/sec, 310 secs
lola: 56238770 markings, 197397943 edges, 0 markings/sec, 315 secs
lola: 56238770 markings, 197397943 edges, 0 markings/sec, 320 secs
lola: 56279705 markings, 197541728 edges, 8187 markings/sec, 325 secs
lola: 57426365 markings, 201566466 edges, 229332 markings/sec, 330 secs
lola: 57446453 markings, 201636972 edges, 4018 markings/sec, 335 secs
lola: 57446453 markings, 201636972 edges, 0 markings/sec, 340 secs
lola: 57446453 markings, 201636972 edges, 0 markings/sec, 345 secs
lola: 57577678 markings, 202097603 edges, 26245 markings/sec, 350 secs
lola: 58317531 markings, 204694389 edges, 147971 markings/sec, 355 secs
lola: 58890570 markings, 206705837 edges, 114608 markings/sec, 360 secs
lola: 59335289 markings, 208266780 edges, 88944 markings/sec, 365 secs
lola: 59665056 markings, 209424271 edges, 65953 markings/sec, 370 secs
lola: 59828171 markings, 209996809 edges, 32623 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p107))) AND ((p84 + 1 <= p152) OR (p150 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p84 + 1 <= p152) OR (p150 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p84 + 1 <= p152) OR (p150 <= 2))
lola: processed formula length: 35
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 14 will run for 1242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p107)))
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 <= p107)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (p107 <= 0)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p5 <= p144))) AND (((p114 <= p231) OR (1 <= p23)) AND ((p167 <= p16) OR (3 <= p228))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p114 <= p231) OR (1 <= p23)) AND ((p167 <= p16) OR (3 <= p228)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p114 <= p231) OR (1 <= p23)) AND ((p167 <= p16) OR (3 <= p228)))
lola: processed formula length: 69
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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 15 will run for 2485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 <= p144)))
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 ((p5 <= p144)))
lola: processed formula length: 20
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (p144 + 1 <= p5)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 170 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((2 <= p202))))) OR ((1 <= p110) OR ((p122 <= p25) OR (p21 + 1 <= p117))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p110) OR ((p122 <= p25) OR (p21 + 1 <= p117)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p110) OR (p122 <= p25) OR (p21 + 1 <= p117))
lola: processed formula length: 51
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: 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 (A (X ((1 <= p70))))) AND (E (F ((1 <= p78))) OR ((p116 <= p120) OR E (F ((p150 + 1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p116 <= p120)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p116 <= p120)
lola: processed formula length: 14
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: ...considering subproblem: E (F ((1 <= p78)))
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 <= p78)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.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 <= p78)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p70)))))
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(AX((1 <= p70)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file CTLCardinality.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).
lola: 2100932 markings, 3172367 edges, 420186 markings/sec, 0 secs
lola: 4212693 markings, 6361128 edges, 422352 markings/sec, 5 secs
lola: 6319180 markings, 9541902 edges, 421297 markings/sec, 10 secs
lola: 8396333 markings, 12678420 edges, 415431 markings/sec, 15 secs
lola: 10412378 markings, 15722637 edges, 403209 markings/sec, 20 secs
lola: 12434429 markings, 18775950 edges, 404410 markings/sec, 25 secs
lola: 14403703 markings, 21749552 edges, 393855 markings/sec, 30 secs
lola: 16499683 markings, 24914466 edges, 419196 markings/sec, 35 secs
lola: 18590209 markings, 28071170 edges, 418105 markings/sec, 40 secs
lola: 20680243 markings, 31227089 edges, 418007 markings/sec, 45 secs
lola: 22744443 markings, 34344049 edges, 412840 markings/sec, 50 secs
lola: 24774118 markings, 37408840 edges, 405935 markings/sec, 55 secs
lola: 26803936 markings, 40473902 edges, 405964 markings/sec, 60 secs
lola: 28254664 markings, 42664461 edges, 290146 markings/sec, 65 secs
lola: 29210563 markings, 44108177 edges, 191180 markings/sec, 70 secs
lola: 31027599 markings, 46851855 edges, 363407 markings/sec, 75 secs
lola: 32109168 markings, 48486645 edges, 216314 markings/sec, 80 secs
lola: 33399657 markings, 50433405 edges, 258098 markings/sec, 85 secs
lola: 35036297 markings, 52904767 edges, 327328 markings/sec, 90 secs
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 (X (A (G ((p118 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((p118 <= 1)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLCardinality.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).
lola: 2568239 markings, 3877989 edges, 513648 markings/sec, 0 secs
lola: 5129274 markings, 7745166 edges, 512207 markings/sec, 5 secs
lola: 7690552 markings, 11612666 edges, 512256 markings/sec, 10 secs
lola: 10178318 markings, 15369184 edges, 497553 markings/sec, 15 secs
lola: 12646717 markings, 19096492 edges, 493680 markings/sec, 20 secs
lola: 15162683 markings, 22895611 edges, 503193 markings/sec, 25 secs
lola: 17666814 markings, 26676840 edges, 500826 markings/sec, 30 secs
lola: 20162651 markings, 30445570 edges, 499167 markings/sec, 35 secs
lola: 22674637 markings, 34238631 edges, 502397 markings/sec, 40 secs
lola: 25135439 markings, 37954476 edges, 492160 markings/sec, 45 secs
lola: 27538236 markings, 41582696 edges, 480559 markings/sec, 50 secs
lola: 30058807 markings, 45388744 edges, 504114 markings/sec, 55 secs
lola: 32554455 markings, 49157169 edges, 499130 markings/sec, 60 secs
lola: 35030661 markings, 52896262 edges, 495241 markings/sec, 65 secs
lola: 37484111 markings, 56600948 edges, 490690 markings/sec, 70 secs
lola: 39887010 markings, 60229335 edges, 480580 markings/sec, 75 secs
lola: 42340501 markings, 63934110 edges, 490698 markings/sec, 80 secs
lola: 44807461 markings, 67659208 edges, 493392 markings/sec, 85 secs
lola: 47292054 markings, 71410933 edges, 496919 markings/sec, 90 secs
lola: 49529793 markings, 74790333 edges, 447548 markings/sec, 95 secs
lola: 51671044 markings, 78023472 edges, 428250 markings/sec, 100 secs
lola: 53807846 markings, 81250188 edges, 427360 markings/sec, 105 secs
lola: 56044568 markings, 84627560 edges, 447344 markings/sec, 110 secs
lola: 56766485 markings, 85717345 edges, 144383 markings/sec, 115 secs
lola: 57551914 markings, 86903323 edges, 157086 markings/sec, 120 secs
lola: 59608173 markings, 90008277 edges, 411252 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (((p136 <= p205) U (p0 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((p136 <= p205) U (p0 <= p191)))
lola: processed formula length: 36
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 1711489 markings, 4295791 edges, 342298 markings/sec, 0 secs
lola: 3427163 markings, 8602131 edges, 343135 markings/sec, 5 secs
lola: 5112432 markings, 12832151 edges, 337054 markings/sec, 10 secs
lola: 6827957 markings, 17138097 edges, 343105 markings/sec, 15 secs
lola: 8530420 markings, 21411294 edges, 340493 markings/sec, 20 secs
lola: 10172764 markings, 25533579 edges, 328469 markings/sec, 25 secs
lola: 11779459 markings, 29566386 edges, 321339 markings/sec, 30 secs
lola: 13377358 markings, 33577101 edges, 319580 markings/sec, 35 secs
lola: 15047826 markings, 37769990 edges, 334094 markings/sec, 40 secs
lola: 16730598 markings, 41993750 edges, 336554 markings/sec, 45 secs
lola: 18419258 markings, 46232283 edges, 337732 markings/sec, 50 secs
lola: 20138947 markings, 50548686 edges, 343938 markings/sec, 55 secs
lola: 21825922 markings, 54782991 edges, 337395 markings/sec, 60 secs
lola: 23452752 markings, 58866345 edges, 325366 markings/sec, 65 secs
lola: 25085817 markings, 62965330 edges, 326613 markings/sec, 70 secs
lola: 26715643 markings, 67056222 edges, 325965 markings/sec, 75 secs
lola: 28386876 markings, 71251030 edges, 334247 markings/sec, 80 secs
lola: 30057115 markings, 75443307 edges, 334048 markings/sec, 85 secs
lola: 31735937 markings, 79657127 edges, 335764 markings/sec, 90 secs
lola: 33402416 markings, 83840010 edges, 333296 markings/sec, 95 secs
lola: 35094355 markings, 88086760 edges, 338388 markings/sec, 100 secs
lola: 36744984 markings, 92229845 edges, 330126 markings/sec, 105 secs
lola: 38370837 markings, 96310744 edges, 325171 markings/sec, 110 secs
lola: 39977727 markings, 100344043 edges, 321378 markings/sec, 115 secs
lola: 41627293 markings, 104484469 edges, 329913 markings/sec, 120 secs
lola: 43295258 markings, 108671048 edges, 333593 markings/sec, 125 secs
lola: 44951644 markings, 112828552 edges, 331277 markings/sec, 130 secs
lola: 46610232 markings, 116991633 edges, 331718 markings/sec, 135 secs
lola: 48248133 markings, 121102823 edges, 327580 markings/sec, 140 secs
lola: 49781940 markings, 124952681 edges, 306761 markings/sec, 145 secs
lola: 51293466 markings, 128746626 edges, 302305 markings/sec, 150 secs
lola: 52788813 markings, 132500109 edges, 299069 markings/sec, 155 secs
lola: 54029780 markings, 135614691 edges, 248193 markings/sec, 160 secs
lola: 55494231 markings, 139290489 edges, 292890 markings/sec, 165 secs
lola: 56510612 markings, 141841588 edges, 203276 markings/sec, 170 secs
lola: 56510612 markings, 141841588 edges, 0 markings/sec, 175 secs
lola: 57434244 markings, 144159889 edges, 184726 markings/sec, 180 secs
lola: 57845111 markings, 145191192 edges, 82173 markings/sec, 185 secs
lola: 58521153 markings, 146888025 edges, 135208 markings/sec, 190 secs
lola: 59358758 markings, 148990411 edges, 167521 markings/sec, 195 secs
lola: 59449729 markings, 149218753 edges, 18194 markings/sec, 200 secs
lola: 59632390 markings, 149677229 edges, 36532 markings/sec, 205 secs
lola: 59650390 markings, 149722422 edges, 3600 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((p172 <= p190))) AND ((p243 <= p136) OR (p86 <= p36) OR ((1 <= p17) AND (1 <= p158))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF((p172 <= p190)) AND ((p243 <= p136) OR (p86 <= p36) OR ((1 <= p17) AND (1 <= p158)))))
lola: processed formula length: 95
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 1234455 markings, 4332775 edges, 246891 markings/sec, 0 secs
lola: 2459853 markings, 8634002 edges, 245080 markings/sec, 5 secs
lola: 3653079 markings, 12822150 edges, 238645 markings/sec, 10 secs
lola: 4836936 markings, 16977601 edges, 236771 markings/sec, 15 secs
lola: 6026466 markings, 21152830 edges, 237906 markings/sec, 20 secs
lola: 7217673 markings, 25333936 edges, 238241 markings/sec, 25 secs
lola: 8404987 markings, 29501441 edges, 237463 markings/sec, 30 secs
lola: 9563286 markings, 33567081 edges, 231660 markings/sec, 35 secs
lola: 10719656 markings, 37625925 edges, 231274 markings/sec, 40 secs
lola: 11869383 markings, 41661436 edges, 229945 markings/sec, 45 secs
lola: 13007920 markings, 45657750 edges, 227707 markings/sec, 50 secs
lola: 14179685 markings, 49770629 edges, 234353 markings/sec, 55 secs
lola: 15363291 markings, 53925026 edges, 236721 markings/sec, 60 secs
lola: 16540357 markings, 58056510 edges, 235413 markings/sec, 65 secs
lola: 17721225 markings, 62201402 edges, 236174 markings/sec, 70 secs
lola: 18898917 markings, 66335039 edges, 235538 markings/sec, 75 secs
lola: 20086408 markings, 70503211 edges, 237498 markings/sec, 80 secs
lola: 21272911 markings, 74667860 edges, 237301 markings/sec, 85 secs
lola: 22447703 markings, 78791360 edges, 234958 markings/sec, 90 secs
lola: 23608409 markings, 82865480 edges, 232141 markings/sec, 95 secs
lola: 24760718 markings, 86910050 edges, 230462 markings/sec, 100 secs
lola: 25894811 markings, 90890733 edges, 226819 markings/sec, 105 secs
lola: 27024441 markings, 94855686 edges, 225926 markings/sec, 110 secs
lola: 28213390 markings, 99028943 edges, 237790 markings/sec, 115 secs
lola: 29402265 markings, 103201874 edges, 237775 markings/sec, 120 secs
lola: 30601415 markings, 107410907 edges, 239830 markings/sec, 125 secs
lola: 31796734 markings, 111606468 edges, 239064 markings/sec, 130 secs
lola: 32996745 markings, 115818481 edges, 240002 markings/sec, 135 secs
lola: 34205665 markings, 120061807 edges, 241784 markings/sec, 140 secs
lola: 35408789 markings, 124284789 edges, 240625 markings/sec, 145 secs
lola: 36585209 markings, 128414030 edges, 235284 markings/sec, 150 secs
lola: 37744873 markings, 132484455 edges, 231933 markings/sec, 155 secs
lola: 38908361 markings, 136568266 edges, 232698 markings/sec, 160 secs
lola: 40055905 markings, 140596211 edges, 229509 markings/sec, 165 secs
lola: 41241692 markings, 144758229 edges, 237157 markings/sec, 170 secs
lola: 42438605 markings, 148959471 edges, 239383 markings/sec, 175 secs
lola: 43628511 markings, 153136005 edges, 237981 markings/sec, 180 secs
lola: 44814803 markings, 157299917 edges, 237258 markings/sec, 185 secs
lola: 46007967 markings, 161487843 edges, 238633 markings/sec, 190 secs
lola: 47210258 markings, 165707936 edges, 240458 markings/sec, 195 secs
lola: 48380437 markings, 169815528 edges, 234036 markings/sec, 200 secs
lola: 49509119 markings, 173777384 edges, 225736 markings/sec, 205 secs
lola: 50592359 markings, 177579177 edges, 216648 markings/sec, 210 secs
lola: 51245669 markings, 179872593 edges, 130662 markings/sec, 215 secs
lola: 52343944 markings, 183727196 edges, 219655 markings/sec, 220 secs
lola: 53435014 markings, 187556853 edges, 218214 markings/sec, 225 secs
lola: 54555363 markings, 191489153 edges, 224070 markings/sec, 230 secs
lola: 55698779 markings, 195502575 edges, 228683 markings/sec, 235 secs
lola: 56834451 markings, 199488849 edges, 227134 markings/sec, 240 secs
lola: 57975423 markings, 203493610 edges, 228194 markings/sec, 245 secs
lola: 59105425 markings, 207460001 edges, 226000 markings/sec, 250 secs
lola: 59859006 markings, 210105056 edges, 150716 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((2 <= p202))))) OR ((1 <= p110) OR ((p122 <= p25) OR (p21 + 1 <= p117))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p110) OR ((p122 <= p25) OR (p21 + 1 <= p117)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p110) OR (p122 <= p25) OR (p21 + 1 <= p117))
lola: processed formula length: 51
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= p202)))))
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:787
lola: processed formula: (p202 <= 1)
lola: processed formula length: 11
lola: 24 rewrites
lola: closed formula file CTLCardinality.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 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 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: (2 <= p202)
lola: state equation task get result unparse finished id 0
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: state equation task get result unparse finished++ id 1
lola: formula 1: (p202 <= 1)
lola: state equation task get result unparse finished id 1
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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 56 markings, 56 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown unknown unknown yes no no no yes no no yes unknown no yes
lola:
preliminary result: yes no unknown unknown unknown yes no no no yes no no yes unknown no yes
lola: memory consumption: 3724 KB
lola: time consumption: 1892 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-050050"
export BK_EXAMINATION="CTLCardinality"
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 RefineWMG-PT-050050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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