Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938700220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RobotManipulation-PT-02000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.6K Apr 12 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 11 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591231330827

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:42:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:42:13] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-06-04 00:42:13] [INFO ] Transformed 15 places.
[2020-06-04 00:42:13] [INFO ] Transformed 11 transitions.
[2020-06-04 00:42:13] [INFO ] Parsed PT model containing 15 places and 11 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Incomplete random walk after 100026 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=2564 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0]
// Phase 1: matrix 11 rows 15 cols
[2020-06-04 00:42:13] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2020-06-04 00:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 8 ms.
[2020-06-04 00:42:13] [INFO ] Added : 8 causal constraints over 2 iterations in 49 ms. Result :sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:13] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2020-06-04 00:42:13] [INFO ] Added : 8 causal constraints over 2 iterations in 49 ms. Result :sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:42:13] [INFO ] Added : 9 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:42:13] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:13] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 4 ms.
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:42:14] [INFO ] Added : 8 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 26 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2020-06-04 00:42:14] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 10 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:42:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-06-04 00:42:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:42:14] [INFO ] Added : 9 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 00:42:14] [INFO ] Flatten gal took : 20 ms
[2020-06-04 00:42:14] [INFO ] Flatten gal took : 4 ms
[2020-06-04 00:42:14] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 00:42:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RobotManipulation-PT-02000 @ 3570 seconds

