Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787400260.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is AirplaneLD-PT-0050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787400260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 23K Mar 24 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 24 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 24 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 24 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 20K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 24 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 24 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 24 06:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 24 06:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 404K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591373741334

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 16:15:44] [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-05 16:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 16:15:44] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2020-06-05 16:15:44] [INFO ] Transformed 369 places.
[2020-06-05 16:15:44] [INFO ] Transformed 408 transitions.
[2020-06-05 16:15:44] [INFO ] Found NUPN structural information;
[2020-06-05 16:15:44] [INFO ] Parsed PT model containing 369 places and 408 transitions in 301 ms.
Reduce places removed 152 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 85 ms.
Incomplete random walk after 100000 steps, including 12583 resets, run finished after 661 ms. (steps per millisecond=151 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 408 rows 217 cols
[2020-06-05 16:15:45] [INFO ] Computed 3 place invariants in 37 ms
[2020-06-05 16:15:45] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2020-06-05 16:15:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 8 ms returned sat
[2020-06-05 16:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:15:46] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2020-06-05 16:15:46] [INFO ] Computed and/alt/rep : 204/4156/204 causal constraints in 105 ms.
[2020-06-05 16:15:46] [INFO ] Added : 1 causal constraints over 1 iterations in 229 ms. Result :sat
[2020-06-05 16:15:46] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-05 16:15:46] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-05 16:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:15:47] [INFO ] [Real]Absence check using state equation in 141 ms returned unsat
[2020-06-05 16:15:47] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-05 16:15:47] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 8 ms returned sat
[2020-06-05 16:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:15:47] [INFO ] [Real]Absence check using state equation in 324 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-05 16:15:48] [INFO ] Flatten gal took : 149 ms
[2020-06-05 16:15:48] [INFO ] Flatten gal took : 68 ms
[2020-06-05 16:15:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2020-06-05 16:15:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AirplaneLD-PT-0050 @ 3570 seconds

FORMULA AirplaneLD-PT-0050-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA AirplaneLD-PT-0050-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA AirplaneLD-PT-0050-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3363
rslt: Output for CTLFireability @ AirplaneLD-PT-0050

{
"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": "Fri Jun 5 16:15:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 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": 29,
"visible_transitions": 0
},
"processed": "(((p54 <= 0) OR (p209 <= 0)) AND ((p68 <= 0) OR (p209 <= 0)) AND ((p69 <= 0) OR (p209 <= 0)) AND ((p63 <= 0) OR (p209 <= 0)) AND ((p74 <= 0) OR (p209 <= 0)) AND ((p59 <= 0) OR (p209 <= 0)) AND ((p70 <= 0) OR (p209 <= 0)) AND ((p67 <= 0) OR (p209 <= 0)) AND ((p53 <= 0) OR (p209 <= 0)) AND ((p58 <= 0) OR (p209 <= 0)) AND ((p75 <= 0) OR (p209 <= 0)) AND ((p62 <= 0) OR (p209 <= 0)) AND ((p66 <= 0) OR (p209 <= 0)) AND ((p71 <= 0) OR (p209 <= 0)) AND ((p56 <= 0) OR (p209 <= 0)) AND ((p57 <= 0) OR (p209 <= 0)) AND ((p101 <= 0) OR (p209 <= 0)) AND ((p76 <= 0) OR (p209 <= 0)) AND ((p61 <= 0) OR (p209 <= 0)) AND ((p55 <= 0) OR (p209 <= 0)) AND ((p72 <= 0) OR (p209 <= 0)) AND ((p65 <= 0) OR (p209 <= 0)) AND ((p52 <= 0) OR (p209 <= 0)) AND ((p64 <= 0) OR (p209 <= 0)) AND ((p73 <= 0) OR (p209 <= 0)) AND ((p60 <= 0) OR (p209 <= 0)) AND ((p207 <= 0) OR (p216 <= 0)))",
"processed_size": 890,
"rewrites": 27
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 105
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 54,
"problems": 27
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX((((1 <= p205) AND (1 <= p215)) OR ((1 <= p204) AND (1 <= p215))))",
"processed_size": 69,
"rewrites": 25
},
"net":
{
"conflict_clusters": 13,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX((EF((((1 <= p0)))) OR ((1 <= p204) AND (1 <= p215) AND (1 <= p102))))",
"processed_size": 72,
"rewrites": 26
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 301679,
"markings": 87876,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF((AX(((1 <= p207) AND (1 <= p216))) AND ((1 <= p51))))",
"processed_size": 56,
"rewrites": 26
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"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": 273
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(((p206 <= 0)))",
"processed_size": 15,
"rewrites": 28
},
"result":
{
"edges": 15329018,
"markings": 3683121,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 26,
"adisj": 1,
"aneg": 0,
"comp": 52,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 52,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p213)) OR ((1 <= p2) AND (1 <= p213)) OR ((1 <= p24) AND (1 <= p213)) OR ((1 <= p7) AND (1 <= p213)) OR ((1 <= p11) AND (1 <= p213)) OR ((1 <= p22) AND (1 <= p213)) OR ((1 <= p3) AND (1 <= p213)) OR ((1 <= p18) AND (1 <= p213)) OR ((1 <= p23) AND (1 <= p213)) OR ((1 <= p8) AND (1 <= p213)) OR ((1 <= p12) AND (1 <= p213)) OR ((1 <= p4) AND (1 <= p213)) OR ((1 <= p9) AND (1 <= p213)) OR ((1 <= p21) AND (1 <= p213)) OR ((1 <= p17) AND (1 <= p213)) OR ((1 <= p13) AND (1 <= p213)))))",
"processed_size": 854,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 127
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 49,
"adisj": 1,
"aneg": 0,
"comp": 98,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 98,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "(((1 <= p135) AND (1 <= p214)) OR ((1 <= p145) AND (1 <= p214)) OR ((1 <= p115) AND (1 <= p214)) OR ((1 <= p116) AND (1 <= p214)) OR ((1 <= p105) AND (1 <= p214)) OR ((1 <= p126) AND (1 <= p214)) OR ((1 <= p114) AND (1 <= p214)) OR ((1 <= p136) AND (1 <= p214)) OR ((1 <= p127) AND (1 <= p214)) OR ((1 <= p106) AND (1 <= p214)) OR ((1 <= p144) AND (1 <= p214)) OR ((1 <= p123) AND (1 <= p214)) OR ((1 <= p118) AND (1 <= p214)) OR ((1 <= p133) AND (1 <= p214)) OR ((1 <= p132) AND (1 <= p214)) OR ((1 <= p143) AND (1 <= p214)) OR ((1 <= p109) AND (1 <= p214)) OR ((1 <= p107) AND (1 <= p214)) OR ((1 <= p124) AND (1 <= p214)) OR ((1 <= p117) AND (1 <= p214)) OR ((1 <= p134) AND (1 <= p214)) OR ((1 <= p151) AND (1 <= p214)) OR ((1 <= p125) AND (1 <= p214)) OR ((1 <= p108) AND (1 <= p214)) OR ((1 <= p142) AND (1 <= p214)) OR ((1 <= p140) AND (1 <= p214)) OR ((1 <= p130) AND (1 <= p214)) OR ((1 <= p150) AND (1 <= p214)) OR ((1 <= p149) AND (1 <= p214)) OR ((1 <= p111) AND (1 <= p214)) OR ((1 <= p120) AND (1 <= p214)) OR ((1 <= p139) AND (1 <= p214)) OR ((1 <= p141) AND (1 <= p214)) OR ((1 <= p119) AND (1 <= p214)) OR ((1 <= p131) AND (1 <= p214)) OR ((1 <= p110) AND (1 <= p214)) OR ((1 <= p148) AND (1 <= p214)) OR ((1 <= p113) AND (1 <= p214)) OR ((1 <= p147) AND (1 <= p214)) OR ((1 <= p137) AND (1 <= p214)) OR ((1 <= p103) AND (1 <= p214)) OR ((1 <= p128) AND (1 <= p214)) OR ((1 <= p122) AND (1 <= p214)) OR ((1 <= p112) AND (1 <= p214)) OR ((1 <= p129) AND (1 <= p214)) OR ((1 <= p146) AND (1 <= p214)) OR ((1 <= p121) AND (1 <= p214)) OR ((1 <= p104) AND (1 <= p214)) OR ((1 <= p138) AND (1 <= p214)))",
"processed_size": 1663,
"rewrites": 27
},
"result":
{
"edges": 373100,
"markings": 128151,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 100
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 98,
"problems": 49
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AG(EF(AX(((1 <= p102)))))",
"processed_size": 25,
"rewrites": 27
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 27946118,
"markings": 4471223,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 51,
"aneg": 1,
"comp": 102,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 102,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p184) AND (1 <= p214)) OR ((1 <= p174) AND (1 <= p214)) OR ((1 <= p154) AND (1 <= p214)) OR ((1 <= p164) AND (1 <= p214)) OR ((1 <= p194) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p214)) OR ((1 <= p156) AND (1 <= p214)) OR ((1 <= p173) AND (1 <= p214)) OR ((1 <= p183) AND (1 <= p214)) OR ((1 <= p153) AND (1 <= p214)) OR ((1 <= p166) AND (1 <= p214)) OR ((1 <= p165) AND (1 <= p214)) OR ((1 <= p182) AND (1 <= p214)) OR ((1 <= p195) AND (1 <= p214)) OR ((1 <= p157) AND (1 <= p214)) OR ((1 <= p201) AND (1 <= p214)) OR ((1 <= p152) AND (1 <= p214)) OR ((1 <= p167) AND (1 <= p214)) OR ((1 <= p186) AND (1 <= p214)) OR ((1 <= p192) AND (1 <= p214)) OR ((1 <= p158) AND (1 <= p214)) OR ((1 <= p177) AND (1 <= p214)) OR ((1 <= p202) AND (1 <= p214)) OR ((1 <= p185) AND (1 <= p214)) OR ((1 <= p168) AND (1 <= p214)) OR ((1 <= p176) AND (1 <= p214)) OR ((1 <= p193) AND (1 <= p214)) OR ((1 <= p159) AND (1 <= p214)) OR ((1 <= p179) AND (1 <= p214)) OR ((1 <= p189) AND (1 <= p214)) OR ((1 <= p169) AND (1 <= p214)) OR ((1 <= p198) AND (1 <= p214)) OR ((1 <= p160) AND (1 <= p214)) OR ((1 <= p200) AND (1 <= p214)) OR ((1 <= p190) AND (1 <= p214)) OR ((1 <= p170) AND (1 <= p214)) OR ((1 <= p187) AND (1 <= p214)) OR ((1 <= p199) AND (1 <= p214)) OR ((1 <= p161) AND (1 <= p214)) OR ((1 <= p191) AND (1 <= p214)) OR ((1 <= p178) AND (1 <= p214)) OR ((1 <= p162) AND (1 <= p214)) OR ((1 <= p172) AND (1 <= p214)) OR ((1 <= p171) AND (1 <= p214)) OR ((1 <= p181) AND (1 <= p214)) OR ((1 <= p196) AND (1 <= p214)) OR ((1 <= p163) AND (1 <= p214)) OR ((1 <= p188) AND (1 <= p214)) OR ((1 <= p155) AND (1 <= p214)) OR ((1 <= p180) AND (1 <= p214)) OR ((1 <= p197) AND (1 <= p214)))))",
"processed_size": 1739,
"rewrites": 25
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p102))))",
"processed_size": 21,
"rewrites": 25
},
"result":
{
"edges": 10212,
"markings": 10213,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 100
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 570
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p58 <= 0) OR (p209 <= 0))",
"processed_size": 28,
"rewrites": 28
},
"result":
{
"edges": 19756224,
"markings": 4471223,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 673
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p54) AND (1 <= p209)) OR ((1 <= p165) AND (1 <= p214)))",
"processed_size": 64,
"rewrites": 28
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((((1 <= p86) AND (1 <= p209)) AND E(((1 <= p102)) U ((1 <= p195) AND (1 <= p214)))))",
"processed_size": 87,
"rewrites": 26
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"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": 1122
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EG((EF(((p144 <= 0) OR (p214 <= 0))) OR (((1 <= p51)) OR EG(((1 <= p77) AND (1 <= p209))))))",
"processed_size": 93,
"rewrites": 27
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 11,
"produced_by": "CTL model checker",
"value": true
},
"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": 1683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 28,
"adisj": 1,
"aneg": 1,
"comp": 55,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "AF((AG(((p205 <= 0) OR (p215 <= 0))) AND (((1 <= p203)) OR ((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p213)) OR ((1 <= p2) AND (1 <= p213)) OR ((1 <= p24) AND (1 <= p213)) OR ((1 <= p7) AND (1 <= p213)) OR ((1 <= p11) AND (1 <= p213)) OR ((1 <= p22) AND (1 <= p213)) OR ((1 <= p3) AND (1 <= p213)) OR ((1 <= p18) AND (1 <= p213)) OR ((1 <= p23) AND (1 <= p213)) OR ((1 <= p8) AND (1 <= p213)) OR ((1 <= p12) AND (1 <= p213)) OR ((1 <= p4) AND (1 <= p213)) OR ((1 <= p9) AND (1 <= p213)) OR ((1 <= p21) AND (1 <= p213)) OR ((1 <= p17) AND (1 <= p213)) OR ((1 <= p13) AND (1 <= p213)))))",
"processed_size": 908,
"rewrites": 26
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 1048224,
"markings": 268011,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((p25 <= 0) OR (p213 <= 0)) U ((1 <= p184) AND (1 <= p214))))",
"processed_size": 66,
"rewrites": 29
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 52
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 240180,
"runtime": 207.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(**)) OR A(F(**))) : (A(X(A(X(**)))) AND A(X((E(F(**)) OR **)))) : A(G(A(F(**)))) : E(G(**)) : A(F((A(G(*)) AND **))) : A(F((A(X(**)) AND **))) : (E(F(A(G(**)))) OR (E(F(E(G(**)))) OR (A(X(**)) AND (E(G(**)) AND (** OR E(X(**))))))) : E(F(*)) : E(G((E(F(**)) OR (** OR E(G(**)))))) : A(F((** AND E((** U **))))) : E(G(**)) : E(F(DEADLOCK)) : A(G(E(F(A(X(**)))))) : E(F(A(G(*)))) : E(F(A(G(**)))) : A((** U **))"
},
"net":
{
"arcs": 1145,
"conflict_clusters": 13,
"places": 217,
"places_significant": 214,
"singleton_clusters": 0,
"transitions": 408
},
"result":
{
"preliminary_value": "no no yes yes no no no yes yes no no yes yes yes no no ",
"value": "no no yes yes no no no yes yes no no yes yes yes 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: 625/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6944
lola: finding significant places
lola: 217 places, 408 transitions, 214 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: (A (X ((((1 <= p205) AND (1 <= p215)) OR ((1 <= p204) AND (1 <= p215))))) OR A (F ((((1 <= p54) AND (1 <= p209)) OR ((1 <= p68) AND (1 <= p209)) OR ((1 <= p69) AND (1 <= p209)) OR ((1 <= p63) AND (1 <= p209)) OR ((1 <= p74) AND (1 <= p209)) OR ((1 <= p59) AND (1 <= p209)) OR ((1 <= p70) AND (1 <= p209)) OR ((1 <= p67) AND (1 <= p209)) OR ((1 <= p53) AND (1 <= p209)) OR ((1 <= p58) AND (1 <= p209)) OR ((1 <= p75) AND (1 <= p209)) OR ((1 <= p62) AND (1 <= p209)) OR ((1 <= p66) AND (1 <= p209)) OR ((1 <= p71) AND (1 <= p209)) OR ((1 <= p56) AND (1 <= p209)) OR ((1 <= p57) AND (1 <= p209)) OR ((1 <= p101) AND (1 <= p209)) OR ((1 <= p76) AND (1 <= p209)) OR ((1 <= p61) AND (1 <= p209)) OR ((1 <= p55) AND (1 <= p209)) OR ((1 <= p72) AND (1 <= p209)) OR ((1 <= p65) AND (1 <= p209)) OR ((1 <= p52) AND (1 <= p209)) OR ((1 <= p64) AND (1 <= p209)) OR ((1 <= p73) AND (1 <= p209)) OR ((1 <= p60) AND (1 <= p209)) OR ((1 <= p207) AND (1 <= p216)))))) : A (X ((A (X ((((1 <= p208) AND (1 <= p216)) OR ((1 <= p208) AND (1 <= p216))))) AND (E (F ((((1 <= p0))))) OR ((1 <= p204) AND (1 <= p215) AND (1 <= p102)))))) : A (G (A (F (((p206 <= 0) OR ((1 <= p102))))))) : E (G (((p204 <= 0) OR (p215 <= 0)))) : A (F ((NOT(E (F (((1 <= p205) AND (1 <= p215))))) AND (((1 <= p203)) OR ((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p213)) OR ((1 <= p2) AND (1 <= p213)) OR ((1 <= p24) AND (1 <= p213)) OR ((1 <= p7) AND (1 <= p213)) OR ((1 <= p11) AND (1 <= p213)) OR ((1 <= p22) AND (1 <= p213)) OR ((1 <= p3) AND (1 <= p213)) OR ((1 <= p18) AND (1 <= p213)) OR ((1 <= p23) AND (1 <= p213)) OR ((1 <= p8) AND (1 <= p213)) OR ((1 <= p12) AND (1 <= p213)) OR ((1 <= p4) AND (1 <= p213)) OR ((1 <= p9) AND (1 <= p213)) OR ((1 <= p21) AND (1 <= p213)) OR ((1 <= p17) AND (1 <= p213)) OR ((1 <= p13) AND (1 <= p213)))))) : A (F ((A (X (((1 <= p207) AND (1 <= p216)))) AND ((1 <= p51))))) : (E (F ((A (G ((((1 <= p206))))) OR E (G ((((1 <= p135) AND (1 <= p214)) OR ((1 <= p145) AND (1 <= p214)) OR ((1 <= p115) AND (1 <= p214)) OR ((1 <= p116) AND (1 <= p214)) OR ((1 <= p105) AND (1 <= p214)) OR ((1 <= p126) AND (1 <= p214)) OR ((1 <= p114) AND (1 <= p214)) OR ((1 <= p136) AND (1 <= p214)) OR ((1 <= p127) AND (1 <= p214)) OR ((1 <= p106) AND (1 <= p214)) OR ((1 <= p144) AND (1 <= p214)) OR ((1 <= p123) AND (1 <= p214)) OR ((1 <= p118) AND (1 <= p214)) OR ((1 <= p133) AND (1 <= p214)) OR ((1 <= p132) AND (1 <= p214)) OR ((1 <= p143) AND (1 <= p214)) OR ((1 <= p109) AND (1 <= p214)) OR ((1 <= p107) AND (1 <= p214)) OR ((1 <= p124) AND (1 <= p214)) OR ((1 <= p117) AND (1 <= p214)) OR ((1 <= p134) AND (1 <= p214)) OR ((1 <= p151) AND (1 <= p214)) OR ((1 <= p125) AND (1 <= p214)) OR ((1 <= p108) AND (1 <= p214)) OR ((1 <= p142) AND (1 <= p214)) OR ((1 <= p140) AND (1 <= p214)) OR ((1 <= p130) AND (1 <= p214)) OR ((1 <= p150) AND (1 <= p214)) OR ((1 <= p149) AND (1 <= p214)) OR ((1 <= p111) AND (1 <= p214)) OR ((1 <= p120) AND (1 <= p214)) OR ((1 <= p139) AND (1 <= p214)) OR ((1 <= p141) AND (1 <= p214)) OR ((1 <= p119) AND (1 <= p214)) OR ((1 <= p131) AND (1 <= p214)) OR ((1 <= p110) AND (1 <= p214)) OR ((1 <= p148) AND (1 <= p214)) OR ((1 <= p113) AND (1 <= p214)) OR ((1 <= p147) AND (1 <= p214)) OR ((1 <= p137) AND (1 <= p214)) OR ((1 <= p103) AND (1 <= p214)) OR ((1 <= p128) AND (1 <= p214)) OR ((1 <= p122) AND (1 <= p214)) OR ((1 <= p112) AND (1 <= p214)) OR ((1 <= p129) AND (1 <= p214)) OR ((1 <= p146) AND (1 <= p214)) OR ((1 <= p121) AND (1 <= p214)) OR ((1 <= p104) AND (1 <= p214)) OR ((1 <= p138) AND (1 <= p214)))))))) OR ((A (X ((((p184 <= 0) OR (p214 <= 0)) AND ((p174 <= 0) OR (p214 <= 0)) AND ((p154 <= 0) OR (p214 <= 0)) AND ((p164 <= 0) OR (p214 <= 0)) AND ((p194 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p214 <= 0)) AND ((p156 <= 0) OR (p214 <= 0)) AND ((p173 <= 0) OR (p214 <= 0)) AND ((p183 <= 0) OR (p214 <= 0)) AND ((p153 <= 0) OR (p214 <= 0)) AND ((p166 <= 0) OR (p214 <= 0)) AND ((p165 <= 0) OR (p214 <= 0)) AND ((p182 <= 0) OR (p214 <= 0)) AND ((p195 <= 0) OR (p214 <= 0)) AND ((p157 <= 0) OR (p214 <= 0)) AND ((p201 <= 0) OR (p214 <= 0)) AND ((p152 <= 0) OR (p214 <= 0)) AND ((p167 <= 0) OR (p214 <= 0)) AND ((p186 <= 0) OR (p214 <= 0)) AND ((p192 <= 0) OR (p214 <= 0)) AND ((p158 <= 0) OR (p214 <= 0)) AND ((p177 <= 0) OR (p214 <= 0)) AND ((p202 <= 0) OR (p214 <= 0)) AND ((p185 <= 0) OR (p214 <= 0)) AND ((p168 <= 0) OR (p214 <= 0)) AND ((p176 <= 0) OR (p214 <= 0)) AND ((p193 <= 0) OR (p214 <= 0)) AND ((p159 <= 0) OR (p214 <= 0)) AND ((p179 <= 0) OR (p214 <= 0)) AND ((p189 <= 0) OR (p214 <= 0)) AND ((p169 <= 0) OR (p214 <= 0)) AND ((p198 <= 0) OR (p214 <= 0)) AND ((p160 <= 0) OR (p214 <= 0)) AND ((p200 <= 0) OR (p214 <= 0)) AND ((p190 <= 0) OR (p214 <= 0)) AND ((p170 <= 0) OR (p214 <= 0)) AND ((p187 <= 0) OR (p214 <= 0)) AND ((p199 <= 0) OR (p214 <= 0)) AND ((p161 <= 0) OR (p214 <= 0)) AND ((p191 <= 0) OR (p214 <= 0)) AND ((p178 <= 0) OR (p214 <= 0)) AND ((p162 <= 0) OR (p214 <= 0)) AND ((p172 <= 0) OR (p214 <= 0)) AND ((p171 <= 0) OR (p214 <= 0)) AND ((p181 <= 0) OR (p214 <= 0)) AND ((p196 <= 0) OR (p214 <= 0)) AND ((p163 <= 0) OR (p214 <= 0)) AND ((p188 <= 0) OR (p214 <= 0)) AND ((p155 <= 0) OR (p214 <= 0)) AND ((p180 <= 0) OR (p214 <= 0)) AND ((p197 <= 0) OR (p214 <= 0))))) AND E (G ((((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p213)) OR ((1 <= p2) AND (1 <= p213)) OR ((1 <= p24) AND (1 <= p213)) OR ((1 <= p7) AND (1 <= p213)) OR ((1 <= p11) AND (1 <= p213)) OR ((1 <= p22) AND (1 <= p213)) OR ((1 <= p3) AND (1 <= p213)) OR ((1 <= p18) AND (1 <= p213)) OR ((1 <= p23) AND (1 <= p213)) OR ((1 <= p8) AND (1 <= p213)) OR ((1 <= p12) AND (1 <= p213)) OR ((1 <= p4) AND (1 <= p213)) OR ((1 <= p9) AND (1 <= p213)) OR ((1 <= p21) AND (1 <= p213)) OR ((1 <= p17) AND (1 <= p213)) OR ((1 <= p13) AND (1 <= p213)))))) AND (((1 <= p203)) OR E (X (((1 <= p205) AND (1 <= p215))))))) : NOT(A (G ((((p184 <= 0) OR (p214 <= 0)) AND ((p174 <= 0) OR (p214 <= 0)) AND ((p154 <= 0) OR (p214 <= 0)) AND ((p164 <= 0) OR (p214 <= 0)) AND ((p194 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p214 <= 0)) AND ((p156 <= 0) OR (p214 <= 0)) AND ((p173 <= 0) OR (p214 <= 0)) AND ((p183 <= 0) OR (p214 <= 0)) AND ((p153 <= 0) OR (p214 <= 0)) AND ((p166 <= 0) OR (p214 <= 0)) AND ((p165 <= 0) OR (p214 <= 0)) AND ((p182 <= 0) OR (p214 <= 0)) AND ((p195 <= 0) OR (p214 <= 0)) AND ((p157 <= 0) OR (p214 <= 0)) AND ((p201 <= 0) OR (p214 <= 0)) AND ((p152 <= 0) OR (p214 <= 0)) AND ((p167 <= 0) OR (p214 <= 0)) AND ((p186 <= 0) OR (p214 <= 0)) AND ((p192 <= 0) OR (p214 <= 0)) AND ((p158 <= 0) OR (p214 <= 0)) AND ((p177 <= 0) OR (p214 <= 0)) AND ((p202 <= 0) OR (p214 <= 0)) AND ((p185 <= 0) OR (p214 <= 0)) AND ((p168 <= 0) OR (p214 <= 0)) AND ((p176 <= 0) OR (p214 <= 0)) AND ((p193 <= 0) OR (p214 <= 0)) AND ((p159 <= 0) OR (p214 <= 0)) AND ((p179 <= 0) OR (p214 <= 0)) AND ((p189 <= 0) OR (p214 <= 0)) AND ((p169 <= 0) OR (p214 <= 0)) AND ((p198 <= 0) OR (p214 <= 0)) AND ((p160 <= 0) OR (p214 <= 0)) AND ((p200 <= 0) OR (p214 <= 0)) AND ((p190 <= 0) OR (p214 <= 0)) AND ((p170 <= 0) OR (p214 <= 0)) AND ((p187 <= 0) OR (p214 <= 0)) AND ((p199 <= 0) OR (p214 <= 0)) AND ((p161 <= 0) OR (p214 <= 0)) AND ((p191 <= 0) OR (p214 <= 0)) AND ((p178 <= 0) OR (p214 <= 0)) AND ((p162 <= 0) OR (p214 <= 0)) AND ((p172 <= 0) OR (p214 <= 0)) AND ((p171 <= 0) OR (p214 <= 0)) AND ((p181 <= 0) OR (p214 <= 0)) AND ((p196 <= 0) OR (p214 <= 0)) AND ((p163 <= 0) OR (p214 <= 0)) AND ((p188 <= 0) OR (p214 <= 0)) AND ((p155 <= 0) OR (p214 <= 0)) AND ((p180 <= 0) OR (p214 <= 0)) AND ((p197 <= 0) OR (p214 <= 0)))))) : E (G (((E (F (((p144 <= 0) OR (p214 <= 0)))) OR ((1 <= p51))) OR E (G (((1 <= p77) AND (1 <= p209))))))) : A (F ((((1 <= p86) AND (1 <= p209)) AND E ((((1 <= p102)) U ((1 <= p195) AND (1 <= p214))))))) : (E (G (((1 <= p102)))) OR (E ((((1 <= p206)) U (1 <= 0))) AND A (X ((((1 <= p143) AND (1 <= p214) AND (1 <= p0)) OR ((1 <= p51))))))) : E (F (A (X ((1 <= 0))))) : A (G (E (F (A (X (((1 <= p102)))))))) : NOT(A (G (E (F ((((1 <= p54) AND (1 <= p209)) OR ((1 <= p165) AND (1 <= p214)))))))) : A (F (E (F (A (G (((1 <= p58) AND (1 <= p209)))))))) : A ((((p25 <= 0) OR (p213 <= 0)) U ((1 <= p184) AND (1 <= p214))))
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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 ((((1 <= p205) AND (1 <= p215)) OR ((1 <= p204) AND (1 <= p215))))) OR A (F ((((1 <= p54) AND (1 <= p209)) OR ((1 <= p68) AND (1 <= p209)) OR ((1 <= p69) AND (1 <= p209)) OR ((1 <= p63) AND (1 <= p209)) OR ((1 <= p74) AND (1 <= p209)) OR ((1 <= p59) AND (1 <= p209)) OR ((1 <= p70) AND (1 <= p209)) OR ((1 <= p67) AND (1 <= p209)) OR ((1 <= p53) AND (1 <= p209)) OR ((1 <= p58) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p54) AND (1 <= p209)) OR ((1 <= p68) AND (1 <= p209)) OR ((1 <= p69) AND (1 <= p209)) OR ((1 <= p63) AND (1 <= p209)) OR ((1 <= p74) AND (1 <= p209)) OR ((1 <= p59) AND (1 <= p209)) OR ((1 <= p70) AND (1 <= p209)) OR ((1 <= p67) AND (1 <= p209)) OR ((1 <= p53) AND (1 <= p209)) OR ((1 <= p58) AND (1 <= p209)) OR ((1 <= p75) AND (1 <= p209)) OR ((1 <= p62) AND (1 <= p209)) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p54 <= 0) OR (p209 <= 0)) AND ((p68 <= 0) OR (p209 <= 0)) AND ((p69 <= 0) OR (p209 <= 0)) AND ((p63 <= 0) OR (p209 <= 0)) AND ((p74 <= 0) OR (p209 <= 0)) AND ((p59 <= 0) OR (p209 <= 0)) AND ((p70 <= 0) OR (p209 <= 0)) AND ((p67 <= 0) OR (p209 <= 0)) AND ((p53 <= 0) OR (p209 <= 0)) AND ((p58 <= 0) OR (p209 <= 0)) AND ((p75 <= 0) OR (p209 <= 0)) AND ((p62 <= 0) OR (p209 <= 0)) AND ((p... (shortened)
lola: processed formula length: 890
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: formula 0: (((1 <= p54) AND (1 <= p209)) OR ((1 <= p68) AND (1 <= p209)) OR ((1 <= p69) AND (1 <= p209)) OR ((1 <= p63) AND (1 <= p209)) OR ((1 <= p74) AND (1 <= p209)) OR ((1 <= p59) AND (1 <= p209)) OR ((1 <= p70) AND (1 <= p209)) OR ((1 <= p67) AND (1 <= p209)) OR ((1 <= p53) AND (1 <= p209)) OR ((1 <= p58) AND (1 <= p209)) OR ((1 <= p75) AND (1 <= p209)) OR ((1 <= p62) AND (1 <= p209)) OR ((1 <= p66) AND (1 <= p209)) OR ((1 <= p71) AND (1 <= p209)) OR ((1 <= p56) AND (1 <= p209)) OR ((1 <= p57) AND (1 <= p209)) OR ((1 <= p101) AND (1 <= p209)) OR ((1 <= p76) AND (1 <= p209)) OR ((1 <= p61) AND (1 <= p209)) OR ((1 <= p55) AND (1 <= p209)) OR ((1 <= p72) AND (1 <= p209)) OR ((1 <= p65) AND (1 <= p209)) OR ((1 <= p52) AND (1 <= p209)) OR ((1 <= p64) AND (1 <= p209)) OR ((1 <= p73) AND (1 <= p209)) OR ((1 <= p60) AND (1 <= p209)) OR ((1 <= p207) AND (1 <= p216)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 54 literals and 27 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p205) AND (1 <= p215)) OR ((1 <= p204) AND (1 <= p215)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p205) AND (1 <= p215)) OR ((1 <= p204) AND (1 <= p215))))
lola: processed formula length: 69
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (X ((((1 <= p208) AND (1 <= p216)) OR ((1 <= p208) AND (1 <= p216))))))) AND A (X ((E (F ((((1 <= p0))))) OR ((1 <= p204) AND (1 <= p215) AND (1 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F ((((1 <= p0))))) OR ((1 <= p204) AND (1 <= p215) AND (1 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EF((((1 <= p0)))) OR ((1 <= p204) AND (1 <= p215) AND (1 <= p102))))
lola: processed formula length: 72
lola: 26 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: 87876 markings, 301679 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (((1 <= p207) AND (1 <= p216)))) AND ((1 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX(((1 <= p207) AND (1 <= p216))) AND ((1 <= p51))))
lola: processed formula length: 56
lola: 26 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((((1 <= p206))))))) OR (E (F (E (G ((((1 <= p135) AND (1 <= p214)) OR ((1 <= p145) AND (1 <= p214)) OR ((1 <= p115) AND (1 <= p214)) OR ((1 <= p116) AND (1 <= p214)) OR ((1 <= p105) AND (1 <= p214)) OR ((1 <= p126) AND (1 <= p214)) OR ((1 <= p114) AND (1 <= p214)) OR ((1 <= p136) AND (1 <= p214)) OR ((1 <= p127) AND (1 <= p214)) OR ((1 <= p106) AND (1 <= p214)) OR ((1 <= p14... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p203))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p203))
lola: processed formula length: 13
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p206)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p206 <= 0)))
lola: processed formula length: 15
lola: 28 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: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 <= p206)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p206 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLFireability-4-0.sara.
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 562242 markings, 1695915 edges, 112448 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1009094 markings, 3502983 edges, 89370 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1382182 markings, 5266508 edges, 74618 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1786170 markings, 7107318 edges, 80798 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2254379 markings, 8863674 edges, 93642 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2699520 markings, 10653418 edges, 89028 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3155726 markings, 12521833 edges, 91241 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 3532352 markings, 14320940 edges, 75325 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3683121 markings, 15329018 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p213)) OR ((1 <= p2) AND (1 <= p213)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p213)) OR ((1 <= p2) AND (1 <= p213)) OR (... (shortened)
lola: processed formula length: 854
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p15 <= 0) OR (p213 <= 0)) AND ((p10 <= 0) OR (p213 <= 0)) AND ((p25 <= 0) OR (p213 <= 0)) AND ((p5 <= 0) OR (p213 <= 0)) AND ((p20 <= 0) OR (p213 <= 0)) AND ((p1 <= 0) OR (p213 <= 0)) AND ((p6 <= 0) OR (p213 <= 0)) AND ((p50 <= 0) OR (p213 <= 0)) AND ((p14 <= 0) OR (p213 <= 0)) AND ((p16 <= 0) OR (p213 <= 0)) AND ((p19 <= 0) OR (p213 <= 0)) AND ((p2 <= 0) OR (p213 <= 0)) AND ((p24 <= 0) OR (p213 <= 0)) AND ((p7 <= 0) OR (p213 <= 0)) AND ((p11 <= 0) OR (p213 <= 0)) AND ((p22 <= 0) OR (p213 <= 0)) AND ((p3 <= 0) OR (p213 <= 0)) AND ((p18 <= 0) OR (p213 <= 0)) AND ((p23 <= 0) OR (p213 <= 0)) AND ((p8 <= 0) OR (p213 <= 0)) AND ((p12 <= 0) OR (p213 <= 0)) AND ((p4 <= 0) OR (p213 <= 0)) AND ((p9 <= 0) OR (p213 <= 0)) AND ((p21 <= 0) OR (p213 <= 0)) AND ((p17 <= 0) OR (p213 <= 0)) AND ((p13 <= 0) OR (p213 <= 0)))
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((1 <= p135) AND (1 <= p214)) OR ((1 <= p145) AND (1 <= p214)) OR ((1 <= p115) AND (1 <= p214)) OR ((1 <= p116) AND (1 <= p214)) OR ((1 <= p105) AND (1 <= p214)) OR ((1 <= p126) AND (1 <= p214)) OR ((1 <= p114) AND (1 <= p214)) OR ((1 <= p136) AND (1 <= p214)) OR ((1 <= p127) AND (1 <= p214)) OR ((1 <= p106) AND (1 <= p214)) OR ((1 <= p144) AND (1 <= p214)) OR ((1 <= p123) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((1 <= p135) AND (1 <= p214)) OR ((1 <= p145) AND (1 <= p214)) OR ((1 <= p115) AND (1 <= p214)) OR ((1 <= p116) AND (1 <= p214)) OR ((1 <= p105) AND (1 <= p214)) OR ((1 <= p126) AND (1 <= p214)) OR ((1 <= p114) AND (1 <= p214)) OR ((1 <= p136) AND (1 <= p214)) OR ((1 <= p127) AND (1 <= p214)) OR ((1 <= p106) AND (1 <= p214)) OR ((1 <= p144) AND (1 <= p214)) OR ((1 <= p123) AND (1 <= p2... (shortened)
lola: processed formula length: 1663
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result rewrite finished id 0
lola: formula 1: (((1 <= p135) AND (1 <= p214)) OR ((1 <= p145) AND (1 <= p214)) OR ((1 <= p115) AND (1 <= p214)) OR ((1 <= p116) AND (1 <= p214)) OR ((1 <= p105) AND (1 <= p214)) OR ((1 <= p126) AND (1 <= p214)) OR ((1 <= p114) AND (1 <= p214)) OR ((1 <= p136) AND (1 <= p214)) OR ((1 <= p127) AND (1 <= p214)) OR ((1 <= p106) AND (1 <= p214)) OR ((1 <= p144) AND (1 <= p214)) OR ((1 <= p123) AND (1 <= p214)) OR ((1 <= p118) AND (1 <= p214)) OR ((1 <= p133) AND (1 <= p214)) OR ((1 <= p132) AND (1 <= p214)) OR ((1 <= p143) AND (1 <= p214)) OR ((1 <= p109) AND (1 <= p214)) OR ((1 <= p107) AND (1 <= p214)) OR ((1 <= p124) AND (1 <= p214)) OR ((1 <= p117) AND (1 <= p214)) OR ((1 <= p134) AND (1 <= p214)) OR ((1 <= p151) AND (1 <= p214)) OR ((1 <= p125) AND (1 <= p214)) OR ((1 <= p108) AND (1 <= p214)) OR ((1 <= p142) AND (1 <= p214)) OR ((1 <= p140) AND (1 <= p214)) OR ((1 <= p130) AND (1 <= p214)) OR ((1 <= p150) AND (1 <= p214)) OR ((1 <= p149) AND (1 <= p214)) OR ((1 <= p111) AND (1 <= p214)) OR ((1 <= p120) AND (1 <= p214)) OR ((1 <= p139) AND (1 <= p214)) OR ((1 <= p141) AND (1 <= p214)) OR ((1 <= p119) AND (1 <= p214)) OR ((1 <= p131) AND (1 <= p214)) OR ((1 <= p110) AND (1 <= p214)) OR ((1 <= p148) AND (1 <= p214)) OR ((1 <= p113) AND (1 <= p214)) OR ((1 <= p147) AND (1 <= p214)) OR ((1 <= p137) AND (1 <= p214)) OR ((1 <= p103) AND (1 <= p214)) OR ((1 <= p128) AND (1 <= p214)) OR ((1 <= p122) AND (1 <= p214)) OR ((1 <= p112) AND (1 <= p214)) OR ((1 <= p129) AND (1 <= p214)) OR ((1 <= p146) AND (1 <= p214)) OR ((1 <= p121) AND (1 <= p214)) OR ((1 <= p104) AND (1 <= p214)) OR ((1 <= p138) AND (1 <= p214)))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation: Generated DNF with 98 literals and 49 conjunctive subformulas
lola: formula 0: (((p135 <= 0) OR (p214 <= 0)) AND ((p145 <= 0) OR (p214 <= 0)) AND ((p115 <= 0) OR (p214 <= 0)) AND ((p116 <= 0) OR (p214 <= 0)) AND ((p105 <= 0) OR (p214 <= 0)) AND ((p126 <= 0) OR (p214 <= 0)) AND ((p114 <= 0) OR (p214 <= 0)) AND ((p136 <= 0) OR (p214 <= 0)) AND ((p127 <= 0) OR (p214 <= 0)) AND ((p106 <= 0) OR (p214 <= 0)) AND ((p144 <= 0) OR (p214 <= 0)) AND ((p123 <= 0) OR (p214 <= 0)) AND ((p118 <= 0) OR (p214 <= 0)) AND ((p133 <= 0) OR (p214 <= 0)) AND ((p132 <= 0) OR (p214 <= 0)) AND ((p143 <= 0) OR (p214 <= 0)) AND ((p109 <= 0) OR (p214 <= 0)) AND ((p107 <= 0) OR (p214 <= 0)) AND ((p124 <= 0) OR (p214 <= 0)) AND ((p117 <= 0) OR (p214 <= 0)) AND ((p134 <= 0) OR (p214 <= 0)) AND ((p151 <= 0) OR (p214 <= 0)) AND ((p125 <= 0) OR (p214 <= 0)) AND ((p108 <= 0) OR (p214 <= 0)) AND ((p142 <= 0) OR (p214 <= 0)) AND ((p140 <= 0) OR (p214 <= 0)) AND ((p130 <= 0) OR (p214 <= 0)) AND ((p150 <= 0) OR (p214 <= 0)) AND ((p149 <= 0) OR (p214 <= 0)) AND ((p111 <= 0) OR (p214 <= 0)) AND ((p120 <= 0) OR (p214 <= 0)) AND ((p139 <= 0) OR (p214 <= 0)) AND ((p141 <= 0) OR (p214 <= 0)) AND ((p119 <= 0) OR (p214 <= 0)) AND ((p131 <= 0) OR (p214 <= 0)) AND ((p110 <= 0) OR (p214 <= 0)) AND ((p148 <= 0) OR (p214 <= 0)) AND ((p113 <= 0) OR (p214 <= 0)) AND ((p147 <= 0) OR (p214 <= 0)) AND ((p137 <= 0) OR (p214 <= 0)) AND ((p103 <= 0) OR (p214 <= 0)) AND ((p128 <= 0) OR (p214 <= 0)) AND ((p122 <= 0) OR (p214 <= 0)) AND ((p112 <= 0) OR (p214 <= 0)) AND ((p129 <= 0) OR (p214 <= 0)) AND ((p146 <= 0) OR (p214 <= 0)) AND ((p121 <= 0) OR (p214 <= 0)) AND ((p104 <= 0) OR (p214 <= 0)) AND ((p138 <= 0) OR (p214 <= 0)))
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 128151 markings, 373100 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (X (((1 <= p102))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EF(AX(((1 <= p102)))))
lola: processed formula length: 25
lola: 27 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: 267963 markings, 1574228 edges, 53593 markings/sec, 0 secs
lola: 586535 markings, 3311270 edges, 63714 markings/sec, 5 secs
lola: 975369 markings, 5095902 edges, 77767 markings/sec, 10 secs
lola: 1240763 markings, 6858571 edges, 53079 markings/sec, 15 secs
lola: 1536940 markings, 8664889 edges, 59235 markings/sec, 20 secs
lola: 1841707 markings, 10448111 edges, 60953 markings/sec, 25 secs
lola: 2053041 markings, 12164440 edges, 42267 markings/sec, 30 secs
lola: 2375838 markings, 13868462 edges, 64559 markings/sec, 35 secs
lola: 2752541 markings, 15617507 edges, 75341 markings/sec, 40 secs
lola: 3026710 markings, 17379163 edges, 54834 markings/sec, 45 secs
lola: 3326744 markings, 19127158 edges, 60007 markings/sec, 50 secs
lola: 3566512 markings, 20870554 edges, 47954 markings/sec, 55 secs
lola: 3797254 markings, 22620870 edges, 46148 markings/sec, 60 secs
lola: 4046429 markings, 24366748 edges, 49835 markings/sec, 65 secs
lola: 4274499 markings, 26119051 edges, 45614 markings/sec, 70 secs
lola: 4470794 markings, 27897628 edges, 39259 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4471223 markings, 27946118 edges
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p184) AND (1 <= p214)) OR ((1 <= p174) AND (1 <= p214)) OR ((1 <= p154) AND (1 <= p214)) OR ((1 <= p164) AND (1 <= p214)) OR ((1 <= p194) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p214)) OR ((1 <= p156) AND (1 <= p214)) OR ((1 <= p173) AND (1 <= p214)) OR ((1 <= p183) AND (1 <= p214)) OR ((1 <= p153) AND (1 <= p214)) OR ((1 <= p166) AND (1 <= p214)) OR ((1 <= p165) AND (1... (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 ((((1 <= p184) AND (1 <= p214)) OR ((1 <= p174) AND (1 <= p214)) OR ((1 <= p154) AND (1 <= p214)) OR ((1 <= p164) AND (1 <= p214)) OR ((1 <= p194) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p214)) OR ((1 <= p156) AND (1 <= p214)) OR ((1 <= p173) AND (1 <= p214)) OR ((1 <= p183) AND (1 <= p214)) OR ((1 <= p153) AND (1 <= p214)) OR ((1 <= p166) AND (1 <= p214)) OR ((1 <= p165) AND (1... (shortened)
lola: processed formula length: 1739
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p102))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p102))))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p102 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 10213 markings, 10212 edges
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p206 <= 0) OR ((1 <= p102)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p206) AND ((p102 <= 0)))
lola: processed formula length: 31
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p206 <= 0) OR ((1 <= p102)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p206) AND ((p102 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 814897 markings, 1090066 edges, 162979 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1506411 markings, 2014628 edges, 138303 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 1510301 markings, 2020500 edges
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p204 <= 0) OR (p215 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p204 <= 0) OR (p215 <= 0))))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p204) AND (1 <= p215))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p58) AND (1 <= p209))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p58 <= 0) OR (p209 <= 0))
lola: processed formula length: 28
lola: 28 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: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 <= p58) AND (1 <= p209))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p58 <= 0) OR (p209 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-10-1.sara
sara: try reading problem file CTLFireability-10-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 520668 markings, 1796017 edges, 104134 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1027494 markings, 3554006 edges, 101365 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1367673 markings, 5342527 edges, 68036 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1842671 markings, 7115621 edges, 95000 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2144188 markings, 8911184 edges, 60303 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2691078 markings, 10620591 edges, 109378 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3138219 markings, 12408814 edges, 89428 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 3496167 markings, 14141202 edges, 71590 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 3848077 markings, 15981386 edges, 70382 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 4207057 markings, 17776660 edges, 71796 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 4469814 markings, 19605695 edges, 52551 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 4471223 markings, 19756224 edges
lola: ========================================
lola: subprocess 11 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p54 <= 0) OR (p209 <= 0)) AND ((p165 <= 0) OR (p214 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p54) AND (1 <= p209)) OR ((1 <= p165) AND (1 <= p214)))
lola: processed formula length: 64
lola: 28 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p54 <= 0) OR (p209 <= 0)) AND ((p165 <= 0) OR (p214 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: The predicate is possibly invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p86) AND (1 <= p209)) AND E ((((1 <= p102)) U ((1 <= p195) AND (1 <= p214)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p86) AND (1 <= p209)) AND E(((1 <= p102)) U ((1 <= p195) AND (1 <= p214)))))
lola: processed formula length: 87
lola: 26 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 13 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (((p144 <= 0) OR (p214 <= 0)))) OR (((1 <= p51)) OR E (G (((1 <= p77) AND (1 <= p209))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF(((p144 <= 0) OR (p214 <= 0))) OR (((1 <= p51)) OR EG(((1 <= p77) AND (1 <= p209))))))
lola: processed formula length: 93
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11 markings, 21 edges
lola: ========================================
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((p205 <= 0) OR (p215 <= 0)))) AND (((1 <= p203)) OR ((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((p205 <= 0) OR (p215 <= 0))) AND (((1 <= p203)) OR ((1 <= p15) AND (1 <= p213)) OR ((1 <= p10) AND (1 <= p213)) OR ((1 <= p25) AND (1 <= p213)) OR ((1 <= p5) AND (1 <= p213)) OR ((1 <= p20) AND (1 <= p213)) OR ((1 <= p1) AND (1 <= p213)) OR ((1 <= p6) AND (1 <= p213)) OR ((1 <= p50) AND (1 <= p213)) OR ((1 <= p14) AND (1 <= p213)) OR ((1 <= p16) AND (1 <= p213)) OR ((1 <= p19) ... (shortened)
lola: processed formula length: 908
lola: 26 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: 268011 markings, 1048224 edges
lola: ========================================
lola: subprocess 15 will run for 3363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p25 <= 0) OR (p213 <= 0)) U ((1 <= p184) AND (1 <= p214))))
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 ((((p25 <= 0) OR (p213 <= 0)) U ((1 <= p184) AND (1 <= p214))))
lola: processed formula length: 66
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p25 <= 0) OR (p213 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 10 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no no yes yes no no yes yes yes no no
lola:
preliminary result: no no yes yes no no no yes yes no no yes yes yes no no
lola: memory consumption: 240180 KB
lola: time consumption: 207 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="AirplaneLD-PT-0050"
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 AirplaneLD-PT-0050, 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 r166-smll-158987787400260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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