Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938900396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SafeBus-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938900396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 3.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 93K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591238481230

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:41:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:41:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:41:22] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-06-04 02:41:22] [INFO ] Transformed 57 places.
[2020-06-04 02:41:22] [INFO ] Transformed 91 transitions.
[2020-06-04 02:41:22] [INFO ] Parsed PT model containing 57 places and 91 transitions in 77 ms.
Reduce places removed 3 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0]
[2020-06-04 02:41:22] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2020-06-04 02:41:22] [INFO ] Computed 17 place invariants in 7 ms
[2020-06-04 02:41:22] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-06-04 02:41:23] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-04 02:41:23] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-06-04 02:41:23] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-04 02:41:23] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned unsat
[2020-06-04 02:41:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-04 02:41:23] [INFO ] Flatten gal took : 43 ms
[2020-06-04 02:41:23] [INFO ] Flatten gal took : 13 ms
[2020-06-04 02:41:23] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-04 02:41:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SafeBus-PT-03 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA SafeBus-PT-03-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ SafeBus-PT-03

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 2,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "AX((EG((((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))) OR ((1 <= p0) AND (1 <= p1) AND (((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p5) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p28))))))",
"processed_size": 317,
"rewrites": 53
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 522,
"markings": 374,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EX(EF(EG((((1 <= p25) AND (1 <= p32)) OR ((1 <= p26) AND (1 <= p33)) OR ((1 <= p27) AND (1 <= p34))))))",
"processed_size": 105,
"rewrites": 54
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 20924,
"markings": 4650,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(((1 <= p37) AND (1 <= p43) AND ((p11 <= 0) OR (p40 <= 0))))",
"processed_size": 63,
"rewrites": 52
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "((p2 <= 0) OR (p4 <= 0))",
"processed_size": 25,
"rewrites": 53
},
"result":
{
"edges": 59,
"markings": 59,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"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": "EX(((1 <= p11) AND (1 <= p46)))",
"processed_size": 31,
"rewrites": 52
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p2) AND (1 <= p4))",
"processed_size": 25,
"rewrites": 55
},
"result":
{
"edges": 4359,
"markings": 1903,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 4,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 54
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 91
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G ((((p49 <= 0) OR (p51 <= 0)) AND ((p49 <= 0) OR (p52 <= 0)) AND ((p50 <= 0) OR (p51 <= 0)) AND ((p50 <= 0) OR (p52 <= 0)) AND ((p50 <= 0) OR (p53 <= 0)) AND ((p48 <= 0) OR (p51 <= 0)) AND ((p48 <= 0) OR (p52 <= 0)) AND ((p49 <= 0) OR (p53 <= 0)) AND ((p48 <= 0) OR (p53 <= 0)))))",
"processed_size": 293,
"rewrites": 52
},
"result":
{
"edges": 344,
"markings": 236,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 9
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p12 <= 0) OR (p47 <= 0)) AND ((p10 <= 0) OR (p45 <= 0)) AND ((p11 <= 0) OR (p46 <= 0)))",
"processed_size": 93,
"rewrites": 54
},
"result":
{
"edges": 216,
"markings": 160,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p11)))",
"processed_size": 378,
"rewrites": 54
},
"result":
{
"edges": 12490,
"markings": 4585,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 24,
"problems": 12
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 26,
"aneg": 0,
"comp": 66,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(((((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0))) OR (((p12 <= 0) OR (p47 <= 0)) AND ((p10 <= 0) OR (p45 <= 0)) AND ((p11 <= 0) OR (p46 <= 0)))) AND ((((p15 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p21 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p18 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p19 <= 0) OR (p28 <= 0) OR (p35 <= 0))) OR (((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))))",
"processed_size": 1044,
"rewrites": 54
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 91
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EG((EF(((p0 <= 0) OR (p9 <= 0) OR (p28 <= 0))) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0))))",
"processed_size": 112,
"rewrites": 53
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 115,
"markings": 56,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 12,
"adisj": 3,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "AF((A((((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8))) U (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) AND (((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34)))))",
"processed_size": 377,
"rewrites": 53
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 197,
"markings": 91,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 21,
"adisj": 3,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))) U (EG((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)))) OR AG((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))))",
"processed_size": 683,
"rewrites": 54
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 117,
"markings": 116,
"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": 1783
},
"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": "((p41 <= 0) OR (p48 <= 0))",
"processed_size": 27,
"rewrites": 55
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p3 <= 0) OR (p34 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)))",
"processed_size": 60,
"rewrites": 54
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p12) AND (1 <= p47))",
"processed_size": 27,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28))",
"processed_size": 57,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p3 <= 0) OR (p34 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)))",
"processed_size": 60,
"rewrites": 54
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 60900,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : E((** U (E(G(**)) OR A(G(**))))) : A(F((A((** U **)) AND **))) : A(F(**)) : E(G(*)) : A(X((E(G(*)) OR **))) : E(X(E(F(E(G(**)))))) : A(F(*)) : (E(X(E(G(*)))) OR E(X(**))) : (A(F(**)) OR (** OR (A(F(**)) AND (** AND **)))) : A(F(DEADLOCK)) : A(F(**)) : A(F(A(G(**)))) : E(G((E(F(*)) AND **))) : (E(F(A(G(*)))) OR (A(X(**)) OR E(X(*)))) : E(G(*))"
},
"net":
{
"arcs": 529,
"conflict_clusters": 4,
"places": 54,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 91
},
"result":
{
"preliminary_value": "yes yes no no yes yes no no yes no no no no yes yes yes ",
"value": "yes yes no no yes yes no no yes no no no no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 145/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 91 transitions, 37 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (G (E (F ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p11))))))) : E (((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))) U (E (G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) OR A (G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)))))))) : A (F ((A (((((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8))) U (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))))) AND (((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34)))))) : A (F ((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))))) : NOT(A (F ((((1 <= p49) AND (1 <= p51)) OR ((1 <= p49) AND (1 <= p52)) OR ((1 <= p50) AND (1 <= p51)) OR ((1 <= p50) AND (1 <= p52)) OR ((1 <= p50) AND (1 <= p53)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p48) AND (1 <= p52)) OR ((1 <= p49) AND (1 <= p53)) OR ((1 <= p48) AND (1 <= p53)))))) : A (X ((NOT(A (F ((((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34)))))) OR ((1 <= p0) AND (1 <= p1) AND (((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p5) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p28))))))) : E (F (E (X (E (G ((((1 <= p25) AND (1 <= p32)) OR ((1 <= p26) AND (1 <= p33)) OR ((1 <= p27) AND (1 <= p34))))))))) : NOT(E (G ((((((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0))) OR (((p12 <= 0) OR (p47 <= 0)) AND ((p10 <= 0) OR (p45 <= 0)) AND ((p11 <= 0) OR (p46 <= 0)))) AND ((((p15 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p21 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p18 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p19 <= 0) OR (p28 <= 0) OR (p35 <= 0))) OR (((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))))))) : E (X ((NOT(A (F (((1 <= p2) AND (1 <= p4))))) OR ((1 <= p37) AND (1 <= p43) AND ((p11 <= 0) OR (p40 <= 0)))))) : ((A (F ((((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50))))) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28))) OR ((A (F (((((1 <= p36) AND (1 <= p42)) OR ((1 <= p41) AND (1 <= p49))) AND (1 <= p3) AND (1 <= p34)))) AND (1 <= p12)) AND (1 <= p47))) : A (F (E (G (A (X ((1 <= 0))))))) : A (F (((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28)))) : NOT(E (G (NOT(A (G (((1 <= p41) AND (1 <= p48)))))))) : E (G ((NOT(A (G (((1 <= p0) AND (1 <= p9) AND (1 <= p28))))) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0))))) : ((NOT(A (G (E (F (((1 <= p2) AND (1 <= p4))))))) OR A (X (((1 <= p31) AND (1 <= p44))))) OR NOT(A (X (((p11 <= 0) OR (p46 <= 0)))))) : (NOT(A (F (((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35))))) AND (NOT(E (X ((1 <= 0)))) OR NOT(A (X ((1 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:200
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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 ((E (G ((((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0))))) OR ((1 <= p0) AND (1 <= p1) AND (((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p5) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p28)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EG((((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))) OR ((1 <= p0) AND (1 <= p1) AND (((1 <= p9) AND (1 <= p28)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p5) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p28))))))
lola: processed formula length: 317
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 374 markings, 522 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (E (G ((((1 <= p25) AND (1 <= p32)) OR ((1 <= p26) AND (1 <= p33)) OR ((1 <= p27) AND (1 <= p34)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EF(EG((((1 <= p25) AND (1 <= p32)) OR ((1 <= p26) AND (1 <= p33)) OR ((1 <= p27) AND (1 <= p34))))))
lola: processed formula length: 105
lola: 54 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: 4650 markings, 20924 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G (((p2 <= 0) OR (p4 <= 0)))))) OR E (X (((1 <= p37) AND (1 <= p43) AND ((p11 <= 0) OR (p40 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p37) AND (1 <= p43) AND ((p11 <= 0) OR (p40 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p37) AND (1 <= p43) AND ((p11 <= 0) OR (p40 <= 0))))
lola: processed formula length: 63
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p2 <= 0) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((p2 <= 0) OR (p4 <= 0))
lola: processed formula length: 25
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) OR (p4 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 59 markings, 59 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p2 <= 0) OR (p4 <= 0)))))) OR (A (X (((1 <= p31) AND (1 <= p44)))) OR E (X (((1 <= p11) AND (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p11) AND (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p11) AND (1 <= p46)))
lola: processed formula length: 31
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p2 <= 0) OR (p4 <= 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 <= p2) AND (1 <= p4))
lola: processed formula length: 25
lola: 55 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 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: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: ((p2 <= 0) OR (p4 <= 0))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((1 <= p2) AND (1 <= p4))
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: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: try reading problem file CTLFireability-4-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 1903 markings, 4359 edges
lola: state equation 1: solution produced
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (DEADLOCK))
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:776
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 82 markings, 82 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28))))
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: ((p13 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0))
lola: processed formula length: 57
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
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: 85 markings, 85 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0))))
lola: processed formula length: 65
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 50 markings, 51 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p49 <= 0) OR (p51 <= 0)) AND ((p49 <= 0) OR (p52 <= 0)) AND ((p50 <= 0) OR (p51 <= 0)) AND ((p50 <= 0) OR (p52 <= 0)) AND ((p50 <= 0) OR (p53 <= 0)) AND ((p48 <= 0) OR (p51 <= 0)) AND ((p48 <= 0) OR (p52 <= 0)) AND ((p49 <= 0) OR (p53 <= 0)) AND ((p48 <= 0) OR (p53 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p49 <= 0) OR (p51 <= 0)) AND ((p49 <= 0) OR (p52 <= 0)) AND ((p50 <= 0) OR (p51 <= 0)) AND ((p50 <= 0) OR (p52 <= 0)) AND ((p50 <= 0) OR (p53 <= 0)) AND ((p48 <= 0) OR (p51 <= 0)) AND ((p48 <= 0) OR (p52 <= 0)) AND ((p49 <= 0) OR (p53 <= 0)) AND ((p48 <= 0) OR (p53 <= 0)))))
lola: processed formula length: 293
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p49) AND (1 <= p51)) OR ((1 <= p49) AND (1 <= p52)) OR ((1 <= p50) AND (1 <= p51)) OR ((1 <= p50) AND (1 <= p52)) OR ((1 <= p50) AND (1 <= p53)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p48) AND (1 <= p52)) OR ((1 <= p49) AND (1 <= p53)) OR ((1 <= p48) AND (1 <= p53)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 236 markings, 344 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))))
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: (((p12 <= 0) OR (p47 <= 0)) AND ((p10 <= 0) OR (p45 <= 0)) AND ((p11 <= 0) OR (p46 <= 0)))
lola: processed formula length: 93
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 160 markings, 216 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p11)))
lola: processed formula length: 378
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)))
lola: formula 1: (((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p11)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 24 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 4585 markings, 12490 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))) AND (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) OR (((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0))) OR (((p12 <= 0) OR (p47 <= 0)) AND ((p10 <= 0) OR (p45 <= 0)) AND ((p11 <= 0) OR (p46 <= 0)))) AND ((((p15 <... (shortened)
lola: processed formula length: 1044
lola: 54 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: formula 0: (((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))) AND (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) OR ((((1 <= p15) AND (1 <= p22) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p28) AND (1 <= p35))) AND (((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34)))))
lola: 82 markings, 82 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 270 literals and 54 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (((p0 <= 0) OR (p9 <= 0) OR (p28 <= 0)))) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF(((p0 <= 0) OR (p9 <= 0) OR (p28 <= 0))) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0))))
lola: processed formula length: 112
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 56 markings, 115 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (((((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8))) U (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))))) AND (((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((A((((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8))) U (((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) AND (((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34)))))
lola: processed formula length: 377
lola: 53 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: 91 markings, 197 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))) U (E (G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) OR A ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))) U (EG((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)))) OR AG((((1 ... (shortened)
lola: processed formula length: 683
lola: 54 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: 116 markings, 117 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p41) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p41 <= 0) OR (p48 <= 0))
lola: processed formula length: 27
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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 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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: ((1 <= p41) AND (1 <= p48))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((p41 <= 0) OR (p48 <= 0))
lola: state equation task get result unparse finished id 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 82 markings, 82 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50))))) OR (((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28)) OR (A (F (((((1 <= p36) AND (1 <= p42)) OR ((1 <= p41) AND (1 <= p49))) AND (1 <= p3) AND (1 <= p34)))) AND ((1 <= p12) AND (1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p12) AND (1 <= p47))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p12) AND (1 <= p47))
lola: processed formula length: 27
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50)))))
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: (((p3 <= 0) OR (p34 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)))
lola: processed formula length: 60
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 64 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50))))) OR (((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28)) OR (A (F (((((1 <= p36) AND (1 <= p42)) OR ((1 <= p41) AND (1 <= p49))) AND (1 <= p3) AND (1 <= p34)))) AND ((1 <= p12) AND (1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p12) AND (1 <= p47))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p12) AND (1 <= p47))
lola: processed formula length: 27
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28))
lola: processed formula length: 57
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50)))))
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: (((p3 <= 0) OR (p34 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)))
lola: processed formula length: 60
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3) AND (1 <= p34)) OR ((1 <= p40) AND (1 <= p50)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 64 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no yes no no no no yes yes yes
lola:
preliminary result: yes yes no no yes yes no no yes no no no no yes yes yes
lola: memory consumption: 60900 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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