Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432900342.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is RefineWMG-PT-050051, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 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-050051-00
FORMULA_NAME RefineWMG-PT-050051-01
FORMULA_NAME RefineWMG-PT-050051-02
FORMULA_NAME RefineWMG-PT-050051-03
FORMULA_NAME RefineWMG-PT-050051-04
FORMULA_NAME RefineWMG-PT-050051-05
FORMULA_NAME RefineWMG-PT-050051-06
FORMULA_NAME RefineWMG-PT-050051-07
FORMULA_NAME RefineWMG-PT-050051-08
FORMULA_NAME RefineWMG-PT-050051-09
FORMULA_NAME RefineWMG-PT-050051-10
FORMULA_NAME RefineWMG-PT-050051-11
FORMULA_NAME RefineWMG-PT-050051-12
FORMULA_NAME RefineWMG-PT-050051-13
FORMULA_NAME RefineWMG-PT-050051-14
FORMULA_NAME RefineWMG-PT-050051-15

=== Now, execution of the tool begins

BK_START 1621429392830

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:03:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 13:03:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:03:15] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-19 13:03:15] [INFO ] Transformed 254 places.
[2021-05-19 13:03:15] [INFO ] Transformed 203 transitions.
[2021-05-19 13:03:15] [INFO ] Parsed PT model containing 254 places and 203 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 208 ms. (steps per millisecond=480 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1]
// Phase 1: matrix 203 rows 254 cols
[2021-05-19 13:03:15] [INFO ] Computed 102 place invariants in 7 ms
[2021-05-19 13:03:15] [INFO ] [Real]Absence check using 102 positive place invariants in 91 ms returned sat
[2021-05-19 13:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:15] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-19 13:03:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:16] [INFO ] [Nat]Absence check using 102 positive place invariants in 350 ms returned sat
[2021-05-19 13:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:17] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2021-05-19 13:03:17] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 34 ms.
[2021-05-19 13:03:18] [INFO ] Added : 48 causal constraints over 10 iterations in 366 ms. Result :sat
[2021-05-19 13:03:18] [INFO ] [Real]Absence check using 102 positive place invariants in 50 ms returned sat
[2021-05-19 13:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:18] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2021-05-19 13:03:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:18] [INFO ] [Nat]Absence check using 102 positive place invariants in 82 ms returned sat
[2021-05-19 13:03:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:18] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-19 13:03:18] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2021-05-19 13:03:19] [INFO ] Added : 73 causal constraints over 15 iterations in 202 ms. Result :sat
[2021-05-19 13:03:19] [INFO ] [Real]Absence check using 102 positive place invariants in 62 ms returned sat
[2021-05-19 13:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:19] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-19 13:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 28 ms returned sat
[2021-05-19 13:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:19] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-19 13:03:19] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 26 ms.
[2021-05-19 13:03:19] [INFO ] Added : 91 causal constraints over 19 iterations in 309 ms. Result :sat
[2021-05-19 13:03:20] [INFO ] [Real]Absence check using 102 positive place invariants in 37 ms returned sat
[2021-05-19 13:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:20] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2021-05-19 13:03:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 60 ms returned sat
[2021-05-19 13:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:20] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2021-05-19 13:03:20] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 21 ms.
[2021-05-19 13:03:20] [INFO ] Added : 44 causal constraints over 9 iterations in 144 ms. Result :sat
[2021-05-19 13:03:20] [INFO ] [Real]Absence check using 102 positive place invariants in 27 ms returned sat
[2021-05-19 13:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:21] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-19 13:03:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:21] [INFO ] [Nat]Absence check using 102 positive place invariants in 34 ms returned sat
[2021-05-19 13:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:21] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-19 13:03:21] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:03:21] [INFO ] Added : 75 causal constraints over 15 iterations in 237 ms. Result :sat
[2021-05-19 13:03:21] [INFO ] [Real]Absence check using 102 positive place invariants in 40 ms returned sat
[2021-05-19 13:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:22] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-19 13:03:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:22] [INFO ] [Nat]Absence check using 102 positive place invariants in 33 ms returned sat
[2021-05-19 13:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:22] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-19 13:03:22] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 36 ms.
[2021-05-19 13:03:22] [INFO ] Added : 44 causal constraints over 9 iterations in 222 ms. Result :sat
[2021-05-19 13:03:22] [INFO ] [Real]Absence check using 102 positive place invariants in 42 ms returned sat
[2021-05-19 13:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:22] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-19 13:03:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:22] [INFO ] [Nat]Absence check using 102 positive place invariants in 34 ms returned sat
[2021-05-19 13:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:23] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-19 13:03:23] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 19 ms.
[2021-05-19 13:03:23] [INFO ] Added : 99 causal constraints over 20 iterations in 217 ms. Result :sat
[2021-05-19 13:03:23] [INFO ] [Real]Absence check using 102 positive place invariants in 60 ms returned sat
[2021-05-19 13:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:23] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-19 13:03:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:23] [INFO ] [Nat]Absence check using 102 positive place invariants in 50 ms returned sat
[2021-05-19 13:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:24] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2021-05-19 13:03:24] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:03:24] [INFO ] Added : 103 causal constraints over 21 iterations in 249 ms. Result :sat
[2021-05-19 13:03:24] [INFO ] [Real]Absence check using 102 positive place invariants in 46 ms returned sat
[2021-05-19 13:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:24] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-19 13:03:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:24] [INFO ] [Nat]Absence check using 102 positive place invariants in 162 ms returned sat
[2021-05-19 13:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:25] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2021-05-19 13:03:25] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2021-05-19 13:03:25] [INFO ] Added : 35 causal constraints over 7 iterations in 123 ms. Result :sat
[2021-05-19 13:03:25] [INFO ] [Real]Absence check using 102 positive place invariants in 62 ms returned sat
[2021-05-19 13:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:26] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-19 13:03:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 28 ms returned sat
[2021-05-19 13:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:26] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-19 13:03:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:03:26] [INFO ] Added : 43 causal constraints over 9 iterations in 115 ms. Result :sat
[2021-05-19 13:03:26] [INFO ] [Real]Absence check using 102 positive place invariants in 37 ms returned sat
[2021-05-19 13:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:26] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-19 13:03:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 28 ms returned sat
[2021-05-19 13:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:26] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-19 13:03:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 28 ms.
[2021-05-19 13:03:27] [INFO ] Added : 102 causal constraints over 21 iterations in 373 ms. Result :sat
[2021-05-19 13:03:27] [INFO ] [Real]Absence check using 102 positive place invariants in 47 ms returned sat
[2021-05-19 13:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:27] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-19 13:03:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 33 ms returned sat
[2021-05-19 13:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:27] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-19 13:03:27] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 33 ms.
[2021-05-19 13:03:28] [INFO ] Added : 60 causal constraints over 12 iterations in 215 ms. Result :sat
[2021-05-19 13:03:28] [INFO ] [Real]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:28] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-19 13:03:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 374 ms returned sat
[2021-05-19 13:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:29] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2021-05-19 13:03:29] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2021-05-19 13:03:29] [INFO ] Added : 29 causal constraints over 6 iterations in 100 ms. Result :sat
[2021-05-19 13:03:29] [INFO ] [Real]Absence check using 102 positive place invariants in 27 ms returned sat
[2021-05-19 13:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:29] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-19 13:03:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:29] [INFO ] [Nat]Absence check using 102 positive place invariants in 28 ms returned sat
[2021-05-19 13:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:29] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-19 13:03:29] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2021-05-19 13:03:29] [INFO ] Added : 44 causal constraints over 9 iterations in 166 ms. Result :sat
[2021-05-19 13:03:30] [INFO ] [Real]Absence check using 102 positive place invariants in 697 ms returned sat
[2021-05-19 13:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:30] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2021-05-19 13:03:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 529 ms returned sat
[2021-05-19 13:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:31] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2021-05-19 13:03:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2021-05-19 13:03:31] [INFO ] Added : 75 causal constraints over 15 iterations in 225 ms. Result :sat
[2021-05-19 13:03:32] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 13:03:32] [INFO ] Flatten gal took : 132 ms
FORMULA RefineWMG-PT-050051-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:03:32] [INFO ] Flatten gal took : 29 ms
[2021-05-19 13:03:32] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-19 13:03:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-050051 @ 3570 seconds

