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.r184-oct2-158987928000060.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 GlobalResAllocation-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928000060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 209K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 662K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 5.7M Apr 27 15:14 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 GlobalResAllocation-PT-03-CTLFireability-00
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-01
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-02
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-03
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-04
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-05
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-06
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-07
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-08
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-09
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-10
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-11
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-12
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-13
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-14
FORMULA_NAME GlobalResAllocation-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591188152581

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:42:34] [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-03 12:42:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:42:34] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2020-06-03 12:42:34] [INFO ] Transformed 33 places.
[2020-06-03 12:42:34] [INFO ] Transformed 4791 transitions.
[2020-06-03 12:42:34] [INFO ] Parsed PT model containing 33 places and 4791 transitions in 349 ms.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 480 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
[2020-06-03 12:42:34] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 4080 transitions
Reduce redundant transitions removed 4080 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 55 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 777 ms. (steps per millisecond=128 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0]
Normalized transition count is 693 out of 711 initially.
// Phase 1: matrix 693 rows 33 cols
[2020-06-03 12:42:35] [INFO ] Computed 12 place invariants in 35 ms
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned unsat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 12:42:35] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 15 ms returned unsat
[2020-06-03 12:42:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-03 12:42:36] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 12:42:36] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-06-03 12:42:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 12:42:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2020-06-03 12:42:36] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 12:42:36] [INFO ] Flatten gal took : 130 ms
[2020-06-03 12:42:36] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 12:42:36] [INFO ] Flatten gal took : 81 ms
FORMULA GlobalResAllocation-PT-03-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 12:42:36] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2020-06-03 12:42:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ GlobalResAllocation-PT-03 @ 3570 seconds

FORMULA GlobalResAllocation-PT-03-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-PT-03-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3546
rslt: Output for CTLFireability @ GlobalResAllocation-PT-03