FORMULA RobotManipulation-PT-02000-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2568
rslt: Output for CTLFireability @ RobotManipulation-PT-02000

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:42:15 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(AG((1 <= p12)))",
"processed_size": 18,
"rewrites": 40
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 4000,
"markings": 4001,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G (((1 <= p12) OR (1 <= p6))))",
"processed_size": 34,
"rewrites": 40
},
"result":
{
"edges": 4001,
"markings": 4002,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EX(((1 <= p3) AND (1 <= p5) AND (1 <= p6)))",
"processed_size": 43,
"rewrites": 39
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((p6 <= 0) OR ((1 <= p0) AND (1 <= p4)))",
"processed_size": 41,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 <= p7) AND (1 <= p11))",
"processed_size": 26,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 <= p2) AND (1 <= p9))",
"processed_size": 25,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (((((1 <= p7) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p5)) OR (p10 <= 0)) U ((1 <= p13) AND (1 <= p14))))",
"processed_size": 109,
"rewrites": 43
},
"result":
{
"edges": 4001,
"markings": 4002,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "AX(((p7 <= 0) OR (p11 <= 0)))",
"processed_size": 30,
"rewrites": 39
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(EX(AF(((1 <= p13) AND (1 <= p14)))))",
"processed_size": 39,
"rewrites": 41
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 16026,
"markings": 8014,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((1 <= p13) AND (1 <= p14))))",
"processed_size": 35,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p7 <= 0) OR (p11 <= 0))",
"processed_size": 26,
"rewrites": 41
},
"result":
{
"edges": 8001,
"markings": 8002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p12 <= 0)",
"processed_size": 10,
"rewrites": 42
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF((EG(((p7 <= 0) OR (p11 <= 0))) AND AF(((p1 <= 0) OR (p5 <= 0)))))",
"processed_size": 70,
"rewrites": 41
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 24054009,
"markings": 16032000,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 399
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A(((p7 <= 0) AND (AG((1 <= p10)) AND ((p13 <= 0) OR (p14 <= 0)))) U (AF(((1 <= p7) AND (1 <= p11))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p13) AND (1 <= p14) AND (1 <= p12))))",
"processed_size": 176,
"rewrites": 41
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 24018002,
"markings": 16016002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 454
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF((((((1 <= p12) OR ((1 <= p7) AND (1 <= p11))) AND ((1 <= p7) OR (1 <= p10))) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p0) AND (1 <= p4) AND (1 <= p10))) OR (((1 <= p10) AND (1 <= p12)) AND (AF(((1 <= p1) AND (1 <= p5))) AND ((p1 <= 0) OR (p5 <= 0))))))",
"processed_size": 256,
"rewrites": 40
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 24018001,
"markings": 16016002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(EG((AF(((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p10) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4)))))) AND E(EF((1 <= p12)) U (1 <= p7)))",
"processed_size": 179,
"rewrites": 42
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 24057,
"markings": 8024,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p12 <= 0)",
"processed_size": 10,
"rewrites": 42
},
"result":
{
"edges": 4006,
"markings": 4006,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1056
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p13 <= 0) OR (p14 <= 0))",
"processed_size": 27,
"rewrites": 41
},
"result":
{
"edges": 4001,
"markings": 4002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1056
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p13 <= 0) OR (p14 <= 0))",
"processed_size": 27,
"rewrites": 41
},
"result":
{
"edges": 4001,
"markings": 4002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (G (((p2 <= 0) OR (p9 <= 0))))",
"processed_size": 33,
"rewrites": 39
},
"result":
{
"edges": 16020009,
"markings": 8026007,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1579
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p8 <= 0)))",
"processed_size": 17,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3158
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))",
"processed_size": 40,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3158
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))",
"processed_size": 95,
"rewrites": 39
},
"result":
{
"edges": 16012001,
"markings": 8010002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p8 <= 0)))",
"processed_size": 17,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))",
"processed_size": 40,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p13 <= 0) OR (p14 <= 0))",
"processed_size": 27,
"rewrites": 41
},
"result":
{
"edges": 4001,
"markings": 4002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))",
"processed_size": 95,
"rewrites": 39
},
"result":
{
"edges": 16012001,
"markings": 8010002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 4,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((1 <= p3) AND (1 <= p5) AND (((p8 <= 0) AND ((p13 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0))) OR ((p8 <= 0) AND ((1 <= p10) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))))",
"processed_size": 183,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4180,
"runtime": 1002.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(X(A(G(*)))) : A(F((E(G(*)) AND A(F(*))))) : (E(G(**)) OR **) : A(F(A(G(**)))) : E((** U A(G(**)))) : (E(G(*)) AND A(F(**))) : (A(G(**)) OR E(X(**))) : A(G(A(F(**)))) : (A(F(**)) OR **) : (E(G((A(F(**)) OR **))) AND E((E(F(**)) U **))) : (A(F(**)) AND (E(F(*)) AND **)) : (A((** U **)) AND (A(F(*)) AND (A(X(*)) AND (A(F(*)) AND **)))) : A(F((** OR (** AND (A(F(**)) AND **))))) : E(G(E(X(A(F(**)))))) : (A(F(**)) OR (E(X(A(G(**)))) AND (** OR A(G(**))))) : A(((** AND (A(G(**)) AND **)) U (A(F(**)) OR **)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no no unknown yes no no yes yes yes yes yes yes yes yes ",
"value": "no no no no unknown yes no no yes yes yes yes yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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 CTLFireability.xml
lola: E (X (NOT(E (F ((p12 <= 0)))))) : NOT(E (G ((A (F (((1 <= p7) AND (1 <= p11)))) OR E (G (((1 <= p1) AND (1 <= p5)))))))) : (E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0))))) OR ((1 <= p3) AND (1 <= p5) AND (((p8 <= 0) AND ((p13 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0))) OR ((p8 <= 0) AND ((1 <= p10) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))))) : A (F (A (G ((1 <= p12))))) : E (((p10 <= 0) U A (G ((p6 <= 0))))) : (NOT(A (F (((1 <= p2) AND (1 <= p9))))) AND A (F (((1 <= p13) AND (1 <= p14))))) : (E (G (A (G (((1 <= p12) OR (1 <= p6)))))) OR E (X (((1 <= p3) AND (1 <= p5) AND (1 <= p6))))) : A (G (A (F ((1 <= p12))))) : (A (F (((1 <= p13) AND (1 <= p14)))) OR (1 <= p8)) : (E (G ((A (F (((1 <= p13) AND (1 <= p14)))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p10) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4))))))) AND E ((E (F ((1 <= p12))) U (1 <= p7)))) : ((A (F (A (((1 <= p6) U ((1 <= p13) AND (1 <= p14)))))) AND NOT(A (G ((1 <= p8))))) AND ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))) : ((((A (((((1 <= p7) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p5)) OR (p10 <= 0)) U ((1 <= p13) AND (1 <= p14)))) AND NOT(E (G (((1 <= p2) AND (1 <= p9)))))) AND NOT(E (X (((1 <= p7) AND (1 <= p11)))))) AND NOT(E (G (((1 <= p7) AND (1 <= p11)))))) AND ((p6 <= 0) OR ((1 <= p0) AND (1 <= p4)))) : A (F ((((((1 <= p12) OR ((1 <= p7) AND (1 <= p11))) AND ((1 <= p7) OR (1 <= p10))) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p0) AND (1 <= p4) AND (1 <= p10))) OR ((((1 <= p10) AND (1 <= p12)) AND A (F (((1 <= p1) AND (1 <= p5))))) AND ((p1 <= 0) OR (p5 <= 0)))))) : E (G (E (X (A (F (((1 <= p13) AND (1 <= p14)))))))) : (A (F (((1 <= p7) AND (1 <= p11)))) OR (E (X (A (G (((1 <= p2) AND (1 <= p9)))))) AND (((1 <= p6) OR (1 <= p10)) OR A (G (((1 <= p13) AND (1 <= p14))))))) : A (((((p7 <= 0) AND A (G ((1 <= p10)))) AND ((p13 <= 0) OR (p14 <= 0))) U (A (F (((1 <= p7) AND (1 <= p11)))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p13) AND (1 <= p14) AND (1 <= p12)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: 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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((1 <= p12)))
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4001 markings, 4000 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p12) OR (1 <= p6)))) OR E (X (((1 <= p3) AND (1 <= p5) AND (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p12) OR (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p12) OR (1 <= p6))))
lola: processed formula length: 34
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p12 <= 0) AND (p6 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4002 markings, 4001 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p3) AND (1 <= p5) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p3) AND (1 <= p5) AND (1 <= p6)))
lola: processed formula length: 43
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p7) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p5)) OR (p10 <= 0)) U ((1 <= p13) AND (1 <= p14)))) AND (A (F (((p2 <= 0) OR (p9 <= 0)))) AND (A (X (((p7 <= 0) OR (p11 <= 0)))) AND (A (F (((p7 <= 0) OR (p11 <= 0)))) AND ((p6 <= 0) OR ((1 <= p0) AND (1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) OR ((1 <= p0) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p6 <= 0) OR ((1 <= p0) AND (1 <= p4)))
lola: processed formula length: 41
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p7 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p7) AND (1 <= p11))
lola: processed formula length: 26
lola: 41 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p7 <= 0) OR (p11 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p2 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p2) AND (1 <= p9))
lola: processed formula length: 25
lola: 41 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p7) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p5)) OR (p10 <= 0)) U ((1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p7) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p5)) OR (p10 <= 0)) U ((1 <= p13) AND (1 <= p14))))
lola: processed formula length: 109
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p7) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p5)) OR (p10 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: 0
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 4002 markings, 4001 edges
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p7 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p7 <= 0) OR (p11 <= 0)))
lola: processed formula length: 30
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (A (F (((1 <= p13) AND (1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(AF(((1 <= p13) AND (1 <= p14)))))
lola: processed formula length: 39
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8014 markings, 16026 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p7) AND (1 <= p11)))) OR (E (X (A (G (((1 <= p2) AND (1 <= p9)))))) AND (((1 <= p6) OR (1 <= p10)) OR A (G (((1 <= p13) AND (1 <= p14)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) OR (1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) OR (1 <= p10))
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file CTLFireability.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: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p13) AND (1 <= p14))))
lola: processed formula length: 35
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13 <= 0) OR (p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p7) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p7 <= 0) OR (p11 <= 0))
lola: processed formula length: 26
lola: 41 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7) AND (1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: try reading problem file CTLFireability-5-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 8002 markings, 8001 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12 <= 0)
lola: processed formula length: 10
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.

