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.r194-csrt-159033390400738.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 EGFr-PT-02010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390400738
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.0K May 13 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 13 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 13 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 59K May 12 20:53 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 EGFr-PT-02010-00
FORMULA_NAME EGFr-PT-02010-01
FORMULA_NAME EGFr-PT-02010-02
FORMULA_NAME EGFr-PT-02010-03
FORMULA_NAME EGFr-PT-02010-04
FORMULA_NAME EGFr-PT-02010-05
FORMULA_NAME EGFr-PT-02010-06
FORMULA_NAME EGFr-PT-02010-07
FORMULA_NAME EGFr-PT-02010-08
FORMULA_NAME EGFr-PT-02010-09
FORMULA_NAME EGFr-PT-02010-10
FORMULA_NAME EGFr-PT-02010-11
FORMULA_NAME EGFr-PT-02010-12
FORMULA_NAME EGFr-PT-02010-13
FORMULA_NAME EGFr-PT-02010-14
FORMULA_NAME EGFr-PT-02010-15

=== Now, execution of the tool begins

BK_START 1591239598471

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:00:00] [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-04 03:00:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:00:00] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-06-04 03:00:00] [INFO ] Transformed 40 places.
[2020-06-04 03:00:00] [INFO ] Transformed 68 transitions.
[2020-06-04 03:00:00] [INFO ] Found NUPN structural information;
[2020-06-04 03:00:00] [INFO ] Parsed PT model containing 40 places and 68 transitions in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 4481 resets, run finished after 233 ms. (steps per millisecond=429 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
[2020-06-04 03:00:00] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2020-06-04 03:00:00] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-04 03:00:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-04 03:00:01] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-06-04 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2020-06-04 03:00:01] [INFO ] Deduced a trap composed of 2 places in 46 ms
[2020-06-04 03:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2020-06-04 03:00:01] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 6 ms.
[2020-06-04 03:00:01] [INFO ] Added : 27 causal constraints over 6 iterations in 59 ms. Result :sat
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-06-04 03:00:01] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 5 ms.
[2020-06-04 03:00:01] [INFO ] Added : 27 causal constraints over 6 iterations in 37 ms. Result :sat
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 20 positive place invariants in 104 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-06-04 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2020-06-04 03:00:01] [INFO ] Deduced a trap composed of 2 places in 13 ms
[2020-06-04 03:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2020-06-04 03:00:01] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-06-04 03:00:01] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :unsat
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:01] [INFO ] Deduced a trap composed of 2 places in 8 ms
[2020-06-04 03:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2020-06-04 03:00:01] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 5 ms.
[2020-06-04 03:00:01] [INFO ] Added : 27 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 7 ms.
[2020-06-04 03:00:02] [INFO ] Added : 26 causal constraints over 6 iterations in 43 ms. Result :sat
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-06-04 03:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 5 ms.
[2020-06-04 03:00:02] [INFO ] Added : 27 causal constraints over 6 iterations in 48 ms. Result :sat
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Deduced a trap composed of 2 places in 8 ms
[2020-06-04 03:00:02] [INFO ] Deduced a trap composed of 2 places in 7 ms
[2020-06-04 03:00:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 27 ms
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-06-04 03:00:02] [INFO ] Added : 28 causal constraints over 6 iterations in 34 ms. Result :sat
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-06-04 03:00:02] [INFO ] Added : 27 causal constraints over 6 iterations in 32 ms. Result :sat
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Deduced a trap composed of 2 places in 13 ms
[2020-06-04 03:00:02] [INFO ] Deduced a trap composed of 2 places in 11 ms
[2020-06-04 03:00:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 5 ms.
[2020-06-04 03:00:02] [INFO ] Added : 29 causal constraints over 6 iterations in 43 ms. Result :sat
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 2 ms.
[2020-06-04 03:00:02] [INFO ] Added : 27 causal constraints over 6 iterations in 42 ms. Result :sat
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-06-04 03:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:02] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-04 03:00:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:02] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-06-04 03:00:02] [INFO ] Added : 27 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-04 03:00:03] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 03:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-04 03:00:03] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:03] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-04 03:00:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:03] [INFO ] Deduced a trap composed of 2 places in 9 ms
[2020-06-04 03:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2020-06-04 03:00:03] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-06-04 03:00:03] [INFO ] Added : 27 causal constraints over 6 iterations in 43 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 03:00:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 03:00:03] [INFO ] Flatten gal took : 65 ms
FORMULA EGFr-PT-02010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:00:03] [INFO ] Applying decomposition
[2020-06-04 03:00:03] [INFO ] Flatten gal took : 11 ms
[2020-06-04 03:00:03] [INFO ] Decomposing Gal with order
[2020-06-04 03:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 03:00:03] [INFO ] Removed a total of 92 redundant transitions.
[2020-06-04 03:00:03] [INFO ] Flatten gal took : 52 ms
[2020-06-04 03:00:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-06-04 03:00:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-04 03:00:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ EGFr-PT-02010 @ 3570 seconds

FORMULA EGFr-PT-02010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ EGFr-PT-02010

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 03:00:03 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((X (X (G ((((1 <= p31) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p17)))))) OR (((p23 <= 0)) OR (((p30 <= 0)) OR ((1 <= p14) AND (1 <= p17)))))))",
"processed_size": 150,
"rewrites": 82
},
"result":
{
"edges": 48639,
"markings": 7124,
"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": 0,
"U": 0,
"X": 5,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"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": 6,
"visible_transitions": 0
},
"processed": "X (F ((X (X (X (F ((X (((1 <= p14) AND (1 <= p19))) OR ((1 <= p6) AND (1 <= p9))))))) R ((p1 <= 0) OR (p37 <= 0)))))",
"processed_size": 117,
"rewrites": 82
},
"result":
{
"edges": 33110,
"markings": 4262,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(F ((((1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36)) R ((p0 <= 0) OR (p4 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0)))) U X (F (((1 <= p0) AND (1 <= p9) AND (1 <= p30)))))",
"processed_size": 230,
"rewrites": 82
},
"result":
{
"edges": 19621,
"markings": 3296,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (((p17 <= 0) OR (p30 <= 0) OR (p5 <= 0) OR (p8 <= 0))) AND G (((p17 <= 0) OR (p30 <= 0)))))",
"processed_size": 101,
"rewrites": 82
},
"result":
{
"edges": 49154,
"markings": 6437,
"produced_by": "LTL model checker",
"value": true
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "X ((X ((((p26 <= 0) OR (p31 <= 0)) OR (G (((1 <= p9) AND (1 <= p32))) AND F (((p26 <= 0) OR (p31 <= 0)))))) AND ((p6 <= 0) OR (p9 <= 0))))",
"processed_size": 141,
"rewrites": 82
},
"result":
{
"edges": 24,
"markings": 19,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (((1 <= p1) AND (1 <= p26))) U ((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))",
"processed_size": 91,
"rewrites": 82
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p21 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p23 <= 0) OR (p29 <= 0)))",
"processed_size": 76,
"rewrites": 87
},
"result":
{
"edges": 5778,
"markings": 1448,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 19
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "G (((p0 <= 0) OR (p29 <= 0)))",
"processed_size": 30,
"rewrites": 82
},
"result":
{
"edges": 803,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p2 <= 0) OR (p11 <= 0) OR (p34 <= 0) OR (p36 <= 0)))",
"processed_size": 60,
"rewrites": 82
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "G (F ((((p13 <= 0) OR (p24 <= 0)) R ((p20 <= 0) OR (p23 <= 0)))))",
"processed_size": 67,
"rewrites": 82
},
"result":
{
"edges": 41484,
"markings": 7757,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 5,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((G (((p15 <= 0) OR (p16 <= 0) OR (p21 <= 0))) AND (((p26 <= 0) OR (p31 <= 0)) AND (G ((G (((p15 <= 0) OR (p16 <= 0) OR (p21 <= 0))) AND ((p26 <= 0) OR (p31 <= 0)))) OR G (F (((p29 <= 0) OR (p30 <= 0))))))))",
"processed_size": 216,
"rewrites": 82
},
"result":
{
"edges": 133679,
"markings": 13049,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 11,
"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": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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 <= p1) AND (1 <= p37))",
"processed_size": 26,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p1) AND (1 <= p37))",
"processed_size": 26,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p1) AND (1 <= p37) AND (1 <= p23) AND (1 <= p24))))",
"processed_size": 64,
"rewrites": 82
},
"result":
{
"edges": 24,
"markings": 23,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 44912,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((* R *))) : G(F((X(**) AND (** AND (** AND (** AND **)))))) : G(F((X(X(G(**))) OR (** OR (** OR **))))) : X(F((X(X(X(F((X(**) OR *))))) R *))) : (F(G(*)) OR **) : G(**) : G((G(*) AND (* AND (G((G(*) AND *)) OR G(F(*)))))) : (F((* R *)) U X(F(**))) : F((** OR **)) : G(*) : F((X(*) AND G(*))) : X((X((** OR (G(**) AND F(**)))) AND **)) : (X(**) U **)"
},
"net":
{
"arcs": 338,
"conflict_clusters": 1,
"places": 40,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 68
},
"result":
{
"preliminary_value": "yes no yes yes no no no no yes no yes yes no ",
"value": "yes no yes yes no no no no yes no yes 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: 108/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40
lola: finding significant places
lola: 40 places, 68 transitions, 20 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: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: X (G (F (NOT(X ((((1 <= p13) AND (1 <= p24)) U ((1 <= p20) AND (1 <= p23)))))))) : G (F (((((X (((1 <= p13) AND (1 <= p14))) AND ((1 <= p27))) AND ((1 <= p32))) AND ((1 <= p13))) AND ((1 <= p14))))) : X (G (F ((((X (G (X ((((1 <= p31) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p17)))))) OR ((p23 <= 0))) OR ((p30 <= 0))) OR ((1 <= p14) AND (1 <= p17)))))) : F (NOT(X ((X (G (X (G (X ((NOT(X (((1 <= p14) AND (1 <= p19)))) AND ((p6 <= 0) OR (p9 <= 0)))))))) U ((1 <= p1) AND (1 <= p37)))))) : (NOT(X (((((1 <= p1) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p32))) U F (G (F (((p1 <= 0) OR (p37 <= 0) OR (p23 <= 0) OR (p24 <= 0)))))))) OR ((1 <= p1) AND (1 <= p37))) : G (((p0 <= 0) OR (p29 <= 0))) : NOT(F ((G (F (NOT(F (NOT(X (((1 <= p29) AND (1 <= p30)))))))) U (F (((1 <= p15) AND (1 <= p16) AND (1 <= p21))) OR ((1 <= p26) AND (1 <= p31)))))) : (F (NOT((((p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0)) U ((1 <= p0) AND (1 <= p4) AND (1 <= p32) AND (1 <= p34) AND (1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36))))) U X (F (((1 <= p0) AND (1 <= p9) AND (1 <= p30))))) : (F (((1 <= p21) AND (1 <= p22) AND (1 <= p25))) OR F (((1 <= p23) AND (1 <= p29)))) : NOT(F (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))) : NOT(G ((X (((1 <= p17) AND (1 <= p30) AND (1 <= p5) AND (1 <= p8))) OR F (((1 <= p17) AND (1 <= p30)))))) : X ((X ((G (((1 <= p9) AND (1 <= p32))) U ((p26 <= 0) OR (p31 <= 0)))) AND ((p6 <= 0) OR (p9 <= 0)))) : (X (((1 <= p1) AND (1 <= p26))) U ((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((1 <= p13) AND (1 <= p14))) AND (((1 <= p27)) AND (((1 <= p32)) AND (((1 <= p13)) AND ((1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((1 <= p13) AND (1 <= p14))) AND (((1 <= p27)) AND (((1 <= p32)) AND (((1 <= p13)) AND ((1 <= p14))))))))
lola: processed formula length: 115
lola: 82 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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((((1 <= p31) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p17)))))) OR (((p23 <= 0)) OR (((p30 <= 0)) OR ((1 <= p14) AND (1 <= p17)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((((1 <= p31) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p17)))))) OR (((p23 <= 0)) OR (((p30 <= 0)) OR ((1 <= p14) AND (1 <= p17)))))))
lola: processed formula length: 150
lola: 82 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: 7124 markings, 48639 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (X (F ((X (((1 <= p14) AND (1 <= p19))) OR ((1 <= p6) AND (1 <= p9))))))) R ((p1 <= 0) OR (p37 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (X (F ((X (((1 <= p14) AND (1 <= p19))) OR ((1 <= p6) AND (1 <= p9))))))) R ((p1 <= 0) OR (p37 <= 0)))))
lola: processed formula length: 117
lola: 82 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: 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: 4262 markings, 33110 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36)) R ((p0 <= 0) OR (p4 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0)))) U X (F (((1 <= p0) AND (1 <= p9) AND (1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36)) R ((p0 <= 0) OR (p4 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0)))) U X (F (((1 <= p0) AND (1 <= p9) AND (1 <= p30)))))
lola: processed formula length: 230
lola: 82 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: 3296 markings, 19621 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p17 <= 0) OR (p30 <= 0) OR (p5 <= 0) OR (p8 <= 0))) AND G (((p17 <= 0) OR (p30 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p17 <= 0) OR (p30 <= 0) OR (p5 <= 0) OR (p8 <= 0))) AND G (((p17 <= 0) OR (p30 <= 0)))))
lola: processed formula length: 101
lola: 82 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6437 markings, 49154 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((p26 <= 0) OR (p31 <= 0)) OR (G (((1 <= p9) AND (1 <= p32))) AND F (((p26 <= 0) OR (p31 <= 0)))))) AND ((p6 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((p26 <= 0) OR (p31 <= 0)) OR (G (((1 <= p9) AND (1 <= p32))) AND F (((p26 <= 0) OR (p31 <= 0)))))) AND ((p6 <= 0) OR (p9 <= 0))))
lola: processed formula length: 141
lola: 82 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: 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: 19 markings, 24 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p1) AND (1 <= p26))) U ((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p1) AND (1 <= p26))) U ((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))
lola: processed formula length: 91
lola: 82 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p21) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p23) AND (1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p21 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p23 <= 0) OR (p29 <= 0)))
lola: processed formula length: 76
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1448 markings, 5778 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p0 <= 0) OR (p29 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p0 <= 0) OR (p29 <= 0)))
lola: processed formula length: 30
lola: 82 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: 187 markings, 803 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p2 <= 0) OR (p11 <= 0) OR (p34 <= 0) OR (p36 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p2 <= 0) OR (p11 <= 0) OR (p34 <= 0) OR (p36 <= 0)))
lola: processed formula length: 60
lola: 82 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p13 <= 0) OR (p24 <= 0)) R ((p20 <= 0) OR (p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p13 <= 0) OR (p24 <= 0)) R ((p20 <= 0) OR (p23 <= 0)))))
lola: processed formula length: 67
lola: 82 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7757 markings, 41484 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p15 <= 0) OR (p16 <= 0) OR (p21 <= 0))) AND (((p26 <= 0) OR (p31 <= 0)) AND (G ((G (((p15 <= 0) OR (p16 <= 0) OR (p21 <= 0))) AND ((p26 <= 0) OR (p31 <= 0)))) OR G (F (((p29 <= 0) OR (p30 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p15 <= 0) OR (p16 <= 0) OR (p21 <= 0))) AND (((p26 <= 0) OR (p31 <= 0)) AND (G ((G (((p15 <= 0) OR (p16 <= 0) OR (p21 <= 0))) AND ((p26 <= 0) OR (p31 <= 0)))) OR G (F (((p29 <= 0) OR (p30 <= 0))))))))
lola: processed formula length: 216
lola: 82 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: 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: 13049 markings, 133679 edges
lola: ========================================
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p1) AND (1 <= p37) AND (1 <= p23) AND (1 <= p24)))) OR ((1 <= p1) AND (1 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p37))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p37))
lola: processed formula length: 26
lola: 82 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p1) AND (1 <= p37) AND (1 <= p23) AND (1 <= p24)))) OR ((1 <= p1) AND (1 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p37))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p37))
lola: processed formula length: 26
lola: 82 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: ========================================
lola: ...considering subproblem: F (G (((1 <= p1) AND (1 <= p37) AND (1 <= p23) AND (1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p1) AND (1 <= p37) AND (1 <= p23) AND (1 <= p24))))
lola: processed formula length: 64
lola: 82 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: 23 markings, 24 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no yes no yes yes no
lola:
preliminary result: yes no yes yes no no no no yes no yes yes no
lola: ========================================
lola: memory consumption: 44912 KB
lola: time consumption: 4 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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r194-csrt-159033390400738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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