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.r182-oct2-158987913700300.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 BridgeAndVehicles-PT-V10P10N10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 7.4K Mar 26 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 25 20:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 25 20:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27K Mar 25 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 25 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 311K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591142547249

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:02:28] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-06-03 00:02:28] [INFO ] Transformed 48 places.
[2020-06-03 00:02:28] [INFO ] Transformed 288 transitions.
[2020-06-03 00:02:28] [INFO ] Parsed PT model containing 48 places and 288 transitions in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100000 steps, including 1109 resets, run finished after 305 ms. (steps per millisecond=327 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0]
[2020-06-03 00:02:29] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2020-06-03 00:02:29] [INFO ] Computed 7 place invariants in 4 ms
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 00:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-06-03 00:02:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-03 00:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:29] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-03 00:02:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:02:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-06-03 00:02:29] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 16 ms.
[2020-06-03 00:02:29] [INFO ] Added : 76 causal constraints over 16 iterations in 266 ms. Result :sat
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 00:02:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:29] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 00:02:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2020-06-03 00:02:29] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 12 ms.
[2020-06-03 00:02:29] [INFO ] Added : 80 causal constraints over 16 iterations in 223 ms. Result :sat
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-03 00:02:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-06-03 00:02:30] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2020-06-03 00:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2020-06-03 00:02:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-03 00:02:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2020-06-03 00:02:30] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 13 ms.
[2020-06-03 00:02:30] [INFO ] Added : 67 causal constraints over 14 iterations in 219 ms. Result :sat
[2020-06-03 00:02:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-03 00:02:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 00:02:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-06-03 00:02:30] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 15 ms.
[2020-06-03 00:02:30] [INFO ] Added : 80 causal constraints over 17 iterations in 440 ms. Result :sat
[2020-06-03 00:02:31] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-03 00:02:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-03 00:02:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2020-06-03 00:02:31] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 23 ms.
[2020-06-03 00:02:31] [INFO ] Added : 75 causal constraints over 15 iterations in 244 ms. Result :sat
[2020-06-03 00:02:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-03 00:02:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:02:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:02:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-03 00:02:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-06-03 00:02:31] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 14 ms.
[2020-06-03 00:02:31] [INFO ] Added : 69 causal constraints over 14 iterations in 182 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 00:02:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 00:02:31] [INFO ] Flatten gal took : 57 ms
[2020-06-03 00:02:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 00:02:31] [INFO ] Flatten gal took : 23 ms
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:02:31] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2020-06-03 00:02:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BridgeAndVehicles-PT-V10P10N10 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3218
rslt: Output for CTLFireability @ BridgeAndVehicles-PT-V10P10N10

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 214
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 47,
"adisj": 5,
"aneg": 0,
"comp": 112,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 112,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (((((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)) OR ((((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36))) AND (((1 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47))))) U ((p13 <= 0) OR ((1 <= p32) AND (((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)))))))",
"processed_size": 1783,
"rewrites": 93
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 266
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 150,
"problems": 43
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 230
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"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": 6,
"visible_transitions": 0
},
"processed": "(((p30 <= 0) OR (p47 <= 0)) AND ((p31 <= 0) OR (p47 <= 0)) AND ((p15 <= 9) OR (p34 <= 0)) AND ((p15 <= 9) OR (p33 <= 0)))",
"processed_size": 125,
"rewrites": 91
},
"result":
{
"edges": 25007,
"markings": 8086,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 248
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 230
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 12,
"adisj": 2,
"aneg": 1,
"comp": 44,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A(EX((((p15 <= 0) OR (p17 <= 0) OR (p22 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p23 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p21 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p19 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p25 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p29 <= 0)))) U EG((((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33)))))",
"processed_size": 694,
"rewrites": 91
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 508,
"markings": 318,
"produced_by": "CTL model checker",
"value": false
},
"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": 248
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 1,
"aneg": 1,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EG(AF((((p28 <= 0) OR (p36 <= 0)) AND ((p22 <= 0) OR (p36 <= 0)) AND ((p23 <= 0) OR (p36 <= 0)) AND ((p21 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)))))",
"processed_size": 357,
"rewrites": 90
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 678006,
"markings": 249835,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 268
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(EF(AG(((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)))))",
"processed_size": 68,
"rewrites": 91
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 1080893,
"markings": 259555,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44))))",
"processed_size": 64,
"rewrites": 89
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)) OR (((p31 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p44 <= 0) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)))))",
"processed_size": 214,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 358
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(AX(((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46))))",
"processed_size": 64,
"rewrites": 90
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 821281,
"markings": 259556,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 357
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(AF(((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39))))",
"processed_size": 64,
"rewrites": 90
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 175,
"markings": 175,
"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": 402
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38))))",
"processed_size": 64,
"rewrites": 89
},
"result":
{
"edges": 736981,
"markings": 245591,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 460
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44))",
"processed_size": 56,
"rewrites": 91
},
"result":
{
"edges": 141,
"markings": 142,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 536
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (G ((((p8 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p11 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p10 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)))))",
"processed_size": 617,
"rewrites": 89
},
"result":
{
"edges": 29438,
"markings": 9704,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 265
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 10
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 644
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 122,
"adisj": 2,
"aneg": 0,
"comp": 464,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 464,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 26,
"visible_transitions": 0
},
"processed": "(((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)) OR ((((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p47)) OR (1 <= p13)) AND (p13 <= 0)))",
"processed_size": 7093,
"rewrites": 91
},
"result":
{
"edges": 409473,
"markings": 142378,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 276
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 804
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 30,
"adisj": 2,
"aneg": 0,
"comp": 120,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 0,
"tdisj": 10,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "AF((A((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p10) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16))) U (((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29)))) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR (((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29)))))))))))))",
"processed_size": 1866,
"rewrites": 90
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 43543,
"markings": 10364,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((((p5 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p42 <= 0) OR (p3 <= 0) OR (p37 <= 0)) OR (G (((p10 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p38 <= 0))) OR ((1 <= p11) AND (1 <= p38)))))",
"processed_size": 189,
"rewrites": 100
},
"result":
{
"edges": 909095,
"markings": 244465,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1609
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))",
"processed_size": 56,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0)) AND ((p9 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p45 <= 0)))",
"processed_size": 180,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 44,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p10) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33)))))",
"processed_size": 683,
"rewrites": 90
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 110,
"adisj": 1,
"aneg": 0,
"comp": 440,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 440,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "EG(AF((((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)))))",
"processed_size": 6737,
"rewrites": 90
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"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": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))",
"processed_size": 56,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40))))",
"processed_size": 64,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 148
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p40 <= 0))",
"processed_size": 56,
"rewrites": 91
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 148
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 309816,
"runtime": 352.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((A(G(**)) AND A(G(**))) OR (** OR E(G(A(F(**)))))) : A(F((A((** U **)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : E(G(*)) : A(F(*)) : (A(X(A(F(**)))) AND A((** U **))) : A((E(X(*)) U E(G(**)))) : (E(G(A(F(*)))) AND A(X(A(X(**))))) : E(X(E(F(A(G(**)))))) : (E(G(A(X(**)))) OR (E(F(**)) OR E(F(E(G(**)))))) : (A(F(**)) OR (DEADLOCK OR (** OR (E(G(**)) AND (** AND (** AND **)))))) : (A(F(A(X(**)))) AND (** OR **)) : E(X(A(F(**)))) : A(G(E(F(**)))) : E(F((** AND (E(F(**)) AND **)))) : E(F(**))"
},
"net":
{
"arcs": 2090,
"conflict_clusters": 5,
"places": 48,
"places_significant": 41,
"singleton_clusters": 0,
"transitions": 288
},
"result":
{
"preliminary_value": "no yes no yes yes no yes no yes no yes no no no no ",
"value": "no yes no yes yes no yes no yes no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1536
lola: finding significant places
lola: 48 places, 288 transitions, 41 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 (G (((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p10) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33))) AND E (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p11)) OR ((1 <= p0) AND (1 <= p10)))))))) OR (1 <= p13)) OR E (G (A (F ((((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p37)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)))))))) : A (F (((((((((((A (((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p10) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16))) U (((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29))))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29))) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29))))) : NOT(A (F ((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p10) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)))))) : NOT(E (G ((((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)) OR ((((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p26) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p47)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p25) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p38)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p43)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p41)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p46)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p23) AND (1 <= p42)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p27) AND (1 <= p47)) OR (1 <= p13)) AND (p13 <= 0)))))) : (A (X (A (F ((((1 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47)) OR ((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33))))))) AND A (((((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)) OR ((((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36))) AND (((1 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47))))) U ((p13 <= 0) OR ((1 <= p32) AND (((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)))))))) : A ((NOT(A (X ((((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29)))))) U E (G ((((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33))))))) : (NOT(A (F (E (G ((((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)))))))) AND A (X (A (X ((((p15 <= 9) OR (p34 <= 0)) AND ((p15 <= 9) OR (p33 <= 0)))))))) : E (F (E (X (A (G (((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)))))))) : (E (G (A (X (((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p42)))))) OR E (F ((A (F (((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44)))) OR E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p42)))))))) : (((A (F (((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)))) OR A (X ((1 <= 0)))) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))) OR (((E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40)))) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0))) AND ((p9 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p41 <= 0))) AND ((p3 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p45 <= 0)))) : ((A (F (A (X (((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)))))) OR (((1 <= p30) AND (1 <= p47)) AND E (X ((1 <= 0))))) AND (A (((1 <= 0) U ((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)))) OR (((p31 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p44 <= 0) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)))))) : E (X (A (F (((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39)))))) : NOT(E (F (NOT(E (F (((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)))))))) : E (F (((((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42) AND (1 <= p3) AND (1 <= p37)) AND E (F (((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38))))) AND ((p11 <= 0) OR (p38 <= 0))))) : E (F (((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38))))
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:458
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: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: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: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: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: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: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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((((1 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47)) OR ((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33))))))) AND A (((((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p... (shortened)
lola: processed formula length: 1783
lola: 93 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
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 <= p15) AND (1 <= p17) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p27) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p25) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)) OR ((((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36))) AND (((1 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 150 literals and 43 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((1 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47)) OR ((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33)))))))
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: (((p30 <= 0) OR (p47 <= 0)) AND ((p31 <= 0) OR (p47 <= 0)) AND ((p15 <= 9) OR (p34 <= 0)) AND ((p15 <= 9) OR (p33 <= 0)))
lola: processed formula length: 125
lola: 91 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: calling and running sara
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 <= p30) AND (1 <= p47)) OR ((1 <= p31) AND (1 <= p47)) OR ((10 <= p15) AND (1 <= p34)) OR ((10 <= p15) AND (1 <= p33)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
sara: try reading problem file CTLFireability-0.sara.
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 8086 markings, 25007 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((((p15 <= 0) OR (p17 <= 0) OR (p22 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p23 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p21 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p19 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((((p15 <= 0) OR (p17 <= 0) OR (p22 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p23 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p21 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p19 <= 0) OR (p29 <= 0)) AND ((p15 <= 0) OR (p17 <... (shortened)
lola: processed formula length: 694
lola: 91 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 318 markings, 508 edges
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((((p28 <= 0) OR (p36 <= 0)) AND ((p22 <= 0) OR (p36 <= 0)) AND ((p23 <= 0) OR (p36 <= 0)) AND ((p21 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p27 <= 0) OR (p36 <= 0))))))) AND A (X (A (X ((((p15 <= 9) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((((p28 <= 0) OR (p36 <= 0)) AND ((p22 <= 0) OR (p36 <= 0)) AND ((p23 <= 0) OR (p36 <= 0)) AND ((p21 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((((p28 <= 0) OR (p36 <= 0)) AND ((p22 <= 0) OR (p36 <= 0)) AND ((p23 <= 0) OR (p36 <= 0)) AND ((p21 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)))))
lola: processed formula length: 357
lola: 90 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: 249835 markings, 678006 edges
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X ((((p15 <= 9) OR (p34 <= 0)) AND ((p15 <= 9) OR (p33 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AX((((p15 <= 9) OR (p34 <= 0)) AND ((p15 <= 9) OR (p33 <= 0)))))
lola: processed formula length: 69
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (A (G (((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EF(AG(((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)))))
lola: processed formula length: 68
lola: 91 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 259555 markings, 1080893 edges
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X (((1 <= p1) AND (1 <= p16) AND (1 <= p28) AND (1 <= p42)))))) OR (E (F (((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44)))) OR E (F (E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p20) AND (1 <= p42))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44))))
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 <= p1) AND (1 <= p16) AND (1 <= p24) AND (1 <= p44))))
lola: processed formula length: 64
lola: 89 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X (((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)))))) AND (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)) OR (((p31 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p44 <= 0) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)) OR (((p31 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p44 <= 0) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p42)) OR (((p31 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p44 <= 0) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p45)))))
lola: processed formula length: 214
lola: 89 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46))))))
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(((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46))))
lola: processed formula length: 64
lola: 90 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: 259556 markings, 821281 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p39))))
lola: processed formula length: 64
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 175 markings, 175 edges
lola: ========================================
lola: subprocess 7 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38))))
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 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38))))
lola: processed formula length: 64
lola: 89 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 <= p9) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 481)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 245591 markings, 736981 edges
lola: ========================================
lola: subprocess 8 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44))))))
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: ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44))
lola: processed formula length: 56
lola: 91 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 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p44 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
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 1
lola: formula 1: ((1 <= p6) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 142 markings, 141 edges
lola: ========================================
lola: subprocess 9 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p8 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p11 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p12 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p8 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p11 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p12 <= 0) ... (shortened)
lola: processed formula length: 617
lola: 89 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p10) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 9704 markings, 29438 edges
lola: ========================================
lola: subprocess 10 will run for 644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p28 <= 0) OR (p36 <= 0)) AND ((p22 <= 0) OR (p36 <= 0)) AND ((p23 <= 0) OR (p36 <= 0)) AND ((p21 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p28) AND (1 <= p36)) OR ((1 <= p22) AND (1 <= p36)) OR ((1 <= p23) AND (1 <= p36)) OR ((1 <= p21) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p27) AND (1 <= p36)) OR ((((1 <= p1) AND (1 <= p16) AND (1 <= p21) AND ... (shortened)
lola: processed formula length: 7093
lola: 91 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: (((p28 <= 0) OR (p36 <= 0)) AND ((p22 <= 0) OR (p36 <= 0)) AND ((p23 <= 0) OR (p36 <= 0)) AND ((p21 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p47 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p38 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p24 <= 0) OR (p44 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p43 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p41 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p46 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p37 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p42 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p47 <= 0)) AND (p13 <= 0)) OR (1 <= p13)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 142378 markings, 409473 edges
lola: ========================================
lola: subprocess 11 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((A((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) ... (shortened)
lola: processed formula length: 1866
lola: 90 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: 10364 markings, 43543 edges
lola: ========================================
lola: subprocess 12 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42) AND (1 <= p3) AND (1 <= p37)) AND (E (F (((1 <= p10) AND (1 <= p17) AND (1 <= p18) AND (1 <= p38)))) AND ((p11 <= 0) OR (p38 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p5 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p42 <= 0) OR (p3 <= 0) OR (p37 <= 0)) OR (G (((p10 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p38 <= 0))) OR ((1 <= p11) AND (1 <= p38)))))
lola: processed formula length: 189
lola: 100 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 244465 markings, 909095 edges
lola: ========================================
lola: subprocess 13 will run for 1609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)))) OR (DEADLOCK OR (((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46)) OR (E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40)))) AND (((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0)) AND (((p9 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p45 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))
lola: processed formula length: 56
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 3218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40))))
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: ((p2 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p40 <= 0))
lola: processed formula length: 56
lola: 91 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 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 89 markings, 88 edges
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0)) AND (((p9 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p45 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0)) AND ((p9 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p45 <= 0)))
lola: processed formula length: 180
lola: 91 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 12 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 3218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) ... (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 <= p8) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p12) ... (shortened)
lola: processed formula length: 683
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p8 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p11 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p10 <= 0) OR (p12 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p15 <= 9) OR (p34 <= 0)) AND ((p15 <= 9) OR (p33 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p4) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p43)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p46)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p47)) OR ((1 <= p3) AND (1 <= p17) AND (1 <= p18) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p17) AND (1 <= p18) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p18) AND (1 <= p44)) OR ((1 <= p4) AND (1 <= p17) A... (shortened)
lola: processed formula length: 6737
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 89 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40)))) OR (DEADLOCK OR (((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46)) OR (E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40)))) AND (((p1 <= 0) OR (p16 <= 0) OR (p22 <= 0) OR (p41 <= 0)) AND (((p9 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p45 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p16) AND (1 <= p22) AND (1 <= p46))
lola: processed formula length: 56
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p1) AND (1 <= p16) AND (1 <= p19) AND (1 <= p40))))
lola: processed formula length: 64
lola: 89 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: 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: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: 1 markings, 0 edges
lola: formula 0: ((p1 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p40 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40))))
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: ((p2 <= 0) OR (p17 <= 0) OR (p18 <= 0) OR (p40 <= 0))
lola: processed formula length: 56
lola: 91 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 <= p2) AND (1 <= p17) AND (1 <= p18) AND (1 <= p40))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 89 markings, 88 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes no yes no yes no no no no
lola:
preliminary result: no yes no yes yes no yes no yes no yes no no no no
lola: memory consumption: 309816 KB
lola: time consumption: 352 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="BridgeAndVehicles-PT-V10P10N10"
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 BridgeAndVehicles-PT-V10P10N10, 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 r182-oct2-158987913700300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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