lola: ========================================
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p12 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 20005 markings, 20005 edges
lola: state equation 0: solution produced
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((p10 <= 0) U A (G ((p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((p10 <= 0) U AG((p6 <= 0)))
lola: processed formula length: 29
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2061442 markings, 5513141 edges, 412288 markings/sec, 0 secs
lola: 4122918 markings, 11019239 edges, 412295 markings/sec, 5 secs
lola: 6232966 markings, 16642245 edges, 422010 markings/sec, 10 secs
lola: 8336753 markings, 22247578 edges, 420757 markings/sec, 15 secs
lola: 10460416 markings, 27912060 edges, 424733 markings/sec, 20 secs
lola: 12592075 markings, 33598285 edges, 426332 markings/sec, 25 secs
lola: 14734366 markings, 39308864 edges, 428458 markings/sec, 30 secs
lola: 16853130 markings, 44962339 edges, 423753 markings/sec, 35 secs
lola: 18998273 markings, 50677737 edges, 429029 markings/sec, 40 secs
lola: 21152698 markings, 56428268 edges, 430885 markings/sec, 45 secs
lola: 23314134 markings, 62187973 edges, 432287 markings/sec, 50 secs
lola: 25473093 markings, 67947855 edges, 431792 markings/sec, 55 secs
lola: 27642240 markings, 73728750 edges, 433829 markings/sec, 60 secs
lola: 29813558 markings, 79514878 edges, 434264 markings/sec, 65 secs
lola: 31937838 markings, 85179682 edges, 424856 markings/sec, 70 secs
lola: 34064389 markings, 90853043 edges, 425310 markings/sec, 75 secs
lola: 36200490 markings, 96547003 edges, 427220 markings/sec, 80 secs
lola: 38312418 markings, 102183333 edges, 422386 markings/sec, 85 secs
lola: 40455524 markings, 107891448 edges, 428621 markings/sec, 90 secs
lola: 42664906 markings, 113785144 edges, 441876 markings/sec, 95 secs
lola: 44812813 markings, 119514177 edges, 429581 markings/sec, 100 secs
lola: 46961877 markings, 125244820 edges, 429813 markings/sec, 105 secs
lola: 49098138 markings, 130938117 edges, 427252 markings/sec, 110 secs
lola: 51253188 markings, 136683775 edges, 431010 markings/sec, 115 secs
lola: 53418011 markings, 142456558 edges, 432965 markings/sec, 120 secs
lola: 55560004 markings, 148168589 edges, 428399 markings/sec, 125 secs
lola: 57732873 markings, 153960481 edges, 434574 markings/sec, 130 secs
lola: 59904065 markings, 159751640 edges, 434238 markings/sec, 135 secs
lola: 62055536 markings, 165486563 edges, 430294 markings/sec, 140 secs
lola: 64234242 markings, 171297020 edges, 435741 markings/sec, 145 secs
lola: 66438702 markings, 177173039 edges, 440892 markings/sec, 150 secs
lola: 68718190 markings, 183249583 edges, 455898 markings/sec, 155 secs
lola: 71024218 markings, 189397352 edges, 461206 markings/sec, 160 secs
lola: 75702262 markings, 196289371 edges, 935609 markings/sec, 165 secs
lola: 80728323 markings, 203537782 edges, 1005212 markings/sec, 170 secs
lola: 84831042 markings, 211656936 edges, 820544 markings/sec, 175 secs
lola: 88799727 markings, 219445758 edges, 793737 markings/sec, 180 secs
lola: 92008752 markings, 227710816 edges, 641805 markings/sec, 185 secs
lola: 94913331 markings, 235793544 edges, 580916 markings/sec, 190 secs
lola: 98506979 markings, 243183374 edges, 718730 markings/sec, 195 secs
lola: 100435969 markings, 251714617 edges, 385798 markings/sec, 200 secs
lola: 104043383 markings, 259064848 edges, 721483 markings/sec, 205 secs
lola: 106217721 markings, 267844705 edges, 434868 markings/sec, 210 secs
lola: 108963089 markings, 276153617 edges, 549074 markings/sec, 215 secs
lola: 112005793 markings, 282930229 edges, 608541 markings/sec, 220 secs
lola: 113844624 markings, 292178756 edges, 367766 markings/sec, 225 secs
lola: 115495710 markings, 300710029 edges, 330217 markings/sec, 230 secs
lola: 119249102 markings, 307625923 edges, 750678 markings/sec, 235 secs
lola: 121511104 markings, 315542133 edges, 452400 markings/sec, 240 secs
lola: 123240124 markings, 324400956 edges, 345804 markings/sec, 245 secs
lola: 124871630 markings, 332834015 edges, 326301 markings/sec, 250 secs
lola: 128166273 markings, 340064975 edges, 658929 markings/sec, 255 secs
lola: 130637030 markings, 346618257 edges, 494151 markings/sec, 260 secs
lola: 132516305 markings, 354790495 edges, 375855 markings/sec, 265 secs
lola: 134134883 markings, 363071600 edges, 323716 markings/sec, 270 secs
lola: 135649575 markings, 370969341 edges, 302938 markings/sec, 275 secs
lola: 137117107 markings, 378674448 edges, 293506 markings/sec, 280 secs
lola: 140432192 markings, 385335746 edges, 663017 markings/sec, 285 secs
lola: 142775251 markings, 391751356 edges, 468612 markings/sec, 290 secs
lola: 144619817 markings, 398699807 edges, 368913 markings/sec, 295 secs
lola: 146332013 markings, 407335864 edges, 342439 markings/sec, 300 secs
lola: 147828161 markings, 415110559 edges, 299230 markings/sec, 305 secs
lola: 149316927 markings, 422819011 edges, 297753 markings/sec, 310 secs
lola: 150723270 markings, 430190926 edges, 281269 markings/sec, 315 secs
lola: 152072831 markings, 437447228 edges, 269912 markings/sec, 320 secs
lola: 155667711 markings, 444243056 edges, 718976 markings/sec, 325 secs
lola: 158069344 markings, 450782857 edges, 480327 markings/sec, 330 secs
lola: 159786362 markings, 457224892 edges, 343404 markings/sec, 335 secs
lola: 161517975 markings, 465951238 edges, 346323 markings/sec, 340 secs
lola: 163085573 markings, 474041698 edges, 313520 markings/sec, 345 secs
lola: 164543428 markings, 481646869 edges, 291571 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown no no unknown unknown unknown yes unknown yes yes unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G (((p7 <= 0) OR (p11 <= 0)))) AND A (F (((p1 <= 0) OR (p5 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG(((p7 <= 0) OR (p11 <= 0))) AND AF(((p1 <= 0) OR (p5 <= 0)))))
lola: processed formula length: 70
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5881691 markings, 8816536 edges, 1176338 markings/sec, 0 secs
lola: 11811142 markings, 17710712 edges, 1185890 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16032000 markings, 24054009 edges
lola: ========================================
lola: subprocess 8 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p7 <= 0) AND (A (G ((1 <= p10))) AND ((p13 <= 0) OR (p14 <= 0)))) U (A (F (((1 <= p7) AND (1 <= p11)))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p13) AND (1 <= p14) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p7 <= 0) AND (AG((1 <= p10)) AND ((p13 <= 0) OR (p14 <= 0)))) U (AF(((1 <= p7) AND (1 <= p11))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p13) AND (1 <= p14) AND (1 <= p12))))
lola: processed formula length: 176
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 6107608 markings, 9155411 edges, 1221522 markings/sec, 0 secs
lola: 12163610 markings, 18239414 edges, 1211200 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16016002 markings, 24018002 edges
lola: ========================================
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((((1 <= p12) OR ((1 <= p7) AND (1 <= p11))) AND ((1 <= p7) OR (1 <= p10))) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p0) AND (1 <= p4) AND (1 <= p10))) OR (((1 <= p10) AND (1 <= p12)) AND (A (F (((1 <= p1) AND (1 <= p5)))) AND ((p1 <= 0) OR (p5 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((((1 <= p12) OR ((1 <= p7) AND (1 <= p11))) AND ((1 <= p7) OR (1 <= p10))) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p0) AND (1 <= p4) AND (1 <= p10))) OR (((1 <= p10) AND (1 <= p12)) AND (AF(((1 <= p1) AND (1 <= p5))) AND ((p1 <= 0) OR (p5 <= 0))))))
lola: processed formula length: 256
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5096852 markings, 7639276 edges, 1019370 markings/sec, 0 secs
lola: 10124224 markings, 15180335 edges, 1005474 markings/sec, 5 secs
lola: 15255517 markings, 22877274 edges, 1026259 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16016002 markings, 24018001 edges
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((A (F (((1 <= p13) AND (1 <= p14)))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p10) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4))))))) AND E ((E (F ((1 <= p12))) U (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (EG((AF(((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5) AND (1 <= p10) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4)))))) AND E(EF((1 <= p12)) U (1 <= p7)))
lola: processed formula length: 179
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8024 markings, 24057 edges
lola: ========================================
lola: subprocess 11 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12 <= 0)
lola: processed formula length: 10
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p12 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 4006 markings, 4006 edges
lola: ========================================
lola: subprocess 12 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p13) AND (1 <= p14)))) OR (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p13 <= 0) OR (p14 <= 0))
lola: processed formula length: 27
lola: 41 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13) AND (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4002 markings, 4001 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((p2 <= 0) OR (p9 <= 0)))) AND A (F (((1 <= p13) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p13 <= 0) OR (p14 <= 0))
lola: processed formula length: 27
lola: 41 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13) AND (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4002 markings, 4001 edges
lola: ========================================
lola: subprocess 14 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p2 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p2 <= 0) OR (p9 <= 0))))
lola: processed formula length: 33
lola: 39 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.

