fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r135-tajo-158961408900060
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for PhilosophersDyn-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4267.080 4344.00 4230.00 12.50 FFTFFFTFTFTFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r135-tajo-158961408900060.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 win2019
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961408900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 87K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590264176152

info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PhilosophersDyn-PT-03 @ 3570 seconds

FORMULA PhilosophersDyn-PT-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-PT-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-PT-03-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA PhilosophersDyn-PT-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ PhilosophersDyn-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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 23 20:02:56 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 36,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 63,
"unfir": 27,
"visible_places": 0,
"visible_transitions": 36
},
"processed": "A (G ((((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT FIREABLE(Leave_1_3_3) AND NOT FIREABLE(Leave_2_3_2) AND NOT FIREABLE(Leave_1_3_1) AND NOT FIREABLE(Leave_3_1_3) AND NOT FIREABLE(Leave_1_2_2) AND NOT FIREABLE(Leave_3_3_3) AND NOT FIREABLE(Leave_3_2_1) AND NOT FIREABLE(Leave_2_1_3) AND NOT FIREABLE(Leave_3_2_2) AND NOT FIREABLE(Leave_2_2_2) AND NOT FIREABLE(Leave_3_1_2) AND NOT FIREABLE(Leave_1_1_1) AND NOT FIREABLE(Leave_2_1_2) AND NOT FIREABLE(Leave_1_2_3)) OR (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3))) OR G ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3))))))",
"processed_size": 1762,
"rewrites": 74
},
"result":
{
"edges": 813,
"markings": 325,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (X (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))",
"processed_size": 261,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 42,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 42,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 42
},
"processed": "A (X (X (X (G (((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)) OR F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3) OR FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)))))))))",
"processed_size": 1098,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 15,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 15,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (X (G (((NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3)) OR G ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3)))))))",
"processed_size": 448,
"rewrites": 74
},
"result":
{
"edges": 1686,
"markings": 649,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (X (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))))",
"processed_size": 97,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 4,
"aneg": 3,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 51,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 51,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 42
},
"processed": "A ((G (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT FIREABLE(Leave_1_3_3) AND NOT FIREABLE(Leave_2_3_2) AND NOT FIREABLE(Leave_1_3_1) AND NOT FIREABLE(Leave_3_1_3) AND NOT FIREABLE(Leave_1_2_2) AND NOT FIREABLE(Leave_3_3_3) AND NOT FIREABLE(Leave_3_2_1) AND NOT FIREABLE(Leave_2_1_3) AND NOT FIREABLE(Leave_3_2_2) AND NOT FIREABLE(Leave_2_2_2) AND NOT FIREABLE(Leave_3_1_2) AND NOT FIREABLE(Leave_1_1_1) AND NOT FIREABLE(Leave_2_1_2) AND NOT FIREABLE(Leave_1_2_3)) AND (G ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3))) R (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3))))) OR X (X (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))))",
"processed_size": 1470,
"rewrites": 74
},
"result":
{
"edges": 512,
"markings": 229,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 27,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 27,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (X (X (F (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND G (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND X (X (X ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))))))))))",
"processed_size": 793,
"rewrites": 74
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 5,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 42,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 42,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (X (((X ((NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))) AND (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))) AND ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) U (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))) U X ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3))))))",
"processed_size": 1271,
"rewrites": 74
},
"result":
{
"edges": 96,
"markings": 79,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((NOT FIREABLE(Eat_3_2) OR X (F (FIREABLE(TakeLeft_2)))))",
"processed_size": 59,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (X (G ((NOT FIREABLE(Join_2_1_3) OR G (F (NOT FIREABLE(Initialize_3_1)))))))",
"processed_size": 78,
"rewrites": 74
},
"result":
{
"edges": 1111,
"markings": 437,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((X (F ((F (FIREABLE(Initialize_2_1)) OR X (F (FIREABLE(Join_2_1_3)))))) U G (NOT FIREABLE(Initialize_3_2))))",
"processed_size": 111,
"rewrites": 74
},
"result":
{
"edges": 1103,
"markings": 341,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (F (G ((F (((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2))))) AND ((FIREABLE(Initialize_3_2) U FIREABLE(SearchForks_2)) OR ((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2)))))))))",
"processed_size": 271,
"rewrites": 74
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((FIREABLE(TakeLeft_3) U FIREABLE(SearchForks_2)))",
"processed_size": 52,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((F (NOT FIREABLE(TakeRight_2_3)) OR (FIREABLE(SearchForks_2) OR X (G (NOT FIREABLE(SearchForks_2))))))",
"processed_size": 105,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (F (G (NOT FIREABLE(TakeLeft_2))))",
"processed_size": 36,
"rewrites": 74
},
"result":
{
"edges": 23,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (F (G ((F (FIREABLE(TakeRight_3_2)) AND (F (FIREABLE(TakeLeft_2)) OR FIREABLE(TakeRight_3_2))))))",
"processed_size": 99,
"rewrites": 74
},
"result":
{
"edges": 9,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "(FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))",
"processed_size": 81,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 15428,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(G(**))) AND A(G((* OR G(*))))) : A(X(X(X(G((** OR F(**))))))) : A(X(G((* OR G(*))))) : A(X(X(G(**)))) : A((G((* AND (G(*) R *))) OR X(X(F(**))))) : A(X(X(F((** AND G((** AND X(X(X(**)))))))))) : A(X(((X(*) AND (F(**) AND (** U **))) U X(*)))) : (** AND A(F(**))) : A((** OR X(F(**)))) : A(F(G((F(**) AND (F(**) OR **))))) : A(X(G((* OR G(F(**)))))) : A(F(G(*))) : A((X(F((F(**) OR X(F(**))))) U G(*))) : A(F(G((F((** OR X(X(**)))) AND ((** U **) OR (** OR X(X(**)))))))) : (A((** U **)) AND A(X(X(X(G(**)))))) : A((F(*) OR (** OR X(G(*)))))"
},
"net":
{
"arcs": 564,
"conflict_clusters": 1,
"places": 30,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 84
},
"result":
{
"preliminary_value": "no no yes no no no yes no yes no yes no no no no yes ",
"value": "no no yes no no no yes no yes no yes no no no no 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: 114/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 84 transitions, 19 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 LTLFireability.xml
lola: A ((G (X ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) AND NOT(F ((((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)) AND (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) AND F ((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT FIREABLE(Leave_1_3_3) AND NOT FIREABLE(Leave_2_3_2) AND NOT FIREABLE(Leave_1_3_1) AND NOT FIREABLE(Leave_3_1_3) AND NOT FIREABLE(Leave_1_2_2) AND NOT FIREABLE(Leave_3_3_3) AND NOT FIREABLE(Leave_3_2_1) AND NOT FIREABLE(Leave_2_1_3) AND NOT FIREABLE(Leave_3_2_2) AND NOT FIREABLE(Leave_2_2_2) AND NOT FIREABLE(Leave_3_1_2) AND NOT FIREABLE(Leave_1_1_1) AND NOT FIREABLE(Leave_2_1_2) AND NOT FIREABLE(Leave_1_2_3)))))))) : A (X (G (X ((X ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) OR (F (X ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))) U X (F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3) OR FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)))))))))) : A (G (X (NOT(((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)) AND F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))))) : A (G (X (X ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))))) : A ((G (NOT(((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)) OR (F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))) U (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))) OR X (X (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))))) : A (X (F (X (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND G (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND X (X (X ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))))))))) : A (X ((((NOT(X ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) AND F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) AND ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) U (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) U NOT(X ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))))) : A (((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)) AND F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))) : A ((NOT FIREABLE(Eat_3_2) OR F (X ((F ((G (F (FIREABLE(TakeRight_3_2))) U FIREABLE(Initialize_1_3))) U FIREABLE(TakeLeft_2)))))) : A (F (G ((F (FIREABLE(TakeLeft_2)) U FIREABLE(TakeRight_3_2))))) : A (G (NOT(X (F ((FIREABLE(Join_2_1_3) AND NOT(G (F (X (NOT FIREABLE(Initialize_3_1))))))))))) : A (X (F (NOT((FIREABLE(TakeLeft_2) OR F (FIREABLE(TakeLeft_2))))))) : A ((X (F ((F (FIREABLE(Initialize_2_1)) OR F (X (FIREABLE(Join_2_1_3)))))) U NOT(F (FIREABLE(Initialize_3_2))))) : A (X (F (G (((FIREABLE(Initialize_3_2) U FIREABLE(SearchForks_2)) U ((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2))))))))) : A (((FIREABLE(TakeLeft_3) U FIREABLE(SearchForks_2)) AND X (X (X (G (FIREABLE(SearchForks_3))))))) : A (((NOT(G (FIREABLE(TakeRight_2_3))) OR ((FIREABLE(SearchForks_2) OR G (FIREABLE(SearchForks_2))) U FIREABLE(SearchForks_2))) OR NOT(F (X (FIREABLE(SearchForks_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:500
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:494
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: 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 (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))) AND A (G ((((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT ... (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 (G ((((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND N... (shortened)
lola: processed formula length: 1762
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 325 markings, 813 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
lola: processed formula length: 261
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 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 (X (X (G (((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)) OR F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)) OR F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3) OR FIREABL... (shortened)
lola: processed formula length: 1098
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3)) OR G ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initia... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3)) OR G ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initia... (shortened)
lola: processed formula length: 448
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 649 markings, 1686 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))))
lola: processed formula length: 97
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND N... (shortened)
lola: processed formula length: 1470
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 229 markings, 512 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND G (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRig... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND G (((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRig... (shortened)
lola: processed formula length: 793
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((X ((NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))) AND (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((X ((NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))) AND (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(... (shortened)
lola: processed formula length: 1271
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 79 markings, 96 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(Eat_3_2) OR X (F (FIREABLE(TakeLeft_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((NOT FIREABLE(Eat_3_2) OR X (F (FIREABLE(TakeLeft_2)))))
lola: processed formula length: 59
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((NOT FIREABLE(Join_2_1_3) OR G (F (NOT FIREABLE(Initialize_3_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((NOT FIREABLE(Join_2_1_3) OR G (F (NOT FIREABLE(Initialize_3_1)))))))
lola: processed formula length: 78
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 437 markings, 1111 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((F (FIREABLE(Initialize_2_1)) OR X (F (FIREABLE(Join_2_1_3)))))) U G (NOT FIREABLE(Initialize_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((F (FIREABLE(Initialize_2_1)) OR X (F (FIREABLE(Join_2_1_3)))))) U G (NOT FIREABLE(Initialize_3_2))))
lola: processed formula length: 111
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 341 markings, 1103 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2))))) AND ((FIREABLE(Initialize_3_2) U FIREABLE(SearchForks_2)) OR ((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2))))) AND ((FIREABLE(Initialize_3_2) U FIREABLE(SearchForks_2)) OR ((FIREABLE(Initialize_3_2) AND NOT FIREABLE(TakeRight_2_1)) OR X (X (FIREABLE(SearchForks_2)))))))))
lola: processed formula length: 271
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((FIREABLE(TakeLeft_3) U FIREABLE(SearchForks_2))) AND A (X (X (X (G (FIREABLE(SearchForks_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(TakeLeft_3) U FIREABLE(SearchForks_2)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
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 ((FIREABLE(TakeLeft_3) U FIREABLE(SearchForks_2)))
lola: processed formula length: 52
lola: 78 rewrites
lola: closed formula file LTLFireability.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: RUNNING
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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (NOT FIREABLE(TakeRight_2_3)) OR (FIREABLE(SearchForks_2) OR X (G (NOT FIREABLE(SearchForks_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (NOT FIREABLE(TakeRight_2_3)) OR (FIREABLE(SearchForks_2) OR X (G (NOT FIREABLE(SearchForks_2))))))
lola: processed formula length: 105
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (NOT FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (NOT FIREABLE(TakeLeft_2))))
lola: processed formula length: 36
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 23 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (FIREABLE(TakeRight_3_2)) AND (F (FIREABLE(TakeLeft_2)) OR FIREABLE(TakeRight_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (FIREABLE(TakeRight_3_2)) AND (F (FIREABLE(TakeLeft_2)) OR FIREABLE(TakeRight_3_2))))))
lola: processed formula length: 99
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 9 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)) AND A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
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: (FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))
lola: processed formula length: 81
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no yes no yes no no no no yes
lola:
preliminary result: no no yes no no no yes no yes no yes no no no no yes
lola: memory consumption: 15428 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

BK_STOP 1590264180496

--------------------
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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2019"
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 win2019"
echo " Input is PhilosophersDyn-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tajo-158961408900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;