FORMULA RefineWMG-PT-050051-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-050051-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-050051-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-050051-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2564
rslt: Output for LTLFireability @ RefineWMG-PT-050051

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F (G ((F (((1 <= p221) AND (1 <= p222) AND (1 <= p224) AND (1 <= p103))) OR ((1 <= p221) AND (1 <= p222) AND (1 <= p224))))) AND (X ((1 <= p103)) U (1 <= p38))))",
"processed_size": 165,
"rewrites": 124
},
"result":
{
"edges": 54,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F ((G (((((1 <= p156) AND (1 <= p157) AND (1 <= p159)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND (1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR ((1 <= p211) AND (1 <= p212) AND (1 <= p214)))))",
"processed_size": 210,
"rewrites": 124
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 771
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (G ((1 <= p88))) OR (1 <= p22))))",
"processed_size": 42,
"rewrites": 124
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 7,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (((F (G ((p18 <= 0))) OR ((p91 <= 0) OR ((p92 <= 0) OR (p94 <= 0)))) AND (p142 <= 0)))",
"processed_size": 88,
"rewrites": 124
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3087
},
"child":
[

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p226) AND (1 <= p227) AND (1 <= p229))",
"processed_size": 45,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p200 <= 0)",
"processed_size": 11,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p137)))",
"processed_size": 19,
"rewrites": 124
},
"result":
{
"edges": 3095,
"markings": 1784,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p160) AND F ((1 <= p137))))",
"processed_size": 37,
"rewrites": 124
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3960,
"runtime": 1006.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) U X(**)) OR (G(**) AND (** AND (** AND **)))) : G((F(G((F(**) OR **))) AND (X(**) U **))) : X(G((F(*) AND ((G(*) R *) AND *)))) : F((G(F((G(*) OR (* OR (* OR *))))) AND F(**))) : G((X((* R *)) AND (F((G(*) OR X(*))) OR X(G(*))))) : X(F((G(**) OR **))) : G((* AND (F(G(*)) OR G(*)))) : F(((F(G(*)) OR (* OR (* OR *))) AND *)) : X(X((X(X(F((X(**) OR (G(*) AND X(F(**))))))) AND **))) : (** AND ((* R X((* R *))) OR **)) : (G(*) OR X(F((X(G(**)) OR *)))) : (G(F(**)) OR G((** AND F(**))))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "yes no unknown no unknown no no no no unknown yes no ",
"value": "yes no unknown no unknown no no no no unknown yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: ((F ((1 <= p248)) U X ((1 <= p232))) OR (((G ((1 <= p248)) AND (1 <= p140)) AND (1 <= p248)) AND (p188 <= 0))) : G ((F (G (X ((F (((1 <= p221) AND (1 <= p222) AND (1 <= p224) AND (1 <= p103))) OR ((1 <= p221) AND (1 <= p222) AND (1 <= p224)))))) AND (X ((1 <= p103)) U (1 <= p38)))) : NOT(F (((X (G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))) OR X ((F ((1 <= p165)) U ((1 <= p56) AND (1 <= p57) AND (1 <= p59))))) OR X (((1 <= p56) AND (1 <= p57) AND (1 <= p59)))))) : F ((NOT(F (X (G ((((F ((5 <= p4)) AND (1 <= p241)) AND (1 <= p242)) AND (1 <= p244)))))) AND F ((5 <= p4)))) : NOT(F ((G ((F ((1 <= p240)) AND X ((1 <= p168)))) U X (((1 <= p240) U (1 <= p78)))))) : X ((X (F (G (((((1 <= p156) AND (1 <= p157) AND (1 <= p159)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND (1 <= p156) AND (1 <= p157) AND (1 <= p159))))) OR F (((1 <= p211) AND (1 <= p212) AND (1 <= p214))))) : NOT(F ((F (G (F (((G ((1 <= p52)) AND (1 <= p188)) U ((1 <= p112) U (1 <= p165)))))) U (1 <= p220)))) : NOT(G (((((G (F ((1 <= p18))) AND (1 <= p91)) AND (1 <= p92)) AND (1 <= p94)) OR (1 <= p142)))) : X (X ((X (F (X ((NOT(F ((1 <= p62))) U X (((1 <= p176) AND (1 <= p177) AND (1 <= p179))))))) AND (1 <= p62)))) : ((p200 <= 0) AND (NOT((((1 <= p226) AND (1 <= p227) AND (1 <= p229)) U (X ((1 <= p178)) U X (((1 <= p141) AND (1 <= p142) AND (1 <= p144)))))) OR ((1 <= p226) AND (1 <= p227) AND (1 <= p229)))) : (NOT(F ((p228 <= 0))) OR NOT(G (X ((F (NOT(X ((1 <= p88)))) AND (p22 <= 0)))))) : (G ((1 <= p160)) U NOT(X (G (F (NOT(X (((1 <= p60) U G (F ((1 <= p137)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:356
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p248)) U X ((1 <= p232))) OR (G ((1 <= p248)) AND ((1 <= p140) AND ((1 <= p248) AND (p188 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p140) AND ((1 <= p248) AND (p188 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p140) AND (1 <= p248) AND (p188 <= 0))
lola: processed formula length: 45
lola: 127 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p248)) U X ((1 <= p232)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p248)) U X ((1 <= p232)))
lola: processed formula length: 35
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 103 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((F (((1 <= p221) AND (1 <= p222) AND (1 <= p224) AND (1 <= p103))) OR ((1 <= p221) AND (1 <= p222) AND (1 <= p224))))) AND (X ((1 <= p103)) U (1 <= p38))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((F (((1 <= p221) AND (1 <= p222) AND (1 <= p224) AND (1 <= p103))) OR ((1 <= p221) AND (1 <= p222) AND (1 <= p224))))) AND (X ((1 <= p103)) U (1 <= p38))))
lola: processed formula length: 165
lola: 124 rewrites
lola: closed formula file LTLFireability.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: add low 201
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 53 markings, 54 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p16) AND (1 <= p17) AND (1 <= p19))) AND ((G ((p165 <= 0)) R ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p16) AND (1 <= p17) AND (1 <= p19))) AND ((G ((p165 <= 0)) R ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))))))
lola: processed formula length: 172
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 1970608 markings, 2975196 edges, 394122 markings/sec, 0 secs
lola: 4049368 markings, 6113691 edges, 415752 markings/sec, 5 secs
lola: 6123680 markings, 9245480 edges, 414862 markings/sec, 10 secs
lola: 8223688 markings, 12416096 edges, 420002 markings/sec, 15 secs
lola: 9977806 markings, 15064464 edges, 350824 markings/sec, 20 secs
lola: 11721278 markings, 17696760 edges, 348694 markings/sec, 25 secs
lola: 13503200 markings, 20387147 edges, 356384 markings/sec, 30 secs
lola: 15394995 markings, 23243378 edges, 378359 markings/sec, 35 secs
lola: 17446089 markings, 26340150 edges, 410219 markings/sec, 40 secs
lola: 19275654 markings, 29102392 edges, 365913 markings/sec, 45 secs
lola: 21100840 markings, 31858075 edges, 365037 markings/sec, 50 secs
lola: 22864685 markings, 34521133 edges, 352769 markings/sec, 55 secs
lola: 24821352 markings, 37475319 edges, 391333 markings/sec, 60 secs
lola: 26815680 markings, 40486360 edges, 398866 markings/sec, 65 secs
lola: 28625955 markings, 43219525 edges, 362055 markings/sec, 70 secs
lola: 30565453 markings, 46147790 edges, 387900 markings/sec, 75 secs
lola: 32566786 markings, 49169424 edges, 400267 markings/sec, 80 secs
lola: 34579538 markings, 52208268 edges, 402550 markings/sec, 85 secs
lola: 36611075 markings, 55275474 edges, 406307 markings/sec, 90 secs
lola: 38642106 markings, 58341925 edges, 406206 markings/sec, 95 secs
lola: 40608148 markings, 61310296 edges, 393208 markings/sec, 100 secs
lola: 42418168 markings, 64043078 edges, 362004 markings/sec, 105 secs
lola: 43527155 markings, 65717491 edges, 221797 markings/sec, 110 secs
lola: 44632879 markings, 67387480 edges, 221145 markings/sec, 115 secs
lola: 46014374 markings, 69472627 edges, 276299 markings/sec, 120 secs
lola: 47325584 markings, 71452306 edges, 262242 markings/sec, 125 secs
lola: 48648883 markings, 73450222 edges, 264660 markings/sec, 130 secs
lola: 49876743 markings, 75304055 edges, 245572 markings/sec, 135 secs
lola: 50680625 markings, 76517731 edges, 160776 markings/sec, 140 secs
lola: 51720005 markings, 78087261 edges, 207876 markings/sec, 145 secs
lola: 52753433 markings, 79647254 edges, 206686 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p240 <= 0) R (p78 <= 0))) AND (F ((G ((p240 <= 0)) OR X ((p168 <= 0)))) OR X (G ((p78 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p240 <= 0) R (p78 <= 0))) AND (F ((G ((p240 <= 0)) OR X ((p168 <= 0)))) OR X (G ((p78 <= 0))))))
lola: processed formula length: 105
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 1906042 markings, 2877610 edges, 381208 markings/sec, 0 secs
lola: 4122265 markings, 6223705 edges, 443245 markings/sec, 5 secs
lola: 6273742 markings, 9471958 edges, 430295 markings/sec, 10 secs
lola: 8376283 markings, 12646447 edges, 420508 markings/sec, 15 secs
lola: 10466061 markings, 15801573 edges, 417956 markings/sec, 20 secs
lola: 12620038 markings, 19053679 edges, 430795 markings/sec, 25 secs
lola: 14639879 markings, 22103135 edges, 403968 markings/sec, 30 secs
lola: 16792398 markings, 25353114 edges, 430504 markings/sec, 35 secs
lola: 18819959 markings, 28414271 edges, 405512 markings/sec, 40 secs
lola: 20987232 markings, 31686416 edges, 433455 markings/sec, 45 secs
lola: 23174101 markings, 34988134 edges, 437374 markings/sec, 50 secs
lola: 25304213 markings, 38204243 edges, 426022 markings/sec, 55 secs
lola: 27422110 markings, 41401780 edges, 423579 markings/sec, 60 secs
lola: 29515610 markings, 44562635 edges, 418700 markings/sec, 65 secs
lola: 31652645 markings, 47789126 edges, 427407 markings/sec, 70 secs
lola: 33736373 markings, 50935136 edges, 416746 markings/sec, 75 secs
lola: 35843624 markings, 54116624 edges, 421450 markings/sec, 80 secs
lola: 37811075 markings, 57087131 edges, 393490 markings/sec, 85 secs
lola: 39881056 markings, 60212475 edges, 413996 markings/sec, 90 secs
lola: 41946477 markings, 63330801 edges, 413084 markings/sec, 95 secs
lola: 44013677 markings, 66451894 edges, 413440 markings/sec, 100 secs
lola: 46185270 markings, 69730560 edges, 434319 markings/sec, 105 secs
lola: 47704741 markings, 72024902 edges, 303894 markings/sec, 110 secs
lola: 48279553 markings, 72892934 edges, 114962 markings/sec, 115 secs
lola: 49456732 markings, 74670190 edges, 235436 markings/sec, 120 secs
lola: 50349482 markings, 76017636 edges, 178550 markings/sec, 125 secs
lola: 51802819 markings, 78211960 edges, 290667 markings/sec, 130 secs
lola: 53072883 markings, 80129492 edges, 254013 markings/sec, 135 secs
lola: 54252225 markings, 81910072 edges, 235868 markings/sec, 140 secs
lola: 55370911 markings, 83599488 edges, 223737 markings/sec, 145 secs
lola: 56945349 markings, 85976152 edges, 314888 markings/sec, 150 secs
lola: 58251762 markings, 87948545 edges, 261283 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((((1 <= p156) AND (1 <= p157) AND (1 <= p159)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND (1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR ((1 <= p211) AND (1 <= p212) AND (1 <= p214)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((((1 <= p156) AND (1 <= p157) AND (1 <= p159)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND (1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR ((1 <= p211) AND (1 <= p212) AND (1 <= p214)))))
lola: processed formula length: 210
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 5 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X (F ((X (((1 <= p176) AND (1 <= p177) AND (1 <= p179))) OR (G ((p62 <= 0)) AND X (F (((1 <= p176) AND (1 <= p177) AND (1 <= p179))))))))) AND (1 <= p62))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (F ((X (((1 <= p176) AND (1 <= p177) AND (1 <= p179))) OR (G ((p62 <= 0)) AND X (F (((1 <= p176) AND (1 <= p177) AND (1 <= p179))))))))) AND (1 <= p62))))
lola: processed formula length: 166
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 53 markings, 53 edges
lola: subprocess 6 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p200 <= 0) AND ((((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R X (((p178 <= 0) R ((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0))))) OR ((1 <= p226) AND (1 <= p227) AND (1 <= p229))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p226) AND (1 <= p227) AND (1 <= p229))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p226) AND (1 <= p227) AND (1 <= p229))
lola: processed formula length: 45
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p200 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p200 <= 0)
lola: processed formula length: 11
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R X (((p178 <= 0) R ((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R X (((p178 <= 0) R ((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))))
lola: processed formula length: 115
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 2021883 markings, 3052614 edges, 404377 markings/sec, 0 secs
lola: 4140411 markings, 6251124 edges, 423706 markings/sec, 5 secs
lola: 6282127 markings, 9484706 edges, 428343 markings/sec, 10 secs
lola: 8393007 markings, 12671742 edges, 422176 markings/sec, 15 secs
lola: 10456115 markings, 15786605 edges, 412622 markings/sec, 20 secs
lola: 12486595 markings, 18852252 edges, 406096 markings/sec, 25 secs
lola: 14506683 markings, 21902182 edges, 404018 markings/sec, 30 secs
lola: 16604881 markings, 25070065 edges, 419640 markings/sec, 35 secs
lola: 18725133 markings, 28271197 edges, 424050 markings/sec, 40 secs
lola: 20829799 markings, 31448839 edges, 420933 markings/sec, 45 secs
lola: 22925249 markings, 34612562 edges, 419090 markings/sec, 50 secs
lola: 24974651 markings, 37706771 edges, 409880 markings/sec, 55 secs
lola: 26990272 markings, 40749970 edges, 403124 markings/sec, 60 secs
lola: 29033876 markings, 43835420 edges, 408721 markings/sec, 65 secs
lola: 31160263 markings, 47045839 edges, 425277 markings/sec, 70 secs
lola: 33115510 markings, 49997856 edges, 391049 markings/sec, 75 secs
lola: 35038313 markings, 52900912 edges, 384561 markings/sec, 80 secs
lola: 36909842 markings, 55726564 edges, 374306 markings/sec, 85 secs
lola: 38850905 markings, 58657197 edges, 388213 markings/sec, 90 secs
lola: 40856906 markings, 61685858 edges, 401200 markings/sec, 95 secs
lola: 42680519 markings, 64439157 edges, 364723 markings/sec, 100 secs
lola: 43848272 markings, 66202477 edges, 233551 markings/sec, 105 secs
lola: 44723585 markings, 67541656 edges, 175063 markings/sec, 110 secs
lola: 46181845 markings, 69725670 edges, 291652 markings/sec, 115 secs
lola: 47041434 markings, 71023262 edges, 171918 markings/sec, 120 secs
lola: 48155303 markings, 72704982 edges, 222774 markings/sec, 125 secs
lola: 49390234 markings, 74569505 edges, 246986 markings/sec, 130 secs
lola: 50930768 markings, 76895399 edges, 308107 markings/sec, 135 secs
lola: 52040402 markings, 78570740 edges, 221927 markings/sec, 140 secs
lola: 53002670 markings, 80023568 edges, 192454 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p228)) OR X (F ((X (G ((1 <= p88))) OR (1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p228))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p228))
lola: processed formula length: 15
lola: 124 rewrites
lola: closed formula file LTLFireability.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 8 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G ((1 <= p88))) OR (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G ((1 <= p88))) OR (1 <= p22))))
lola: processed formula length: 42
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 52 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p220 <= 0) AND (F (G ((p165 <= 0))) OR G ((p220 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p220 <= 0) AND (F (G ((p165 <= 0))) OR G ((p220 <= 0)))))
lola: processed formula length: 62
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 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 129
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: 442 markings, 569 edges
lola: ========================================
lola: subprocess 9 will run for 1029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((G ((p4 <= 4)) OR ((p241 <= 0) OR ((p242 <= 0) OR (p244 <= 0)))))) AND F ((5 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((G ((p4 <= 4)) OR ((p241 <= 0) OR ((p242 <= 0) OR (p244 <= 0)))))) AND F ((5 <= p4))))
lola: processed formula length: 96
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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 10 will run for 1543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((F (G ((p18 <= 0))) OR ((p91 <= 0) OR ((p92 <= 0) OR (p94 <= 0)))) AND (p142 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((F (G ((p18 <= 0))) OR ((p91 <= 0) OR ((p92 <= 0) OR (p94 <= 0)))) AND (p142 <= 0)))
lola: processed formula length: 88
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 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 3087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p137))) OR G (((1 <= p160) AND F ((1 <= p137)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p137)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p137)))
lola: processed formula length: 19
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 1784 markings, 3095 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p16) AND (1 <= p17) AND (1 <= p19))) AND ((G ((p165 <= 0)) R ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p16) AND (1 <= p17) AND (1 <= p19))) AND ((G ((p165 <= 0)) R ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))))))
lola: processed formula length: 172
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 2033996 markings, 3070892 edges, 406799 markings/sec, 0 secs
lola: 4173474 markings, 6301066 edges, 427896 markings/sec, 5 secs
lola: 5884416 markings, 8884278 edges, 342188 markings/sec, 10 secs
lola: 7848005 markings, 11848887 edges, 392718 markings/sec, 15 secs
lola: 9919064 markings, 14975782 edges, 414212 markings/sec, 20 secs
lola: 11779226 markings, 17784285 edges, 372032 markings/sec, 25 secs
lola: 13620534 markings, 20564267 edges, 368262 markings/sec, 30 secs
lola: 15592805 markings, 23542026 edges, 394454 markings/sec, 35 secs
lola: 17456103 markings, 26355260 edges, 372660 markings/sec, 40 secs
lola: 19233836 markings, 29039243 edges, 355547 markings/sec, 45 secs
lola: 21118566 markings, 31884853 edges, 376946 markings/sec, 50 secs
lola: 23168711 markings, 34980155 edges, 410029 markings/sec, 55 secs
lola: 24950102 markings, 37669704 edges, 356278 markings/sec, 60 secs
lola: 26769529 markings, 40416700 edges, 363885 markings/sec, 65 secs
lola: 28534520 markings, 43081461 edges, 352998 markings/sec, 70 secs
lola: 30432053 markings, 45946397 edges, 379507 markings/sec, 75 secs
lola: 32265293 markings, 48714217 edges, 366648 markings/sec, 80 secs
lola: 34216182 markings, 51659672 edges, 390178 markings/sec, 85 secs
lola: 36109350 markings, 54517974 edges, 378634 markings/sec, 90 secs
lola: 37969461 markings, 57326411 edges, 372022 markings/sec, 95 secs
lola: 39940404 markings, 60302119 edges, 394189 markings/sec, 100 secs
lola: 41954219 markings, 63342611 edges, 402763 markings/sec, 105 secs
lola: 43421761 markings, 65559047 edges, 293508 markings/sec, 110 secs
lola: 44355088 markings, 66967760 edges, 186665 markings/sec, 115 secs
lola: 45533090 markings, 68746136 edges, 235600 markings/sec, 120 secs
lola: 46744013 markings, 70574226 edges, 242185 markings/sec, 125 secs
lola: 47687353 markings, 71998496 edges, 188668 markings/sec, 130 secs
lola: 48469654 markings, 73179593 edges, 156460 markings/sec, 135 secs
lola: 49352310 markings, 74512228 edges, 176531 markings/sec, 140 secs
lola: 50387467 markings, 76075140 edges, 207031 markings/sec, 145 secs
lola: 51354411 markings, 77535019 edges, 193389 markings/sec, 150 secs
lola: 52478567 markings, 79232271 edges, 224831 markings/sec, 155 secs
lola: 53099154 markings, 80169247 edges, 124117 markings/sec, 160 secs
lola: 53099233 markings, 80169353 edges, 16 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((X (((p240 <= 0) R (p78 <= 0))) AND (F ((G ((p240 <= 0)) OR X ((p168 <= 0)))) OR X (G ((p78 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p240 <= 0) R (p78 <= 0))) AND (F ((G ((p240 <= 0)) OR X ((p168 <= 0)))) OR X (G ((p78 <= 0))))))
lola: processed formula length: 105
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 1524938 markings, 2302259 edges, 304988 markings/sec, 0 secs
lola: 3326698 markings, 5022558 edges, 360352 markings/sec, 5 secs
lola: 5337657 markings, 8058723 edges, 402192 markings/sec, 10 secs
lola: 7228225 markings, 10912972 edges, 378114 markings/sec, 15 secs
lola: 9037598 markings, 13644863 edges, 361875 markings/sec, 20 secs
lola: 11061064 markings, 16699924 edges, 404693 markings/sec, 25 secs
lola: 13057231 markings, 19713691 edges, 399233 markings/sec, 30 secs
lola: 15011092 markings, 22663606 edges, 390772 markings/sec, 35 secs
lola: 16903580 markings, 25520984 edges, 378498 markings/sec, 40 secs
lola: 18813261 markings, 28404141 edges, 381936 markings/sec, 45 secs
lola: 20792599 markings, 31392544 edges, 395868 markings/sec, 50 secs
lola: 22834080 markings, 34474806 edges, 408296 markings/sec, 55 secs
lola: 24751842 markings, 37370217 edges, 383552 markings/sec, 60 secs
lola: 26707307 markings, 40322600 edges, 391093 markings/sec, 65 secs
lola: 28563495 markings, 43125075 edges, 371238 markings/sec, 70 secs
lola: 30653314 markings, 46280300 edges, 417964 markings/sec, 75 secs
lola: 32552025 markings, 49146936 edges, 379742 markings/sec, 80 secs
lola: 34424116 markings, 51973517 edges, 374418 markings/sec, 85 secs
lola: 36361368 markings, 54898434 edges, 387450 markings/sec, 90 secs
lola: 38433841 markings, 58027398 edges, 414495 markings/sec, 95 secs
lola: 40472286 markings, 61105107 edges, 407689 markings/sec, 100 secs
lola: 42525094 markings, 64204402 edges, 410562 markings/sec, 105 secs
lola: 44623247 markings, 67372222 edges, 419631 markings/sec, 110 secs
lola: 46762517 markings, 70602083 edges, 427854 markings/sec, 115 secs
lola: 47854357 markings, 72251034 edges, 218368 markings/sec, 120 secs
lola: 49297504 markings, 74434732 edges, 288629 markings/sec, 125 secs
lola: 50825063 markings, 76736074 edges, 305512 markings/sec, 130 secs
lola: 51806569 markings, 78217584 edges, 196301 markings/sec, 135 secs
lola: 52790301 markings, 79702823 edges, 196746 markings/sec, 140 secs
lola: 53896500 markings, 81373055 edges, 221240 markings/sec, 145 secs
lola: 54683311 markings, 82560928 edges, 157362 markings/sec, 150 secs
lola: 55928698 markings, 84441178 edges, 249077 markings/sec, 155 secs
lola: 56885578 markings, 85885843 edges, 191376 markings/sec, 160 secs
lola: 57248897 markings, 86434472 edges, 72664 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p200 <= 0) AND ((((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R X (((p178 <= 0) R ((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0))))) OR ((1 <= p226) AND (1 <= p227) AND (1 <= p229))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p226) AND (1 <= p227) AND (1 <= p229))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p226) AND (1 <= p227) AND (1 <= p229))
lola: processed formula length: 45
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p200 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p200 <= 0)
lola: processed formula length: 11
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R X (((p178 <= 0) R ((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R X (((p178 <= 0) R ((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))))
lola: processed formula length: 115
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 1751418 markings, 2644245 edges, 350284 markings/sec, 0 secs
lola: 3692526 markings, 5574943 edges, 388222 markings/sec, 5 secs
lola: 5734127 markings, 8657326 edges, 408320 markings/sec, 10 secs
lola: 7606255 markings, 11483886 edges, 374426 markings/sec, 15 secs
lola: 9445641 markings, 14260979 edges, 367877 markings/sec, 20 secs
lola: 11336560 markings, 17115920 edges, 378184 markings/sec, 25 secs
lola: 13103080 markings, 19783038 edges, 353304 markings/sec, 30 secs
lola: 14914207 markings, 22517488 edges, 362225 markings/sec, 35 secs
lola: 16742860 markings, 25278383 edges, 365731 markings/sec, 40 secs
lola: 18581826 markings, 28054871 edges, 367793 markings/sec, 45 secs
lola: 20383860 markings, 30775540 edges, 360407 markings/sec, 50 secs
lola: 22219729 markings, 33547377 edges, 367174 markings/sec, 55 secs
lola: 24049369 markings, 36309763 edges, 365928 markings/sec, 60 secs
lola: 25906449 markings, 39113602 edges, 371416 markings/sec, 65 secs
lola: 27682353 markings, 41794856 edges, 355181 markings/sec, 70 secs
lola: 29481637 markings, 44511439 edges, 359857 markings/sec, 75 secs
lola: 31409402 markings, 47421983 edges, 385553 markings/sec, 80 secs
lola: 33331096 markings, 50323346 edges, 384339 markings/sec, 85 secs
lola: 35095332 markings, 52986999 edges, 352847 markings/sec, 90 secs
lola: 36948990 markings, 55785638 edges, 370732 markings/sec, 95 secs
lola: 38727304 markings, 58470572 edges, 355663 markings/sec, 100 secs
lola: 40483471 markings, 61122066 edges, 351233 markings/sec, 105 secs
lola: 42248145 markings, 63786376 edges, 352935 markings/sec, 110 secs
lola: 43615518 markings, 65851268 edges, 273475 markings/sec, 115 secs
lola: 44684516 markings, 67465262 edges, 213800 markings/sec, 120 secs
lola: 46260514 markings, 69844340 edges, 315200 markings/sec, 125 secs
lola: 47468451 markings, 71667980 edges, 241587 markings/sec, 130 secs
lola: 48586386 markings, 73355846 edges, 223587 markings/sec, 135 secs
lola: 49713883 markings, 75058148 edges, 225499 markings/sec, 140 secs
lola: 50839368 markings, 76757414 edges, 225097 markings/sec, 145 secs
lola: 51869516 markings, 78312737 edges, 206030 markings/sec, 150 secs
lola: 52986902 markings, 79999756 edges, 223477 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p137))) OR G (((1 <= p160) AND F ((1 <= p137)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p137)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p137)))
lola: processed formula length: 19
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 1784 markings, 3095 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((1 <= p160) AND F ((1 <= p137))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p160) AND F ((1 <= p137))))
lola: processed formula length: 37
lola: 124 rewrites
lola: closed formula file LTLFireability.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: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no unknown no no no no unknown yes no
lola:
preliminary result: yes no unknown no unknown no no no no unknown yes no
lola: memory consumption: 3960 KB
lola: time consumption: 1006 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-050051"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is RefineWMG-PT-050051, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432900342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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