lola: state equation 0: solution produced
lola: 4114772 markings, 8205542 edges, 822954 markings/sec, 0 secs || sara is running 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8026007 markings, 16020009 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p13) AND (1 <= p14)))) AND (E (F ((p8 <= 0))) AND ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p8 <= 0)))
lola: processed formula length: 17
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.

lola: subprocess 15 will run for 3158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))
lola: processed formula length: 40
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0))))) OR ((1 <= p3) AND (1 <= p5) AND (((p8 <= 0) AND ((p13 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0))) OR ((p8 <= 0) AND ((1 <= p10) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))
lola: processed formula length: 95
lola: 39 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p13) AND (1 <= p14) AND (1 <= p8)) OR (1 <= p7) OR ((1 <= p3) AND (1 <= p5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.

lola: state equation 0: solution produced
lola: 4423481 markings, 8838959 edges, 884696 markings/sec, 0 secs || sara is running 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 8010002 markings, 16012001 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: E (((p10 <= 0) U A (G ((p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((p10 <= 0) U AG((p6 <= 0)))
lola: processed formula length: 29
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2069262 markings, 5537715 edges, 413852 markings/sec, 0 secs
lola: 4149931 markings, 11087026 edges, 416134 markings/sec, 5 secs
lola: 6244477 markings, 16674969 edges, 418909 markings/sec, 10 secs
lola: 8334277 markings, 22242627 edges, 417960 markings/sec, 15 secs
lola: 10434686 markings, 27847486 edges, 420082 markings/sec, 20 secs
lola: 12527134 markings, 33424784 edges, 418490 markings/sec, 25 secs
lola: 14636853 markings, 39049586 edges, 421944 markings/sec, 30 secs
lola: 16724319 markings, 44617457 edges, 417493 markings/sec, 35 secs
lola: 18850357 markings, 50286902 edges, 425208 markings/sec, 40 secs
lola: 20988811 markings, 55985919 edges, 427691 markings/sec, 45 secs
lola: 23125320 markings, 61686394 edges, 427302 markings/sec, 50 secs
lola: 25276035 markings, 67420886 edges, 430143 markings/sec, 55 secs
lola: 27421954 markings, 73144674 edges, 429184 markings/sec, 60 secs
lola: 29616625 markings, 78990553 edges, 438934 markings/sec, 65 secs
lola: 31735280 markings, 84646347 edges, 423731 markings/sec, 70 secs
lola: 33910583 markings, 90444667 edges, 435061 markings/sec, 75 secs
lola: 36099620 markings, 96278478 edges, 437807 markings/sec, 80 secs
lola: 38260848 markings, 102044809 edges, 432246 markings/sec, 85 secs
lola: 40447887 markings, 107876176 edges, 437408 markings/sec, 90 secs
lola: 42664186 markings, 113782840 edges, 443260 markings/sec, 95 secs
lola: 44824725 markings, 119541410 edges, 432108 markings/sec, 100 secs
lola: 47030878 markings, 125427412 edges, 441231 markings/sec, 105 secs
lola: 49248000 markings, 131340503 edges, 443424 markings/sec, 110 secs
lola: 51474493 markings, 137275323 edges, 445299 markings/sec, 115 secs
lola: 53707475 markings, 143229981 edges, 446596 markings/sec, 120 secs
lola: 55915935 markings, 149115502 edges, 441692 markings/sec, 125 secs
lola: 58141908 markings, 155054475 edges, 445195 markings/sec, 130 secs
lola: 60406172 markings, 161087355 edges, 452853 markings/sec, 135 secs
lola: 62680518 markings, 167154948 edges, 454869 markings/sec, 140 secs
lola: 64978508 markings, 173278991 edges, 459598 markings/sec, 145 secs
lola: 67279624 markings, 179414730 edges, 460223 markings/sec, 150 secs
lola: 69584821 markings, 185559520 edges, 461039 markings/sec, 155 secs
lola: 71950499 markings, 191864869 edges, 473136 markings/sec, 160 secs
lola: 77958909 markings, 199620156 edges, 1201682 markings/sec, 165 secs
lola: 82910065 markings, 207409266 edges, 990231 markings/sec, 170 secs
lola: 86797159 markings, 215414468 edges, 777419 markings/sec, 175 secs
lola: 90414262 markings, 223919535 edges, 723421 markings/sec, 180 secs
lola: 94141618 markings, 231963143 edges, 745471 markings/sec, 185 secs
lola: 97288208 markings, 240722958 edges, 629318 markings/sec, 190 secs
lola: 99929429 markings, 249148631 edges, 528244 markings/sec, 195 secs
lola: 103189875 markings, 257024735 edges, 652089 markings/sec, 200 secs
lola: 105718627 markings, 265304991 edges, 505750 markings/sec, 205 secs
lola: 107432378 markings, 274077525 edges, 342750 markings/sec, 210 secs
lola: 111414460 markings, 281071592 edges, 796416 markings/sec, 215 secs
lola: 113390776 markings, 289862864 edges, 395263 markings/sec, 220 secs
lola: 115091558 markings, 298578611 edges, 340156 markings/sec, 225 secs
lola: 118667448 markings, 305906144 edges, 715178 markings/sec, 230 secs
lola: 121086989 markings, 313450528 edges, 483908 markings/sec, 235 secs
lola: 122921443 markings, 322709370 edges, 366891 markings/sec, 240 secs
lola: 124594027 markings, 331351269 edges, 334517 markings/sec, 245 secs
lola: 127670587 markings, 339057950 edges, 615312 markings/sec, 250 secs
lola: 130529674 markings, 345970591 edges, 571817 markings/sec, 255 secs
lola: 132442730 markings, 354412676 edges, 382611 markings/sec, 260 secs
lola: 134170530 markings, 363250107 edges, 345560 markings/sec, 265 secs
lola: 135762612 markings, 371586190 edges, 318416 markings/sec, 270 secs
lola: 137319097 markings, 379770997 edges, 311297 markings/sec, 275 secs
lola: 141069920 markings, 386867866 edges, 750165 markings/sec, 280 secs
lola: 143394821 markings, 393738680 edges, 464980 markings/sec, 285 secs
lola: 145292003 markings, 402044283 edges, 379436 markings/sec, 290 secs
lola: 147000506 markings, 410781995 edges, 341701 markings/sec, 295 secs
lola: 148591045 markings, 419092971 edges, 318108 markings/sec, 300 secs
lola: 150108758 markings, 427071316 edges, 303543 markings/sec, 305 secs
lola: 151625880 markings, 435017147 edges, 303424 markings/sec, 310 secs
lola: 154702333 markings, 442176115 edges, 615291 markings/sec, 315 secs
lola: 157465928 markings, 448928302 edges, 552719 markings/sec, 320 secs
lola: 159331602 markings, 455508135 edges, 373135 markings/sec, 325 secs
lola: 161133503 markings, 464006375 edges, 360380 markings/sec, 330 secs
lola: 162830123 markings, 472693731 edges, 339324 markings/sec, 335 secs
lola: 164369249 markings, 480777903 edges, 307825 markings/sec, 340 secs
lola: 165889208 markings, 488751979 edges, 303992 markings/sec, 345 secs
lola: 167407477 markings, 496712309 edges, 303654 markings/sec, 350 secs
lola: 168927524 markings, 504663747 edges, 304009 markings/sec, 355 secs
lola: 170317011 markings, 512054575 edges, 277897 markings/sec, 360 secs
lola: 174097287 markings, 518701034 edges, 756055 markings/sec, 365 secs
lola: 176252568 markings, 525161899 edges, 431056 markings/sec, 370 secs
lola: 177730363 markings, 530349389 edges, 295559 markings/sec, 375 secs
lola: 178882729 markings, 534991153 edges, 230473 markings/sec, 380 secs
lola: 180253319 markings, 541923561 edges, 274118 markings/sec, 385 secs
lola: 181228232 markings, 546898362 edges, 194983 markings/sec, 390 secs
lola: 182327050 markings, 552635286 edges, 219764 markings/sec, 395 secs
lola: 183656719 markings, 559500675 edges, 265934 markings/sec, 400 secs
lola: 185072428 markings, 566968888 edges, 283142 markings/sec, 405 secs
lola: 186181976 markings, 572784377 edges, 221910 markings/sec, 410 secs
lola: 187325514 markings, 578742150 edges, 228708 markings/sec, 415 secs
lola: 188133938 markings, 583068103 edges, 161685 markings/sec, 420 secs
lola: 188978837 markings, 587659248 edges, 168980 markings/sec, 425 secs
lola: 190372937 markings, 594896743 edges, 278820 markings/sec, 430 secs
lola: 191570714 markings, 601426540 edges, 239555 markings/sec, 435 secs
lola: 192430984 markings, 605843636 edges, 172054 markings/sec, 440 secs
lola: 195009224 markings, 609318793 edges, 515648 markings/sec, 445 secs
lola: 197475839 markings, 615428381 edges, 493323 markings/sec, 450 secs
lola: 198842689 markings, 620077189 edges, 273370 markings/sec, 455 secs
lola: 200011951 markings, 625134340 edges, 233852 markings/sec, 460 secs
lola: 200966060 markings, 628934401 edges, 190822 markings/sec, 465 secs
lola: 202499618 markings, 635266068 edges, 306712 markings/sec, 470 secs
lola: 204184959 markings, 643806037 edges, 337068 markings/sec, 475 secs
lola: 205682495 markings, 651536081 edges, 299507 markings/sec, 480 secs
lola: 207141846 markings, 659156767 edges, 291870 markings/sec, 485 secs
lola: 208552492 markings, 666544096 edges, 282129 markings/sec, 490 secs
lola: 209874049 markings, 673615713 edges, 264311 markings/sec, 495 secs
lola: 211159006 markings, 680326718 edges, 256991 markings/sec, 500 secs
lola: 212229396 markings, 686082360 edges, 214078 markings/sec, 505 secs
lola: 213507101 markings, 692745958 edges, 255541 markings/sec, 510 secs
lola: 214708206 markings, 699260523 edges, 240221 markings/sec, 515 secs
lola: 216047749 markings, 706231593 edges, 267909 markings/sec, 520 secs
lola: 217276874 markings, 712902381 edges, 245825 markings/sec, 525 secs
lola: 218427844 markings, 719131813 edges, 230194 markings/sec, 530 secs
lola: 220707494 markings, 724471028 edges, 455930 markings/sec, 535 secs
lola: 223303030 markings, 730118699 edges, 519107 markings/sec, 540 secs
lola: 225289956 markings, 736218022 edges, 397385 markings/sec, 545 secs
lola: 227038121 markings, 742280445 edges, 349633 markings/sec, 550 secs
lola: 228456836 markings, 748435682 edges, 283743 markings/sec, 555 secs
lola: 229740432 markings, 753724365 edges, 256719 markings/sec, 560 secs
lola: 230583318 markings, 758043141 edges, 168577 markings/sec, 565 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p13) AND (1 <= p14)))) AND (E (F ((p8 <= 0))) AND ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p8 <= 0)))
lola: processed formula length: 17
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p0 <= 0) OR (p4 <= 0))
lola: processed formula length: 40
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p13 <= 0) OR (p14 <= 0))
lola: processed formula length: 27
lola: 41 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4002 markings, 4001 edges
sara: try reading problem file CTLFireability-17-0.sara.

lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13) AND (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
sara: try reading problem file CTLFireability-19-0.sara.

lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0))))) OR ((1 <= p3) AND (1 <= p5) AND (((p8 <= 0) AND ((p13 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0))) OR ((p8 <= 0) AND ((1 <= p10) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p13 <= 0) OR (p14 <= 0) OR (p8 <= 0)) AND (p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))
lola: processed formula length: 95
lola: 39 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p13) AND (1 <= p14) AND (1 <= p8)) OR (1 <= p7) OR ((1 <= p3) AND (1 <= p5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-18-0.sara.

lola: state equation 0: solution produced
lola: 4377713 markings, 8747424 edges, 875543 markings/sec, 0 secs || sara is running 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 8010002 markings, 16012001 edges
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p5) AND (((p8 <= 0) AND ((p13 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0))) OR ((p8 <= 0) AND ((1 <= p10) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p5) AND (((p8 <= 0) AND ((p13 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0))) OR ((p8 <= 0) AND ((1 <= p10) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))))
lola: processed formula length: 183
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 12 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown yes no no yes yes yes yes yes yes yes yes
lola:
preliminary result: no no no no unknown yes no no yes yes yes yes yes yes yes yes
lola: memory consumption: 4180 KB
lola: time consumption: 1002 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="RobotManipulation-PT-02000"
export BK_EXAMINATION="CTLFireability"
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 RobotManipulation-PT-02000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938700220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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