{
"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": "Wed Jun 3 12:42:36 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 105,
"adisj": 2,
"aneg": 2,
"comp": 375,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 375,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A(EX((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p7 <= 0)))) R EG((((p9 <= 0) OR (p12 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p14 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p22 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p11 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p16 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p15 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p15 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p13 <= 0) OR (p31 <= 1)) AND ((p19 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p9 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p18 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p15 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p21 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p9 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p17 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p13 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p19 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p13 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p20 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p10 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p24 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p20 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p17 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p26 <= 0) OR (p27 <= 1)))))",
"processed_size": 5598,
"rewrites": 39
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 18,
"adisj": 1,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "AG(EX(AF((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p28)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p28))))))",
"processed_size": 584,
"rewrites": 39
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 68312,
"markings": 6320,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 64,
"adisj": 2,
"aneg": 1,
"comp": 171,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 171,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "((((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) OR (((p9 <= 0) OR (p12 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p14 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p22 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p11 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p16 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p15 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p15 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p13 <= 0) OR (p31 <= 1)) AND ((p19 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p9 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p18 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p15 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p21 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p9 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p17 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p13 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p19 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p13 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p20 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p10 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p24 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p20 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p17 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p26 <= 0) OR (p27 <= 1))))",
"processed_size": 2651,
"rewrites": 38
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 711
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 63,
"adisj": 1,
"aneg": 1,
"comp": 171,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 171,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0)))",
"processed_size": 2517,
"rewrites": 40
},
"result":
{
"edges": 61308,
"markings": 6320,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 171,
"problems": 63
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 63,
"adisj": 1,
"aneg": 0,
"comp": 174,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 174,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5)))))",
"processed_size": 2570,
"rewrites": 37
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 711
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EG(A(((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7))))",
"processed_size": 144,
"rewrites": 38
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 3,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 45,
"adisj": 1,
"aneg": 0,
"comp": 135,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 135,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF(EG((((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5)))))",
"processed_size": 1985,
"rewrites": 38
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "CTL model checker",
"value": true
},
"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": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 108,
"adisj": 3,
"aneg": 0,
"comp": 306,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 306,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A(E((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8))) U (((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27)))) U (((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))",
"processed_size": 4763,
"rewrites": 38
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 22,
"markings": 13,
"produced_by": "CTL model checker",
"value": false
},
"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": 1182
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5))))",
"processed_size": 61,
"rewrites": 37
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 614
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3546
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 173,
"adisj": 5,
"aneg": 2,
"comp": 477,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 477,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E (((((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p14 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p28 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p16 <= 0) OR (p28 <= 0))) OR (((p13 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)) AND ((p18 <= 0) OR (p31 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p27 <= 0)) AND ((p17 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p25 <= 0) OR (p31 <= 0)) AND ((p24 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p26 <= 0) OR (p27 <= 0)) AND ((p14 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p28 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p16 <= 0) OR (p28 <= 0))))) R ((((p9 <= 0) OR (p12 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p14 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p22 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p11 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p16 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p15 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p15 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p13 <= 0) OR (p31 <= 1)) AND ((p19 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p9 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p18 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p15 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p21 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p9 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p17 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p13 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p19 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p13 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p20 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p10 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p24 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p20 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p17 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p26 <= 0) OR (p27 <= 1))) OR (((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0))))))",
"processed_size": 7233,
"rewrites": 39
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 711
},
"threads": 1,
"type": "dfs"
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 710048,
"runtime": 24.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((* R *)) : E(X(E(G(*)))) : E(F(A(G(**)))) : E(G(**)) : A(F(E(G(**)))) : A((E(X(*)) R E(G(*)))) : A((E((** U **)) U **)) : A(G(E(X(A(F(**)))))) : TRUE : A(F(A(G(**)))) : E(G(A((** U **)))) : (E(G(*)) OR DEADLOCK)"
},
"net":
{
"arcs": 4947,
"conflict_clusters": 7,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 711
},
"result":
{
"preliminary_value": "yes yes no yes yes yes no yes yes no yes yes ",
"value": "yes yes no yes yes yes no yes yes no 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: 744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 711 transitions, 21 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: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (3 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p5)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p19)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p17)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: LP says that atomic proposition is always false: (2 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: NOT(A (((((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5)) OR ((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p28)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p28))) AND (((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p28)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p28))))) U ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))) AND (((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5))))))) : E (X (NOT(A (F (((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8))) AND (((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))))))) : E (F (A (G ((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5))))))) : E (G (E (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5))))))) : A (F (E (G (E (G ((((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5))))))))) : NOT(E ((A (X ((((1 <= p2) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p7))))) U A (F ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27)))))))) : A ((E (((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8))) U (((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))) U (((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))))) : A (G (E (X (A (F ((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p28)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p28))))))))) : E (G (NOT(E (G ((1 <= 0)))))) : (E (G (A (((1 <= 0) U (1 <= 0))))) OR A (F (A (G (((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6))))))) : E (G (A ((((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7)))))) : (NOT(A (F (((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0))))) OR NOT(E (X ((0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:288
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 1 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(EX((((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p8... (shortened)
lola: processed formula length: 5598
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 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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (A (F ((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR... (shortened)
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:813
lola: processed formula: AG(EX(AF((((1 <= p13) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p31)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p27)) OR ((1 <= p17) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p25) AND (1 <= p31)) OR ((1 <= p24) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p26) AND (1 <= p27)) OR ((1 <= ... (shortened)
lola: processed formula length: 584
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 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: 6320 markings, 68312 edges
lola: ========================================
lola: subprocess 3 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= ... (shortened)
lola: processed formula length: 2651
lola: 38 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 3 markings, 3 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) OR (((p9 <= 0) OR (p12 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p14 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p22 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p11 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p16 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p15 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p15 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p13 <= 0) OR (p31 <= 1)) AND ((p19 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p9 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p18 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p15 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p13 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p12 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p21 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p9 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p17 <= 0) OR (p23 <= 0) OR (p28 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p9 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p13 <= 0) OR (p19 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p28 <= 1)) AND ((p14 <= 0) OR (p15 <= 0) OR (p27 <= 1)) AND ((p19 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p13 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p20 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p10 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p18 <= 0) OR (p31 <= 1)) AND ((p24 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p10 <= 0) OR (p21 <= 0) OR (p27 <= 1)) AND ((p20 <= 0) OR (p26 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p18 <= 0) OR (p24 <= 0) OR (p31 <= 1)) AND ((p17 <= 0) OR (p22 <= 0) OR (p28 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p28 <= 1)) AND ((p10 <= 0) OR (p20 <= 0) OR (p27 <= 1)) AND ((p11 <= 0) OR (p25 <= 0) OR (p31 <= 1)) AND ((p14 <= 0) OR (p26 <= 0) OR (p27 <= 1))))
lola: ========================================
lola: subprocess 4 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0... (shortened)
lola: processed formula length: 2517
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
lola: using tscc preserving stubborn set method (--stubborn)
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: 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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result rewrite finished id 0
lola: formula 1: (((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0)))
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 171 literals and 63 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 6320 markings, 61308 edges
lola: ========================================
lola: subprocess 5 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((4 <= p29) OR (4 <= p30) OR (4 <= p32) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 ... (shortened)
lola: processed formula length: 2570
lola: 37 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: 3 markings, 3 edges
lola: formula 0: ((p29 <= 3) AND (p30 <= 3) AND (p32 <= 3) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p3 <= 0)) AND ((p1 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p5 <= 0)))
lola: ========================================
lola: subprocess 6 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A(((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8)) U ((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7))))
lola: processed formula length: 144
lola: 38 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: 3 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) O... (shortened)
lola: processed formula length: 1985
lola: 38 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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(E((((1 <= p1) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p3)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <... (shortened)
lola: processed formula length: 4763
lola: 38 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5)))) OR DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 10 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p0) AND (1 <= p3) AND (1 <= p4) AND (1 <= p5))))
lola: processed formula length: 61
lola: 37 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: ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0) OR (p5 <= 0))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p0) AND (1 <= p4) AND (1 <= p5) AND (1 <= p6))))))
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: ((p0 <= 0) OR (p4 <= 0) OR (p5 <= 0) OR (p6 <= 0))
lola: processed formula length: 53
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 /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 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 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 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not eventually invariant.
lola: 8 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 3546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((((p2 <= 0) OR (p3 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p8 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p8 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p4 <= 0) OR (p5 <= 0)) AND... (shortened)
lola: processed formula length: 7233
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 /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:788
lola: state equation task get result rewrite finished id 0
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 3 markings, 3 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p9) AND (1 <= p12) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p14) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p22) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p11) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p16) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p15) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p15) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p13) AND (2 <= p31)) OR ((1 <= p19) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p9) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p18) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p15) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p13) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p12) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p21) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p9) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p17) AND (1 <= p23) AND (2 <= p28)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p9) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p13) AND (1 <= p19) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p28)) OR ((1 <= p14) AND (1 <= p15) AND (2 <= p27)) OR ((1 <= p19) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p13) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p20) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p10) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p18) AND (2 <= p31)) OR ((1 <= p24) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p10) AND (1 <= p21) AND (2 <= p27)) OR ((1 <= p20) AND (1 <= p26) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p18) AND (1 <= p24) AND (2 <= p31)) OR ((1 <= p17) AND (1 <= p22) AND (2 <= p28)) OR ((1 <= p16) AND (1 <= p17) AND (2 <= p28)) OR ((1 <= p10) AND (1 <= p20) AND (2 <= p27)) OR ((1 <= p11) AND (1 <= p25) AND (2 <= p31)) OR ((1 <= p14) AND (1 <= p26) AND (2 <= p27))) AND (((1 <= p2) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p5)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p5))))
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no yes yes no yes yes
lola:
preliminary result: yes yes no yes yes yes no yes yes no yes yes
lola: memory consumption: 710048 KB
lola: time consumption: 24 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="GlobalResAllocation-PT-03"
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 GlobalResAllocation-PT-03, 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 r184-oct2-158987928000060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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