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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:02 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 23K 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.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 22:57 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 1591227474209

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:37:55] [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:37:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:37:55] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-06-03 23:37:55] [INFO ] Transformed 254 places.
[2020-06-03 23:37:55] [INFO ] Transformed 203 transitions.
[2020-06-03 23:37:55] [INFO ] Parsed PT model containing 254 places and 203 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Incomplete random walk after 100009 steps, including 0 resets, run finished after 177 ms. (steps per millisecond=565 ) properties seen :[0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:37:55] [INFO ] Computed 102 place invariants in 6 ms
[2020-06-03 23:37:55] [INFO ] [Real]Absence check using 102 positive place invariants in 37 ms returned sat
[2020-06-03 23:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:56] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-03 23:37:56] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:56] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2020-06-03 23:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:56] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:37:56] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 19 ms.
[2020-06-03 23:37:56] [INFO ] Added : 86 causal constraints over 18 iterations in 247 ms. Result :sat
[2020-06-03 23:37:56] [INFO ] [Real]Absence check using 102 positive place invariants in 28 ms returned sat
[2020-06-03 23:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:56] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-03 23:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:57] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2020-06-03 23:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:57] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-03 23:37:57] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 27 ms.
[2020-06-03 23:37:57] [INFO ] Added : 46 causal constraints over 10 iterations in 159 ms. Result :sat
[2020-06-03 23:37:57] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:57] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 23:37:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:57] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:57] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:37:57] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:37:58] [INFO ] Added : 93 causal constraints over 19 iterations in 225 ms. Result :sat
[2020-06-03 23:37:58] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:58] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-03 23:37:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:58] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:58] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-06-03 23:37:58] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:37:58] [INFO ] Added : 101 causal constraints over 21 iterations in 266 ms. Result :sat
[2020-06-03 23:37:58] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:58] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:37:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:59] [INFO ] [Nat]Absence check using 102 positive place invariants in 38 ms returned sat
[2020-06-03 23:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:59] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-03 23:37:59] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:37:59] [INFO ] Added : 106 causal constraints over 22 iterations in 268 ms. Result :sat
[2020-06-03 23:37:59] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:59] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 23:37:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:59] [INFO ] [Nat]Absence check using 102 positive place invariants in 44 ms returned sat
[2020-06-03 23:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:59] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 23:37:59] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 6 ms.
[2020-06-03 23:38:00] [INFO ] Added : 99 causal constraints over 20 iterations in 258 ms. Result :sat
[2020-06-03 23:38:00] [INFO ] [Real]Absence check using 102 positive place invariants in 560 ms returned sat
[2020-06-03 23:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:00] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-06-03 23:38:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:01] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2020-06-03 23:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:01] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:38:01] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2020-06-03 23:38:01] [INFO ] Added : 95 causal constraints over 19 iterations in 429 ms. Result :sat
[2020-06-03 23:38:01] [INFO ] [Real]Absence check using 102 positive place invariants in 46 ms returned sat
[2020-06-03 23:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:01] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:38:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:01] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-06-03 23:38:02] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:38:02] [INFO ] Added : 98 causal constraints over 20 iterations in 305 ms. Result :sat
[2020-06-03 23:38:02] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:02] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-06-03 23:38:02] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:38:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-06-03 23:38:02] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 37 ms.
[2020-06-03 23:38:02] [INFO ] Added : 49 causal constraints over 10 iterations in 163 ms. Result :sat
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-03 23:38:03] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:03] [INFO ] Added : 103 causal constraints over 21 iterations in 261 ms. Result :sat
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-03 23:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:04] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-06-03 23:38:04] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:04] [INFO ] Added : 25 causal constraints over 5 iterations in 71 ms. Result :sat
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:38:04] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:04] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:04] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:38:04] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:04] [INFO ] Added : 67 causal constraints over 14 iterations in 178 ms. Result :sat
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-03 23:38:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:05] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:05] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:38:05] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:05] [INFO ] Added : 104 causal constraints over 21 iterations in 237 ms. Result :sat
[2020-06-03 23:38:05] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:05] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:38:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:05] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:05] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:38:05] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:05] [INFO ] Added : 31 causal constraints over 7 iterations in 90 ms. Result :sat
[2020-06-03 23:38:05] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:06] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-06-03 23:38:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:06] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2020-06-03 23:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:06] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 23:38:06] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:06] [INFO ] Added : 93 causal constraints over 19 iterations in 214 ms. Result :sat
[2020-06-03 23:38:06] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:06] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 23:38:06] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:06] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:07] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:38:07] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:07] [INFO ] Added : 48 causal constraints over 10 iterations in 119 ms. Result :sat
[2020-06-03 23:38:07] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:07] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-06-03 23:38:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:07] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:07] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-03 23:38:07] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:38:07] [INFO ] Added : 97 causal constraints over 20 iterations in 256 ms. Result :sat
[2020-06-03 23:38:07] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2020-06-03 23:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 23:38:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2020-06-03 23:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:38:08] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:08] [INFO ] Added : 33 causal constraints over 7 iterations in 100 ms. Result :sat
[2020-06-03 23:38:08] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:38:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using 102 positive place invariants in 37 ms returned sat
[2020-06-03 23:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-03 23:38:08] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:08] [INFO ] Added : 49 causal constraints over 10 iterations in 125 ms. Result :sat
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using 102 positive place invariants in 35 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:38:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:09] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:09] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2020-06-03 23:38:09] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:09] [INFO ] Added : 29 causal constraints over 6 iterations in 86 ms. Result :sat
[2020-06-03 23:38:09] [INFO ] Flatten gal took : 79 ms
[2020-06-03 23:38:09] [INFO ] Flatten gal took : 32 ms
[2020-06-03 23:38:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 23:38:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-050051 @ 3570 seconds

FORMULA n0-CTLCardinality-09 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-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA n0-CTLCardinality-15 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-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-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA n0-CTLCardinality-05 FALSE 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-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1725
rslt: Output for CTLCardinality @ RefineWMG-PT-050051

{
"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:38:09 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": "(p173 <= p66)",
"processed_size": 13,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(((2 <= p129) AND (1 <= p177)))",
"processed_size": 33,
"rewrites": 21
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"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": 256
},
"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 <= p174)",
"processed_size": 11,
"rewrites": 22
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"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": "(p45 <= p199)",
"processed_size": 13,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"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 ((p163 <= p1)))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"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 ((p184 <= p63)))",
"processed_size": 21,
"rewrites": 22
},
"result":
{
"edges": 43,
"markings": 30,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 278
},
"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 ((p137 <= p94)))",
"processed_size": 21,
"rewrites": 21
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"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 ((2 <= p35)))",
"processed_size": 18,
"rewrites": 21
},
"result":
{
"edges": 89,
"markings": 90,
"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": 370
},
"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 ((p232 <= p41)))",
"processed_size": 21,
"rewrites": 22
},
"result":
{
"edges": 202,
"markings": 139,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"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 ((p194 <= p124)))",
"processed_size": 22,
"rewrites": 22
},
"result":
{
"edges": 13,
"markings": 14,
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p238 <= 0) OR (3 <= p136) OR (p227 + 1 <= p71) OR (p83 + 1 <= p180))))",
"processed_size": 81,
"rewrites": 22
},
"result":
{
"edges": 2410,
"markings": 2411,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((2 <= p94) AND (p209 <= p6))",
"processed_size": 29,
"rewrites": 23
},
"result":
{
"edges": 199,
"markings": 199,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((p170 + 1 <= p207) AND (p156 <= 2))",
"processed_size": 36,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"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 <= p14)))",
"processed_size": 18,
"rewrites": 21
},
"result":
{
"edges": 146,
"markings": 147,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((p195 <= 0)))",
"processed_size": 19,
"rewrites": 22
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1111
},
"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": "(p167 <= p232)",
"processed_size": 14,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2495
},
"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 ((p31 <= p6)))",
"processed_size": 19,
"rewrites": 22
},
"result":
{
"edges": 52,
"markings": 53,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((p124 <= 1)))",
"processed_size": 19,
"rewrites": 22
},
"result":
{
"edges": 53,
"markings": 54,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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((1 <= p58))",
"processed_size": 14,
"rewrites": 21
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"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 <= p101)",
"processed_size": 11,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"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": 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": "(p167 <= p232)",
"processed_size": 14,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3328,
"runtime": 1845.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F((E(G(**)) AND (** AND (** AND **))))) : (E(F(**)) OR **) : (E((** U **)) AND (** OR (A(X(**)) OR A(X(**))))) : A(G(**)) : (A(G(*)) AND ((A(G(**)) OR A(F(**))) AND **)) : A(G(**)) : E(F(E(G(**)))) : A(G(**)) : (E(X(E(F(**)))) OR (** AND E(X(**)))) : (A(G(**)) AND (** OR A(X(**)))) : (A(F(A(G(**)))) AND **) : (A((* R *)) AND A(G(*))) : (A(X(E(X(**)))) AND A(G(**))) : (E(F(**)) OR E(X(E(F(**))))) : A(X(A(G(**))))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "yes unknown yes unknown no no no yes no yes no unknown no no yes no ",
"value": "yes unknown yes unknown no no no yes no yes no unknown no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 ((2 <= p35))) : E (F ((((E (G ((p155 <= p214))) AND (p209 <= p199)) AND (3 <= p230)) AND (p71 <= p208)))) : (E (F ((3 <= p14))) OR ((p170 + 1 <= p207) AND (p156 <= 2))) : (E ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149)))) AND (((2 <= p101) OR A (X ((1 <= p58)))) OR A (X (((2 <= p212) OR (p40 <= p80)))))) : A (G (((p238 <= 0) OR (3 <= p136) OR (p227 + 1 <= p71) OR (p83 + 1 <= p180)))) : ((NOT(E (F ((2 <= p124)))) AND (A (G ((p31 <= p6))) OR A (F (((1 <= p237) OR (p141 <= p208)))))) AND ((p244 <= p172) OR (2 <= p40))) : A (G ((p194 <= p124))) : E (F (E (G (((2 <= p94) AND (p209 <= p6)))))) : A (G (A (G ((p232 <= p41))))) : (E (F (E (X ((1 <= p174))))) OR ((p173 <= p66) AND E (X (((2 <= p129) AND (1 <= p177)))))) : (A (G ((p163 <= p1))) AND ((p45 <= p199) OR A (X (((1 <= p17) AND (p250 <= p57)))))) : (A (F (A (G ((2 <= p217))))) AND (p167 <= p232)) : (NOT(E (((3 <= p198) U (3 <= p235)))) AND NOT(E (F ((1 <= p195))))) : (A (X (E (X ((p150 <= p164))))) AND A (G (E (G ((p184 <= p63)))))) : E (F (((p137 <= p94) OR E (X ((p161 <= p63)))))) : A (X (A (G (((1 <= p89) OR (3 <= p47))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
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 ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149)))) AND ((2 <= p101) OR (A (X ((1 <= p58))) OR A (X (((2 <= p212) OR (p40 <= p80)))))))
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: A (X ((1 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p58))
lola: processed formula length: 14
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: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p101)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p101)
lola: processed formula length: 11
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149))))
lola: processed formula length: 69
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p64 <= p36) AND (p206 <= p149))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2253863 markings, 3402856 edges, 450773 markings/sec, 0 secs
lola: sara is running 5 secs || 4475816 markings, 6757548 edges, 444391 markings/sec, 5 secs
lola: sara is running 10 secs || 6699833 markings, 10115368 edges, 444803 markings/sec, 10 secs
lola: sara is running 15 secs || 8915618 markings, 13460771 edges, 443157 markings/sec, 15 secs
lola: sara is running 20 secs || 11080047 markings, 16728649 edges, 432886 markings/sec, 20 secs
lola: sara is running 25 secs || 13198315 markings, 19926825 edges, 423654 markings/sec, 25 secs
lola: sara is running 30 secs || 15348672 markings, 23173432 edges, 430071 markings/sec, 30 secs
lola: sara is running 35 secs || 17555707 markings, 26505622 edges, 441407 markings/sec, 35 secs
lola: sara is running 40 secs || 19787627 markings, 29875377 edges, 446384 markings/sec, 40 secs
lola: sara is running 45 secs || 22016607 markings, 33240704 edges, 445796 markings/sec, 45 secs
lola: sara is running 50 secs || 24240368 markings, 36598132 edges, 444752 markings/sec, 50 secs
lola: sara is running 55 secs || 26389639 markings, 39843119 edges, 429854 markings/sec, 55 secs
lola: sara is running 60 secs || 28526274 markings, 43069038 edges, 427327 markings/sec, 60 secs
lola: sara is running 65 secs || 30722975 markings, 46385635 edges, 439340 markings/sec, 65 secs
lola: sara is running 70 secs || 32913358 markings, 49692676 edges, 438077 markings/sec, 70 secs
lola: sara is running 75 secs || 35123600 markings, 53029702 edges, 442048 markings/sec, 75 secs
lola: sara is running 80 secs || 37336103 markings, 56370146 edges, 442501 markings/sec, 80 secs
lola: sara is running 85 secs || 39545027 markings, 59705163 edges, 441785 markings/sec, 85 secs
lola: sara is running 90 secs || 41751337 markings, 63036273 edges, 441262 markings/sec, 90 secs
lola: sara is running 95 secs || 43916741 markings, 66305620 edges, 433081 markings/sec, 95 secs
lola: sara is running 100 secs || 46120004 markings, 69632123 edges, 440653 markings/sec, 100 secs
lola: sara is running 105 secs || 48363991 markings, 73020100 edges, 448797 markings/sec, 105 secs
lola: sara is running 110 secs || 50561765 markings, 76338280 edges, 439555 markings/sec, 110 secs
lola: sara is running 115 secs || 52750067 markings, 79642197 edges, 437660 markings/sec, 115 secs
lola: sara is running 120 secs || 54890422 markings, 82873715 edges, 428071 markings/sec, 120 secs
lola: sara is running 125 secs || 56914700 markings, 85929982 edges, 404856 markings/sec, 125 secs
lola: sara is running 130 secs || 57085954 markings, 86188555 edges, 34251 markings/sec, 130 secs
lola: sara is running 135 secs || 57110330 markings, 86225356 edges, 4875 markings/sec, 135 secs
lola: sara is running 140 secs || 57110330 markings, 86225356 edges, 0 markings/sec, 140 secs
lola: sara is running 145 secs || 57428074 markings, 86705105 edges, 63549 markings/sec, 145 secs
lola: sara is running 150 secs || 57470725 markings, 86769490 edges, 8530 markings/sec, 150 secs
lola: sara is running 155 secs || 58467595 markings, 88274556 edges, 199374 markings/sec, 155 secs
lola: sara is running 160 secs || 59374422 markings, 89643715 edges, 181365 markings/sec, 160 secs
lola: sara is running 165 secs || 60188476 markings, 90872741 edges, 162811 markings/sec, 165 secs
lola: sara is running 170 secs || 61464121 markings, 92798703 edges, 255129 markings/sec, 170 secs
lola: sara is running 175 secs || 61526053 markings, 92892222 edges, 12386 markings/sec, 175 secs
lola: sara is running 180 secs || 61537221 markings, 92909106 edges, 2234 markings/sec, 180 secs
lola: sara is running 185 secs || 61880881 markings, 93427928 edges, 68732 markings/sec, 185 secs
lola: sara is running 190 secs || 61889381 markings, 93440796 edges, 1700 markings/sec, 190 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: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 16024296 KB
lola: time consumption: 233 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 16022524 KB
lola: time consumption: 233 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((1 <= p174))))) OR ((p173 <= p66) AND E (X (((2 <= p129) AND (1 <= p177))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p173 <= p66)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p173 <= p66)
lola: processed formula length: 13
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= p129) AND (1 <= p177))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((2 <= p129) AND (1 <= p177)))
lola: processed formula length: 33
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: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((1 <= p174)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (1 <= p174)
lola: processed formula length: 11
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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p174)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-3-0.sara.
lola: ...considering subproblem: (A (G ((p163 <= p1))) AND ((p45 <= p199) OR A (X (((1 <= p17) AND (p250 <= p57))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p45 <= p199)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p45 <= p199)
lola: processed formula length: 13
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p163 <= p1)))
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 ((p163 <= p1)))
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: (p1 + 1 <= p163)
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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (X ((p150 <= p164))))) AND A (G ((p184 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p184 <= p63)))
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 ((p184 <= p63)))
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: (p63 + 1 <= p184)
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: 30 markings, 43 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p137 <= p94))) OR E (X (E (F ((p161 <= p63))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p137 <= p94)))
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 ((p137 <= p94)))
lola: processed formula length: 21
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: (p137 <= p94)
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: 52 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p89) OR (3 <= p47))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p89 <= 0) AND (p47 <= 2))
lola: processed formula length: 27
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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: formula 0: ((p89 <= 0) AND (p47 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant from successors.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p35)))
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 <= p35)))
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: (2 <= p35)
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: 90 markings, 89 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p232 <= p41)))
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 ((p232 <= p41)))
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: (p41 + 1 <= p232)
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: 139 markings, 202 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p194 <= p124)))
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 ((p194 <= p124)))
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: 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: (p124 + 1 <= p194)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p238 <= 0) OR (3 <= p136) OR (p227 + 1 <= p71) OR (p83 + 1 <= p180))))
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 (((p238 <= 0) OR (3 <= p136) OR (p227 + 1 <= p71) OR (p83 + 1 <= p180))))
lola: processed formula length: 81
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: ((1 <= p238) AND (p136 <= 2) AND (p71 <= p227) AND (p180 <= p83))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2411 markings, 2410 edges
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((2 <= p94) AND (p209 <= p6))))))
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 <= p94) AND (p209 <= p6))
lola: processed formula length: 29
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 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: ((p94 <= 1) OR (p6 + 1 <= p209))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation 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 <= p94) AND (p209 <= p6))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 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: 199 markings, 199 edges
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-10-0.sara.
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-10-1.sara.
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: (E (F ((3 <= p14))) OR ((p170 + 1 <= p207) AND (p156 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
sara: place or transition ordering is non-deterministic

lola: RUNNING
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p170 + 1 <= p207) AND (p156 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p170 + 1 <= p207) AND (p156 <= 2))
lola: processed formula length: 36
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p14)))
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 <= p14)))
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 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 147 markings, 146 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p198 <= 2) R (p235 <= 2))) AND A (G ((p195 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p195 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p195 <= 0)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((2 <= p217))))) AND (p167 <= p232))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p167 <= p232)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p167 <= p232)
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: 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 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p217 <= 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 <= p217)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation 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: (p217 <= 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: write sara problem file to CTLCardinality-14-1.sara
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-14-1.sara.
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced

lola: sara is running 0 secs || sara is running 0 secs || 2621265 markings, 3957529 edges, 524253 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5313655 markings, 8022520 edges, 538478 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7959672 markings, 12017477 edges, 529203 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10514615 markings, 15874952 edges, 510989 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13009118 markings, 19641154 edges, 498901 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15442024 markings, 23314397 edges, 486581 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17983633 markings, 27151699 edges, 508322 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20522440 markings, 30984819 edges, 507761 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23092662 markings, 34865347 edges, 514044 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25563053 markings, 38595148 edges, 494078 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27976277 markings, 42238635 edges, 482645 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30450504 markings, 45974233 edges, 494845 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32976274 markings, 49787639 edges, 505154 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35505756 markings, 53606643 edges, 505896 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38027917 markings, 57414648 edges, 504432 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40419461 markings, 61025412 edges, 478309 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42874428 markings, 64731940 edges, 490993 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 45370374 markings, 68500294 edges, 499189 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47886554 markings, 72299243 edges, 503236 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 50377089 markings, 76059472 edges, 498107 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 52838628 markings, 79775898 edges, 492308 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 53215384 markings, 80344734 edges, 75351 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55280111 markings, 83462061 edges, 412945 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 57387082 markings, 86643196 edges, 421394 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 58641102 markings, 88536501 edges, 250804 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 59254856 markings, 89463172 edges, 122751 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 59263461 markings, 89476158 edges, 1721 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 60234494 markings, 90942242 edges, 194207 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 60234494 markings, 90942242 edges, 0 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 60234494 markings, 90942242 edges, 0 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 60996653 markings, 92092949 edges, 152432 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 62066517 markings, 93708203 edges, 213973 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 62158662 markings, 93847339 edges, 18429 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 62158662 markings, 93847339 edges, 0 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 62158662 markings, 93847339 edges, 0 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 62158662 markings, 93847339 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 62192166 markings, 93897926 edges, 6701 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 62725317 markings, 94702884 edges, 106630 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 62958557 markings, 95055020 edges, 46648 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 62968813 markings, 95070498 edges, 2051 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 64916522 markings, 98011155 edges, 389542 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 64984918 markings, 98114426 edges, 13679 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 64984918 markings, 98114426 edges, 0 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 64984918 markings, 98114426 edges, 0 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 64984918 markings, 98114426 edges, 0 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 65001730 markings, 98139787 edges, 3362 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 65180545 markings, 98409781 edges, 35763 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 65391570 markings, 98728370 edges, 42205 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 65509064 markings, 98905780 edges, 23499 markings/sec, 240 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 14 will run for 1490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p155 <= p214))) AND ((p209 <= p199) AND ((3 <= p230) AND (p71 <= p208))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p214 + 1 <= p155)) OR ((p199 + 1 <= p209) OR ((p230 <= 2) OR (p208 + 1 <= p71)))))
lola: processed formula length: 90
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1397791 markings, 2676531 edges, 279558 markings/sec, 0 secs
lola: 2819348 markings, 5398584 edges, 284311 markings/sec, 5 secs
lola: 4257172 markings, 8093523 edges, 287565 markings/sec, 10 secs
lola: 5747251 markings, 10850362 edges, 298016 markings/sec, 15 secs
lola: 7192586 markings, 13568286 edges, 289067 markings/sec, 20 secs
lola: 8779550 markings, 16387024 edges, 317393 markings/sec, 25 secs
lola: 10360285 markings, 19180542 edges, 316147 markings/sec, 30 secs
lola: 11946932 markings, 21960028 edges, 317329 markings/sec, 35 secs
lola: 13509583 markings, 24802164 edges, 312530 markings/sec, 40 secs
lola: 15108574 markings, 27599735 edges, 319798 markings/sec, 45 secs
lola: 16782448 markings, 30421911 edges, 334775 markings/sec, 50 secs
lola: 18354719 markings, 33192031 edges, 314454 markings/sec, 55 secs
lola: 20031040 markings, 35963731 edges, 335264 markings/sec, 60 secs
lola: 21611956 markings, 38703478 edges, 316183 markings/sec, 65 secs
lola: 23294106 markings, 41629888 edges, 336430 markings/sec, 70 secs
lola: 24834565 markings, 44356704 edges, 308092 markings/sec, 75 secs
lola: 26454919 markings, 47131673 edges, 324071 markings/sec, 80 secs
lola: 27943685 markings, 49867039 edges, 297753 markings/sec, 85 secs
lola: 29469246 markings, 52567922 edges, 305112 markings/sec, 90 secs
lola: 31173285 markings, 55291294 edges, 340808 markings/sec, 95 secs
lola: 32846839 markings, 58048990 edges, 334711 markings/sec, 100 secs
lola: 34436205 markings, 60773242 edges, 317873 markings/sec, 105 secs
lola: 36167099 markings, 63532312 edges, 346179 markings/sec, 110 secs
lola: 37766280 markings, 66276117 edges, 319836 markings/sec, 115 secs
lola: 39351420 markings, 69014519 edges, 317028 markings/sec, 120 secs
lola: 40982592 markings, 71790920 edges, 326234 markings/sec, 125 secs
lola: 42640411 markings, 74565350 edges, 331564 markings/sec, 130 secs
lola: 44330853 markings, 77248663 edges, 338088 markings/sec, 135 secs
lola: 46026071 markings, 80022743 edges, 339044 markings/sec, 140 secs
lola: 47688396 markings, 82755385 edges, 332465 markings/sec, 145 secs
lola: 49319015 markings, 85508065 edges, 326124 markings/sec, 150 secs
lola: 51036047 markings, 88223720 edges, 343406 markings/sec, 155 secs
lola: 52695252 markings, 90962099 edges, 331841 markings/sec, 160 secs
lola: 54261851 markings, 93671799 edges, 313320 markings/sec, 165 secs
lola: 55936574 markings, 96396649 edges, 334945 markings/sec, 170 secs
lola: 57587646 markings, 99137695 edges, 330214 markings/sec, 175 secs
lola: 59171897 markings, 101826594 edges, 316850 markings/sec, 180 secs
lola: 60788871 markings, 104479022 edges, 323395 markings/sec, 185 secs
lola: 62468221 markings, 107220143 edges, 335870 markings/sec, 190 secs
lola: 64112333 markings, 109959277 edges, 328822 markings/sec, 195 secs
lola: 65871261 markings, 112700020 edges, 351786 markings/sec, 200 secs
lola: 67478578 markings, 115396699 edges, 321463 markings/sec, 205 secs
lola: 69162495 markings, 118141734 edges, 336783 markings/sec, 210 secs
lola: 70841531 markings, 120857744 edges, 335807 markings/sec, 215 secs
lola: 72431669 markings, 123594595 edges, 318028 markings/sec, 220 secs
lola: 74044722 markings, 126288917 edges, 322611 markings/sec, 225 secs
lola: 75616841 markings, 128980346 edges, 314424 markings/sec, 230 secs
lola: 77089919 markings, 131691861 edges, 294616 markings/sec, 235 secs
lola: 78731135 markings, 134424105 edges, 328243 markings/sec, 240 secs
lola: 80509346 markings, 137203110 edges, 355642 markings/sec, 245 secs
lola: 82194560 markings, 139984551 edges, 337043 markings/sec, 250 secs
lola: 83924854 markings, 142720212 edges, 346059 markings/sec, 255 secs
lola: 85667486 markings, 145434104 edges, 348526 markings/sec, 260 secs
lola: 87307165 markings, 148185671 edges, 327936 markings/sec, 265 secs
lola: 88928275 markings, 150868943 edges, 324222 markings/sec, 270 secs
lola: 90605031 markings, 153587037 edges, 335351 markings/sec, 275 secs
lola: 92404694 markings, 156376545 edges, 359933 markings/sec, 280 secs
lola: 94215623 markings, 159210013 edges, 362186 markings/sec, 285 secs
lola: 95738524 markings, 161900752 edges, 304580 markings/sec, 290 secs
lola: 97358831 markings, 164722315 edges, 324061 markings/sec, 295 secs
lola: 99088834 markings, 167529001 edges, 346001 markings/sec, 300 secs
lola: 100854965 markings, 170353457 edges, 353226 markings/sec, 305 secs
lola: 101432417 markings, 171275763 edges, 115490 markings/sec, 310 secs
lola: 102691693 markings, 173502151 edges, 251855 markings/sec, 315 secs
lola: 103660189 markings, 175118476 edges, 193699 markings/sec, 320 secs
lola: 103660635 markings, 175119369 edges, 89 markings/sec, 325 secs
lola: 103660635 markings, 175119369 edges, 0 markings/sec, 330 secs
lola: 103660635 markings, 175119369 edges, 0 markings/sec, 335 secs
lola: 103850326 markings, 175428351 edges, 37938 markings/sec, 340 secs
lola: 104589563 markings, 176571192 edges, 147847 markings/sec, 345 secs
lola: 105426280 markings, 178019801 edges, 167343 markings/sec, 350 secs
lola: 105429932 markings, 178026749 edges, 730 markings/sec, 355 secs
lola: 105444573 markings, 178054397 edges, 2928 markings/sec, 360 secs
lola: 105869571 markings, 178756504 edges, 85000 markings/sec, 365 secs
lola: 106959240 markings, 180436701 edges, 217934 markings/sec, 370 secs
lola: 106959240 markings, 180436701 edges, 0 markings/sec, 375 secs
lola: 107636351 markings, 181517362 edges, 135422 markings/sec, 380 secs
lola: 108335297 markings, 182624961 edges, 139789 markings/sec, 385 secs
lola: 109352298 markings, 184209958 edges, 203400 markings/sec, 390 secs
lola: 110257996 markings, 185735337 edges, 181140 markings/sec, 395 secs
lola: 111560677 markings, 187974298 edges, 260536 markings/sec, 400 secs
lola: 112469454 markings, 189430301 edges, 181755 markings/sec, 405 secs
lola: 113023797 markings, 190403498 edges, 110869 markings/sec, 410 secs
lola: 113966479 markings, 191939401 edges, 188536 markings/sec, 415 secs
lola: 115228399 markings, 194100572 edges, 252384 markings/sec, 420 secs
lola: 116831233 markings, 196682310 edges, 320567 markings/sec, 425 secs
lola: 118282289 markings, 199142119 edges, 290211 markings/sec, 430 secs
lola: 119683291 markings, 201422456 edges, 280200 markings/sec, 435 secs
lola: 120934686 markings, 203428555 edges, 250279 markings/sec, 440 secs
lola: 122494213 markings, 205851682 edges, 311905 markings/sec, 445 secs
lola: 124012292 markings, 208279424 edges, 303616 markings/sec, 450 secs
lola: 125501129 markings, 210644214 edges, 297767 markings/sec, 455 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p124 <= 1))) AND ((A (G ((p31 <= p6))) OR A (F (((1 <= p237) OR (p141 <= p208))))) AND ((p244 <= p172) OR (2 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p31 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p31 <= p6)))
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: (p6 + 1 <= p31)
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: 53 markings, 52 edges
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p124 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p124 <= 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: 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p124)
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: 54 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149)))) AND ((2 <= p101) OR (A (X ((1 <= p58))) OR A (X (((2 <= p212) OR (p40 <= p80)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p58))
lola: processed formula length: 14
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: ========================================
lola: ...considering subproblem: (2 <= p101)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p101)
lola: processed formula length: 11
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= p40) OR (3 <= p47)) U ((p64 <= p36) AND (p206 <= p149))))
lola: processed formula length: 69
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
sara: try reading problem file CTLCardinality-15-0.sara.
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p64 <= p36) AND (p206 <= p149))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2272983 markings, 3431708 edges, 454597 markings/sec, 0 secs
lola: sara is running 5 secs || 4509789 markings, 6808855 edges, 447361 markings/sec, 5 secs
lola: sara is running 10 secs || 6784015 markings, 10242472 edges, 454845 markings/sec, 10 secs
lola: sara is running 15 secs || 9079828 markings, 13708720 edges, 459163 markings/sec, 15 secs
lola: sara is running 20 secs || 11286726 markings, 17040710 edges, 441380 markings/sec, 20 secs
lola: sara is running 25 secs || 13475605 markings, 20345493 edges, 437776 markings/sec, 25 secs
lola: sara is running 30 secs || 15704091 markings, 23710070 edges, 445697 markings/sec, 30 secs
lola: sara is running 35 secs || 17944267 markings, 27092294 edges, 448035 markings/sec, 35 secs
lola: sara is running 40 secs || 20211169 markings, 30514850 edges, 453380 markings/sec, 40 secs
lola: sara is running 45 secs || 22502011 markings, 33973564 edges, 458168 markings/sec, 45 secs
lola: sara is running 50 secs || 24736987 markings, 37347951 edges, 446995 markings/sec, 50 secs
lola: sara is running 55 secs || 26929305 markings, 40657903 edges, 438464 markings/sec, 55 secs
lola: sara is running 60 secs || 29087541 markings, 43916431 edges, 431647 markings/sec, 60 secs
lola: sara is running 65 secs || 31347751 markings, 47328883 edges, 452042 markings/sec, 65 secs
lola: sara is running 70 secs || 33576625 markings, 50694057 edges, 445775 markings/sec, 70 secs
lola: sara is running 75 secs || 35930703 markings, 54248251 edges, 470816 markings/sec, 75 secs
lola: sara is running 80 secs || 38270530 markings, 57780942 edges, 467965 markings/sec, 80 secs
lola: sara is running 85 secs || 40474808 markings, 61108983 edges, 440856 markings/sec, 85 secs
lola: sara is running 90 secs || 42668350 markings, 64420791 edges, 438708 markings/sec, 90 secs
lola: sara is running 95 secs || 44993964 markings, 67932034 edges, 465123 markings/sec, 95 secs
lola: sara is running 100 secs || 47341924 markings, 71476975 edges, 469592 markings/sec, 100 secs
lola: sara is running 105 secs || 49613759 markings, 74906974 edges, 454367 markings/sec, 105 secs
lola: sara is running 110 secs || 51870888 markings, 78314768 edges, 451426 markings/sec, 110 secs
lola: sara is running 115 secs || 54078449 markings, 81647799 edges, 441512 markings/sec, 115 secs
lola: sara is running 120 secs || 56227640 markings, 84892669 edges, 429838 markings/sec, 120 secs
lola: sara is running 125 secs || 58252701 markings, 87950115 edges, 405012 markings/sec, 125 secs
lola: sara is running 130 secs || 58837531 markings, 88833077 edges, 116966 markings/sec, 130 secs
lola: sara is running 135 secs || 58918547 markings, 88955379 edges, 16203 markings/sec, 135 secs
lola: sara is running 140 secs || 60682264 markings, 91618287 edges, 352743 markings/sec, 140 secs
lola: sara is running 145 secs || 62417534 markings, 94238180 edges, 347054 markings/sec, 145 secs
lola: sara is running 150 secs || 63498712 markings, 95870528 edges, 216236 markings/sec, 150 secs
lola: sara is running 155 secs || 65512260 markings, 98910610 edges, 402710 markings/sec, 155 secs
lola: sara is running 160 secs || 67274359 markings, 101571033 edges, 352420 markings/sec, 160 secs
lola: sara is running 165 secs || 69272565 markings, 104587920 edges, 399641 markings/sec, 165 secs
lola: sara is running 170 secs || 70666068 markings, 106691851 edges, 278701 markings/sec, 170 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: (A (F (A (G ((2 <= p217))))) AND (p167 <= p232))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p167 <= p232)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p167 <= p232)
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: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p217 <= 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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: 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: (p217 <= 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 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 <= p217)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-18-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: try reading problem file CTLCardinality-18-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2576233 markings, 3889545 edges, 515247 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5130994 markings, 7746726 edges, 510952 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7730599 markings, 11671595 edges, 519921 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10251460 markings, 15477618 edges, 504172 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12691985 markings, 19162371 edges, 488105 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15209119 markings, 22962737 edges, 503427 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17811626 markings, 26891990 edges, 520501 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20439766 markings, 30859965 edges, 525628 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23018470 markings, 34753301 edges, 515741 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25552764 markings, 38579620 edges, 506859 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28083982 markings, 42401274 edges, 506244 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30642854 markings, 46264670 edges, 511774 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33192299 markings, 50113811 edges, 509889 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35790832 markings, 54037071 edges, 519707 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38398859 markings, 57974671 edges, 521605 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40905822 markings, 61759717 edges, 501393 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 43355839 markings, 65458796 edges, 490003 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 45935582 markings, 69353677 edges, 515949 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 48491796 markings, 73213030 edges, 511243 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 51127919 markings, 77193066 edges, 527225 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 53640215 markings, 80986139 edges, 502459 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 55892083 markings, 84386048 edges, 450374 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55984432 markings, 84525480 edges, 18470 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 55984432 markings, 84525480 edges, 0 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 57200299 markings, 86361197 edges, 243173 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 58373274 markings, 88132138 edges, 234595 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 60641713 markings, 91557026 edges, 453688 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 62995517 markings, 95110829 edges, 470761 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 63983341 markings, 96602215 edges, 197565 markings/sec, 140 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 (F ((E (G ((p155 <= p214))) AND ((p209 <= p199) AND ((3 <= p230) AND (p71 <= p208))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p214 + 1 <= p155)) OR ((p199 + 1 <= p209) OR ((p230 <= 2) OR (p208 + 1 <= p71)))))
lola: processed formula length: 90
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1373854 markings, 2630548 edges, 274771 markings/sec, 0 secs
lola: 2746251 markings, 5258474 edges, 274479 markings/sec, 5 secs
lola: 4182838 markings, 7950982 edges, 287317 markings/sec, 10 secs
lola: 5649842 markings, 10665487 edges, 293401 markings/sec, 15 secs
lola: 7067560 markings, 13330153 edges, 283544 markings/sec, 20 secs
lola: 8599314 markings, 16071619 edges, 306351 markings/sec, 25 secs
lola: 10163339 markings, 18836360 edges, 312805 markings/sec, 30 secs
lola: 11752488 markings, 21588582 edges, 317830 markings/sec, 35 secs
lola: 13185471 markings, 24255043 edges, 286597 markings/sec, 40 secs
lola: 14767240 markings, 27001662 edges, 316354 markings/sec, 45 secs
lola: 16425132 markings, 29788820 edges, 331578 markings/sec, 50 secs
lola: 17945236 markings, 32504542 edges, 304021 markings/sec, 55 secs
lola: 19576256 markings, 35262211 edges, 326204 markings/sec, 60 secs
lola: 21220292 markings, 37994389 edges, 328807 markings/sec, 65 secs
lola: 22742298 markings, 40706860 edges, 304401 markings/sec, 70 secs
lola: 24332222 markings, 43424208 edges, 317985 markings/sec, 75 secs
lola: 25910609 markings, 46171229 edges, 315677 markings/sec, 80 secs
lola: 27375432 markings, 48833751 edges, 292965 markings/sec, 85 secs
lola: 28903042 markings, 51529859 edges, 305522 markings/sec, 90 secs
lola: 30484762 markings, 54215611 edges, 316344 markings/sec, 95 secs
lola: 32149688 markings, 56914841 edges, 332985 markings/sec, 100 secs
lola: 33790316 markings, 59656768 edges, 328126 markings/sec, 105 secs
lola: 35528965 markings, 62470205 edges, 347730 markings/sec, 110 secs
lola: 37236456 markings, 65341372 edges, 341498 markings/sec, 115 secs
lola: 38788200 markings, 68045553 edges, 310349 markings/sec, 120 secs
lola: 40389288 markings, 70750241 edges, 320218 markings/sec, 125 secs
lola: 42006560 markings, 73516994 edges, 323454 markings/sec, 130 secs
lola: 43685785 markings, 76215219 edges, 335845 markings/sec, 135 secs
lola: 45388539 markings, 78969141 edges, 340551 markings/sec, 140 secs
lola: 47077776 markings, 81720475 edges, 337847 markings/sec, 145 secs
lola: 48660143 markings, 84434161 edges, 316473 markings/sec, 150 secs
lola: 50354609 markings, 87160524 edges, 338893 markings/sec, 155 secs
lola: 52068155 markings, 89863817 edges, 342709 markings/sec, 160 secs
lola: 53581238 markings, 92555164 edges, 302617 markings/sec, 165 secs
lola: 55283425 markings, 95249680 edges, 340437 markings/sec, 170 secs
lola: 56861044 markings, 97956100 edges, 315524 markings/sec, 175 secs
lola: 58550004 markings, 100701494 edges, 337792 markings/sec, 180 secs
lola: 60088398 markings, 103366547 edges, 307679 markings/sec, 185 secs
lola: 61750492 markings, 106051604 edges, 332419 markings/sec, 190 secs
lola: 63415573 markings, 108771271 edges, 333016 markings/sec, 195 secs
lola: 65092586 markings, 111491057 edges, 335403 markings/sec, 200 secs
lola: 66803673 markings, 114248845 edges, 342217 markings/sec, 205 secs
lola: 68382677 markings, 116946727 edges, 315801 markings/sec, 210 secs
lola: 70090010 markings, 119609506 edges, 341467 markings/sec, 215 secs
lola: 71761910 markings, 122385468 edges, 334380 markings/sec, 220 secs
lola: 73273219 markings, 125050932 edges, 302262 markings/sec, 225 secs
lola: 74869068 markings, 127727675 edges, 319170 markings/sec, 230 secs
lola: 76396995 markings, 130400260 edges, 305585 markings/sec, 235 secs
lola: 77859305 markings, 133037690 edges, 292462 markings/sec, 240 secs
lola: 79602511 markings, 135793601 edges, 348641 markings/sec, 245 secs
lola: 81365733 markings, 138588446 edges, 352644 markings/sec, 250 secs
lola: 83063453 markings, 141367159 edges, 339544 markings/sec, 255 secs
lola: 84729154 markings, 144001455 edges, 333140 markings/sec, 260 secs
lola: 86431956 markings, 146729495 edges, 340560 markings/sec, 265 secs
lola: 88058256 markings, 149453640 edges, 325260 markings/sec, 270 secs
lola: 89681118 markings, 152117983 edges, 324572 markings/sec, 275 secs
lola: 91438344 markings, 154863612 edges, 351445 markings/sec, 280 secs
lola: 93170902 markings, 157589253 edges, 346512 markings/sec, 285 secs
lola: 94842373 markings, 160299183 edges, 334294 markings/sec, 290 secs
lola: 96379205 markings, 162979573 edges, 307366 markings/sec, 295 secs
lola: 97879853 markings, 165641865 edges, 300130 markings/sec, 300 secs
lola: 99566871 markings, 168290579 edges, 337404 markings/sec, 305 secs
lola: 101234278 markings, 170919208 edges, 333481 markings/sec, 310 secs
lola: 102552076 markings, 173256384 edges, 263560 markings/sec, 315 secs
lola: 104019740 markings, 175703226 edges, 293533 markings/sec, 320 secs
lola: 105499274 markings, 178141075 edges, 295907 markings/sec, 325 secs
lola: 107064001 markings, 180598539 edges, 312945 markings/sec, 330 secs
lola: 108572485 markings, 182996227 edges, 301697 markings/sec, 335 secs
lola: 109364353 markings, 184228062 edges, 158374 markings/sec, 340 secs
lola: 110805743 markings, 186651777 edges, 288278 markings/sec, 345 secs
lola: 112250727 markings, 189099807 edges, 288997 markings/sec, 350 secs
lola: 113713809 markings, 191525093 edges, 292616 markings/sec, 355 secs
lola: 115146753 markings, 193943963 edges, 286589 markings/sec, 360 secs
lola: 116713216 markings, 196488358 edges, 313293 markings/sec, 365 secs
lola: 118173627 markings, 198974618 edges, 292082 markings/sec, 370 secs
lola: 119652631 markings, 201374807 edges, 295801 markings/sec, 375 secs
lola: 121176127 markings, 203799815 edges, 304699 markings/sec, 380 secs
lola: 122709891 markings, 206197043 edges, 306753 markings/sec, 385 secs
lola: 123455733 markings, 207378546 edges, 149168 markings/sec, 390 secs
lola: 123986234 markings, 208240107 edges, 106100 markings/sec, 395 secs
lola: 125354193 markings, 210398537 edges, 273592 markings/sec, 400 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes unknown yes unknown no no no yes no yes no unknown no no yes no
lola:
preliminary result: yes unknown yes unknown no no no yes no yes no unknown no no yes no
lola: memory consumption: 3328 KB
lola: time consumption: 1845 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-050051"
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-050051, 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-158987938500107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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