fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r322-tall-162132128000182
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for TwoPhaseLocking-PT-nC05000vN

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.680 3600000.00 397294.00 39165.30 F?FFFTFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r322-tall-162132128000182.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is TwoPhaseLocking-PT-nC05000vN, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128000182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.2K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC05000vN-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-15

=== Now, execution of the tool begins

BK_START 1621449472065

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 18:37:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 18:37:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 18:37:53] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-19 18:37:53] [INFO ] Transformed 8 places.
[2021-05-19 18:37:53] [INFO ] Transformed 6 transitions.
[2021-05-19 18:37:53] [INFO ] Parsed PT model containing 8 places and 6 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 10009 steps, including 0 resets, run visited all 14 properties in 11 ms. (steps per millisecond=909 )
[2021-05-19 18:37:53] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 18:37:53] [INFO ] Flatten gal took : 21 ms
FORMULA TwoPhaseLocking-PT-nC05000vN-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 18:37:53] [INFO ] Flatten gal took : 3 ms
[2021-05-19 18:37:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 18:37:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ TwoPhaseLocking-PT-nC05000vN @ 3570 seconds

FORMULA TwoPhaseLocking-PT-nC05000vN-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TwoPhaseLocking-PT-nC05000vN-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vN-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3145
rslt: Output for LTLFireability @ TwoPhaseLocking-PT-nC05000vN

{
"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=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": "Wed May 19 18:37:55 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((F ((1 <= p6)) AND ((p3 <= 0) OR (p5 <= 0)))) U X (F ((p6 <= 0)))))",
"processed_size": 75,
"rewrites": 95
},
"result":
{
"edges": 17498,
"markings": 17498,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"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": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((G (((p3 <= 0) OR (p4 <= 0))) AND (F (((p3 <= 0) OR (p5 <= 0))) OR G (((p3 <= 0) OR (p4 <= 0))))) R X (((p3 <= 0) OR (p4 <= 0))))))",
"processed_size": 142,
"rewrites": 95
},
"result":
{
"edges": 12503,
"markings": 12503,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"child":
[

{
"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": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p0 <= 0) OR (p1 <= 0))",
"processed_size": 25,
"rewrites": 95
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((p3 <= 0) OR (p5 <= 0))))",
"processed_size": 33,
"rewrites": 95
},
"result":
{
"edges": 10003,
"markings": 10003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((((p0 <= 0) OR (p1 <= 0)) R (p2 <= 0)) AND ((p3 <= 0) OR (p5 <= 0))))",
"processed_size": 75,
"rewrites": 95
},
"result":
{
"edges": 10003,
"markings": 10003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (X (((((1 <= p3) AND (1 <= p5)) U ((1 <= p0) AND (1 <= p1))) OR ((1 <= p3) AND (1 <= p5))))) OR ((p0 <= 0) OR (p1 <= 0)))))",
"processed_size": 132,
"rewrites": 95
},
"result":
{
"edges": 10087,
"markings": 10063,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p3) AND (1 <= p4))) OR (F ((((1 <= p3) AND (1 <= p4)) AND ((1 <= p3) AND (1 <= p4)))) OR X ((1 <= p7)))))",
"processed_size": 119,
"rewrites": 95
},
"result":
{
"edges": 28136246,
"markings": 12510000,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 6,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((G ((((((p3 <= 0) OR (p5 <= 0)) R (p2 <= 0)) R ((p3 <= 0) OR (p5 <= 0))) OR ((p0 <= 0) OR (p1 <= 0)))) AND (p2 <= 0))))",
"processed_size": 127,
"rewrites": 95
},
"result":
{
"edges": 18763,
"markings": 18762,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 443
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "X ((G (F ((p7 <= 0))) AND (p6 <= 0)))",
"processed_size": 37,
"rewrites": 95
},
"result":
{
"edges": 10004,
"markings": 10004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 506
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((G ((p6 <= 0)) OR G (((p0 <= 0) OR (p1 <= 0))))))",
"processed_size": 56,
"rewrites": 95
},
"result":
{
"edges": 10005,
"markings": 10005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (G ((1 <= p6))) U ((p3 <= 0) OR (p5 <= 0)))",
"processed_size": 47,
"rewrites": 95
},
"result":
{
"edges": 10003,
"markings": 10003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 709
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (F ((G (((p0 <= 0) OR (p1 <= 0))) AND ((p0 <= 0) OR (p1 <= 0))))) AND (1 <= p2)))",
"processed_size": 89,
"rewrites": 95
},
"result":
{
"edges": 10003,
"markings": 10003,
"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": 887
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p3) AND (1 <= p5))) OR ((1 <= p2) OR (G (((1 <= p7) AND (1 <= p2))) AND F ((X (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)))))))",
"processed_size": 138,
"rewrites": 95
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1182
},
"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 <= p3) AND (1 <= p5))",
"processed_size": 25,
"rewrites": 97
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p2)) AND (((1 <= p0) AND (1 <= p1)) OR (1 <= p2)))))",
"processed_size": 68,
"rewrites": 95
},
"result":
{
"edges": 10005,
"markings": 10004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3404,
"runtime": 425.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F((F(**) AND **)) U X(F(*)))) : G(F(**)) : X(G(((G(*) AND (F(*) OR G(*))) R X(*)))) : (X(((* R *) AND *)) OR (X(G(**)) AND **)) : F(G((X(X(((** U **) OR **))) OR (** OR **)))) : X((G(**) OR (F((** AND **)) OR X(**)))) : X(F((G((((* R *) R *) OR (* OR *))) AND *))) : X((G(F(*)) AND *)) : X(F((G(*) OR G(*)))) : (X(G(**)) U **) : F(*) : X((G(F((G(*) AND *))) AND **)) : X((X(**) OR (** OR (G((** AND **)) AND F((X(**) OR **)))))) : F(G((F(**) AND (** OR **))))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "no unknown no no no yes no no no no no no yes no ",
"value": "no unknown no no no yes no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 14/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 256
lola: finding significant places
lola: 8 places, 6 transitions, 5 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: X ((F ((F ((1 <= p6)) AND ((p3 <= 0) OR (p5 <= 0)))) U NOT(X (G ((1 <= p6)))))) : X ((((1 <= p3) AND (1 <= p4)) U F (X (G (F (((1 <= p3) AND (1 <= p5)))))))) : G (X (NOT(((G (((1 <= p3) AND (1 <= p5))) U F (((1 <= p3) AND (1 <= p4)))) U X (((1 <= p3) AND (1 <= p4))))))) : (NOT(X (((((1 <= p0) AND (1 <= p1)) U (1 <= p2)) OR ((1 <= p3) AND (1 <= p5))))) OR (G (X (((p3 <= 0) OR (p5 <= 0)))) AND ((p0 <= 0) OR (p1 <= 0)))) : X (X (F (X (G (((X (X (((((1 <= p3) AND (1 <= p5)) U ((1 <= p0) AND (1 <= p1))) OR ((1 <= p3) AND (1 <= p5))))) OR (p0 <= 0)) OR (p1 <= 0))))))) : ((X (G (((1 <= p3) AND (1 <= p4)))) OR F ((X (((1 <= p3) AND (1 <= p4))) AND X (((1 <= p3) AND (1 <= p4)))))) OR X (X ((1 <= p7)))) : NOT(G (X ((F (((((((1 <= p3) AND (1 <= p5)) U (1 <= p2)) U ((1 <= p3) AND (1 <= p5))) AND (1 <= p0)) AND (1 <= p1))) OR (1 <= p2))))) : NOT(X ((F (G (X ((1 <= p7)))) OR (1 <= p6)))) : NOT(X ((F (G (F ((1 <= p6)))) AND (((p0 <= 0) OR (p1 <= 0)) U G (X (F (((1 <= p0) AND (1 <= p1))))))))) : (X (G ((1 <= p6))) U ((p3 <= 0) OR (p5 <= 0))) : ((((p3 <= 0) OR (p5 <= 0)) U ((X (X (G ((((1 <= p3) AND (1 <= p5)) OR (1 <= p2))))) AND (1 <= p0)) AND (1 <= p1))) U NOT(G (((1 <= p3) AND (1 <= p5))))) : X ((X (X (G ((X (((1 <= p0) AND (1 <= p1))) U NOT(G ((F (((1 <= p0) AND (1 <= p1))) OR ((1 <= p0) AND (1 <= p1))))))))) AND (1 <= p2))) : X (((G ((1 <= p7)) AND G ((1 <= p2))) U (X (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)))) : X ((X (((1 <= p3) AND (1 <= p5) AND (1 <= p0) AND (1 <= p1))) U (((1 <= p0) AND (1 <= p1)) U F (G ((((1 <= p0) AND (1 <= p1)) U (1 <= p2)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((F ((1 <= p6)) AND ((p3 <= 0) OR (p5 <= 0)))) U X (F ((p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((F ((1 <= p6)) AND ((p3 <= 0) OR (p5 <= 0)))) U X (F ((p6 <= 0)))))
lola: processed formula length: 75
lola: 95 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: 17498 markings, 17498 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((G (((p3 <= 0) OR (p4 <= 0))) AND (F (((p3 <= 0) OR (p5 <= 0))) OR G (((p3 <= 0) OR (p4 <= 0))))) R X (((p3 <= 0) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((G (((p3 <= 0) OR (p4 <= 0))) AND (F (((p3 <= 0) OR (p5 <= 0))) OR G (((p3 <= 0) OR (p4 <= 0))))) R X (((p3 <= 0) OR (p4 <= 0))))))
lola: processed formula length: 142
lola: 95 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: 12503 markings, 12503 edges
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((p0 <= 0) OR (p1 <= 0)) R (p2 <= 0)) AND ((p3 <= 0) OR (p5 <= 0)))) OR (X (G (((p3 <= 0) OR (p5 <= 0)))) AND ((p0 <= 0) OR (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) OR (p1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0) OR (p1 <= 0))
lola: processed formula length: 25
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p3 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p3 <= 0) OR (p5 <= 0))))
lola: processed formula length: 33
lola: 95 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: 10003 markings, 10003 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p0 <= 0) OR (p1 <= 0)) R (p2 <= 0)) AND ((p3 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p0 <= 0) OR (p1 <= 0)) R (p2 <= 0)) AND ((p3 <= 0) OR (p5 <= 0))))
lola: processed formula length: 75
lola: 95 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: 10003 markings, 10003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (((((1 <= p3) AND (1 <= p5)) U ((1 <= p0) AND (1 <= p1))) OR ((1 <= p3) AND (1 <= p5))))) OR ((p0 <= 0) OR (p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (((((1 <= p3) AND (1 <= p5)) U ((1 <= p0) AND (1 <= p1))) OR ((1 <= p3) AND (1 <= p5))))) OR ((p0 <= 0) OR (p1 <= 0)))))
lola: processed formula length: 132
lola: 95 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: add low 5
lola: add low 3
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: 10063 markings, 10087 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p3) AND (1 <= p4))) OR (F ((((1 <= p3) AND (1 <= p4)) AND ((1 <= p3) AND (1 <= p4)))) OR X ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p3) AND (1 <= p4))) OR (F ((((1 <= p3) AND (1 <= p4)) AND ((1 <= p3) AND (1 <= p4)))) OR X ((1 <= p7)))))
lola: processed formula length: 119
lola: 95 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: 5342773 markings, 8010409 edges, 1068555 markings/sec, 0 secs
lola: 7966706 markings, 14506368 edges, 524787 markings/sec, 5 secs
lola: 10388461 markings, 21771632 edges, 484351 markings/sec, 10 secs
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: 12510000 markings, 28136246 edges
lola: ========================================
lola: subprocess 5 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((((p3 <= 0) OR (p5 <= 0)) R (p2 <= 0)) R ((p3 <= 0) OR (p5 <= 0))) OR ((p0 <= 0) OR (p1 <= 0)))) AND (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((((((p3 <= 0) OR (p5 <= 0)) R (p2 <= 0)) R ((p3 <= 0) OR (p5 <= 0))) OR ((p0 <= 0) OR (p1 <= 0)))) AND (p2 <= 0))))
lola: processed formula length: 127
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 18762 markings, 18763 edges
lola: ========================================
lola: subprocess 6 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((p7 <= 0))) AND (p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((p7 <= 0))) AND (p6 <= 0)))
lola: processed formula length: 37
lola: 95 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: 10004 markings, 10004 edges
lola: ========================================
lola: subprocess 7 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p6 <= 0)) OR G (((p0 <= 0) OR (p1 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p6 <= 0)) OR G (((p0 <= 0) OR (p1 <= 0))))))
lola: processed formula length: 56
lola: 95 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: 10005 markings, 10005 edges
lola: ========================================
lola: subprocess 8 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p6))) U ((p3 <= 0) OR (p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((1 <= p6))) U ((p3 <= 0) OR (p5 <= 0)))
lola: processed formula length: 47
lola: 95 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: 10003 markings, 10003 edges
lola: subprocess 9 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((G (((p0 <= 0) OR (p1 <= 0))) AND ((p0 <= 0) OR (p1 <= 0))))) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((G (((p0 <= 0) OR (p1 <= 0))) AND ((p0 <= 0) OR (p1 <= 0))))) AND (1 <= p2)))
lola: processed formula length: 89
lola: 95 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: ========================================
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: 10003 markings, 10003 edges
lola: ========================================
lola: subprocess 10 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p3) AND (1 <= p5))) OR ((1 <= p2) OR (G (((1 <= p7) AND (1 <= p2))) AND F ((X (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p3) AND (1 <= p5))) OR ((1 <= p2) OR (G (((1 <= p7) AND (1 <= p2))) AND F ((X (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)))))))
lola: processed formula length: 138
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p3 <= 0) OR (p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p3) AND (1 <= p5))
lola: processed formula length: 25
lola: 97 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p3) AND (1 <= p5))))
lola: processed formula length: 33
lola: 95 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: 5420926 markings, 7831235 edges, 1084185 markings/sec, 0 secs
lola: 10693328 markings, 15447077 edges, 1054480 markings/sec, 5 secs
lola: 15870137 markings, 22924924 edges, 1035362 markings/sec, 10 secs
lola: 21133634 markings, 30528045 edges, 1052699 markings/sec, 15 secs
lola: 26374825 markings, 38098941 edges, 1048238 markings/sec, 20 secs
lola: 31061701 markings, 45512309 edges, 937375 markings/sec, 25 secs
lola: 35370464 markings, 52694144 edges, 861753 markings/sec, 30 secs
lola: 39599197 markings, 59743202 edges, 845747 markings/sec, 35 secs
lola: 43796339 markings, 66737548 edges, 839428 markings/sec, 40 secs
lola: 48066492 markings, 73855203 edges, 854031 markings/sec, 45 secs
lola: 52296009 markings, 80905264 edges, 845903 markings/sec, 50 secs
lola: 56545469 markings, 87983806 edges, 849892 markings/sec, 55 secs
lola: 59178304 markings, 92370451 edges, 526567 markings/sec, 60 secs
lola: 61829783 markings, 96790363 edges, 530296 markings/sec, 65 secs
lola: 64509981 markings, 101254790 edges, 536040 markings/sec, 70 secs
lola: 67997904 markings, 107062199 edges, 697585 markings/sec, 75 secs
lola: 71550196 markings, 112973476 edges, 710458 markings/sec, 80 secs
lola: 74980989 markings, 118687663 edges, 686159 markings/sec, 85 secs
lola: 78395996 markings, 124375706 edges, 683001 markings/sec, 90 secs
lola: 81900683 markings, 130212357 edges, 700937 markings/sec, 95 secs
lola: 85234039 markings, 135766771 edges, 666671 markings/sec, 100 secs
lola: 88543206 markings, 141278264 edges, 661833 markings/sec, 105 secs
lola: 91865648 markings, 146815112 edges, 664488 markings/sec, 110 secs
lola: 95262719 markings, 152476002 edges, 679414 markings/sec, 115 secs
lola: 98618077 markings, 158069071 edges, 671072 markings/sec, 120 secs
lola: 100891529 markings, 161857566 edges, 454690 markings/sec, 125 secs
lola: 103019386 markings, 165402426 edges, 425571 markings/sec, 130 secs
lola: 104438093 markings, 167768756 edges, 283741 markings/sec, 135 secs
lola: 106745492 markings, 171613982 edges, 461480 markings/sec, 140 secs
lola: 109101789 markings, 175539805 edges, 471259 markings/sec, 145 secs
lola: 110931953 markings, 178592564 edges, 366033 markings/sec, 150 secs
lola: 112791030 markings, 181692429 edges, 371815 markings/sec, 155 secs
lola: 114432921 markings, 184427808 edges, 328378 markings/sec, 160 secs
lola: 115427030 markings, 186086178 edges, 198822 markings/sec, 165 secs
lola: 117966909 markings, 190318099 edges, 507976 markings/sec, 170 secs
lola: 119449946 markings, 192794263 edges, 296607 markings/sec, 175 secs
lola: 120636535 markings, 194767534 edges, 237318 markings/sec, 180 secs
lola: 122502096 markings, 197880276 edges, 373112 markings/sec, 185 secs
lola: 124050137 markings, 200462795 edges, 309608 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 3343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p2)) AND (((1 <= p0) AND (1 <= p1)) OR (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p2)) AND (((1 <= p0) AND (1 <= p1)) OR (1 <= p2)))))
lola: processed formula length: 68
lola: 95 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10004 markings, 10005 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p3) AND (1 <= p5))))
lola: processed formula length: 33
lola: 95 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: 5409034 markings, 7813890 edges, 1081807 markings/sec, 0 secs
lola: 10673453 markings, 15418327 edges, 1052884 markings/sec, 5 secs
lola: 15846070 markings, 22890185 edges, 1034523 markings/sec, 10 secs
lola: 21117991 markings, 30505338 edges, 1054384 markings/sec, 15 secs
lola: 26381290 markings, 38108178 edges, 1052660 markings/sec, 20 secs
lola: 31150621 markings, 45660617 edges, 953866 markings/sec, 25 secs
lola: 35542062 markings, 52979588 edges, 878288 markings/sec, 30 secs
lola: 39857754 markings, 60173095 edges, 863138 markings/sec, 35 secs
lola: 44122187 markings, 67281760 edges, 852887 markings/sec, 40 secs
lola: 48418263 markings, 74442295 edges, 859215 markings/sec, 45 secs
lola: 52702499 markings, 81583426 edges, 856847 markings/sec, 50 secs
lola: 56829634 markings, 88458434 edges, 825427 markings/sec, 55 secs
lola: 59370187 markings, 92690904 edges, 508111 markings/sec, 60 secs
lola: 62076657 markings, 97201207 edges, 541294 markings/sec, 65 secs
lola: 64992467 markings, 102059124 edges, 583162 markings/sec, 70 secs
lola: 68420792 markings, 107765003 edges, 685665 markings/sec, 75 secs
lola: 71744762 markings, 113298014 edges, 664794 markings/sec, 80 secs
lola: 74913285 markings, 118574449 edges, 633705 markings/sec, 85 secs
lola: 78316307 markings, 124242518 edges, 680604 markings/sec, 90 secs
lola: 81699429 markings, 129876612 edges, 676624 markings/sec, 95 secs
lola: 85124593 markings, 135584581 edges, 685033 markings/sec, 100 secs
lola: 88495186 markings, 141197148 edges, 674119 markings/sec, 105 secs
lola: 92022572 markings, 147077470 edges, 705477 markings/sec, 110 secs
lola: 95446637 markings, 152782865 edges, 684813 markings/sec, 115 secs
lola: 98865312 markings, 158481351 edges, 683735 markings/sec, 120 secs
lola: 101654202 markings, 163129823 edges, 557778 markings/sec, 125 secs
lola: 103067464 markings, 165484058 edges, 282652 markings/sec, 130 secs
lola: 105824167 markings, 170077300 edges, 551341 markings/sec, 135 secs
lola: 106376827 markings, 170998551 edges, 110532 markings/sec, 140 secs
lola: 109151901 markings, 175623342 edges, 555015 markings/sec, 145 secs
lola: 110006597 markings, 177049011 edges, 170939 markings/sec, 150 secs
lola: 111976444 markings, 180335090 edges, 393969 markings/sec, 155 secs
lola: 114057632 markings, 183803645 edges, 416238 markings/sec, 160 secs
lola: 115979745 markings, 187006636 edges, 384423 markings/sec, 165 secs
lola: 117449281 markings, 189455170 edges, 293907 markings/sec, 170 secs
lola: 119582743 markings, 193015889 edges, 426692 markings/sec, 175 secs
lola: 122321390 markings, 197577580 edges, 547729 markings/sec, 180 secs
lola: 124310289 markings, 200896639 edges, 397780 markings/sec, 185 secs
lola: 124621456 markings, 201414844 edges, 62233 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no yes no no no no no no yes no
lola:
preliminary result: no unknown no no no yes no no no no no no yes no
lola: memory consumption: 3404 KB
lola: time consumption: 425 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="TwoPhaseLocking-PT-nC05000vN"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is TwoPhaseLocking-PT-nC05000vN, 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 r322-tall-162132128000182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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