Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700082.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 MAPK-PT-10240, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.2K Apr 8 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K Mar 24 05:37 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 MAPK-PT-10240-00
FORMULA_NAME MAPK-PT-10240-01
FORMULA_NAME MAPK-PT-10240-02
FORMULA_NAME MAPK-PT-10240-03
FORMULA_NAME MAPK-PT-10240-04
FORMULA_NAME MAPK-PT-10240-05
FORMULA_NAME MAPK-PT-10240-06
FORMULA_NAME MAPK-PT-10240-07
FORMULA_NAME MAPK-PT-10240-08
FORMULA_NAME MAPK-PT-10240-09
FORMULA_NAME MAPK-PT-10240-10
FORMULA_NAME MAPK-PT-10240-11
FORMULA_NAME MAPK-PT-10240-12
FORMULA_NAME MAPK-PT-10240-13
FORMULA_NAME MAPK-PT-10240-14
FORMULA_NAME MAPK-PT-10240-15

=== Now, execution of the tool begins

BK_START 1591129705775

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:28:27] [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]
[2020-06-02 20:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:28:28] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-06-02 20:28:28] [INFO ] Transformed 22 places.
[2020-06-02 20:28:28] [INFO ] Transformed 30 transitions.
[2020-06-02 20:28:28] [INFO ] Parsed PT model containing 22 places and 30 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102441 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=1528 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 20:28:28] [INFO ] Computed 7 place invariants in 4 ms
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 7 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:28] [INFO ] Added : 26 causal constraints over 6 iterations in 55 ms. Result :sat
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:28] [INFO ] Added : 25 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 11 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:28] [INFO ] Added : 26 causal constraints over 6 iterations in 28 ms. Result :sat
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:28] [INFO ] Added : 27 causal constraints over 7 iterations in 28 ms. Result :sat
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 7 iterations in 27 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 24 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 30 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 25 causal constraints over 6 iterations in 27 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 29 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 7 iterations in 25 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 6 iterations in 37 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 7 iterations in 34 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 26 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:30] [INFO ] Added : 25 causal constraints over 6 iterations in 122 ms. Result :sat
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:30] [INFO ] Added : 21 causal constraints over 5 iterations in 46 ms. Result :sat
[2020-06-02 20:28:30] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 20:28:30] [INFO ] Flatten gal took : 56 ms
FORMULA MAPK-PT-10240-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:30] [INFO ] Flatten gal took : 7 ms
[2020-06-02 20:28:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-02 20:28:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ MAPK-PT-10240 @ 3570 seconds

FORMULA MAPK-PT-10240-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2025
rslt: Output for LTLFireability @ MAPK-PT-10240

{
"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": "Tue Jun 2 20:28:31 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 8,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G ((X (G ((1 <= p1))) AND G ((1 <= p5)))) OR (F (G ((X (G ((1 <= p1))) AND G ((1 <= p5))))) AND F (G ((p13 <= 0))))))",
"processed_size": 121,
"rewrites": 68
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 41
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((p13 <= 0)) OR (X (F (((p13 <= 0) OR (p8 <= 0) OR (p10 <= 0)))) AND (p13 <= 0))))",
"processed_size": 90,
"rewrites": 68
},
"result":
{
"edges": 1,
"markings": 2,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "X (((p0 <= 0) R (((1 <= p6) AND (1 <= p9)) U (1 <= p0))))",
"processed_size": 57,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (((p12 <= 0) R F ((p19 <= 0)))) AND G ((X ((1 <= p18)) AND (1 <= p12)))))",
"processed_size": 79,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G (((p17 <= 0) AND (p4 <= 0)))))",
"processed_size": 38,
"rewrites": 68
},
"result":
{
"edges": 9,
"markings": 8,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"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": "X (X (F (((1 <= p12) OR ((1 <= p3) AND (1 <= p16))))))",
"processed_size": 55,
"rewrites": 68
},
"result":
{
"edges": 5121,
"markings": 5121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "((X ((1 <= p14)) U (1 <= p14)) U X (G (((1 <= p3) AND (1 <= p16)))))",
"processed_size": 68,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p3 <= 0) OR (p16 <= 0))))",
"processed_size": 64,
"rewrites": 68
},
"result":
{
"edges": 97295,
"markings": 66567,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 934
},
"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": "X ((F ((1 <= p0)) U (1 <= p4)))",
"processed_size": 31,
"rewrites": 68
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 934
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p14) U ((1 <= p2) AND (1 <= p16))) OR ((F (((1 <= p2) AND (1 <= p16))) AND (1 <= p12)) U ((1 <= p6) AND (1 <= p9))))))",
"processed_size": 132,
"rewrites": 68
},
"result":
{
"edges": 2562,
"markings": 2562,
"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": 1402
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2804
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p8 <= 0) OR (p10 <= 0)) U (F (((1 <= p8) AND (1 <= p10))) OR ((1 <= p10) AND (1 <= p16))))",
"processed_size": 94,
"rewrites": 68
},
"result":
{
"edges": 2564,
"markings": 2564,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": "G ((((p10 <= 0) OR (p16 <= 0)) R (p13 <= 0)))",
"processed_size": 46,
"rewrites": 68
},
"result":
{
"edges": 20487,
"markings": 20486,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3328,
"runtime": 1545.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G((X(G(**)) AND G(**))) OR (F(G((X(G(**)) AND G(**)))) AND F(G(*))))) : F((G(*) OR (X(F(*)) AND *))) : X((G(**) OR (G((F(**) AND (** OR **))) AND F(G(**))))) : X(G((X(G(**)) AND F(**)))) : (** OR (G((* R *)) AND F(**))) : X((* R (** U **))) : F((F((* R F(*))) AND G((X(**) AND **)))) : X(G(((X(**) AND *) R *))) : X(X(G(*))) : (X(X(F(**))) OR ((X(**) U **) U X(G(**)))) : (X((F(**) U **)) OR (G((G(*) OR (** OR **))) AND X(F(**)))) : G(F(((** U **) OR ((F(**) AND **) U **)))) : ((** U (F(**) OR **)) OR (** OR **))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no yes no unknown no no no unknown no no no no no ",
"value": "no yes no unknown no no no unknown no no no 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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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: G ((NOT(G (F ((1 <= p13)))) U G ((G (X ((1 <= p1))) AND G ((1 <= p5)))))) : NOT(G ((G (X (((1 <= p13) AND (1 <= p8) AND (1 <= p10)))) U (1 <= p13)))) : (X (G (((1 <= p12) U ((1 <= p7) AND (1 <= p15))))) U X (G ((1 <= p12)))) : G ((X (X (G (((p7 <= 0) OR (p8 <= 0))))) AND F (X ((1 <= p19))))) : (G (NOT((((1 <= p10) AND (1 <= p16)) U (1 <= p13)))) U ((1 <= p9) AND (1 <= p11))) : X (NOT(((1 <= p0) U NOT((((1 <= p6) AND (1 <= p9)) U (1 <= p0)))))) : F ((F (NOT(((1 <= p12) U G ((1 <= p19))))) AND G ((X ((1 <= p18)) AND (1 <= p12))))) : G (X (G (NOT(((NOT(X ((1 <= p17))) OR (p12 <= 0)) U ((1 <= p6) AND (1 <= p7))))))) : G (NOT(X (F (X (((1 <= p17) OR (1 <= p4))))))) : (X (F (X (((1 <= p12) OR ((1 <= p3) AND (1 <= p16)))))) OR ((X ((1 <= p14)) U (1 <= p14)) U X (G (((1 <= p3) AND (1 <= p16)))))) : (G (((NOT(F (((1 <= p7) AND (1 <= p8)))) OR (p3 <= 0)) OR (p16 <= 0))) U (F (X ((1 <= p0))) U X ((1 <= p4)))) : G (F ((((1 <= p14) U ((1 <= p2) AND (1 <= p16))) OR ((F (((1 <= p2) AND (1 <= p16))) AND (1 <= p12)) U ((1 <= p6) AND (1 <= p9)))))) : (((((p8 <= 0) OR (p10 <= 0)) U (F (((1 <= p8) AND (1 <= p10))) OR ((1 <= p10) AND (1 <= p16)))) OR ((1 <= p8) AND (1 <= p10))) OR ((1 <= p10) AND (1 <= p16)))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:431
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((X (G ((1 <= p1))) AND G ((1 <= p5)))) OR (F (G ((X (G ((1 <= p1))) AND G ((1 <= p5))))) AND F (G ((p13 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X (G ((1 <= p1))) AND G ((1 <= p5)))) OR (F (G ((X (G ((1 <= p1))) AND G ((1 <= p5))))) AND F (G ((p13 <= 0))))))
lola: processed formula length: 121
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 41 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p13 <= 0)) OR (X (F (((p13 <= 0) OR (p8 <= 0) OR (p10 <= 0)))) AND (p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p13 <= 0)) OR (X (F (((p13 <= 0) OR (p8 <= 0) OR (p10 <= 0)))) AND (p13 <= 0))))
lola: processed formula length: 90
lola: 68 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p12)) OR (G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15))))) AND F (G ((1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p12)) OR (G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15))))) AND F (G ((1 <= p12))))))
lola: processed formula length: 132
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G (((p7 <= 0) OR (p8 <= 0)))) AND F ((1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G (((p7 <= 0) OR (p8 <= 0)))) AND F ((1 <= p19)))))
lola: processed formula length: 62
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 2594349 markings, 4671799 edges, 518870 markings/sec, 0 secs
lola: 4813384 markings, 8666838 edges, 443807 markings/sec, 5 secs
lola: 6418404 markings, 11556531 edges, 321004 markings/sec, 10 secs
lola: 7960349 markings, 14333113 edges, 308389 markings/sec, 15 secs
lola: 9583905 markings, 17255577 edges, 324711 markings/sec, 20 secs
lola: 11043209 markings, 19881813 edges, 291861 markings/sec, 25 secs
lola: 12464463 markings, 22440741 edges, 284251 markings/sec, 30 secs
lola: 13951177 markings, 25118332 edges, 297343 markings/sec, 35 secs
lola: 15409740 markings, 27743672 edges, 291713 markings/sec, 40 secs
lola: 16813037 markings, 30269865 edges, 280659 markings/sec, 45 secs
lola: 18227323 markings, 32814245 edges, 282857 markings/sec, 50 secs
lola: 19633608 markings, 35348583 edges, 281257 markings/sec, 55 secs
lola: 21045344 markings, 37890142 edges, 282347 markings/sec, 60 secs
lola: 22408114 markings, 40340908 edges, 272554 markings/sec, 65 secs
lola: 23778218 markings, 42808410 edges, 274021 markings/sec, 70 secs
lola: 25166016 markings, 45306073 edges, 277560 markings/sec, 75 secs
lola: 26559442 markings, 47815090 edges, 278685 markings/sec, 80 secs
lola: 27943849 markings, 50305081 edges, 276881 markings/sec, 85 secs
lola: 29334122 markings, 52808158 edges, 278055 markings/sec, 90 secs
lola: 30698043 markings, 55265092 edges, 272784 markings/sec, 95 secs
lola: 32056328 markings, 57708177 edges, 271657 markings/sec, 100 secs
lola: 33415119 markings, 60154465 edges, 271758 markings/sec, 105 secs
lola: 34772027 markings, 62595977 edges, 271382 markings/sec, 110 secs
lola: 36108339 markings, 65002388 edges, 267262 markings/sec, 115 secs
lola: 37448174 markings, 67416138 edges, 267967 markings/sec, 120 secs
lola: 38773002 markings, 69800929 edges, 264966 markings/sec, 125 secs
lola: 40111090 markings, 72208966 edges, 267618 markings/sec, 130 secs
lola: 41430248 markings, 74584673 edges, 263832 markings/sec, 135 secs
lola: 42753656 markings, 76965108 edges, 264682 markings/sec, 140 secs
lola: 44080766 markings, 79355374 edges, 265422 markings/sec, 145 secs
lola: 45387312 markings, 81706171 edges, 261309 markings/sec, 150 secs
lola: 46672877 markings, 84020409 edges, 257113 markings/sec, 155 secs
lola: 47931152 markings, 86285130 edges, 251655 markings/sec, 160 secs
lola: 49055312 markings, 88308825 edges, 224832 markings/sec, 165 secs
lola: 50311382 markings, 90567688 edges, 251214 markings/sec, 170 secs
lola: 51606263 markings, 92903108 edges, 258976 markings/sec, 175 secs
lola: 52877138 markings, 95188542 edges, 254175 markings/sec, 180 secs
lola: 54167353 markings, 97513274 edges, 258043 markings/sec, 185 secs
lola: 55452629 markings, 99825036 edges, 257055 markings/sec, 190 secs
lola: 56728729 markings, 102122145 edges, 255220 markings/sec, 195 secs
lola: 58001147 markings, 104411690 edges, 254484 markings/sec, 200 secs
lola: 59285717 markings, 106726974 edges, 256914 markings/sec, 205 secs
lola: 60544456 markings, 108992443 edges, 251748 markings/sec, 210 secs
lola: 61778807 markings, 111210409 edges, 246870 markings/sec, 215 secs
lola: 63019146 markings, 113445861 edges, 248068 markings/sec, 220 secs
lola: 64273826 markings, 115704414 edges, 250936 markings/sec, 225 secs
lola: 65493085 markings, 117899781 edges, 243852 markings/sec, 230 secs
lola: 66704654 markings, 120080250 edges, 242314 markings/sec, 235 secs
lola: 67915985 markings, 122261417 edges, 242266 markings/sec, 240 secs
lola: 69126679 markings, 124439522 edges, 242139 markings/sec, 245 secs
lola: 70337130 markings, 126621041 edges, 242090 markings/sec, 250 secs
lola: 71606232 markings, 128902847 edges, 253820 markings/sec, 255 secs
lola: 72845864 markings, 131133704 edges, 247926 markings/sec, 260 secs
lola: 74086477 markings, 133366645 edges, 248123 markings/sec, 265 secs
lola: 75323062 markings, 135592209 edges, 247317 markings/sec, 270 secs
lola: 76554781 markings, 137809746 edges, 246344 markings/sec, 275 secs
lola: 77772764 markings, 140002238 edges, 243597 markings/sec, 280 secs
lola: 78980628 markings, 142179310 edges, 241573 markings/sec, 285 secs
lola: 80190995 markings, 144357996 edges, 242073 markings/sec, 290 secs
lola: 81405037 markings, 146540968 edges, 242808 markings/sec, 295 secs
lola: 82607961 markings, 148709082 edges, 240585 markings/sec, 300 secs
lola: 83839473 markings, 150923920 edges, 246302 markings/sec, 305 secs
lola: 84856630 markings, 152759166 edges, 203431 markings/sec, 310 secs
lola: 86109950 markings, 155014059 edges, 250664 markings/sec, 315 secs
lola: 87260411 markings, 157084597 edges, 230092 markings/sec, 320 secs
lola: 88324239 markings, 158995892 edges, 212766 markings/sec, 325 secs
lola: 89477032 markings, 161069940 edges, 230559 markings/sec, 330 secs
lola: 90589893 markings, 163075579 edges, 222572 markings/sec, 335 secs
lola: 91553813 markings, 164806544 edges, 192784 markings/sec, 340 secs
lola: 92680821 markings, 166839880 edges, 225402 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p0 <= 0) R (((1 <= p6) AND (1 <= p9)) U (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p0 <= 0) R (((1 <= p6) AND (1 <= p9)) U (1 <= p0))))
lola: processed formula length: 57
lola: 68 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p12 <= 0) R F ((p19 <= 0)))) AND G ((X ((1 <= p18)) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p12 <= 0) R F ((p19 <= 0)))) AND G ((X ((1 <= p18)) AND (1 <= p12)))))
lola: processed formula length: 79
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X ((1 <= p17)) AND (1 <= p12)) R ((p6 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X ((1 <= p17)) AND (1 <= p12)) R ((p6 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 69
lola: 68 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: 2749215 markings, 4950932 edges, 549843 markings/sec, 0 secs
lola: 5177650 markings, 9323947 edges, 485687 markings/sec, 5 secs
lola: 7411935 markings, 13345615 edges, 446857 markings/sec, 10 secs
lola: 9398354 markings, 16921015 edges, 397284 markings/sec, 15 secs
lola: 11060886 markings, 19914156 edges, 332506 markings/sec, 20 secs
lola: 12622370 markings, 22725216 edges, 312297 markings/sec, 25 secs
lola: 14124663 markings, 25430277 edges, 300459 markings/sec, 30 secs
lola: 15600336 markings, 28086705 edges, 295135 markings/sec, 35 secs
lola: 17026957 markings, 30654874 edges, 285324 markings/sec, 40 secs
lola: 18436918 markings, 33192102 edges, 281992 markings/sec, 45 secs
lola: 19822657 markings, 35685477 edges, 277148 markings/sec, 50 secs
lola: 21259121 markings, 38272575 edges, 287293 markings/sec, 55 secs
lola: 22643245 markings, 40763149 edges, 276825 markings/sec, 60 secs
lola: 24018997 markings, 43241894 edges, 275150 markings/sec, 65 secs
lola: 25342830 markings, 45624231 edges, 264767 markings/sec, 70 secs
lola: 26746266 markings, 48150752 edges, 280687 markings/sec, 75 secs
lola: 28093359 markings, 50576306 edges, 269419 markings/sec, 80 secs
lola: 29416751 markings, 52959224 edges, 264678 markings/sec, 85 secs
lola: 30706798 markings, 55279980 edges, 258009 markings/sec, 90 secs
lola: 32051426 markings, 57700570 edges, 268926 markings/sec, 95 secs
lola: 33393859 markings, 60116656 edges, 268487 markings/sec, 100 secs
lola: 34730047 markings, 62522879 edges, 267238 markings/sec, 105 secs
lola: 36086970 markings, 64965272 edges, 271385 markings/sec, 110 secs
lola: 37428693 markings, 67379669 edges, 268345 markings/sec, 115 secs
lola: 38749692 markings, 69757868 edges, 264200 markings/sec, 120 secs
lola: 40087522 markings, 72166702 edges, 267566 markings/sec, 125 secs
lola: 41399900 markings, 74528542 edges, 262476 markings/sec, 130 secs
lola: 42725635 markings, 76915950 edges, 265147 markings/sec, 135 secs
lola: 44025954 markings, 79256360 edges, 260064 markings/sec, 140 secs
lola: 45353829 markings, 81647558 edges, 265575 markings/sec, 145 secs
lola: 46668588 markings, 84010670 edges, 262952 markings/sec, 150 secs
lola: 47897887 markings, 86223256 edges, 245860 markings/sec, 155 secs
lola: 49182029 markings, 88535974 edges, 256828 markings/sec, 160 secs
lola: 50477109 markings, 90868174 edges, 259016 markings/sec, 165 secs
lola: 51770341 markings, 93198018 edges, 258646 markings/sec, 170 secs
lola: 52974574 markings, 95363879 edges, 240847 markings/sec, 175 secs
lola: 54276293 markings, 97708729 edges, 260344 markings/sec, 180 secs
lola: 55582152 markings, 100056453 edges, 261172 markings/sec, 185 secs
lola: 56882758 markings, 102398497 edges, 260121 markings/sec, 190 secs
lola: 58153127 markings, 104687369 edges, 254074 markings/sec, 195 secs
lola: 59367880 markings, 106874420 edges, 242951 markings/sec, 200 secs
lola: 60639571 markings, 109162319 edges, 254338 markings/sec, 205 secs
lola: 61901910 markings, 111437228 edges, 252468 markings/sec, 210 secs
lola: 63166854 markings, 113711529 edges, 252989 markings/sec, 215 secs
lola: 64317389 markings, 115785029 edges, 230107 markings/sec, 220 secs
lola: 65573633 markings, 118045530 edges, 251249 markings/sec, 225 secs
lola: 66839877 markings, 120323485 edges, 253249 markings/sec, 230 secs
lola: 68094470 markings, 122583118 edges, 250919 markings/sec, 235 secs
lola: 69325240 markings, 124800172 edges, 246154 markings/sec, 240 secs
lola: 70569750 markings, 127037444 edges, 248902 markings/sec, 245 secs
lola: 71839455 markings, 129322391 edges, 253941 markings/sec, 250 secs
lola: 73090348 markings, 131575246 edges, 250179 markings/sec, 255 secs
lola: 74308070 markings, 133763719 edges, 243544 markings/sec, 260 secs
lola: 75574775 markings, 136048545 edges, 253341 markings/sec, 265 secs
lola: 76828062 markings, 138301486 edges, 250657 markings/sec, 270 secs
lola: 78058556 markings, 140517213 edges, 246099 markings/sec, 275 secs
lola: 79302752 markings, 142758361 edges, 248839 markings/sec, 280 secs
lola: 80508343 markings, 144929015 edges, 241118 markings/sec, 285 secs
lola: 81734876 markings, 147133575 edges, 245307 markings/sec, 290 secs
lola: 82961726 markings, 149345130 edges, 245370 markings/sec, 295 secs
lola: 84167681 markings, 151515285 edges, 241191 markings/sec, 300 secs
lola: 85300323 markings, 153556755 edges, 226528 markings/sec, 305 secs
lola: 86305819 markings, 155366809 edges, 201099 markings/sec, 310 secs
lola: 87339671 markings, 157225076 edges, 206770 markings/sec, 315 secs
lola: 88474869 markings, 159269369 edges, 227040 markings/sec, 320 secs
lola: 89621208 markings, 161332584 edges, 229268 markings/sec, 325 secs
lola: 90720863 markings, 163315321 edges, 219931 markings/sec, 330 secs
lola: 91768431 markings, 165193642 edges, 209514 markings/sec, 335 secs
lola: 92877439 markings, 167191702 edges, 221802 markings/sec, 340 secs
lola: 94010609 markings, 169230790 edges, 226634 markings/sec, 345 secs
lola: 95115038 markings, 171222101 edges, 220886 markings/sec, 350 secs
lola: 96156229 markings, 173094950 edges, 208238 markings/sec, 355 secs
lola: 97250350 markings, 175064784 edges, 218824 markings/sec, 360 secs
lola: 98222475 markings, 176815119 edges, 194425 markings/sec, 365 secs
lola: 99260662 markings, 178686467 edges, 207637 markings/sec, 370 secs
lola: 100177417 markings, 180329270 edges, 183351 markings/sec, 375 secs
lola: 101073736 markings, 181943272 edges, 179264 markings/sec, 380 secs
lola: 102152878 markings, 183888026 edges, 215828 markings/sec, 385 secs
lola: 103273469 markings, 185908081 edges, 224118 markings/sec, 390 secs
lola: 104235252 markings, 187637792 edges, 192357 markings/sec, 395 secs
lola: 105265817 markings, 189494398 edges, 206113 markings/sec, 400 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p17 <= 0) AND (p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p17 <= 0) AND (p4 <= 0)))))
lola: processed formula length: 38
lola: 68 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p12) OR ((1 <= p3) AND (1 <= p16)))))) OR ((X ((1 <= p14)) U (1 <= p14)) U X (G (((1 <= p3) AND (1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p12) OR ((1 <= p3) AND (1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p12) OR ((1 <= p3) AND (1 <= p16))))))
lola: processed formula length: 55
lola: 68 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: 5121 markings, 5121 edges
lola: ========================================
lola: subprocess 9 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((1 <= p14)) U (1 <= p14)) U X (G (((1 <= p3) AND (1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((1 <= p14)) U (1 <= p14)) U X (G (((1 <= p3) AND (1 <= p16)))))
lola: processed formula length: 68
lola: 68 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: 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((1 <= p0)) U (1 <= p4))) OR (G ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p3 <= 0) OR (p16 <= 0)))) AND X (F ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p3 <= 0) OR (p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p3 <= 0) OR (p16 <= 0))))
lola: processed formula length: 64
lola: 68 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: 66567 markings, 97295 edges
lola: ========================================
lola: subprocess 10 will run for 934 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p0)) U (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p0)) U (1 <= p4)))
lola: processed formula length: 31
lola: 68 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 934 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p14) U ((1 <= p2) AND (1 <= p16))) OR ((F (((1 <= p2) AND (1 <= p16))) AND (1 <= p12)) U ((1 <= p6) AND (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p14) U ((1 <= p2) AND (1 <= p16))) OR ((F (((1 <= p2) AND (1 <= p16))) AND (1 <= p12)) U ((1 <= p6) AND (1 <= p9))))))
lola: processed formula length: 132
lola: 68 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: 2562 markings, 2562 edges
lola: ========================================
lola: subprocess 11 will run for 1402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p8 <= 0) OR (p10 <= 0)) U (F (((1 <= p8) AND (1 <= p10))) OR ((1 <= p10) AND (1 <= p16)))) OR (((1 <= p8) AND (1 <= p10)) OR ((1 <= p10) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) AND (1 <= p10)) OR ((1 <= p10) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p8) AND (1 <= p10)) OR ((1 <= p10) AND (1 <= p16)))
lola: processed formula length: 59
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 2804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p8 <= 0) OR (p10 <= 0)) U (F (((1 <= p8) AND (1 <= p10))) OR ((1 <= p10) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p8 <= 0) OR (p10 <= 0)) U (F (((1 <= p8) AND (1 <= p10))) OR ((1 <= p10) AND (1 <= p16))))
lola: processed formula length: 94
lola: 68 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: 2564 markings, 2564 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 2804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p9) AND (1 <= p11)) OR (G ((((p10 <= 0) OR (p16 <= 0)) R (p13 <= 0))) AND F (((1 <= p9) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p9) AND (1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p9) AND (1 <= p11))
lola: processed formula length: 26
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p10 <= 0) OR (p16 <= 0)) R (p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p10 <= 0) OR (p16 <= 0)) R (p13 <= 0)))
lola: processed formula length: 46
lola: 68 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: 20486 markings, 20487 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (G (((p7 <= 0) OR (p8 <= 0)))) AND F ((1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G (((p7 <= 0) OR (p8 <= 0)))) AND F ((1 <= p19)))))
lola: processed formula length: 62
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 2830498 markings, 5097587 edges, 566100 markings/sec, 0 secs
lola: 5307970 markings, 9557350 edges, 495494 markings/sec, 5 secs
lola: 7502988 markings, 13509040 edges, 439004 markings/sec, 10 secs
lola: 9408692 markings, 16940499 edges, 381141 markings/sec, 15 secs
lola: 11169587 markings, 20111338 edges, 352179 markings/sec, 20 secs
lola: 12786256 markings, 23019432 edges, 323334 markings/sec, 25 secs
lola: 14443952 markings, 26005808 edges, 331539 markings/sec, 30 secs
lola: 15936175 markings, 28690157 edges, 298445 markings/sec, 35 secs
lola: 17391212 markings, 31309808 edges, 291007 markings/sec, 40 secs
lola: 18835192 markings, 33909155 edges, 288796 markings/sec, 45 secs
lola: 20264212 markings, 36481515 edges, 285804 markings/sec, 50 secs
lola: 21660702 markings, 38996530 edges, 279298 markings/sec, 55 secs
lola: 23053206 markings, 41502534 edges, 278501 markings/sec, 60 secs
lola: 24451267 markings, 44020336 edges, 279612 markings/sec, 65 secs
lola: 25822504 markings, 46488661 edges, 274247 markings/sec, 70 secs
lola: 27193393 markings, 48953442 edges, 274178 markings/sec, 75 secs
lola: 28530310 markings, 51362866 edges, 267383 markings/sec, 80 secs
lola: 29894773 markings, 53818486 edges, 272893 markings/sec, 85 secs
lola: 31183167 markings, 56136822 edges, 257679 markings/sec, 90 secs
lola: 32527122 markings, 58558584 edges, 268791 markings/sec, 95 secs
lola: 33856986 markings, 60951009 edges, 265973 markings/sec, 100 secs
lola: 35297399 markings, 63543133 edges, 288083 markings/sec, 105 secs
lola: 36659688 markings, 65996953 edges, 272458 markings/sec, 110 secs
lola: 38006877 markings, 68419501 edges, 269438 markings/sec, 115 secs
lola: 39361728 markings, 70861055 edges, 270970 markings/sec, 120 secs
lola: 40707826 markings, 73282841 edges, 269220 markings/sec, 125 secs
lola: 42058932 markings, 75713768 edges, 270221 markings/sec, 130 secs
lola: 43397376 markings, 78122035 edges, 267689 markings/sec, 135 secs
lola: 44739354 markings, 80538790 edges, 268396 markings/sec, 140 secs
lola: 46078931 markings, 82952720 edges, 267915 markings/sec, 145 secs
lola: 47399216 markings, 85327441 edges, 264057 markings/sec, 150 secs
lola: 48731405 markings, 87725342 edges, 266438 markings/sec, 155 secs
lola: 50062336 markings, 90121897 edges, 266186 markings/sec, 160 secs
lola: 51430765 markings, 92586282 edges, 273686 markings/sec, 165 secs
lola: 52794872 markings, 95041779 edges, 272821 markings/sec, 170 secs
lola: 54125617 markings, 97435413 edges, 266149 markings/sec, 175 secs
lola: 55484389 markings, 99883006 edges, 271754 markings/sec, 180 secs
lola: 56820532 markings, 102285366 edges, 267229 markings/sec, 185 secs
lola: 58172272 markings, 104719870 edges, 270348 markings/sec, 190 secs
lola: 59497112 markings, 107107251 edges, 264968 markings/sec, 195 secs
lola: 60833927 markings, 109509124 edges, 267363 markings/sec, 200 secs
lola: 62161698 markings, 111901311 edges, 265554 markings/sec, 205 secs
lola: 63485775 markings, 114283820 edges, 264815 markings/sec, 210 secs
lola: 64809909 markings, 116668066 edges, 264827 markings/sec, 215 secs
lola: 66112623 markings, 119012944 edges, 260543 markings/sec, 220 secs
lola: 67375950 markings, 121288413 edges, 252665 markings/sec, 225 secs
lola: 68682420 markings, 123638851 edges, 261294 markings/sec, 230 secs
lola: 69981766 markings, 125978427 edges, 259869 markings/sec, 235 secs
lola: 71274140 markings, 128307213 edges, 258475 markings/sec, 240 secs
lola: 72556888 markings, 130615841 edges, 256550 markings/sec, 245 secs
lola: 73857947 markings, 132957973 edges, 260212 markings/sec, 250 secs
lola: 75118810 markings, 135224099 edges, 252173 markings/sec, 255 secs
lola: 76370508 markings, 137480061 edges, 250340 markings/sec, 260 secs
lola: 77621584 markings, 139727961 edges, 250215 markings/sec, 265 secs
lola: 78878443 markings, 141993679 edges, 251372 markings/sec, 270 secs
lola: 80164779 markings, 144306119 edges, 257267 markings/sec, 275 secs
lola: 81454258 markings, 146630908 edges, 257896 markings/sec, 280 secs
lola: 82740782 markings, 148945158 edges, 257305 markings/sec, 285 secs
lola: 84015394 markings, 151240870 edges, 254922 markings/sec, 290 secs
lola: 85238027 markings, 153442872 edges, 244527 markings/sec, 295 secs
lola: 86449424 markings, 155620935 edges, 242279 markings/sec, 300 secs
lola: 87659804 markings, 157797656 edges, 242076 markings/sec, 305 secs
lola: 88815518 markings, 159884789 edges, 231143 markings/sec, 310 secs
lola: 89997378 markings, 162011893 edges, 236372 markings/sec, 315 secs
lola: 91180281 markings, 164139046 edges, 236581 markings/sec, 320 secs
lola: 92332434 markings, 166210912 edges, 230431 markings/sec, 325 secs
lola: 93486767 markings, 168287802 edges, 230867 markings/sec, 330 secs
lola: 94628884 markings, 170347175 edges, 228423 markings/sec, 335 secs
lola: 95747596 markings, 172358385 edges, 223742 markings/sec, 340 secs
lola: 96913153 markings, 174460498 edges, 233111 markings/sec, 345 secs
lola: 98066176 markings, 176534925 edges, 230605 markings/sec, 350 secs
lola: 99226678 markings, 178623845 edges, 232100 markings/sec, 355 secs
lola: 100390802 markings, 180717365 edges, 232825 markings/sec, 360 secs
lola: 101528048 markings, 182764315 edges, 227449 markings/sec, 365 secs
lola: 102649939 markings, 184783524 edges, 224378 markings/sec, 370 secs
lola: 103631412 markings, 186555357 edges, 196295 markings/sec, 375 secs
lola: 104716977 markings, 188507571 edges, 217113 markings/sec, 380 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G (((X ((1 <= p17)) AND (1 <= p12)) R ((p6 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X ((1 <= p17)) AND (1 <= p12)) R ((p6 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 69
lola: 68 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: 2759862 markings, 4969901 edges, 551972 markings/sec, 0 secs
lola: 5445785 markings, 9806556 edges, 537185 markings/sec, 5 secs
lola: 7930062 markings, 14278440 edges, 496855 markings/sec, 10 secs
lola: 10003970 markings, 18011438 edges, 414782 markings/sec, 15 secs
lola: 11904422 markings, 21432431 edges, 380090 markings/sec, 20 secs
lola: 13581135 markings, 24449679 edges, 335343 markings/sec, 25 secs
lola: 15243312 markings, 27442598 edges, 332435 markings/sec, 30 secs
lola: 16780692 markings, 30210645 edges, 307476 markings/sec, 35 secs
lola: 18277282 markings, 32904545 edges, 299318 markings/sec, 40 secs
lola: 19793395 markings, 35635768 edges, 303223 markings/sec, 45 secs
lola: 21296510 markings, 38341006 edges, 300623 markings/sec, 50 secs
lola: 22718442 markings, 40901961 edges, 284386 markings/sec, 55 secs
lola: 24155616 markings, 43486611 edges, 287435 markings/sec, 60 secs
lola: 25545764 markings, 45989431 edges, 278030 markings/sec, 65 secs
lola: 26939339 markings, 48498091 edges, 278715 markings/sec, 70 secs
lola: 28319864 markings, 50982459 edges, 276105 markings/sec, 75 secs
lola: 29690042 markings, 53450775 edges, 274036 markings/sec, 80 secs
lola: 31078691 markings, 55948273 edges, 277730 markings/sec, 85 secs
lola: 32452014 markings, 58423761 edges, 274665 markings/sec, 90 secs
lola: 33817064 markings, 60880451 edges, 273010 markings/sec, 95 secs
lola: 35167680 markings, 63308036 edges, 270123 markings/sec, 100 secs
lola: 36531538 markings, 65764472 edges, 272772 markings/sec, 105 secs
lola: 37890939 markings, 68212465 edges, 271880 markings/sec, 110 secs
lola: 39233747 markings, 70630140 edges, 268562 markings/sec, 115 secs
lola: 40530138 markings, 72960807 edges, 259278 markings/sec, 120 secs
lola: 41875850 markings, 75385137 edges, 269142 markings/sec, 125 secs
lola: 43217669 markings, 77800548 edges, 268364 markings/sec, 130 secs
lola: 44547356 markings, 80194210 edges, 265937 markings/sec, 135 secs
lola: 45867059 markings, 82571381 edges, 263941 markings/sec, 140 secs
lola: 47189435 markings, 84948273 edges, 264475 markings/sec, 145 secs
lola: 48508566 markings, 87326355 edges, 263826 markings/sec, 150 secs
lola: 49807733 markings, 89664338 edges, 259833 markings/sec, 155 secs
lola: 51115198 markings, 92017541 edges, 261493 markings/sec, 160 secs
lola: 52407033 markings, 94342370 edges, 258367 markings/sec, 165 secs
lola: 53706454 markings, 96683710 edges, 259884 markings/sec, 170 secs
lola: 54973828 markings, 98963868 edges, 253475 markings/sec, 175 secs
lola: 56270945 markings, 101299273 edges, 259423 markings/sec, 180 secs
lola: 57592173 markings, 103675889 edges, 264246 markings/sec, 185 secs
lola: 58868059 markings, 105972242 edges, 255177 markings/sec, 190 secs
lola: 60148800 markings, 108280787 edges, 256148 markings/sec, 195 secs
lola: 61401773 markings, 110533718 edges, 250595 markings/sec, 200 secs
lola: 62666639 markings, 112810723 edges, 252973 markings/sec, 205 secs
lola: 63997171 markings, 115209068 edges, 266106 markings/sec, 210 secs
lola: 65326759 markings, 117603257 edges, 265918 markings/sec, 215 secs
lola: 66651428 markings, 119981569 edges, 264934 markings/sec, 220 secs
lola: 67982953 markings, 122381356 edges, 266305 markings/sec, 225 secs
lola: 69303190 markings, 124756811 edges, 264047 markings/sec, 230 secs
lola: 70633518 markings, 127153890 edges, 266066 markings/sec, 235 secs
lola: 71961211 markings, 129543150 edges, 265539 markings/sec, 240 secs
lola: 73285398 markings, 131926517 edges, 264837 markings/sec, 245 secs
lola: 74605440 markings, 134303551 edges, 264008 markings/sec, 250 secs
lola: 75932906 markings, 136690885 edges, 265493 markings/sec, 255 secs
lola: 77233686 markings, 139032920 edges, 260156 markings/sec, 260 secs
lola: 78534515 markings, 141375295 edges, 260166 markings/sec, 265 secs
lola: 79852238 markings, 143744619 edges, 263545 markings/sec, 270 secs
lola: 81132962 markings, 146052222 edges, 256145 markings/sec, 275 secs
lola: 82425859 markings, 148380037 edges, 258579 markings/sec, 280 secs
lola: 83699043 markings, 150672791 edges, 254637 markings/sec, 285 secs
lola: 84921603 markings, 152873224 edges, 244512 markings/sec, 290 secs
lola: 85995629 markings, 154805669 edges, 214805 markings/sec, 295 secs
lola: 87137315 markings, 156863973 edges, 228337 markings/sec, 300 secs
lola: 88221392 markings, 158811569 edges, 216815 markings/sec, 305 secs
lola: 89387601 markings, 160911128 edges, 233242 markings/sec, 310 secs
lola: 90574377 markings, 163046172 edges, 237355 markings/sec, 315 secs
lola: 91736466 markings, 165140580 edges, 232418 markings/sec, 320 secs
lola: 92907468 markings, 167250645 edges, 234200 markings/sec, 325 secs
lola: 94082380 markings, 169363856 edges, 234982 markings/sec, 330 secs
lola: 95243602 markings, 171452121 edges, 232244 markings/sec, 335 secs
lola: 96376612 markings, 173492845 edges, 226602 markings/sec, 340 secs
lola: 97547117 markings, 175597587 edges, 234101 markings/sec, 345 secs
lola: 98725436 markings, 177721481 edges, 235664 markings/sec, 350 secs
lola: 99895068 markings, 179827104 edges, 233926 markings/sec, 355 secs
lola: 101032660 markings, 181872326 edges, 227518 markings/sec, 360 secs
lola: 102095690 markings, 183788091 edges, 212606 markings/sec, 365 secs
lola: 103217662 markings, 185806259 edges, 224394 markings/sec, 370 secs
lola: 104366344 markings, 187875191 edges, 229736 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no unknown no no no unknown no no no no no
lola:
preliminary result: no yes no unknown no no no unknown no no no no no
lola: memory consumption: 3328 KB
lola: time consumption: 1545 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="MAPK-PT-10240"
export BK_EXAMINATION="LTLFireability"
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 MAPK-PT-10240, 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 r174-csrt-158987852700082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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