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-158987938500097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-050050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 110K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591227312752

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:35:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:35:17] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-06-03 23:35:17] [INFO ] Transformed 254 places.
[2020-06-03 23:35:17] [INFO ] Transformed 203 transitions.
[2020-06-03 23:35:17] [INFO ] Parsed PT model containing 254 places and 203 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100044 steps, including 0 resets, run finished after 208 ms. (steps per millisecond=480 ) properties seen :[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:35:17] [INFO ] Computed 102 place invariants in 6 ms
[2020-06-03 23:35:17] [INFO ] [Real]Absence check using 102 positive place invariants in 99 ms returned sat
[2020-06-03 23:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:18] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-06-03 23:35:18] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2020-06-03 23:35:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:18] [INFO ] [Nat]Absence check using 102 positive place invariants in 73 ms returned sat
[2020-06-03 23:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:18] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2020-06-03 23:35:18] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 37 ms.
[2020-06-03 23:35:25] [INFO ] Added : 77 causal constraints over 16 iterations in 6704 ms. Result :sat
[2020-06-03 23:35:25] [INFO ] [Real]Absence check using 102 positive place invariants in 29 ms returned sat
[2020-06-03 23:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:25] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:35:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:25] [INFO ] [Nat]Absence check using 102 positive place invariants in 30 ms returned sat
[2020-06-03 23:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:26] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-06-03 23:35:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:26] [INFO ] Added : 100 causal constraints over 20 iterations in 294 ms. Result :sat
[2020-06-03 23:35:26] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:26] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-03 23:35:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:26] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-06-03 23:35:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 26 ms.
[2020-06-03 23:35:26] [INFO ] Added : 44 causal constraints over 9 iterations in 142 ms. Result :sat
[2020-06-03 23:35:26] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:27] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 23:35:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 29 ms returned sat
[2020-06-03 23:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:27] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-03 23:35:27] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:27] [INFO ] Added : 95 causal constraints over 19 iterations in 230 ms. Result :sat
[2020-06-03 23:35:27] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:28] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2020-06-03 23:35:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:28] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:35:28] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2020-06-03 23:35:28] [INFO ] Added : 98 causal constraints over 20 iterations in 249 ms. Result :sat
[2020-06-03 23:35:28] [INFO ] [Real]Absence check using 102 positive place invariants in 3 ms returned unsat
[2020-06-03 23:35:28] [INFO ] [Real]Absence check using 102 positive place invariants in 3 ms returned unsat
[2020-06-03 23:35:28] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:28] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-06-03 23:35:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:29] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:35:29] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:29] [INFO ] Added : 78 causal constraints over 16 iterations in 178 ms. Result :sat
[2020-06-03 23:35:29] [INFO ] [Real]Absence check using 102 positive place invariants in 28 ms returned sat
[2020-06-03 23:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:29] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:35:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:29] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:29] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:35:29] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:35:29] [INFO ] Added : 109 causal constraints over 22 iterations in 277 ms. Result :sat
[2020-06-03 23:35:30] [INFO ] [Real]Absence check using 102 positive place invariants in 59 ms returned sat
[2020-06-03 23:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:30] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:35:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:30] [INFO ] [Nat]Absence check using 102 positive place invariants in 33 ms returned sat
[2020-06-03 23:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:30] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:35:30] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:35:30] [INFO ] Added : 49 causal constraints over 10 iterations in 133 ms. Result :sat
[2020-06-03 23:35:30] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:30] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:35:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:30] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:30] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2020-06-03 23:35:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:35:31] [INFO ] Added : 40 causal constraints over 8 iterations in 97 ms. Result :sat
[2020-06-03 23:35:31] [INFO ] [Real]Absence check using 102 positive place invariants in 2 ms returned unsat
[2020-06-03 23:35:31] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:31] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:35:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:31] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2020-06-03 23:35:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:35:32] [INFO ] Added : 103 causal constraints over 21 iterations in 248 ms. Result :sat
[2020-06-03 23:35:32] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:32] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-03 23:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:32] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:35:32] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:35:32] [INFO ] Added : 94 causal constraints over 19 iterations in 220 ms. Result :sat
[2020-06-03 23:35:32] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:32] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:33] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:35:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:33] [INFO ] Added : 95 causal constraints over 19 iterations in 221 ms. Result :sat
[2020-06-03 23:35:33] [INFO ] [Real]Absence check using 102 positive place invariants in 2 ms returned unsat
[2020-06-03 23:35:33] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:33] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-06-03 23:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:33] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:35:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:34] [INFO ] Added : 103 causal constraints over 21 iterations in 242 ms. Result :sat
[2020-06-03 23:35:34] [INFO ] [Real]Absence check using 102 positive place invariants in 30 ms returned sat
[2020-06-03 23:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:34] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:34] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-06-03 23:35:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:35:34] [INFO ] Added : 102 causal constraints over 21 iterations in 442 ms. Result :sat
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using 102 positive place invariants in 2 ms returned unsat
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:35:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 23:35:35] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:35] [INFO ] Added : 52 causal constraints over 11 iterations in 125 ms. Result :sat
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using 102 positive place invariants in 58 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-06-03 23:35:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:35:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2020-06-03 23:35:36] [INFO ] Added : 84 causal constraints over 17 iterations in 224 ms. Result :sat
[2020-06-03 23:35:36] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:36] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-03 23:35:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:36] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:36] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-06-03 23:35:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2020-06-03 23:35:36] [INFO ] Added : 103 causal constraints over 21 iterations in 273 ms. Result :sat
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 23:35:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:37] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-03 23:35:37] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:37] [INFO ] Added : 101 causal constraints over 21 iterations in 259 ms. Result :sat
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 23:35:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:38] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-06-03 23:35:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:38] [INFO ] Added : 103 causal constraints over 21 iterations in 257 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-06-03 23:35:38] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 23:35:38] [INFO ] Flatten gal took : 42 ms
FORMULA RefineWMG-PT-050050-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:35:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 23:35:38] [INFO ] Flatten gal took : 14 ms
[2020-06-03 23:35:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RefineWMG-PT-050050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:35:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 23:35:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-050050 @ 3570 seconds

FORMULA RefineWMG-PT-050050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p144)) OR X (F (((p172 + 1 <= p136) R (p39 + 1 <= p178))))))",
"processed_size": 73,
"rewrites": 47
},
"result":
{
"edges": 53,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F ((p215 <= p160))))",
"processed_size": 26,
"rewrites": 47
},
"result":
{
"edges": 2703,
"markings": 1380,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F ((1 <= p36))))",
"processed_size": 22,
"rewrites": 47
},
"result":
{
"edges": 2703,
"markings": 1380,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p251 + 1 <= p149)))",
"processed_size": 26,
"rewrites": 47
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((X (X (X (F ((3 <= p119))))) AND ((3 <= p119) AND (2 <= p152)))))",
"processed_size": 71,
"rewrites": 47
},
"result":
{
"edges": 56,
"markings": 55,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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 <= p241)",
"processed_size": 11,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((p80 <= p88)) AND (p62 <= p11)))",
"processed_size": 39,
"rewrites": 47
},
"result":
{
"edges": 102,
"markings": 103,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p176)))",
"processed_size": 19,
"rewrites": 47
},
"result":
{
"edges": 224576,
"markings": 170388,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "G (F ((p50 <= p159)))",
"processed_size": 21,
"rewrites": 47
},
"result":
{
"edges": 1570,
"markings": 1149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((p138 <= 1))) OR (p49 <= p237))))",
"processed_size": 46,
"rewrites": 47
},
"result":
{
"edges": 71661,
"markings": 38045,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G ((p153 <= p5))",
"processed_size": 16,
"rewrites": 47
},
"result":
{
"edges": 650,
"markings": 510,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p63 <= p183) AND (p54 + 1 <= p192))",
"processed_size": 37,
"rewrites": 52
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": "(p194 + 1 <= p145)",
"processed_size": 18,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G ((p33 <= p173))",
"processed_size": 17,
"rewrites": 47
},
"result":
{
"edges": 3927,
"markings": 2138,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (((G ((p152 <= p217)) OR (p208 <= p16)) AND G (((p146 + 1 <= p16) OR (p190 + 1 <= p232)))))",
"processed_size": 94,
"rewrites": 47
},
"result":
{
"edges": 628,
"markings": 404,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22996,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : G((F(**) OR X(F((* R *))))) : G(F(**)) : (F(**) AND (G(**) OR (G(*) AND **))) : (G(((G(**) OR **) AND G(**))) OR **) : X(X(F(**))) : X(X(F(**))) : X(G(*)) : F(G((X(X(X(F(**)))) AND (** AND **)))) : G(F((F(G(**)) OR **))) : (G(**) OR F((* OR **))) : (X((F(**) AND **)) AND **)"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "no no no no no yes yes no no no no yes ",
"value": "no no no no no yes yes no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X (F (X (G (X (X ((1 <= p176))))))) : G ((F ((1 <= p144)) OR F (NOT(X (((p136 <= p172) U (p178 <= p39))))))) : G (F (X ((p50 <= p159)))) : (((0 <= 0) U ((1 <= p50) U (p33 <= p173))) AND (G ((p33 <= p173)) OR (NOT(F ((p56 + 1 <= p146))) AND (p194 + 1 <= p145)))) : (G (((G ((p152 <= p217)) OR (p208 <= p16)) AND G (((p146 + 1 <= p16) OR (p190 + 1 <= p232))))) OR (p232 <= p190)) : F (X (X ((p215 <= p160)))) : F ((((p15 <= p175) U (0 <= 0)) U X (F (X ((1 <= p36)))))) : G (NOT(X ((p149 <= p251)))) : F (G (((X (X (X (((0 <= 0) U (3 <= p119))))) AND (3 <= p119)) AND (2 <= p152)))) : G (X (G (((p18 <= 2) U F ((F (G ((p138 <= 1))) OR (p49 <= p237))))))) : ((G ((p153 <= p5)) OR NOT(G ((p63 <= p183)))) OR F ((p192 <= p54))) : (X ((F ((p80 <= p88)) AND (p62 <= p11))) AND (1 <= p241))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p144)) OR X (F (((p172 + 1 <= p136) R (p39 + 1 <= p178))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p144)) OR X (F (((p172 + 1 <= p136) R (p39 + 1 <= p178))))))
lola: processed formula length: 73
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 201
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52 markings, 53 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p215 <= p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p215 <= p160))))
lola: processed formula length: 26
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1380 markings, 2703 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((1 <= p36))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((1 <= p36))))
lola: processed formula length: 22
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1380 markings, 2703 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p251 + 1 <= p149)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p251 + 1 <= p149)))
lola: processed formula length: 26
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (X (F ((3 <= p119))))) AND ((3 <= p119) AND (2 <= p152)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (X (F ((3 <= p119))))) AND ((3 <= p119) AND (2 <= p152)))))
lola: processed formula length: 71
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 55 markings, 56 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((p80 <= p88)) AND (p62 <= p11))) AND (1 <= p241))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p241)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p241)
lola: processed formula length: 11
lola: 47 rewrites
lola: closed formula file LTLCardinality.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 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p80 <= p88)) AND (p62 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p80 <= p88)) AND (p62 <= p11)))
lola: processed formula length: 39
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 103 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p176)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p176)))
lola: processed formula length: 19
lola: 47 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 137
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170388 markings, 224576 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p50 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p50 <= p159)))
lola: processed formula length: 21
lola: 47 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1149 markings, 1570 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((p138 <= 1))) OR (p49 <= p237))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((p138 <= 1))) OR (p49 <= p237))))
lola: processed formula length: 46
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 201
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38045 markings, 71661 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p153 <= p5)) OR F (((p183 + 1 <= p63) OR (p192 <= p54))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p153 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p153 <= p5))
lola: processed formula length: 16
lola: 47 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 510 markings, 650 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p183 + 1 <= p63) OR (p192 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p63 <= p183) AND (p54 + 1 <= p192))
lola: processed formula length: 37
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p33 <= p173)) AND (G ((p33 <= p173)) OR (G ((p146 <= p56)) AND (p194 + 1 <= p145))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p194 + 1 <= p145)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p194 + 1 <= p145)
lola: processed formula length: 18
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p33 <= p173))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p33 <= p173))
lola: processed formula length: 17
lola: 47 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2138 markings, 3927 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((G ((p152 <= p217)) OR (p208 <= p16)) AND G (((p146 + 1 <= p16) OR (p190 + 1 <= p232))))) OR (p232 <= p190))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p232 <= p190)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p232 <= p190)
lola: processed formula length: 14
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: (G (((G ((p152 <= p217)) OR (p208 <= p16)) AND G (((p146 + 1 <= p16) OR (p190 + 1 <= p232))))) OR (p232 <= p190))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p232 <= p190)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p232 <= p190)
lola: processed formula length: 14
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((G ((p152 <= p217)) OR (p208 <= p16)) AND G (((p146 + 1 <= p16) OR (p190 + 1 <= p232)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p152 <= p217)) OR (p208 <= p16)) AND G (((p146 + 1 <= p16) OR (p190 + 1 <= p232)))))
lola: processed formula length: 94
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 404 markings, 628 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes no no no no yes
lola:
preliminary result: no no no no no yes yes no no no no yes
lola: ========================================
lola: memory consumption: 22996 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-050050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RefineWMG-PT-050050, examination is LTLCardinality"
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-158987938500097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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