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-158987914100620.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 CSRepetitions-COL-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591168189316

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:09:51] [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 07:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:09:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 07:09:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 748 ms
[2020-06-03 07:09:52] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-06-03 07:09:52] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 11 ms.
[2020-06-03 07:09:52] [INFO ] Computed order based on color domains.
[2020-06-03 07:09:52] [INFO ] Unfolded HLPN to a Petri net with 58 places and 81 transitions in 18 ms.
[2020-06-03 07:09:52] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 53 ms.
Finished random walk after 226 steps, including 6 resets, run visited all 35 properties in 20 ms. (steps per millisecond=11 )
[2020-06-03 07:09:52] [INFO ] Flatten gal took : 194 ms
[2020-06-03 07:09:52] [INFO ] Flatten gal took : 30 ms
[2020-06-03 07:09:53] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 28 ms.
[2020-06-03 07:09:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ CSRepetitions-COL-03 @ 3570 seconds

FORMULA CSRepetitions-COL-03-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ CSRepetitions-COL-03

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 2,
"aneg": 1,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) OR ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))",
"processed_size": 406,
"rewrites": 82
},
"result":
{
"edges": 2303,
"markings": 511,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 243,
"problems": 81
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 9,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EX((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))))",
"processed_size": 271,
"rewrites": 80
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))",
"processed_size": 132,
"rewrites": 81
},
"result":
{
"edges": 52,
"markings": 45,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 28,
"adisj": 2,
"aneg": 1,
"comp": 63,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "AG(EX(((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0))) OR ((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)))))",
"processed_size": 981,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF(EG(((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))",
"processed_size": 140,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 4681,
"markings": 2856,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))",
"processed_size": 140,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))",
"processed_size": 140,
"rewrites": 80
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "EF(AX((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))))",
"processed_size": 842,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AX(AG(AF((((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))))))",
"processed_size": 279,
"rewrites": 82
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 28,
"markings": 15,
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 27,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AF(EG((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p21 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)))))",
"processed_size": 869,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 4681,
"markings": 2856,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 1,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (F ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0)))))",
"processed_size": 842,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 27,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "EG(AX((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0)))))",
"processed_size": 842,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 4608,
"markings": 2816,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "EX(AG(((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= 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)))))",
"processed_size": 410,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 57,
"markings": 50,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 27,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "EX(AG((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0)))))",
"processed_size": 842,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 59,
"markings": 52,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))",
"processed_size": 132,
"rewrites": 82
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))",
"processed_size": 861,
"rewrites": 82
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AF(EG((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))",
"processed_size": 869,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 12202,
"markings": 3465,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 55,
"adisj": 11,
"aneg": 0,
"comp": 135,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 135,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 58,
"visible_transitions": 0
},
"processed": "E((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))) U (AF((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))) OR ((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)))))",
"processed_size": 2113,
"rewrites": 81
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 28,
"aneg": 2,
"comp": 63,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) R F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))",
"processed_size": 975,
"rewrites": 88
},
"result":
{
"edges": 117,
"markings": 92,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 10,
"adisj": 11,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 28,
"visible_transitions": 0
},
"processed": "A (((((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))) U ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))",
"processed_size": 815,
"rewrites": 84
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 1,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (G ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p21 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)))))",
"processed_size": 869,
"rewrites": 80
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 54,
"problems": 27
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))))",
"processed_size": 842,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 234988,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(A(F(**)))) : (E(X(E(G(*)))) OR E(X(**))) : A(F(E(G(**)))) : A(G(E(X(*)))) : (A(F(E(G(*)))) AND A(F((A(X(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))))) : (E(F(*)) OR (E(G(**)) AND (E((** U **)) OR (A(X(**)) AND **)))) : E((** U E(G(**)))) : E(F(A(X(**)))) : A(X(A(G(A(F(**)))))) : E((** U (A(F(**)) OR **))) : (A((** U **)) AND (E(G(**)) OR (E(G(*)) AND A(F(*))))) : (A(F(E(G(**)))) AND (** OR (A(X(*)) OR **))) : A(F(**)) : (E(G(A(X(**)))) AND E(F(*))) : A(G(E(F(**)))) : (E(X(A(G(**)))) OR E(X(A(G(**)))))"
},
"net":
{
"arcs": 279,
"conflict_clusters": 11,
"places": 58,
"places_significant": 46,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "yes no yes no no yes yes yes no no no no yes no no no ",
"value": "yes no yes no no yes yes yes no no no no yes 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: 139/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 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 (X (A (F (((((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))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))))) : E (X ((NOT(A (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))) OR (((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)))))) : A (F (A (F (E (G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))))))) : NOT(E (F (A (X (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) AND ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))))))) : (A (F (NOT(A (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))))) AND A (F (((((((((((A (X ((((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 ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (1 <= p22)) OR (1 <= p23)) OR (1 <= p24)) OR (1 <= p25)) OR (1 <= p26)) OR (1 <= p27)) OR (1 <= p28)) OR (1 <= p29)) OR (1 <= p30))))) : (NOT(A (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))))) OR (E (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)))) AND (E (((((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))) U (((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 (A (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))) AND ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= 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))))))) : E (((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0))) U E (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))))) : A (F (E (F (A (X ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))))))))) : A (G (A (X (A (F ((((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))))))))) : E (((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))) U (A (F ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))))) OR ((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)))))) : (A (((((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))) U ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))) AND (E (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))))) OR (NOT(A (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))) AND NOT(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))))))))) : (A (F (E (G ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p21 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p19 <= 0))))))) AND ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)) OR NOT(E (X ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0))))))) OR ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) AND (((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)))))) : A (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))) : (E (G (A (X ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0))))))) AND E (F (NOT(E (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))))))))) : E (G (A (G (E (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))))))) : E (X ((A (G ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0))))) OR A (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= 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))))))))
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:554
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:398
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((((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))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) OR ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <... (shortened)
lola: processed formula length: 406
lola: 82 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= 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))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 243 literals and 81 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 511 markings, 2303 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))))) OR E (X ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))))
lola: processed formula length: 271
lola: 80 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))
lola: processed formula length: 132
lola: 81 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: formula 0: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: The predicate is not possibly preserved from any successor.
lola: 45 markings, 52 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 ... (shortened)
lola: processed formula length: 981
lola: 81 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: 16 markings, 15 edges
lola: ========================================
sara: try reading problem file CTLFireability-2-0.sara.
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))))) AND A (F ((A (X ((((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 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))
lola: processed formula length: 140
lola: 81 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: 2856 markings, 4681 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: error: :375: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)))) OR (E (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)))) AND (E (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: processed formula length: 140
lola: 80 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: result: no
lola: produced by: state space / EG
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 9 conjunctive subformulas
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: processed formula length: 140
lola: 80 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: ((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= ... (shortened)
lola: processed formula length: 842
lola: 81 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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (A (F ((((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)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AG(AF((((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))))))
lola: processed formula length: 279
lola: 82 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: 15 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= ... (shortened)
lola: processed formula length: 869
lola: 81 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: 2856 markings, 4681 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <... (shortened)
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 ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <... (shortened)
lola: processed formula length: 842
lola: 80 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: (((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <... (shortened)
lola: processed formula length: 842
lola: 81 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: 2816 markings, 4608 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= 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) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= 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 ... (shortened)
lola: processed formula length: 410
lola: 81 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: 50 markings, 57 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <... (shortened)
lola: processed formula length: 842
lola: 81 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: 52 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))
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: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))
lola: processed formula length: 132
lola: 82 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate eventually occurs.
lola: 10 markings, 9 edges
lola: formula 0: ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 9 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1... (shortened)
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 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND... (shortened)
lola: processed formula length: 861
lola: 82 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p21 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p1... (shortened)
lola: processed formula length: 869
lola: 81 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: 3465 markings, 12202 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) A... (shortened)
lola: processed formula length: 2113
lola: 81 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= ... (shortened)
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:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
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: ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48))... (shortened)
lola: processed formula length: 975
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 92 markings, 117 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((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))) U ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((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))) U ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0... (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 <= 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))) U ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0... (shortened)
lola: processed formula length: 815
lola: 84 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 0
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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= ... (shortened)
lola: processed formula length: 869
lola: 80 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 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 54 literals and 27 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= ... (shortened)
lola: processed formula length: 842
lola: 80 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: (((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p33 <= 0)) AND ((p1 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p2 <= 0) OR (p36 <= 0)) AND ((p2 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p2 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p48 <= 0)) AND ((p6 <= 0) OR (p46 <= 0)) AND ((p6 <= 0) OR (p47 <= 0)) AND ((p4 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p3 <= 0) OR (p37 <= 0)) AND ((p3 <= 0) OR (p38 <= 0)) AND ((p3 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p43 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p5 <= 0) OR (p45 <= 0)) AND ((p8 <= 0) OR (p54 <= 0)) AND ((p8 <= 0) OR (p52 <= 0)) AND ((p8 <= 0) OR (p53 <= 0)))
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes yes no no no no yes no no no
lola:
preliminary result: yes no yes no no yes yes yes no no no no yes no no no
lola: memory consumption: 234988 KB
lola: time consumption: 4 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="CSRepetitions-COL-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is CSRepetitions-COL-03, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;