Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987939000404.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 SafeBus-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939000404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 9 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 9 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 448K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591238527173

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:42:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:42:09] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2020-06-04 02:42:09] [INFO ] Transformed 144 places.
[2020-06-04 02:42:09] [INFO ] Transformed 451 transitions.
[2020-06-04 02:42:09] [INFO ] Parsed PT model containing 144 places and 451 transitions in 172 ms.
Reduce places removed 6 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 105 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 920 ms. (steps per millisecond=108 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1]
[2020-06-04 02:42:10] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2020-06-04 02:42:10] [INFO ] Computed 29 place invariants in 10 ms
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 38 ms returned sat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 17 ms returned unsat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned unsat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 2 ms returned unsat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned unsat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2020-06-04 02:42:11] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 2 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-04 02:42:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 02:42:11] [INFO ] Flatten gal took : 175 ms
[2020-06-04 02:42:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 02:42:11] [INFO ] Flatten gal took : 40 ms
FORMULA SafeBus-PT-06-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:42:11] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-04 02:42:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SafeBus-PT-06 @ 3570 seconds
check_solution: Constraint R2 = 4.68036364485e-310 is above its equality of -1
check_solution: Constraint R12 = 0 is above its equality of -1
check_solution: Constraint R19 = 0 is above its equality of -1
check_solution: Constraint R20 = 0 is above its equality of -1
check_solution: Constraint R21 = 0 is above its equality of -1
check_solution: Constraint R22 = 0 is above its equality of -1
check_solution: Constraint R23 = 0 is above its equality of -1
check_solution: Constraint R24 = 0 is above its equality of -1
check_solution: Constraint R37 = 0 is above its equality of -1
check_solution: Constraint R79 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA SafeBus-PT-06-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SafeBus-PT-06-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3325
rslt: Output for CTLFireability @ SafeBus-PT-06

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:42:12 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 225
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EX((((p111 <= 0) OR (p126 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p129 <= 0)) AND ((p110 <= 0) OR (p128 <= 0)) AND ((p110 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p130 <= 0)) AND ((p110 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (p126 <= 0)) AND ((p109 <= 0) OR (p131 <= 0)) AND ((p109 <= 0) OR (p130 <= 0)) AND ((p109 <= 0) OR (p129 <= 0)) AND ((p109 <= 0) OR (p128 <= 0)) AND ((p109 <= 0) OR (p127 <= 0)) AND ((p109 <= 0) OR (p126 <= 0)) AND ((p112 <= 0) OR (p127 <= 0)) AND ((p112 <= 0) OR (p126 <= 0)) AND ((p113 <= 0) OR (p131 <= 0)) AND ((p112 <= 0) OR (p129 <= 0)) AND ((p113 <= 0) OR (p130 <= 0)) AND ((p112 <= 0) OR (p128 <= 0)) AND ((p113 <= 0) OR (p129 <= 0)) AND ((p108 <= 0) OR (p127 <= 0)) AND ((p113 <= 0) OR (p128 <= 0)) AND ((p112 <= 0) OR (p131 <= 0)) AND ((p108 <= 0) OR (p126 <= 0)) AND ((p113 <= 0) OR (p127 <= 0)) AND ((p112 <= 0) OR (p130 <= 0)) AND ((p113 <= 0) OR (p126 <= 0)) AND ((p108 <= 0) OR (p129 <= 0)) AND ((p108 <= 0) OR (p128 <= 0)) AND ((p108 <= 0) OR (p131 <= 0)) AND ((p108 <= 0) OR (p130 <= 0))))",
"processed_size": 1225,
"rewrites": 31
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p130 <= 0) OR (p133 <= 0)) AND ((p130 <= 0) OR (p132 <= 0)) AND ((p130 <= 0) OR (p137 <= 0)) AND ((p130 <= 0) OR (p136 <= 0)) AND ((p130 <= 0) OR (p135 <= 0)) AND ((p130 <= 0) OR (p134 <= 0)) AND ((p126 <= 0) OR (p137 <= 0)) AND ((p126 <= 0) OR (p136 <= 0)) AND ((p126 <= 0) OR (p135 <= 0)) AND ((p126 <= 0) OR (p134 <= 0)) AND ((p129 <= 0) OR (p136 <= 0)) AND ((p129 <= 0) OR (p135 <= 0)) AND ((p129 <= 0) OR (p137 <= 0)) AND ((p126 <= 0) OR (p133 <= 0)) AND ((p129 <= 0) OR (p132 <= 0)) AND ((p126 <= 0) OR (p132 <= 0)) AND ((p129 <= 0) OR (p134 <= 0)) AND ((p129 <= 0) OR (p133 <= 0)) AND ((p128 <= 0) OR (p137 <= 0)) AND ((p128 <= 0) OR (p136 <= 0)) AND ((p128 <= 0) OR (p135 <= 0)) AND ((p128 <= 0) OR (p134 <= 0)) AND ((p127 <= 0) OR (p132 <= 0)) AND ((p128 <= 0) OR (p133 <= 0)) AND ((p128 <= 0) OR (p132 <= 0)) AND ((p131 <= 0) OR (p132 <= 0)) AND ((p131 <= 0) OR (p134 <= 0)) AND ((p131 <= 0) OR (p133 <= 0)) AND ((p131 <= 0) OR (p136 <= 0)) AND ((p131 <= 0) OR (p135 <= 0)) AND ((p127 <= 0) OR (p134 <= 0)) AND ((p127 <= 0) OR (p133 <= 0)) AND ((p131 <= 0) OR (p137 <= 0)) AND ((p127 <= 0) OR (p136 <= 0)) AND ((p127 <= 0) OR (p135 <= 0)) AND ((p127 <= 0) OR (p137 <= 0)))",
"processed_size": 1221,
"rewrites": 33
},
"result":
{
"edges": 2593,
"markings": 1286,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 78
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 72,
"problems": 36
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 120,
"adisj": 2,
"aneg": 0,
"comp": 240,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 240,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "EG((AX((((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130)))) AND (((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130)) OR ((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)) OR ((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <= p135)) OR ((1 <= p129) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p133)) OR ((1 <= p129) AND (1 <= p132)) OR ((1 <= p126) AND (1 <= p132)) OR ((1 <= p129) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p137)) OR ((1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p135)) OR ((1 <= p128) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p132)) OR ((1 <= p128) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p134)) OR ((1 <= p131) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p136)) OR ((1 <= p131) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p137)) OR ((1 <= p127) AND (1 <= p136)) OR ((1 <= p127) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p137)) OR ((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112)))))",
"processed_size": 4066,
"rewrites": 32
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 185,
"markings": 185,
"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": 260
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 260
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130)))",
"processed_size": 1221,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p92 <= 0) OR (p117 <= 0)) AND ((p90 <= 0) OR (p115 <= 0)) AND ((p94 <= 0) OR (p119 <= 0)) AND ((p89 <= 0) OR (p114 <= 0)) AND ((p91 <= 0) OR (p116 <= 0)) AND ((p93 <= 0) OR (p118 <= 0)))",
"processed_size": 195,
"rewrites": 33
},
"result":
{
"edges": 275,
"markings": 209,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 324
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 30,
"adisj": 1,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p2) AND (1 <= p31)) OR ((1 <= p2) AND (1 <= p30)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p32)) OR ((1 <= p2) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p2) AND (1 <= p28)) 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 <= p9)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12)))))",
"processed_size": 929,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 97
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 216,
"adisj": 1,
"aneg": 0,
"comp": 864,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 864,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p41) AND (1 <= p56) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p87) AND (1 <= p88)))))",
"processed_size": 13397,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AX((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99))))",
"processed_size": 188,
"rewrites": 31
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"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": 423
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 42,
"adisj": 1,
"aneg": 0,
"comp": 84,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 84,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "AX((((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <= p135)) OR ((1 <= p129) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p133)) OR ((1 <= p129) AND (1 <= p132)) OR ((1 <= p126) AND (1 <= p132)) OR ((1 <= p129) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p137)) OR ((1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p135)) OR ((1 <= p128) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p132)) OR ((1 <= p128) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p134)) OR ((1 <= p131) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p136)) OR ((1 <= p131) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p137)) OR ((1 <= p127) AND (1 <= p136)) OR ((1 <= p127) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p137)) OR ((1 <= p1) AND (1 <= p34)) OR ((1 <= p1) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p36)) OR ((1 <= p1) AND (1 <= p35)) OR ((1 <= p1) AND (1 <= p39))))",
"processed_size": 1411,
"rewrites": 31
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((1 <= p131) AND (1 <= p137) AND ((p131 <= 0) OR (p133 <= 0) OR (p43 <= 0) OR (p67 <= 0) OR (p84 <= 0) OR (p88 <= 0)))",
"processed_size": 123,
"rewrites": 33
},
"result":
{
"edges": 65,
"markings": 66,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 5
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AX((((p44 <= 0) OR (p72 <= 0) OR (p86 <= 0) OR (p88 <= 0)) AND ((p102 <= 0) OR (p114 <= 0))))",
"processed_size": 97,
"rewrites": 31
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AX((EF(((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88))) OR ((1 <= p0) AND (1 <= p25) AND (1 <= p88))))",
"processed_size": 112,
"rewrites": 32
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 21019,
"markings": 12659,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(AX(((p40 <= 0) OR (p46 <= 0) OR (p88 <= 0) OR (p101 <= 0))))",
"processed_size": 66,
"rewrites": 32
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 537,
"markings": 538,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((p40 <= 0) OR (p46 <= 0) OR (p87 <= 0) OR (p88 <= 0)) AND ((p43 <= 0) OR (p66 <= 0) OR (p83 <= 0) OR (p88 <= 0)))))",
"processed_size": 129,
"rewrites": 32
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 423
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)))))",
"processed_size": 192,
"rewrites": 31
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 483
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p1 <= 0) OR (p37 <= 0))",
"processed_size": 26,
"rewrites": 33
},
"result":
{
"edges": 74,
"markings": 74,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 25
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p0 <= 0) OR (p6 <= 0) OR (p88 <= 0))",
"processed_size": 40,
"rewrites": 33
},
"result":
{
"edges": 88,
"markings": 88,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 303
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 676
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))",
"processed_size": 195,
"rewrites": 33
},
"result":
{
"edges": 83,
"markings": 83,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 144
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 846
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p34 <= 0) OR (p120 <= 0)) AND ((p35 <= 0) OR (p121 <= 0)) AND ((p36 <= 0) OR (p122 <= 0)) AND ((p37 <= 0) OR (p123 <= 0)) AND ((p38 <= 0) OR (p124 <= 0)) AND ((p39 <= 0) OR (p125 <= 0)))",
"processed_size": 195,
"rewrites": 33
},
"result":
{
"edges": 2194,
"markings": 831,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 84
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1128
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EG(E(((1 <= p44) AND (1 <= p74) AND (1 <= p84) AND (1 <= p88)) U ((p106 <= 0) OR (p118 <= 0))))",
"processed_size": 96,
"rewrites": 32
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 160,
"markings": 77,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A(AF(((p43 <= 0) OR (p67 <= 0) OR (p83 <= 0) OR (p88 <= 0))) U AG(((1 <= p44) AND (1 <= p70) AND (1 <= p83) AND (1 <= p88))))",
"processed_size": 128,
"rewrites": 33
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 273,
"markings": 91,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3384
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))))",
"processed_size": 203,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))))",
"processed_size": 203,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p34 <= 0)) AND ((p1 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p36 <= 0)) AND ((p1 <= 0) OR (p35 <= 0)) AND ((p1 <= 0) OR (p39 <= 0)))",
"processed_size": 183,
"rewrites": 33
},
"result":
{
"edges": 29030832,
"markings": 6816756,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 384,
"problems": 64
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 361436,
"runtime": 245.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : A(F(**)) : (E(X(*)) OR A(X(A(F(**))))) : E(F(**)) : E(G((A(X(**)) AND **))) : (E(G(**)) OR (A(F(**)) OR (A(X(**)) OR (A(G(**)) OR (A(X(**)) AND **))))) : (A(G(E(F(*)))) OR A(G(*))) : A(F(**)) : A(G(*)) : A(X(A(G(**)))) : A(F(**)) : (A(X(**)) AND A(X((E(F(**)) OR **)))) : A((A(F(**)) U A(G(**)))) : A(F(A(X(*)))) : E(G(E((** U **))))"
},
"net":
{
"arcs": 2908,
"conflict_clusters": 7,
"places": 138,
"places_significant": 109,
"singleton_clusters": 0,
"transitions": 451
},
"result":
{
"preliminary_value": "no no no yes yes no yes no no no no yes no yes yes ",
"value": "no no no yes yes no yes no no no no 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: 589/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4416
lola: finding significant places
lola: 138 places, 451 transitions, 109 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: A (F ((((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112))))) : A (F (A (F (A (F ((((1 <= p34) AND (1 <= p120)) OR ((1 <= p35) AND (1 <= p121)) OR ((1 <= p36) AND (1 <= p122)) OR ((1 <= p37) AND (1 <= p123)) OR ((1 <= p38) AND (1 <= p124)) OR ((1 <= p39) AND (1 <= p125))))))))) : (NOT(A (X ((((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130)))))) OR A (X (A (F ((((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <= p135)) OR ((1 <= p129) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p133)) OR ((1 <= p129) AND (1 <= p132)) OR ((1 <= p126) AND (1 <= p132)) OR ((1 <= p129) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p137)) OR ((1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p135)) OR ((1 <= p128) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p132)) OR ((1 <= p128) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p134)) OR ((1 <= p131) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p136)) OR ((1 <= p131) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p137)) OR ((1 <= p127) AND (1 <= p136)) OR ((1 <= p127) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p137)))))))) : E (F ((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99))))) : E (G ((A (X ((((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130))))) AND (((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130)) OR ((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)) OR ((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <= p135)) OR ((1 <= p129) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p133)) OR ((1 <= p129) AND (1 <= p132)) OR ((1 <= p126) AND (1 <= p132)) OR ((1 <= p129) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p137)) OR ((1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p135)) OR ((1 <= p128) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p132)) OR ((1 <= p128) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p134)) OR ((1 <= p131) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p136)) OR ((1 <= p131) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p137)) OR ((1 <= p127) AND (1 <= p136)) OR ((1 <= p127) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p137)) OR ((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112)))))) : ((((E (G ((((1 <= p2) AND (1 <= p31)) OR ((1 <= p2) AND (1 <= p30)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p32)) OR ((1 <= p2) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p2) AND (1 <= p28)) 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 <= p9)) OR ((1 <= p2) AND (1 <= p8)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12))))) OR A (F ((((1 <= p92) AND (1 <= p117)) OR ((1 <= p90) AND (1 <= p115)) OR ((1 <= p94) AND (1 <= p119)) OR ((1 <= p89) AND (1 <= p114)) OR ((1 <= p91) AND (1 <= p116)) OR ((1 <= p93) AND (1 <= p118)))))) OR A (X ((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)))))) OR A (G ((((1 <= p41) AND (1 <= p56) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p53) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p51) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p61) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p56) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p81) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p65) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p72) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p48) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p69) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p60) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p50) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p78) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p47) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p70) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p55) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p67) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p64) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p77) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p75) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p62) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p73) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p46) AND (1 <= p84) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p68) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p63) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p79) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p40) AND (1 <= p49) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p54) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p76) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p71) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p44) AND (1 <= p74) AND (1 <= p87) AND (1 <= p88)))))) OR (A (X ((((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <= p135)) OR ((1 <= p129) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p133)) OR ((1 <= p129) AND (1 <= p132)) OR ((1 <= p126) AND (1 <= p132)) OR ((1 <= p129) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p137)) OR ((1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p135)) OR ((1 <= p128) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p132)) OR ((1 <= p128) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p134)) OR ((1 <= p131) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p136)) OR ((1 <= p131) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p137)) OR ((1 <= p127) AND (1 <= p136)) OR ((1 <= p127) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p137)) OR ((1 <= p1) AND (1 <= p34)) OR ((1 <= p1) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p36)) OR ((1 <= p1) AND (1 <= p35)) OR ((1 <= p1) AND (1 <= p39))))) AND (((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p126)) OR ((1 <= p109) AND (1 <= p131)) OR ((1 <= p109) AND (1 <= p130)) OR ((1 <= p109) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p128)) OR ((1 <= p109) AND (1 <= p127)) OR ((1 <= p109) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p131)) OR ((1 <= p112) AND (1 <= p129)) OR ((1 <= p113) AND (1 <= p130)) OR ((1 <= p112) AND (1 <= p128)) OR ((1 <= p113) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p127)) OR ((1 <= p113) AND (1 <= p128)) OR ((1 <= p112) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p126)) OR ((1 <= p113) AND (1 <= p127)) OR ((1 <= p112) AND (1 <= p130)) OR ((1 <= p113) AND (1 <= p126)) OR ((1 <= p108) AND (1 <= p129)) OR ((1 <= p108) AND (1 <= p128)) OR ((1 <= p108) AND (1 <= p131)) OR ((1 <= p108) AND (1 <= p130))))) : (NOT(E (F (A (G ((((1 <= p1) AND (1 <= p34)) OR ((1 <= p1) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p36)) OR ((1 <= p1) AND (1 <= p35)) OR ((1 <= p1) AND (1 <= p39)))))))) OR NOT(E (F ((((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112))))))) : A (F (((1 <= p0) AND (1 <= p6) AND (1 <= p88)))) : NOT(E (F (A (F ((((1 <= p40) AND (1 <= p46) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p83) AND (1 <= p88)))))))) : A (G (A (X (((p131 <= 0) OR (p137 <= 0) OR ((1 <= p131) AND (1 <= p133) AND (1 <= p43) AND (1 <= p67) AND (1 <= p84) AND (1 <= p88))))))) : A (F (((1 <= p1) AND (1 <= p37)))) : A (X (((((p44 <= 0) OR (p72 <= 0) OR (p86 <= 0) OR (p88 <= 0)) AND ((p102 <= 0) OR (p114 <= 0))) AND (E (F (((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88)))) OR ((1 <= p0) AND (1 <= p25) AND (1 <= p88)))))) : A ((A (F (((p43 <= 0) OR (p67 <= 0) OR (p83 <= 0) OR (p88 <= 0)))) U A (G (((1 <= p44) AND (1 <= p70) AND (1 <= p83) AND (1 <= p88)))))) : A (((0 <= 0) U NOT(E (X (((1 <= p40) AND (1 <= p46) AND (1 <= p88) AND (1 <= p101))))))) : E (G (E ((((1 <= p44) AND (1 <= p74) AND (1 <= p84) AND (1 <= p88)) U ((p106 <= 0) OR (p118 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((p111 <= 0) OR (p126 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p129 <= 0)) AND ((p110 <= 0) OR (p128 <= 0)) AND ((p110 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p130 <= 0)) AND ((p110 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p111 <= 0) OR (p126 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p129 <= 0)) AND ((p110 <= 0) OR (p128 <= 0)) AND ((p110 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p130 <= 0)) AND ((p110 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p111 <= 0) OR (p126 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p129 <= 0)) AND ((p110 <= 0) OR (p128 <= 0)) AND ((p110 <= 0) OR (p131 <= 0)) AND ((p110 <= 0) OR (p130 <= 0)) AND ((p110 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (p126... (shortened)
lola: processed formula length: 1225
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p130 <= 0) OR (p133 <= 0)) AND ((p130 <= 0) OR (p132 <= 0)) AND ((p130 <= 0) OR (p137 <= 0)) AND ((p130 <= 0) OR (p136 <= 0)) AND ((p130 <= 0) OR (p135 <= 0)) AND ((p130 <= 0) OR (p134 <= 0)) AND ((p126 <= 0) OR (p137 <= 0)) AND ((p126 <= 0) OR (p136 <= 0)) AND ((p126 <= 0) OR (p135 <= 0)) AND ((p126 <= 0) OR (p134 <= 0)) AND ((p129 <= 0) OR (p136 <= 0)) AND ((p129 <= 0) OR (p135 <=... (shortened)
lola: processed formula length: 1221
lola: 33 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: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <= p135)) OR ((1 <= p129) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p133)) OR ((1 <= p129) AND (1 <= p132)) OR ((1 <= p126) AND (1 <= p132)) OR ((1 <= p129) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p137)) OR ((1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p135)) OR ((1 <= p128) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p132)) OR ((1 <= p128) AND (1 <= p133)) OR ((1 <= p128) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p132)) OR ((1 <= p131) AND (1 <= p134)) OR ((1 <= p131) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p136)) OR ((1 <= p131) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p134)) OR ((1 <= p127) AND (1 <= p133)) OR ((1 <= p131) AND (1 <= p137)) OR ((1 <= p127) AND (1 <= p136)) OR ((1 <= p127) AND (1 <= p135)) OR ((1 <= p127) AND (1 <= p137)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 36 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 1286 markings, 2593 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AX((((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (... (shortened)
lola: processed formula length: 4066
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 185 markings, 185 edges
lola: ========================================
lola: subprocess 2 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p2) AND (1 <= p31)) OR ((1 <= p2) AND (1 <= p30)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p32)) OR ((1 <= p2) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p2) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p111) AND (1 <= p126)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p129)) OR ((1 <= p110) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p131)) OR ((1 <= p110) AND (1 <= p130)) OR ((1 <= p110) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p1... (shortened)
lola: processed formula length: 1221
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 72 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p92) AND (1 <= p117)) OR ((1 <= p90) AND (1 <= p115)) OR ((1 <= p94) AND (1 <= p119)) OR ((1 <= p89) AND (1 <= p114)) OR ((1 <= p91) AND (1 <= p116)) OR ((1 <= p93) AND (1 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p92 <= 0) OR (p117 <= 0)) AND ((p90 <= 0) OR (p115 <= 0)) AND ((p94 <= 0) OR (p119 <= 0)) AND ((p89 <= 0) OR (p114 <= 0)) AND ((p91 <= 0) OR (p116 <= 0)) AND ((p93 <= 0) OR (p118 <= 0)))
lola: processed formula length: 195
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: formula 0: (((1 <= p92) AND (1 <= p117)) OR ((1 <= p90) AND (1 <= p115)) OR ((1 <= p94) AND (1 <= p119)) OR ((1 <= p89) AND (1 <= p114)) OR ((1 <= p91) AND (1 <= p116)) OR ((1 <= p93) AND (1 <= p118)))
lola: state equation task get result unparse finished id 0
lola: 209 markings, 275 edges
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p2) AND (1 <= p31)) OR ((1 <= p2) AND (1 <= p30)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p32)) OR ((1 <= p2) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p2) AND (1 <= p31)) OR ((1 <= p2) AND (1 <= p30)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p32)) OR ((1 <= p2) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= ... (shortened)
lola: processed formula length: 929
lola: 31 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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p2 <= 0) OR (p31 <= 0)) AND ((p2 <= 0) OR (p30 <= 0)) AND ((p2 <= 0) OR (p33 <= 0)) AND ((p2 <= 0) OR (p32 <= 0)) AND ((p2 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p19 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p2 <= 0) OR (p21 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p25 <= 0)) AND ((p2 <= 0) OR (p24 <= 0)) AND ((p2 <= 0) OR (p27 <= 0)) AND ((p2 <= 0) OR (p26 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p2 <= 0) OR (p28 <= 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 (p9 <= 0)) AND ((p2 <= 0) OR (p8 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))
lola: ========================================
lola: subprocess 5 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p41) AND (1 <= p56) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p41) AND (1 <= p56) AND (1 <= p86) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p59) AND (1 <= p82) AND (1 <= p88)) OR ((1 <= p42) AND (1 <= p58) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p45) AND (1 <= p80) AND (1 <= p85) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p57) AND (1 <= p83) AND (1 <= p88)) OR ((1 <= p41) AND (1 <= p52) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p42) AND (1 <=... (shortened)
lola: processed formula length: 13397
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: SUBRESULT
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: result: no
lola: produced by: state space
lola: state equation task get result rewrite finished id 0
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99))))
lola: processed formula length: 188
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p130) AND (1 <= p133)) OR ((1 <= p130) AND (1 <= p132)) OR ((1 <= p130) AND (1 <= p137)) OR ((1 <= p130) AND (1 <= p136)) OR ((1 <= p130) AND (1 <= p135)) OR ((1 <= p130) AND (1 <= p134)) OR ((1 <= p126) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p136)) OR ((1 <= p126) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p134)) OR ((1 <= p129) AND (1 <= p136)) OR ((1 <= p129) AND (1 <=... (shortened)
lola: processed formula length: 1411
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p131 <= 0) OR (p137 <= 0) OR ((1 <= p131) AND (1 <= p133) AND (1 <= p43) AND (1 <= p67) AND (1 <= p84) AND (1 <= p88)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p131) AND (1 <= p137) AND ((p131 <= 0) OR (p133 <= 0) OR (p43 <= 0) OR (p67 <= 0) OR (p84 <= 0) OR (p88 <= 0)))
lola: processed formula length: 123
lola: 33 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
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 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p131) AND (1 <= p137) AND ((p131 <= 0) OR (p133 <= 0) OR (p43 <= 0) OR (p67 <= 0) OR (p84 <= 0) OR (p88 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 66 markings, 65 edges
lola: ========================================
lola: subprocess 4 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p44 <= 0) OR (p72 <= 0) OR (p86 <= 0) OR (p88 <= 0)) AND ((p102 <= 0) OR (p114 <= 0))))) AND A (X ((E (F (((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88)))) OR ((1 <= p0) AND (1 <= p25) AND (1 <= p88))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p44 <= 0) OR (p72 <= 0) OR (p86 <= 0) OR (p88 <= 0)) AND ((p102 <= 0) OR (p114 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p44 <= 0) OR (p72 <= 0) OR (p86 <= 0) OR (p88 <= 0)) AND ((p102 <= 0) OR (p114 <= 0))))
lola: processed formula length: 97
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F (((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88)))) OR ((1 <= p0) AND (1 <= p25) AND (1 <= p88)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EF(((1 <= p41) AND (1 <= p53) AND (1 <= p86) AND (1 <= p88))) OR ((1 <= p0) AND (1 <= p25) AND (1 <= p88))))
lola: processed formula length: 112
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12659 markings, 21019 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((p40 <= 0) OR (p46 <= 0) OR (p88 <= 0) OR (p101 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((p40 <= 0) OR (p46 <= 0) OR (p88 <= 0) OR (p101 <= 0))))
lola: processed formula length: 66
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 538 markings, 537 edges
lola: ========================================
lola: subprocess 6 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p40 <= 0) OR (p46 <= 0) OR (p87 <= 0) OR (p88 <= 0)) AND ((p43 <= 0) OR (p66 <= 0) OR (p83 <= 0) OR (p88 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p40 <= 0) OR (p46 <= 0) OR (p87 <= 0) OR (p88 <= 0)) AND ((p43 <= 0) OR (p66 <= 0) OR (p83 <= 0) OR (p88 <= 0)))))
lola: processed formula length: 129
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p40) AND (1 <= p46) AND (1 <= p87) AND (1 <= p88)) OR ((1 <= p43) AND (1 <= p66) AND (1 <= p83) AND (1 <= p88)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)))))
lola: processed formula length: 192
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3) AND (1 <= p95)) OR ((1 <= p3) AND (1 <= p96)) OR ((1 <= p3) AND (1 <= p98)) OR ((1 <= p3) AND (1 <= p97)) OR ((1 <= p3) AND (1 <= p100)) OR ((1 <= p3) AND (1 <= p99)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: subprocess 8 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p1) AND (1 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 0) OR (p37 <= 0))
lola: processed formula length: 26
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1) AND (1 <= p37))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
========================================lola:
The predicate does not eventually occur.
lola: 74 markings, 74 edges
lola: ========================================
lola: subprocess 9 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p0) AND (1 <= p6) AND (1 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p6 <= 0) OR (p88 <= 0))
lola: processed formula length: 40
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p6) AND (1 <= p88))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 88 markings, 88 edges
lola: ========================================
lola: subprocess 10 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))
lola: processed formula length: 195
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 83 markings, 83 edges
lola: subprocess 11 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p34) AND (1 <= p120)) OR ((1 <= p35) AND (1 <= p121)) OR ((1 <= p36) AND (1 <= p122)) OR ((1 <= p37) AND (1 <= p123)) OR ((1 <= p38) AND (1 <= p124)) OR ((1 <= p39) AND (1 <= p125)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p34 <= 0) OR (p120 <= 0)) AND ((p35 <= 0) OR (p121 <= 0)) AND ((p36 <= 0) OR (p122 <= 0)) AND ((p37 <= 0) OR (p123 <= 0)) AND ((p38 <= 0) OR (p124 <= 0)) AND ((p39 <= 0) OR (p125 <= 0)))
lola: processed formula length: 195
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p34) AND (1 <= p120)) OR ((1 <= p35) AND (1 <= p121)) OR ((1 <= p36) AND (1 <= p122)) OR ((1 <= p37) AND (1 <= p123)) OR ((1 <= p38) AND (1 <= p124)) OR ((1 <= p39) AND (1 <= p125)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 831 markings, 2194 edges
lola: ========================================
lola: subprocess 12 will run for 1128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((((1 <= p44) AND (1 <= p74) AND (1 <= p84) AND (1 <= p88)) U ((p106 <= 0) OR (p118 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: ========================================
lola: processed formula: EG(E(((1 <= p44) AND (1 <= p74) AND (1 <= p84) AND (1 <= p88)) U ((p106 <= 0) OR (p118 <= 0))))
lola: processed formula length: 96
lola: 32 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: 77 markings, 160 edges
lola: ========================================
lola: subprocess 13 will run for 1692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F (((p43 <= 0) OR (p67 <= 0) OR (p83 <= 0) OR (p88 <= 0)))) U A (G (((1 <= p44) AND (1 <= p70) AND (1 <= p83) AND (1 <= p88))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AF(((p43 <= 0) OR (p67 <= 0) OR (p83 <= 0) OR (p88 <= 0))) U AG(((1 <= p44) AND (1 <= p70) AND (1 <= p83) AND (1 <= p88))))
lola: processed formula length: 128
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 91 markings, 273 edges
lola: ========================================
lola: subprocess 14 will run for 3384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((((p1 <= 0) OR (p34 <= 0)) AND ((p1 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p36 <= 0)) AND ((p1 <= 0) OR (p35 <= 0)) AND ((p1 <= 0) OR (p39 <= 0))))))) OR A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))))
lola: processed formula length: 203
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p36) AND (1 <= p110)) OR ((1 <= p35) AND (1 <= p109)) OR ((1 <= p37) AND (1 <= p111)) OR ((1 <= p39) AND (1 <= p113)) OR ((1 <= p34) AND (1 <= p108)) OR ((1 <= p38) AND (1 <= p112)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((((p1 <= 0) OR (p34 <= 0)) AND ((p1 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p36 <= 0)) AND ((p1 <= 0) OR (p35 <= 0)) AND ((p1 <= 0) OR (p39 <= 0))))))) OR A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p36 <= 0) OR (p110 <= 0)) AND ((p35 <= 0) OR (p109 <= 0)) AND ((p37 <= 0) OR (p111 <= 0)) AND ((p39 <= 0) OR (p113 <= 0)) AND ((p34 <= 0) OR (p108 <= 0)) AND ((p38 <= 0) OR (p112 <= 0)))))
lola: processed formula length: 203
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((p1 <= 0) OR (p34 <= 0)) AND ((p1 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p36 <= 0)) AND ((p1 <= 0) OR (p35 <= 0)) AND ((p1 <= 0) OR (p39 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((p1 <= 0) OR (p34 <= 0)) AND ((p1 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p36 <= 0)) AND ((p1 <= 0) OR (p35 <= 0)) AND ((p1 <= 0) OR (p39 <= 0)))
lola: processed formula length: 183
lola: 33 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: 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 started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((1 <= p1) AND (1 <= p34)) OR ((1 <= p1) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p36)) OR ((1 <= p1) AND (1 <= p35)) OR ((1 <= p1) AND (1 <= p39)))
lola: state equation task get result unparse finished id 0
lola: formula 1: (((p1 <= 0) OR (p34 <= 0)) AND ((p1 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p36 <= 0)) AND ((p1 <= 0) OR (p35 <= 0)) AND ((p1 <= 0) OR (p39 <= 0)))
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 384 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: write sara problem file to CTLFireability-16-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-0.sara.
sara: try reading problem file CTLFireability-16-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1091426 markings, 2643991 edges, 218285 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2016440 markings, 5444950 edges, 185003 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2700520 markings, 7787737 edges, 136816 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3291055 markings, 9959084 edges, 118107 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3854274 markings, 12204469 edges, 112644 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4421687 markings, 14562606 edges, 113483 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4960920 markings, 16885526 edges, 107847 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 5508177 markings, 19323016 edges, 109451 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6104295 markings, 22094786 edges, 119224 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 6606166 markings, 24971229 edges, 100374 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 6759283 markings, 27271069 edges, 30623 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 6816756 markings, 29030832 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no no no yes no yes yes
lola:
preliminary result: no no no yes yes no yes no no no no yes no yes yes
lola: memory consumption: 361436 KB
lola: time consumption: 245 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="SafeBus-PT-06"
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 SafeBus-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939000404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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