About the Execution of ITS-LoLa for RefineWMG-PT-100100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15798.860 | 3600000.00 | 2793934.00 | 315858.80 | ?F???TFF??FF?FTF | normal |
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-158987938500113.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-100100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500113
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.7K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.5K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.8K 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:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 218K 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-100100-00
FORMULA_NAME RefineWMG-PT-100100-01
FORMULA_NAME RefineWMG-PT-100100-02
FORMULA_NAME RefineWMG-PT-100100-03
FORMULA_NAME RefineWMG-PT-100100-04
FORMULA_NAME RefineWMG-PT-100100-05
FORMULA_NAME RefineWMG-PT-100100-06
FORMULA_NAME RefineWMG-PT-100100-07
FORMULA_NAME RefineWMG-PT-100100-08
FORMULA_NAME RefineWMG-PT-100100-09
FORMULA_NAME RefineWMG-PT-100100-10
FORMULA_NAME RefineWMG-PT-100100-11
FORMULA_NAME RefineWMG-PT-100100-12
FORMULA_NAME RefineWMG-PT-100100-13
FORMULA_NAME RefineWMG-PT-100100-14
FORMULA_NAME RefineWMG-PT-100100-15
=== Now, execution of the tool begins
BK_START 1591227522725
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:38:45] [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:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:38:46] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2020-06-03 23:38:46] [INFO ] Transformed 504 places.
[2020-06-03 23:38:46] [INFO ] Transformed 403 transitions.
[2020-06-03 23:38:46] [INFO ] Parsed PT model containing 504 places and 403 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100012 steps, including 0 resets, run finished after 372 ms. (steps per millisecond=268 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:38:46] [INFO ] Computed 202 place invariants in 19 ms
[2020-06-03 23:38:46] [INFO ] [Real]Absence check using 202 positive place invariants in 163 ms returned sat
[2020-06-03 23:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:47] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2020-06-03 23:38:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:47] [INFO ] [Nat]Absence check using 202 positive place invariants in 73 ms returned sat
[2020-06-03 23:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:48] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2020-06-03 23:38:48] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2020-06-03 23:38:49] [INFO ] Added : 205 causal constraints over 41 iterations in 1297 ms. Result :sat
[2020-06-03 23:38:51] [INFO ] [Real]Absence check using 202 positive place invariants in 1393 ms returned sat
[2020-06-03 23:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:51] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2020-06-03 23:38:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:51] [INFO ] [Nat]Absence check using 202 positive place invariants in 97 ms returned sat
[2020-06-03 23:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:52] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2020-06-03 23:38:52] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 40 ms.
[2020-06-03 23:38:53] [INFO ] Added : 199 causal constraints over 40 iterations in 1171 ms. Result :sat
[2020-06-03 23:38:53] [INFO ] [Real]Absence check using 202 positive place invariants in 147 ms returned sat
[2020-06-03 23:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:54] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2020-06-03 23:38:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:54] [INFO ] [Nat]Absence check using 202 positive place invariants in 134 ms returned sat
[2020-06-03 23:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:56] [INFO ] [Nat]Absence check using state equation in 1292 ms returned sat
[2020-06-03 23:38:56] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:38:57] [INFO ] Added : 205 causal constraints over 41 iterations in 1132 ms. Result :sat
[2020-06-03 23:38:57] [INFO ] [Real]Absence check using 202 positive place invariants in 130 ms returned sat
[2020-06-03 23:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:59] [INFO ] [Real]Absence check using state equation in 1533 ms returned sat
[2020-06-03 23:38:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:59] [INFO ] [Nat]Absence check using 202 positive place invariants in 410 ms returned sat
[2020-06-03 23:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:01] [INFO ] [Nat]Absence check using state equation in 2026 ms returned sat
[2020-06-03 23:39:01] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 44 ms.
[2020-06-03 23:39:02] [INFO ] Added : 170 causal constraints over 34 iterations in 996 ms. Result :sat
[2020-06-03 23:39:04] [INFO ] [Real]Absence check using 202 positive place invariants in 1308 ms returned sat
[2020-06-03 23:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:06] [INFO ] [Real]Absence check using state equation in 2748 ms returned sat
[2020-06-03 23:39:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 151 ms returned sat
[2020-06-03 23:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:07] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2020-06-03 23:39:07] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:08] [INFO ] Added : 101 causal constraints over 21 iterations in 485 ms. Result :sat
[2020-06-03 23:39:08] [INFO ] [Real]Absence check using 202 positive place invariants in 123 ms returned sat
[2020-06-03 23:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:09] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2020-06-03 23:39:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:09] [INFO ] [Nat]Absence check using 202 positive place invariants in 553 ms returned sat
[2020-06-03 23:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:10] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-06-03 23:39:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:39:11] [INFO ] Added : 117 causal constraints over 24 iterations in 552 ms. Result :sat
[2020-06-03 23:39:11] [INFO ] [Real]Absence check using 202 positive place invariants in 109 ms returned sat
[2020-06-03 23:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:11] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2020-06-03 23:39:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:12] [INFO ] [Nat]Absence check using 202 positive place invariants in 218 ms returned sat
[2020-06-03 23:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:13] [INFO ] [Nat]Absence check using state equation in 1761 ms returned sat
[2020-06-03 23:39:13] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 37 ms.
[2020-06-03 23:39:15] [INFO ] Added : 198 causal constraints over 40 iterations in 1276 ms. Result :sat
[2020-06-03 23:39:15] [INFO ] [Real]Absence check using 202 positive place invariants in 112 ms returned sat
[2020-06-03 23:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:16] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2020-06-03 23:39:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:16] [INFO ] [Nat]Absence check using 202 positive place invariants in 261 ms returned sat
[2020-06-03 23:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:16] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2020-06-03 23:39:16] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:39:17] [INFO ] Added : 44 causal constraints over 9 iterations in 361 ms. Result :sat
[2020-06-03 23:39:17] [INFO ] [Real]Absence check using 202 positive place invariants in 446 ms returned sat
[2020-06-03 23:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:18] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2020-06-03 23:39:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 132 ms returned sat
[2020-06-03 23:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:19] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2020-06-03 23:39:19] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 43 ms.
[2020-06-03 23:39:21] [INFO ] Added : 195 causal constraints over 39 iterations in 1515 ms. Result :sat
[2020-06-03 23:39:21] [INFO ] [Real]Absence check using 202 positive place invariants in 69 ms returned sat
[2020-06-03 23:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:21] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2020-06-03 23:39:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 88 ms returned sat
[2020-06-03 23:39:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:24] [INFO ] [Nat]Absence check using state equation in 2882 ms returned sat
[2020-06-03 23:39:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:39:25] [INFO ] Added : 137 causal constraints over 28 iterations in 686 ms. Result :sat
[2020-06-03 23:39:25] [INFO ] [Real]Absence check using 202 positive place invariants in 80 ms returned sat
[2020-06-03 23:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:26] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2020-06-03 23:39:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:26] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2020-06-03 23:39:26] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:39:28] [INFO ] Added : 198 causal constraints over 40 iterations in 1227 ms. Result :sat
[2020-06-03 23:39:29] [INFO ] [Real]Absence check using 202 positive place invariants in 1217 ms returned sat
[2020-06-03 23:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:30] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2020-06-03 23:39:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:30] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:31] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2020-06-03 23:39:31] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:39:32] [INFO ] Added : 198 causal constraints over 40 iterations in 1295 ms. Result :sat
[2020-06-03 23:39:33] [INFO ] [Real]Absence check using 202 positive place invariants in 126 ms returned sat
[2020-06-03 23:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:34] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2020-06-03 23:39:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 102 ms returned sat
[2020-06-03 23:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:34] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2020-06-03 23:39:34] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 38 ms.
[2020-06-03 23:39:35] [INFO ] Added : 76 causal constraints over 16 iterations in 458 ms. Result :sat
[2020-06-03 23:39:35] [INFO ] [Real]Absence check using 202 positive place invariants in 125 ms returned sat
[2020-06-03 23:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:36] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2020-06-03 23:39:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:36] [INFO ] [Nat]Absence check using 202 positive place invariants in 361 ms returned sat
[2020-06-03 23:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:38] [INFO ] [Nat]Absence check using state equation in 2274 ms returned sat
[2020-06-03 23:39:38] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2020-06-03 23:39:39] [INFO ] Added : 59 causal constraints over 12 iterations in 389 ms. Result :sat
[2020-06-03 23:39:39] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:39] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2020-06-03 23:39:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:40] [INFO ] [Nat]Absence check using 202 positive place invariants in 68 ms returned sat
[2020-06-03 23:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:40] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:39:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:41] [INFO ] Added : 184 causal constraints over 37 iterations in 1160 ms. Result :sat
[2020-06-03 23:39:41] [INFO ] [Real]Absence check using 202 positive place invariants in 122 ms returned sat
[2020-06-03 23:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:42] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2020-06-03 23:39:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:42] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:43] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2020-06-03 23:39:43] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:39:45] [INFO ] Added : 191 causal constraints over 39 iterations in 1244 ms. Result :sat
[2020-06-03 23:39:45] [INFO ] [Real]Absence check using 202 positive place invariants in 164 ms returned sat
[2020-06-03 23:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:46] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2020-06-03 23:39:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 74 ms returned sat
[2020-06-03 23:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:46] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2020-06-03 23:39:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:39:47] [INFO ] Added : 124 causal constraints over 25 iterations in 670 ms. Result :sat
[2020-06-03 23:39:47] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:48] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2020-06-03 23:39:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 105 ms returned sat
[2020-06-03 23:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:48] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2020-06-03 23:39:49] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:39:49] [INFO ] Added : 136 causal constraints over 28 iterations in 680 ms. Result :sat
[2020-06-03 23:39:50] [INFO ] [Real]Absence check using 202 positive place invariants in 948 ms returned sat
[2020-06-03 23:39:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:51] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2020-06-03 23:39:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:51] [INFO ] [Nat]Absence check using 202 positive place invariants in 115 ms returned sat
[2020-06-03 23:39:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:52] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2020-06-03 23:39:52] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:39:53] [INFO ] Added : 153 causal constraints over 31 iterations in 883 ms. Result :sat
[2020-06-03 23:39:53] [INFO ] [Real]Absence check using 202 positive place invariants in 80 ms returned sat
[2020-06-03 23:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:54] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2020-06-03 23:39:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:54] [INFO ] [Nat]Absence check using 202 positive place invariants in 113 ms returned sat
[2020-06-03 23:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:55] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2020-06-03 23:39:55] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 41 ms.
[2020-06-03 23:39:56] [INFO ] Added : 203 causal constraints over 41 iterations in 1330 ms. Result :sat
[2020-06-03 23:39:56] [INFO ] [Real]Absence check using 202 positive place invariants in 114 ms returned sat
[2020-06-03 23:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:57] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2020-06-03 23:39:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:57] [INFO ] [Nat]Absence check using 202 positive place invariants in 112 ms returned sat
[2020-06-03 23:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:58] [INFO ] [Nat]Absence check using state equation in 1286 ms returned sat
[2020-06-03 23:39:58] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 96 ms.
[2020-06-03 23:40:00] [INFO ] Added : 194 causal constraints over 39 iterations in 1711 ms. Result :sat
[2020-06-03 23:40:01] [INFO ] [Real]Absence check using 202 positive place invariants in 638 ms returned sat
[2020-06-03 23:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:02] [INFO ] [Real]Absence check using state equation in 1748 ms returned sat
[2020-06-03 23:40:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:02] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:40:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:05] [INFO ] [Nat]Absence check using state equation in 2608 ms returned sat
[2020-06-03 23:40:05] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:40:06] [INFO ] Added : 105 causal constraints over 21 iterations in 704 ms. Result :sat
[2020-06-03 23:40:06] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:06] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2020-06-03 23:40:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 664 ms returned sat
[2020-06-03 23:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:08] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2020-06-03 23:40:08] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 43 ms.
[2020-06-03 23:40:08] [INFO ] Added : 19 causal constraints over 4 iterations in 154 ms. Result :sat
[2020-06-03 23:40:08] [INFO ] [Real]Absence check using 202 positive place invariants in 66 ms returned sat
[2020-06-03 23:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:09] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2020-06-03 23:40:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:09] [INFO ] [Nat]Absence check using 202 positive place invariants in 67 ms returned sat
[2020-06-03 23:40:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:09] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2020-06-03 23:40:09] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:40:10] [INFO ] Added : 132 causal constraints over 27 iterations in 778 ms. Result :sat
[2020-06-03 23:40:10] [INFO ] [Real]Absence check using 202 positive place invariants in 86 ms returned sat
[2020-06-03 23:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:11] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2020-06-03 23:40:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:11] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:11] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2020-06-03 23:40:12] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:40:12] [INFO ] Added : 170 causal constraints over 34 iterations in 816 ms. Result :sat
[2020-06-03 23:40:12] [INFO ] [Real]Absence check using 202 positive place invariants in 106 ms returned sat
[2020-06-03 23:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:13] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2020-06-03 23:40:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:13] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:14] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:40:14] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:40:14] [INFO ] Added : 55 causal constraints over 11 iterations in 271 ms. Result :sat
[2020-06-03 23:40:14] [INFO ] [Real]Absence check using 202 positive place invariants in 184 ms returned sat
[2020-06-03 23:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:15] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2020-06-03 23:40:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:15] [INFO ] [Nat]Absence check using 202 positive place invariants in 142 ms returned sat
[2020-06-03 23:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:15] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2020-06-03 23:40:16] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:40:16] [INFO ] Added : 104 causal constraints over 21 iterations in 634 ms. Result :sat
[2020-06-03 23:40:16] [INFO ] [Real]Absence check using 202 positive place invariants in 66 ms returned sat
[2020-06-03 23:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:18] [INFO ] [Real]Absence check using state equation in 1370 ms returned sat
[2020-06-03 23:40:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:40:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 112 ms returned sat
[2020-06-03 23:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:40:18] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2020-06-03 23:40:18] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:40:19] [INFO ] Added : 45 causal constraints over 9 iterations in 200 ms. Result :sat
[2020-06-03 23:40:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 23:40:19] [INFO ] Flatten gal took : 65 ms
FORMULA RefineWMG-PT-100100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:40:19] [INFO ] Flatten gal took : 30 ms
[2020-06-03 23:40:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 23:40:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-100100 @ 3570 seconds
FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100100-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 852
rslt: Output for LTLCardinality @ RefineWMG-PT-100100
{
"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:41:06 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "(F ((p250 <= p452)) U ((p312 <= p139) OR (p452 + 1 <= p250)))",
"processed_size": 62,
"rewrites": 97
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p312 <= p139) U G ((X ((3 <= p100)) AND (p250 <= p452))))",
"processed_size": 59,
"rewrites": 97
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"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": "F (G ((p26 <= p436)))",
"processed_size": 21,
"rewrites": 97
},
"result":
{
"edges": 429,
"markings": 336,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p395 <= p85)))",
"processed_size": 21,
"rewrites": 97
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 319
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"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": "F (G ((p184 <= p263)))",
"processed_size": 22,
"rewrites": 97
},
"result":
{
"edges": 40889,
"markings": 21024,
"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": 364
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((G ((p331 <= 0)) AND (1 <= p331)))",
"processed_size": 37,
"rewrites": 97
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"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": "(p212 <= p177)",
"processed_size": 14,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p170 <= 2)",
"processed_size": 11,
"rewrites": 99
},
"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": 2
},
"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": 543
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((3 <= p120)) U (p42 + 1 <= p292))",
"processed_size": 37,
"rewrites": 97
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 725
},
"formula":
{
"count":
{
"A": 0,
"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": "X ((3 <= p120))",
"processed_size": 15,
"rewrites": 97
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1009
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"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": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((p128 <= p441)) AND ((p270 <= 0) AND ((1 <= p125) OR (p441 + 1 <= p128)))))",
"processed_size": 83,
"rewrites": 97
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 2018
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p213 <= p252) OR (p323 <= p201))",
"processed_size": 35,
"rewrites": 99
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3508,
"runtime": 2718.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(*)) : ((** U G((X(**) AND **))) OR (F(**) U **)) : X(F((G((F(**) AND (** OR **))) AND (G(*) OR **)))) : G(F(((X(*) R *) OR *))) : G(F(((F(G(*)) AND F(*)) OR X(**)))) : (X(F(**)) OR F(G(**))) : (F(G(**)) OR X((G(**) AND **))) : X((* R (X(G(*)) R *))) : G((X(G(**)) AND **)) : (X(F(*)) AND (F(**) AND **)) : ((F(**) U **) OR ((X(**) U **) AND X(**))) : X(F((G(**) OR G(**)))) : (G(F(**)) AND F(*)) : F((F(**) AND (** AND **)))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "unknown no unknown unknown unknown yes no unknown unknown no no unknown no no ",
"value": "unknown no unknown unknown unknown yes no unknown unknown no no unknown no 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: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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: NOT(X (F (((((p205 + 1 <= p456) U (3 <= p416)) OR (3 <= p416)) U F ((p456 <= p205)))))) : (((p312 <= p139) U G ((X ((3 <= p100)) AND (p250 <= p452)))) OR (F ((p250 <= p452)) U ((p312 <= p139) OR (p452 + 1 <= p250)))) : X (F ((G (((p482 <= p403) U (p113 <= p367))) AND (NOT(F ((1 <= p214))) OR (p162 + 1 <= p276))))) : G (F (X (X (NOT(X (G (((X ((3 <= p480)) U (3 <= p480)) AND (p7 <= p24))))))))) : G (NOT(G (NOT(F (((NOT(G (F ((p1 <= p448)))) AND NOT(G ((2 <= p26)))) OR X ((2 <= p26)))))))) : (X (F ((p395 <= p85))) OR X (F (X (F (X (G ((p26 <= p436)))))))) : (F (G ((p184 <= p263))) OR X ((G ((p331 <= 0)) AND (1 <= p331)))) : X (NOT(((p54 <= p477) U (F (X ((1 <= p20))) U (1 <= p20))))) : G ((X (G ((p225 <= 2))) AND (p482 <= p212))) : ((F ((F ((p307 + 1 <= p97)) U NOT(X ((3 <= p170))))) AND F ((3 <= p170))) AND (p212 <= p177)) : ((F ((3 <= p120)) U (p42 + 1 <= p292)) OR ((X ((3 <= p120)) U (p189 <= p446)) AND X ((3 <= p120)))) : F (NOT(X (G ((NOT(G ((p125 <= p2))) AND NOT(G ((3 <= p244)))))))) : (NOT(F (NOT(F ((NOT(G (X ((p459 <= p154)))) U (p459 <= p154)))))) AND NOT(G (((p213 <= p252) OR (p323 <= p201))))) : F (((F ((p128 <= p441)) AND (p270 <= 0)) AND ((1 <= p125) OR (p441 + 1 <= p128))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p205 + 1 <= p456)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p205 + 1 <= p456)))
lola: processed formula length: 26
lola: 97 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: 1358490 markings, 2044430 edges, 271698 markings/sec, 0 secs
lola: 2632766 markings, 3962229 edges, 254855 markings/sec, 5 secs
lola: 4024097 markings, 6056206 edges, 278266 markings/sec, 10 secs
lola: 5401506 markings, 8129187 edges, 275482 markings/sec, 15 secs
lola: 6772221 markings, 10192138 edges, 274143 markings/sec, 20 secs
lola: 8130016 markings, 12235572 edges, 271559 markings/sec, 25 secs
lola: 9548748 markings, 14370818 edges, 283746 markings/sec, 30 secs
lola: 10966318 markings, 16504191 edges, 283514 markings/sec, 35 secs
lola: 12384805 markings, 18639112 edges, 283697 markings/sec, 40 secs
lola: 13766605 markings, 20718627 edges, 276360 markings/sec, 45 secs
lola: 15085269 markings, 22703204 edges, 263733 markings/sec, 50 secs
lola: 16514691 markings, 24854543 edges, 285884 markings/sec, 55 secs
lola: 17905825 markings, 26948159 edges, 278227 markings/sec, 60 secs
lola: 19298929 markings, 29044809 edges, 278621 markings/sec, 65 secs
lola: 20682237 markings, 31126693 edges, 276662 markings/sec, 70 secs
lola: 22060386 markings, 33200794 edges, 275630 markings/sec, 75 secs
lola: 23425306 markings, 35255004 edges, 272984 markings/sec, 80 secs
lola: 24502075 markings, 36875554 edges, 215354 markings/sec, 85 secs
lola: 24561031 markings, 36964288 edges, 11791 markings/sec, 90 secs
lola: 24584426 markings, 36999534 edges, 4679 markings/sec, 95 secs
lola: 24808094 markings, 37336252 edges, 44734 markings/sec, 100 secs
lola: 24814379 markings, 37345549 edges, 1257 markings/sec, 105 secs
lola: 24963922 markings, 37570615 edges, 29909 markings/sec, 110 secs
lola: 24967916 markings, 37576623 edges, 799 markings/sec, 115 secs
lola: 24967916 markings, 37576623 edges, 0 markings/sec, 120 secs
lola: 25019170 markings, 37653765 edges, 10251 markings/sec, 125 secs
lola: 25048387 markings, 37697759 edges, 5843 markings/sec, 130 secs
lola: 25137770 markings, 37832257 edges, 17877 markings/sec, 135 secs
lola: 25186461 markings, 37905493 edges, 9738 markings/sec, 140 secs
lola: 25329083 markings, 38120129 edges, 28524 markings/sec, 145 secs
lola: 25475727 markings, 38340841 edges, 29329 markings/sec, 150 secs
lola: 25475727 markings, 38340841 edges, 0 markings/sec, 155 secs
lola: 25475897 markings, 38341114 edges, 34 markings/sec, 160 secs
lola: 25476190 markings, 38341562 edges, 59 markings/sec, 165 secs
lola: 25677929 markings, 38645135 edges, 40348 markings/sec, 170 secs
lola: 25686015 markings, 38657341 edges, 1617 markings/sec, 175 secs
lola: 25689678 markings, 38662848 edges, 733 markings/sec, 180 secs
lola: 25841284 markings, 38891017 edges, 30321 markings/sec, 185 secs
lola: 25843756 markings, 38894725 edges, 494 markings/sec, 190 secs
lola: 25993199 markings, 39119686 edges, 29889 markings/sec, 195 secs
lola: 26011862 markings, 39147756 edges, 3733 markings/sec, 200 secs
lola: 26051988 markings, 39208160 edges, 8025 markings/sec, 205 secs
lola: 26051988 markings, 39208160 edges, 0 markings/sec, 210 secs
lola: 26120790 markings, 39311696 edges, 13760 markings/sec, 215 secs
lola: 26124194 markings, 39316785 edges, 681 markings/sec, 220 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p312 <= p139) U G ((X ((3 <= p100)) AND (p250 <= p452)))) OR (F ((p250 <= p452)) U ((p312 <= p139) OR (p452 + 1 <= p250))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p250 <= p452)) U ((p312 <= p139) OR (p452 + 1 <= p250)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p250 <= p452)) U ((p312 <= p139) OR (p452 + 1 <= p250)))
lola: processed formula length: 62
lola: 97 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p312 <= p139) U G ((X ((3 <= p100)) AND (p250 <= p452))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p312 <= p139) U G ((X ((3 <= p100)) AND (p250 <= p452))))
lola: processed formula length: 59
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 101 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F ((p113 <= p367)) AND ((p482 <= p403) OR (p113 <= p367)))) AND (G ((p214 <= 0)) OR (p162 + 1 <= p276)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F ((p113 <= p367)) AND ((p482 <= p403) OR (p113 <= p367)))) AND (G ((p214 <= 0)) OR (p162 + 1 <= p276)))))
lola: processed formula length: 117
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 1437398 markings, 2163187 edges, 287480 markings/sec, 0 secs
lola: 2710159 markings, 4078701 edges, 254552 markings/sec, 5 secs
lola: 4138339 markings, 6228162 edges, 285636 markings/sec, 10 secs
lola: 5531858 markings, 8325354 edges, 278704 markings/sec, 15 secs
lola: 6948427 markings, 10457284 edges, 283314 markings/sec, 20 secs
lola: 8333879 markings, 12542410 edges, 277090 markings/sec, 25 secs
lola: 9767462 markings, 14699949 edges, 286717 markings/sec, 30 secs
lola: 11158507 markings, 16793485 edges, 278209 markings/sec, 35 secs
lola: 12575722 markings, 18926400 edges, 283443 markings/sec, 40 secs
lola: 13968037 markings, 21021798 edges, 278463 markings/sec, 45 secs
lola: 15379006 markings, 23145296 edges, 282194 markings/sec, 50 secs
lola: 16809892 markings, 25298828 edges, 286177 markings/sec, 55 secs
lola: 18245302 markings, 27459099 edges, 287082 markings/sec, 60 secs
lola: 19595811 markings, 29491580 edges, 270102 markings/sec, 65 secs
lola: 20913751 markings, 31475120 edges, 263588 markings/sec, 70 secs
lola: 22289366 markings, 33545377 edges, 275123 markings/sec, 75 secs
lola: 23662998 markings, 35612687 edges, 274726 markings/sec, 80 secs
lola: 24608138 markings, 37035166 edges, 189028 markings/sec, 85 secs
lola: 24615491 markings, 37046231 edges, 1471 markings/sec, 90 secs
lola: 24633878 markings, 37073912 edges, 3677 markings/sec, 95 secs
lola: 24706975 markings, 37183956 edges, 14619 markings/sec, 100 secs
lola: 24820743 markings, 37355153 edges, 22754 markings/sec, 105 secs
lola: 24838376 markings, 37381667 edges, 3527 markings/sec, 110 secs
lola: 24881926 markings, 37447220 edges, 8710 markings/sec, 115 secs
lola: 25167865 markings, 37877523 edges, 57188 markings/sec, 120 secs
lola: 25291355 markings, 38063385 edges, 24698 markings/sec, 125 secs
lola: 25291550 markings, 38063676 edges, 39 markings/sec, 130 secs
lola: 25415151 markings, 38249682 edges, 24720 markings/sec, 135 secs
lola: 25812613 markings, 38847881 edges, 79492 markings/sec, 140 secs
lola: 26090096 markings, 39265514 edges, 55497 markings/sec, 145 secs
lola: 26090096 markings, 39265514 edges, 0 markings/sec, 150 secs
lola: 26142752 markings, 39344713 edges, 10531 markings/sec, 155 secs
lola: 26210281 markings, 39446383 edges, 13506 markings/sec, 160 secs
lola: 26474539 markings, 39844109 edges, 52852 markings/sec, 165 secs
lola: 27081547 markings, 40757654 edges, 121402 markings/sec, 170 secs
lola: 27081547 markings, 40757654 edges, 0 markings/sec, 175 secs
lola: 27384064 markings, 41212917 edges, 60503 markings/sec, 180 secs
lola: 27517095 markings, 41413128 edges, 26606 markings/sec, 185 secs
lola: 28066822 markings, 42240447 edges, 109945 markings/sec, 190 secs
lola: 28693772 markings, 43184025 edges, 125390 markings/sec, 195 secs
lola: 29275270 markings, 44059232 edges, 116300 markings/sec, 200 secs
lola: 29531728 markings, 44445118 edges, 51292 markings/sec, 205 secs
lola: 29707938 markings, 44710374 edges, 35242 markings/sec, 210 secs
lola: 30244865 markings, 45518423 edges, 107385 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X ((p480 <= 2)) R (p480 <= 2)) OR (p24 + 1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((p480 <= 2)) R (p480 <= 2)) OR (p24 + 1 <= p7))))
lola: processed formula length: 60
lola: 97 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: 1326012 markings, 1995567 edges, 265202 markings/sec, 0 secs
lola: 2632204 markings, 3961407 edges, 261238 markings/sec, 5 secs
lola: 3947536 markings, 5940955 edges, 263066 markings/sec, 10 secs
lola: 5281296 markings, 7948286 edges, 266752 markings/sec, 15 secs
lola: 6581349 markings, 9904857 edges, 260011 markings/sec, 20 secs
lola: 7918578 markings, 11917415 edges, 267446 markings/sec, 25 secs
lola: 9262960 markings, 13940674 edges, 268876 markings/sec, 30 secs
lola: 10600722 markings, 15954007 edges, 267552 markings/sec, 35 secs
lola: 11917565 markings, 17935877 edges, 263369 markings/sec, 40 secs
lola: 13247227 markings, 19936962 edges, 265932 markings/sec, 45 secs
lola: 14579701 markings, 21942369 edges, 266495 markings/sec, 50 secs
lola: 15914053 markings, 23950567 edges, 266870 markings/sec, 55 secs
lola: 17223863 markings, 25921811 edges, 261962 markings/sec, 60 secs
lola: 18566425 markings, 27942455 edges, 268512 markings/sec, 65 secs
lola: 19877671 markings, 29915787 edges, 262249 markings/sec, 70 secs
lola: 21179504 markings, 31875101 edges, 260367 markings/sec, 75 secs
lola: 22474096 markings, 33823439 edges, 258918 markings/sec, 80 secs
lola: 23768443 markings, 35771402 edges, 258869 markings/sec, 85 secs
lola: 24670933 markings, 37129681 edges, 180498 markings/sec, 90 secs
lola: 25076273 markings, 37739804 edges, 81068 markings/sec, 95 secs
lola: 25212267 markings, 37944382 edges, 27199 markings/sec, 100 secs
lola: 25432811 markings, 38276291 edges, 44109 markings/sec, 105 secs
lola: 25432811 markings, 38276291 edges, 0 markings/sec, 110 secs
lola: 25802633 markings, 38832852 edges, 73964 markings/sec, 115 secs
lola: 26235337 markings, 39484121 edges, 86541 markings/sec, 120 secs
lola: 26926098 markings, 40523686 edges, 138152 markings/sec, 125 secs
lola: 27704638 markings, 41695382 edges, 155708 markings/sec, 130 secs
lola: 27722993 markings, 41722982 edges, 3671 markings/sec, 135 secs
lola: 27722993 markings, 41722982 edges, 0 markings/sec, 140 secs
lola: 27763712 markings, 41784295 edges, 8144 markings/sec, 145 secs
lola: 28718708 markings, 43221579 edges, 190999 markings/sec, 150 secs
lola: 29543775 markings, 44463292 edges, 165013 markings/sec, 155 secs
lola: 29543775 markings, 44463292 edges, 0 markings/sec, 160 secs
lola: 29543775 markings, 44463292 edges, 0 markings/sec, 165 secs
lola: 29543775 markings, 44463292 edges, 0 markings/sec, 170 secs
lola: 29549663 markings, 44472109 edges, 1178 markings/sec, 175 secs
lola: 29581750 markings, 44520445 edges, 6417 markings/sec, 180 secs
lola: 29825202 markings, 44886803 edges, 48690 markings/sec, 185 secs
lola: 30553271 markings, 45982810 edges, 145614 markings/sec, 190 secs
lola: 30569321 markings, 46006732 edges, 3210 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((F (G ((p448 + 1 <= p1))) AND F ((p26 <= 1))) OR X ((2 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((F (G ((p448 + 1 <= p1))) AND F ((p26 <= 1))) OR X ((2 <= p26)))))
lola: processed formula length: 73
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1457776 markings, 2193697 edges, 291555 markings/sec, 0 secs
lola: 2980102 markings, 4484707 edges, 304465 markings/sec, 5 secs
lola: 4084348 markings, 6146709 edges, 220849 markings/sec, 10 secs
lola: 5496880 markings, 8272634 edges, 282506 markings/sec, 15 secs
lola: 6907525 markings, 10395608 edges, 282129 markings/sec, 20 secs
lola: 8310474 markings, 12506981 edges, 280590 markings/sec, 25 secs
lola: 9610633 markings, 14463817 edges, 260032 markings/sec, 30 secs
lola: 10749115 markings, 16177161 edges, 227696 markings/sec, 35 secs
lola: 12122286 markings, 18243936 edges, 274634 markings/sec, 40 secs
lola: 13461215 markings, 20258978 edges, 267786 markings/sec, 45 secs
lola: 14758252 markings, 22210873 edges, 259407 markings/sec, 50 secs
lola: 16175185 markings, 24343361 edges, 283387 markings/sec, 55 secs
lola: 17512607 markings, 26356283 edges, 267484 markings/sec, 60 secs
lola: 18891994 markings, 28432291 edges, 275877 markings/sec, 65 secs
lola: 20211460 markings, 30418015 edges, 263893 markings/sec, 70 secs
lola: 21561987 markings, 32450496 edges, 270105 markings/sec, 75 secs
lola: 22939138 markings, 34523125 edges, 275430 markings/sec, 80 secs
lola: 24251795 markings, 36498704 edges, 262531 markings/sec, 85 secs
lola: 25576780 markings, 38492933 edges, 264997 markings/sec, 90 secs
lola: 26848470 markings, 40406750 edges, 254338 markings/sec, 95 secs
lola: 28213351 markings, 42460834 edges, 272976 markings/sec, 100 secs
lola: 28748989 markings, 43266892 edges, 107128 markings/sec, 105 secs
lola: 29065175 markings, 43742839 edges, 63237 markings/sec, 110 secs
lola: 29771044 markings, 44807343 edges, 141174 markings/sec, 115 secs
lola: 30343690 markings, 45667108 edges, 114529 markings/sec, 120 secs
lola: 30983647 markings, 46630264 edges, 127991 markings/sec, 125 secs
lola: 30988754 markings, 46637830 edges, 1021 markings/sec, 130 secs
lola: 30988754 markings, 46637830 edges, 0 markings/sec, 135 secs
lola: 31342292 markings, 47170076 edges, 70708 markings/sec, 140 secs
lola: 31655437 markings, 47641227 edges, 62629 markings/sec, 145 secs
lola: 31655437 markings, 47641227 edges, 0 markings/sec, 150 secs
lola: 32025391 markings, 48198016 edges, 73991 markings/sec, 155 secs
lola: 32528312 markings, 48954850 edges, 100584 markings/sec, 160 secs
lola: 32528312 markings, 48954850 edges, 0 markings/sec, 165 secs
lola: 32897161 markings, 49509890 edges, 73770 markings/sec, 170 secs
lola: 33476308 markings, 50381551 edges, 115829 markings/sec, 175 secs
lola: 33476308 markings, 50381551 edges, 0 markings/sec, 180 secs
lola: 33476446 markings, 50381791 edges, 28 markings/sec, 185 secs
lola: 34268536 markings, 51573873 edges, 158418 markings/sec, 190 secs
lola: 34268536 markings, 51573873 edges, 0 markings/sec, 195 secs
lola: 34268536 markings, 51573873 edges, 0 markings/sec, 200 secs
lola: 34272552 markings, 51579905 edges, 803 markings/sec, 205 secs
lola: 35085223 markings, 52802950 edges, 162534 markings/sec, 210 secs
lola: 35085223 markings, 52802950 edges, 0 markings/sec, 215 secs
lola: 35085223 markings, 52802950 edges, 0 markings/sec, 220 secs
lola: 35373537 markings, 53236997 edges, 57663 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p395 <= p85))) OR F (G ((p26 <= p436))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p26 <= p436)))
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 ((p26 <= p436)))
lola: processed formula length: 21
lola: 97 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 345
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: 336 markings, 429 edges
lola: ========================================
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p395 <= p85)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p395 <= p85)))
lola: processed formula length: 21
lola: 97 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: 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: 102 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p184 <= p263))) OR X ((G ((p331 <= 0)) AND (1 <= p331))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p184 <= p263)))
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 ((p184 <= p263)))
lola: processed formula length: 22
lola: 97 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 401
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: 21024 markings, 40889 edges
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p331 <= 0)) AND (1 <= p331)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p331 <= 0)) AND (1 <= p331)))
lola: processed formula length: 37
lola: 97 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 102 markings, 102 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p477 + 1 <= p54) R (X (G ((p20 <= 0))) R (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p477 + 1 <= p54) R (X (G ((p20 <= 0))) R (p20 <= 0))))
lola: processed formula length: 59
lola: 97 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: 1414776 markings, 2129154 edges, 282955 markings/sec, 0 secs
lola: 2771375 markings, 4170833 edges, 271320 markings/sec, 5 secs
lola: 4162118 markings, 6263935 edges, 278149 markings/sec, 10 secs
lola: 5555217 markings, 8360531 edges, 278620 markings/sec, 15 secs
lola: 6889414 markings, 10368506 edges, 266839 markings/sec, 20 secs
lola: 8237692 markings, 12397662 edges, 269656 markings/sec, 25 secs
lola: 9621181 markings, 14479755 edges, 276698 markings/sec, 30 secs
lola: 10867187 markings, 16355041 edges, 249201 markings/sec, 35 secs
lola: 12225449 markings, 18399262 edges, 271652 markings/sec, 40 secs
lola: 13555661 markings, 20401153 edges, 266042 markings/sec, 45 secs
lola: 14850150 markings, 22349393 edges, 258898 markings/sec, 50 secs
lola: 16114105 markings, 24251663 edges, 252791 markings/sec, 55 secs
lola: 17456021 markings, 26271314 edges, 268383 markings/sec, 60 secs
lola: 18777794 markings, 28260482 edges, 264355 markings/sec, 65 secs
lola: 20116248 markings, 30274878 edges, 267691 markings/sec, 70 secs
lola: 21418414 markings, 32234618 edges, 260433 markings/sec, 75 secs
lola: 22731519 markings, 34210876 edges, 262621 markings/sec, 80 secs
lola: 24052550 markings, 36199032 edges, 264206 markings/sec, 85 secs
lola: 24974920 markings, 37587383 edges, 184474 markings/sec, 90 secs
lola: 25369438 markings, 38181091 edges, 78904 markings/sec, 95 secs
lola: 25951698 markings, 39057225 edges, 116452 markings/sec, 100 secs
lola: 25988979 markings, 39113312 edges, 7456 markings/sec, 105 secs
lola: 26195719 markings, 39424487 edges, 41348 markings/sec, 110 secs
lola: 26663148 markings, 40127984 edges, 93486 markings/sec, 115 secs
lola: 27270538 markings, 41042052 edges, 121478 markings/sec, 120 secs
lola: 28103092 markings, 42295032 edges, 166511 markings/sec, 125 secs
lola: 28535538 markings, 42945917 edges, 86489 markings/sec, 130 secs
lola: 28569406 markings, 42996865 edges, 6774 markings/sec, 135 secs
lola: 28993038 markings, 43634481 edges, 84726 markings/sec, 140 secs
lola: 29486424 markings, 44376954 edges, 98677 markings/sec, 145 secs
lola: 29704736 markings, 44705552 edges, 43662 markings/sec, 150 secs
lola: 29704736 markings, 44705552 edges, 0 markings/sec, 155 secs
lola: 30256898 markings, 45536543 edges, 110432 markings/sec, 160 secs
lola: 30589218 markings, 46036686 edges, 66464 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p225 <= 2))) AND (p482 <= p212)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p225 <= 2))) AND (p482 <= p212)))
lola: processed formula length: 44
lola: 97 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: 1258947 markings, 1894603 edges, 251789 markings/sec, 0 secs
lola: 1655694 markings, 2491733 edges, 79349 markings/sec, 5 secs
lola: 3018534 markings, 4542816 edges, 272568 markings/sec, 10 secs
lola: 4326137 markings, 6510771 edges, 261521 markings/sec, 15 secs
lola: 5712686 markings, 8597528 edges, 277310 markings/sec, 20 secs
lola: 7102303 markings, 10688896 edges, 277923 markings/sec, 25 secs
lola: 8430006 markings, 12687094 edges, 265541 markings/sec, 30 secs
lola: 9778431 markings, 14716471 edges, 269685 markings/sec, 35 secs
lola: 11099839 markings, 16705176 edges, 264282 markings/sec, 40 secs
lola: 12422739 markings, 18696171 edges, 264580 markings/sec, 45 secs
lola: 13740237 markings, 20678963 edges, 263500 markings/sec, 50 secs
lola: 15021029 markings, 22606537 edges, 256158 markings/sec, 55 secs
lola: 16345432 markings, 24599841 edges, 264881 markings/sec, 60 secs
lola: 17659694 markings, 26577722 edges, 262852 markings/sec, 65 secs
lola: 18973878 markings, 28555647 edges, 262837 markings/sec, 70 secs
lola: 20262347 markings, 30494753 edges, 257694 markings/sec, 75 secs
lola: 21579796 markings, 32477472 edges, 263490 markings/sec, 80 secs
lola: 22893566 markings, 34454733 edges, 262754 markings/sec, 85 secs
lola: 24230832 markings, 36467292 edges, 267453 markings/sec, 90 secs
lola: 25103202 markings, 37782909 edges, 174474 markings/sec, 95 secs
lola: 25639855 markings, 38588247 edges, 107331 markings/sec, 100 secs
lola: 26633351 markings, 40083213 edges, 198699 markings/sec, 105 secs
lola: 27681519 markings, 41660652 edges, 209634 markings/sec, 110 secs
lola: 28806514 markings, 43353731 edges, 224999 markings/sec, 115 secs
lola: 29716492 markings, 44723182 edges, 181996 markings/sec, 120 secs
lola: 30564656 markings, 45999745 edges, 169633 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p170 <= 2))) AND (F ((3 <= p170)) AND (p212 <= p177)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p212 <= p177)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p212 <= p177)
lola: processed formula length: 14
lola: 97 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: subprocess 10 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p170))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p170 <= 2)
lola: processed formula length: 11
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((3 <= p120)) U (p42 + 1 <= p292)) OR ((X ((3 <= p120)) U (p189 <= p446)) AND X ((3 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p120)) U (p42 + 1 <= p292))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((3 <= p120)) U (p42 + 1 <= p292))
lola: processed formula length: 37
lola: 97 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 725 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((3 <= p120))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((3 <= p120))
lola: processed formula length: 15
lola: 97 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: 101 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 725 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p125 <= p2)) OR G ((3 <= p244)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p125 <= p2)) OR G ((3 <= p244)))))
lola: processed formula length: 45
lola: 97 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: 1405421 markings, 2115064 edges, 281084 markings/sec, 0 secs
lola: 2752583 markings, 4142557 edges, 269432 markings/sec, 5 secs
lola: 4107642 markings, 6181949 edges, 271012 markings/sec, 10 secs
lola: 5464721 markings, 8224343 edges, 271416 markings/sec, 15 secs
lola: 6800689 markings, 10234945 edges, 267194 markings/sec, 20 secs
lola: 8140174 markings, 12250937 edges, 267897 markings/sec, 25 secs
lola: 9496147 markings, 14291572 edges, 271195 markings/sec, 30 secs
lola: 10829927 markings, 16298940 edges, 266756 markings/sec, 35 secs
lola: 12178602 markings, 18328762 edges, 269735 markings/sec, 40 secs
lola: 13519760 markings, 20347103 edges, 268232 markings/sec, 45 secs
lola: 14842847 markings, 22338363 edges, 264617 markings/sec, 50 secs
lola: 16178221 markings, 24348174 edges, 267075 markings/sec, 55 secs
lola: 17511728 markings, 26355030 edges, 266701 markings/sec, 60 secs
lola: 18855822 markings, 28377930 edges, 268819 markings/sec, 65 secs
lola: 20172102 markings, 30358941 edges, 263256 markings/sec, 70 secs
lola: 21495996 markings, 32351362 edges, 264779 markings/sec, 75 secs
lola: 22811336 markings, 34330992 edges, 263068 markings/sec, 80 secs
lola: 24136087 markings, 36324724 edges, 264950 markings/sec, 85 secs
lola: 25003244 markings, 37630046 edges, 173431 markings/sec, 90 secs
lola: 25489109 markings, 38365761 edges, 97173 markings/sec, 95 secs
lola: 25955964 markings, 39063634 edges, 93371 markings/sec, 100 secs
lola: 26868833 markings, 40437571 edges, 182574 markings/sec, 105 secs
lola: 27601131 markings, 41539608 edges, 146460 markings/sec, 110 secs
lola: 28028424 markings, 42182661 edges, 85459 markings/sec, 115 secs
lola: 28944692 markings, 43561669 edges, 183254 markings/sec, 120 secs
lola: 29446167 markings, 44316397 edges, 100295 markings/sec, 125 secs
lola: 29820800 markings, 44880179 edges, 74927 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p128 <= p441)) AND ((p270 <= 0) AND ((1 <= p125) OR (p441 + 1 <= p128)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p128 <= p441)) AND ((p270 <= 0) AND ((1 <= p125) OR (p441 + 1 <= p128)))))
lola: processed formula length: 83
lola: 97 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 2018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p459 <= p154))) AND F (((p252 + 1 <= p213) AND (p201 + 1 <= p323))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p252 + 1 <= p213) AND (p201 + 1 <= p323)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p213 <= p252) OR (p323 <= p201))
lola: processed formula length: 35
lola: 99 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: ========================================
lola: ...considering subproblem: X (G ((p205 + 1 <= p456)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p205 + 1 <= p456)))
lola: processed formula length: 26
lola: 97 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: 1375408 markings, 2069907 edges, 275082 markings/sec, 0 secs
lola: 2712162 markings, 4081718 edges, 267351 markings/sec, 5 secs
lola: 4062421 markings, 6113926 edges, 270052 markings/sec, 10 secs
lola: 5394927 markings, 8119235 edges, 266501 markings/sec, 15 secs
lola: 6718313 markings, 10110999 edges, 264677 markings/sec, 20 secs
lola: 8053882 markings, 12121024 edges, 267114 markings/sec, 25 secs
lola: 9400098 markings, 14147058 edges, 269243 markings/sec, 30 secs
lola: 10706868 markings, 16113759 edges, 261354 markings/sec, 35 secs
lola: 12053486 markings, 18140426 edges, 269324 markings/sec, 40 secs
lola: 13377057 markings, 20132376 edges, 264714 markings/sec, 45 secs
lola: 14699348 markings, 22122443 edges, 264458 markings/sec, 50 secs
lola: 16019521 markings, 24109284 edges, 264035 markings/sec, 55 secs
lola: 17340374 markings, 26097161 edges, 264171 markings/sec, 60 secs
lola: 18662372 markings, 28086823 edges, 264400 markings/sec, 65 secs
lola: 19993747 markings, 30090541 edges, 266275 markings/sec, 70 secs
lola: 21305293 markings, 32064367 edges, 262309 markings/sec, 75 secs
lola: 22625513 markings, 34051331 edges, 264044 markings/sec, 80 secs
lola: 23933431 markings, 36019719 edges, 261584 markings/sec, 85 secs
lola: 24970822 markings, 37581098 edges, 207478 markings/sec, 90 secs
lola: 24970988 markings, 37581282 edges, 33 markings/sec, 95 secs
lola: 25382324 markings, 38201104 edges, 82267 markings/sec, 100 secs
lola: 25894262 markings, 38971725 edges, 102388 markings/sec, 105 secs
lola: 26617108 markings, 40058672 edges, 144569 markings/sec, 110 secs
lola: 27471344 markings, 41344252 edges, 170847 markings/sec, 115 secs
lola: 28274689 markings, 42553320 edges, 160669 markings/sec, 120 secs
lola: 28915315 markings, 43517492 edges, 128125 markings/sec, 125 secs
lola: 29920494 markings, 45030208 edges, 201036 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F ((p113 <= p367)) AND ((p482 <= p403) OR (p113 <= p367)))) AND (G ((p214 <= 0)) OR (p162 + 1 <= p276)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F ((p113 <= p367)) AND ((p482 <= p403) OR (p113 <= p367)))) AND (G ((p214 <= 0)) OR (p162 + 1 <= p276)))))
lola: processed formula length: 117
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 1315350 markings, 1979478 edges, 263070 markings/sec, 0 secs
lola: 2592124 markings, 3901085 edges, 255355 markings/sec, 5 secs
lola: 3894352 markings, 5860968 edges, 260446 markings/sec, 10 secs
lola: 5165183 markings, 7773510 edges, 254166 markings/sec, 15 secs
lola: 6432417 markings, 9680705 edges, 253447 markings/sec, 20 secs
lola: 7703485 markings, 11593667 edges, 254214 markings/sec, 25 secs
lola: 8965299 markings, 13492656 edges, 252363 markings/sec, 30 secs
lola: 10220916 markings, 15382424 edges, 251123 markings/sec, 35 secs
lola: 11456141 markings, 17241347 edges, 247045 markings/sec, 40 secs
lola: 12660707 markings, 19054273 edges, 240913 markings/sec, 45 secs
lola: 13885460 markings, 20897531 edges, 244951 markings/sec, 50 secs
lola: 15065190 markings, 22673016 edges, 235946 markings/sec, 55 secs
lola: 16299632 markings, 24530896 edges, 246888 markings/sec, 60 secs
lola: 17550280 markings, 26413046 edges, 250130 markings/sec, 65 secs
lola: 18786401 markings, 28273489 edges, 247224 markings/sec, 70 secs
lola: 20029190 markings, 30143824 edges, 248558 markings/sec, 75 secs
lola: 21233837 markings, 31956859 edges, 240929 markings/sec, 80 secs
lola: 22489576 markings, 33846711 edges, 251148 markings/sec, 85 secs
lola: 23711663 markings, 35685921 edges, 244417 markings/sec, 90 secs
lola: 24689994 markings, 37166709 edges, 195666 markings/sec, 95 secs
lola: 25392313 markings, 38215889 edges, 140464 markings/sec, 100 secs
lola: 26324834 markings, 39619157 edges, 186504 markings/sec, 105 secs
lola: 27292249 markings, 41074755 edges, 193483 markings/sec, 110 secs
lola: 28383754 markings, 42717452 edges, 218301 markings/sec, 115 secs
lola: 29430758 markings, 44293182 edges, 209401 markings/sec, 120 secs
lola: 30371076 markings, 45708376 edges, 188064 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F (((X ((p480 <= 2)) R (p480 <= 2)) OR (p24 + 1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((p480 <= 2)) R (p480 <= 2)) OR (p24 + 1 <= p7))))
lola: processed formula length: 60
lola: 97 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: 1388340 markings, 2089410 edges, 277668 markings/sec, 0 secs
lola: 2708804 markings, 4076684 edges, 264093 markings/sec, 5 secs
lola: 4041865 markings, 6082966 edges, 266612 markings/sec, 10 secs
lola: 5304665 markings, 7983446 edges, 252560 markings/sec, 15 secs
lola: 6562806 markings, 9876954 edges, 251628 markings/sec, 20 secs
lola: 7864885 markings, 11836571 edges, 260416 markings/sec, 25 secs
lola: 9168023 markings, 13797761 edges, 260628 markings/sec, 30 secs
lola: 10435275 markings, 15705006 edges, 253450 markings/sec, 35 secs
lola: 11758232 markings, 17696063 edges, 264591 markings/sec, 40 secs
lola: 13029656 markings, 19609532 edges, 254285 markings/sec, 45 secs
lola: 14354899 markings, 21604055 edges, 265049 markings/sec, 50 secs
lola: 15633204 markings, 23527886 edges, 255661 markings/sec, 55 secs
lola: 16926839 markings, 25474805 edges, 258727 markings/sec, 60 secs
lola: 18221691 markings, 27423566 edges, 258970 markings/sec, 65 secs
lola: 19487236 markings, 29328170 edges, 253109 markings/sec, 70 secs
lola: 20718909 markings, 31181880 edges, 246335 markings/sec, 75 secs
lola: 21979162 markings, 33078536 edges, 252051 markings/sec, 80 secs
lola: 23153999 markings, 34846696 edges, 234967 markings/sec, 85 secs
lola: 24443346 markings, 36787167 edges, 257869 markings/sec, 90 secs
lola: 24783874 markings, 37300267 edges, 68106 markings/sec, 95 secs
lola: 25207316 markings, 37936895 edges, 84688 markings/sec, 100 secs
lola: 26070761 markings, 39236452 edges, 172689 markings/sec, 105 secs
lola: 26996228 markings, 40629245 edges, 185093 markings/sec, 110 secs
lola: 28113009 markings, 42309991 edges, 223356 markings/sec, 115 secs
lola: 29207180 markings, 43956729 edges, 218834 markings/sec, 120 secs
lola: 30262162 markings, 45544445 edges, 210996 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F (((F (G ((p448 + 1 <= p1))) AND F ((p26 <= 1))) OR X ((2 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((F (G ((p448 + 1 <= p1))) AND F ((p26 <= 1))) OR X ((2 <= p26)))))
lola: processed formula length: 73
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1446323 markings, 2176432 edges, 289265 markings/sec, 0 secs
lola: 2881601 markings, 4336607 edges, 287056 markings/sec, 5 secs
lola: 4276474 markings, 6435922 edges, 278975 markings/sec, 10 secs
lola: 5580413 markings, 8398315 edges, 260788 markings/sec, 15 secs
lola: 6918643 markings, 10412476 edges, 267646 markings/sec, 20 secs
lola: 8217355 markings, 12366937 edges, 259742 markings/sec, 25 secs
lola: 9599155 markings, 14446476 edges, 276360 markings/sec, 30 secs
lola: 10914954 markings, 16426683 edges, 263160 markings/sec, 35 secs
lola: 12243421 markings, 18426224 edges, 265693 markings/sec, 40 secs
lola: 13526482 markings, 20357268 edges, 256612 markings/sec, 45 secs
lola: 14871145 markings, 22380884 edges, 268933 markings/sec, 50 secs
lola: 16243380 markings, 24445968 edges, 274447 markings/sec, 55 secs
lola: 17567336 markings, 26438777 edges, 264791 markings/sec, 60 secs
lola: 18871228 markings, 28400967 edges, 260778 markings/sec, 65 secs
lola: 20156831 markings, 30335813 edges, 257121 markings/sec, 70 secs
lola: 21365457 markings, 32154699 edges, 241725 markings/sec, 75 secs
lola: 22752295 markings, 34242001 edges, 277368 markings/sec, 80 secs
lola: 24068716 markings, 36223192 edges, 263284 markings/sec, 85 secs
lola: 25417847 markings, 38253620 edges, 269826 markings/sec, 90 secs
lola: 26719707 markings, 40212888 edges, 260372 markings/sec, 95 secs
lola: 28137643 markings, 42346843 edges, 283587 markings/sec, 100 secs
lola: 28769987 markings, 43300451 edges, 126469 markings/sec, 105 secs
lola: 29058589 markings, 43732855 edges, 57720 markings/sec, 110 secs
lola: 29311400 markings, 44113423 edges, 50562 markings/sec, 115 secs
lola: 29493448 markings, 44387496 edges, 36410 markings/sec, 120 secs
lola: 29752567 markings, 44777404 edges, 51824 markings/sec, 125 secs
lola: 30002324 markings, 45153317 edges, 49951 markings/sec, 130 secs
lola: 30247647 markings, 45522482 edges, 49065 markings/sec, 135 secs
lola: 30392155 markings, 45739996 edges, 28902 markings/sec, 140 secs
lola: 30578398 markings, 46020211 edges, 37249 markings/sec, 145 secs
lola: 30792838 markings, 46343089 edges, 42888 markings/sec, 150 secs
lola: 31116664 markings, 46830321 edges, 64765 markings/sec, 155 secs
lola: 31447971 markings, 47328990 edges, 66261 markings/sec, 160 secs
lola: 31671221 markings, 47664919 edges, 44650 markings/sec, 165 secs
lola: 31864034 markings, 47955160 edges, 38563 markings/sec, 170 secs
lola: 32084550 markings, 48287052 edges, 44103 markings/sec, 175 secs
lola: 32570773 markings, 49018824 edges, 97245 markings/sec, 180 secs
lola: 32704332 markings, 49219676 edges, 26712 markings/sec, 185 secs
lola: 32899741 markings, 49513852 edges, 39082 markings/sec, 190 secs
lola: 33090493 markings, 49800892 edges, 38150 markings/sec, 195 secs
lola: 33341209 markings, 50178157 edges, 50143 markings/sec, 200 secs
lola: 33615925 markings, 50591695 edges, 54943 markings/sec, 205 secs
lola: 33842407 markings, 50932507 edges, 45296 markings/sec, 210 secs
lola: 34056810 markings, 51255092 edges, 42881 markings/sec, 215 secs
lola: 34307889 markings, 51632978 edges, 50216 markings/sec, 220 secs
lola: 34589916 markings, 52057620 edges, 56405 markings/sec, 225 secs
lola: 34901338 markings, 52526311 edges, 62284 markings/sec, 230 secs
lola: 35175088 markings, 52938210 edges, 54750 markings/sec, 235 secs
lola: 35413667 markings, 53297224 edges, 47716 markings/sec, 240 secs
lola: 35595379 markings, 53570745 edges, 36342 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (((p477 + 1 <= p54) R (X (G ((p20 <= 0))) R (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p477 + 1 <= p54) R (X (G ((p20 <= 0))) R (p20 <= 0))))
lola: processed formula length: 59
lola: 97 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: 1424223 markings, 2143362 edges, 284845 markings/sec, 0 secs
lola: 2810036 markings, 4229032 edges, 277163 markings/sec, 5 secs
lola: 4198517 markings, 6318714 edges, 277696 markings/sec, 10 secs
lola: 5532589 markings, 8326488 edges, 266814 markings/sec, 15 secs
lola: 6864450 markings, 10330871 edges, 266372 markings/sec, 20 secs
lola: 8182085 markings, 12313989 edges, 263527 markings/sec, 25 secs
lola: 9544017 markings, 14363643 edges, 272386 markings/sec, 30 secs
lola: 10864919 markings, 16351595 edges, 264180 markings/sec, 35 secs
lola: 12231408 markings, 18408160 edges, 273298 markings/sec, 40 secs
lola: 13565794 markings, 20416422 edges, 266877 markings/sec, 45 secs
lola: 14898283 markings, 22421848 edges, 266498 markings/sec, 50 secs
lola: 16215997 markings, 24405013 edges, 263543 markings/sec, 55 secs
lola: 17526845 markings, 26377791 edges, 262170 markings/sec, 60 secs
lola: 18834117 markings, 28345287 edges, 261454 markings/sec, 65 secs
lola: 20161629 markings, 30343193 edges, 265502 markings/sec, 70 secs
lola: 21491636 markings, 32344792 edges, 266001 markings/sec, 75 secs
lola: 22794846 markings, 34306173 edges, 260642 markings/sec, 80 secs
lola: 24116532 markings, 36295308 edges, 264337 markings/sec, 85 secs
lola: 24696864 markings, 37168713 edges, 116066 markings/sec, 90 secs
lola: 24975634 markings, 37589650 edges, 55754 markings/sec, 95 secs
lola: 25137144 markings, 37831328 edges, 32302 markings/sec, 100 secs
lola: 25294828 markings, 38068649 edges, 31537 markings/sec, 105 secs
lola: 25460711 markings, 38318303 edges, 33177 markings/sec, 110 secs
lola: 25770714 markings, 38784826 edges, 62001 markings/sec, 115 secs
lola: 25968034 markings, 39081779 edges, 39464 markings/sec, 120 secs
lola: 26215322 markings, 39453993 edges, 49458 markings/sec, 125 secs
lola: 26656993 markings, 40118682 edges, 88334 markings/sec, 130 secs
lola: 27242381 markings, 40999691 edges, 117078 markings/sec, 135 secs
lola: 27719082 markings, 41717104 edges, 95340 markings/sec, 140 secs
lola: 28031325 markings, 42187075 edges, 62449 markings/sec, 145 secs
lola: 28256416 markings, 42525834 edges, 45018 markings/sec, 150 secs
lola: 28561156 markings, 42984486 edges, 60948 markings/sec, 155 secs
lola: 28786671 markings, 43323890 edges, 45103 markings/sec, 160 secs
lola: 29005599 markings, 43653367 edges, 43786 markings/sec, 165 secs
lola: 29191767 markings, 43933528 edges, 37234 markings/sec, 170 secs
lola: 29445741 markings, 44315766 edges, 50795 markings/sec, 175 secs
lola: 29860287 markings, 44939606 edges, 82909 markings/sec, 180 secs
lola: 30192870 markings, 45440171 edges, 66517 markings/sec, 185 secs
lola: 30428679 markings, 45795073 edges, 47162 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p225 <= 2))) AND (p482 <= p212)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p225 <= 2))) AND (p482 <= p212)))
lola: processed formula length: 44
lola: 97 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: 1487187 markings, 2238143 edges, 297437 markings/sec, 0 secs
lola: 2936730 markings, 4419701 edges, 289909 markings/sec, 5 secs
lola: 4361058 markings, 6563313 edges, 284866 markings/sec, 10 secs
lola: 5749752 markings, 8653322 edges, 277739 markings/sec, 15 secs
lola: 7081493 markings, 10657579 edges, 266348 markings/sec, 20 secs
lola: 8438676 markings, 12700115 edges, 271437 markings/sec, 25 secs
lola: 9769801 markings, 14703469 edges, 266225 markings/sec, 30 secs
lola: 11098619 markings, 16703342 edges, 265764 markings/sec, 35 secs
lola: 12427551 markings, 18703392 edges, 265786 markings/sec, 40 secs
lola: 13774759 markings, 20730944 edges, 269442 markings/sec, 45 secs
lola: 15072227 markings, 22683634 edges, 259494 markings/sec, 50 secs
lola: 16427463 markings, 24723294 edges, 271047 markings/sec, 55 secs
lola: 17766967 markings, 26739192 edges, 267901 markings/sec, 60 secs
lola: 19077824 markings, 28712045 edges, 262171 markings/sec, 65 secs
lola: 20431214 markings, 30748876 edges, 270678 markings/sec, 70 secs
lola: 21756823 markings, 32743917 edges, 265122 markings/sec, 75 secs
lola: 23088589 markings, 34748256 edges, 266353 markings/sec, 80 secs
lola: 24393644 markings, 36712330 edges, 261011 markings/sec, 85 secs
lola: 24740641 markings, 37235377 edges, 69399 markings/sec, 90 secs
lola: 24887586 markings, 37455769 edges, 29389 markings/sec, 95 secs
lola: 25047387 markings, 37696254 edges, 31960 markings/sec, 100 secs
lola: 25247510 markings, 37997380 edges, 40025 markings/sec, 105 secs
lola: 25591809 markings, 38515566 edges, 68860 markings/sec, 110 secs
lola: 25833112 markings, 38878722 edges, 48261 markings/sec, 115 secs
lola: 26492646 markings, 39871328 edges, 131907 markings/sec, 120 secs
lola: 27103233 markings, 40790247 edges, 122117 markings/sec, 125 secs
lola: 27501391 markings, 41389491 edges, 79632 markings/sec, 130 secs
lola: 27733638 markings, 41739004 edges, 46449 markings/sec, 135 secs
lola: 28482109 markings, 42865489 edges, 149694 markings/sec, 140 secs
lola: 28917755 markings, 43521142 edges, 87129 markings/sec, 145 secs
lola: 29360575 markings, 44187577 edges, 88564 markings/sec, 150 secs
lola: 30098605 markings, 45298315 edges, 147606 markings/sec, 155 secs
lola: 30437356 markings, 45808165 edges, 67750 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p125 <= p2)) OR G ((3 <= p244)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p125 <= p2)) OR G ((3 <= p244)))))
lola: processed formula length: 45
lola: 97 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: 1443500 markings, 2172406 edges, 288700 markings/sec, 0 secs
lola: 2811634 markings, 4231449 edges, 273627 markings/sec, 5 secs
lola: 4175737 markings, 6284442 edges, 272821 markings/sec, 10 secs
lola: 5557732 markings, 8364263 edges, 276399 markings/sec, 15 secs
lola: 6882414 markings, 10357924 edges, 264936 markings/sec, 20 secs
lola: 8260192 markings, 12431566 edges, 275556 markings/sec, 25 secs
lola: 9630050 markings, 14493136 edges, 273972 markings/sec, 30 secs
lola: 10968538 markings, 16507541 edges, 267698 markings/sec, 35 secs
lola: 12313264 markings, 18531380 edges, 268945 markings/sec, 40 secs
lola: 13669124 markings, 20571976 edges, 271172 markings/sec, 45 secs
lola: 14984060 markings, 22550882 edges, 262987 markings/sec, 50 secs
lola: 16321809 markings, 24564302 edges, 267550 markings/sec, 55 secs
lola: 17659054 markings, 26576773 edges, 267449 markings/sec, 60 secs
lola: 18971759 markings, 28552416 edges, 262541 markings/sec, 65 secs
lola: 20269194 markings, 30505012 edges, 259487 markings/sec, 70 secs
lola: 21585683 markings, 32486374 edges, 263298 markings/sec, 75 secs
lola: 22884314 markings, 34440805 edges, 259726 markings/sec, 80 secs
lola: 24199343 markings, 36419933 edges, 263006 markings/sec, 85 secs
lola: 25027502 markings, 37666481 edges, 165632 markings/sec, 90 secs
lola: 25637612 markings, 38584935 edges, 122022 markings/sec, 95 secs
lola: 26491632 markings, 39869796 edges, 170804 markings/sec, 100 secs
lola: 27436490 markings, 41291829 edges, 188972 markings/sec, 105 secs
lola: 28355211 markings, 42674502 edges, 183744 markings/sec, 110 secs
lola: 29319283 markings, 44125470 edges, 192814 markings/sec, 115 secs
lola: 29875234 markings, 44962108 edges, 111190 markings/sec, 120 secs
lola: 30108827 markings, 45313665 edges, 46719 markings/sec, 125 secs
lola: 30517249 markings, 45928353 edges, 81684 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no unknown unknown unknown yes no unknown unknown no no unknown no no
lola:
preliminary result: unknown no unknown unknown unknown yes no unknown unknown no no unknown no no
lola: memory consumption: 3508 KB
lola: time consumption: 2718 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-100100"
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-100100, 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-158987938500113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 '
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 ;