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.r151-tall-162089151200197.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 ParamProductionCell-PT-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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 ParamProductionCell-PT-4-00
FORMULA_NAME ParamProductionCell-PT-4-01
FORMULA_NAME ParamProductionCell-PT-4-02
FORMULA_NAME ParamProductionCell-PT-4-03
FORMULA_NAME ParamProductionCell-PT-4-04
FORMULA_NAME ParamProductionCell-PT-4-05
FORMULA_NAME ParamProductionCell-PT-4-06
FORMULA_NAME ParamProductionCell-PT-4-07
FORMULA_NAME ParamProductionCell-PT-4-08
FORMULA_NAME ParamProductionCell-PT-4-09
FORMULA_NAME ParamProductionCell-PT-4-10
FORMULA_NAME ParamProductionCell-PT-4-11
FORMULA_NAME ParamProductionCell-PT-4-12
FORMULA_NAME ParamProductionCell-PT-4-13
FORMULA_NAME ParamProductionCell-PT-4-14
FORMULA_NAME ParamProductionCell-PT-4-15

=== Now, execution of the tool begins

BK_START 1621005985416

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 15:26:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 15:26:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:26:27] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-14 15:26:27] [INFO ] Transformed 231 places.
[2021-05-14 15:26:27] [INFO ] Transformed 202 transitions.
[2021-05-14 15:26:27] [INFO ] Found NUPN structural information;
[2021-05-14 15:26:27] [INFO ] Parsed PT model containing 231 places and 202 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 318 ms. (steps per millisecond=314 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 15:26:27] [INFO ] Computed 59 place invariants in 13 ms
[2021-05-14 15:26:27] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2021-05-14 15:26:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-14 15:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:26:27] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-14 15:26:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:26:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned unsat
[2021-05-14 15:26:28] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2021-05-14 15:26:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:26:28] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-14 15:26:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:26:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2021-05-14 15:26:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:26:28] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-14 15:26:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 15:26:28] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:26:28] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2021-05-14 15:26:28] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2021-05-14 15:26:28] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2021-05-14 15:26:28] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2021-05-14 15:26:28] [INFO ] Deduced a trap composed of 10 places in 59 ms
[2021-05-14 15:26:29] [INFO ] Deduced a trap composed of 7 places in 23 ms
[2021-05-14 15:26:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 454 ms
[2021-05-14 15:26:29] [INFO ] Computed and/alt/rep : 198/572/198 causal constraints in 10 ms.
[2021-05-14 15:26:29] [INFO ] Added : 65 causal constraints over 13 iterations in 215 ms. Result :sat
[2021-05-14 15:26:29] [INFO ] Deduced a trap composed of 7 places in 44 ms
[2021-05-14 15:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2021-05-14 15:26:29] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:26:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:26:29] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-14 15:26:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:26:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned unsat
[2021-05-14 15:26:29] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2021-05-14 15:26:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:26:29] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-14 15:26:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:26:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2021-05-14 15:26:30] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-14 15:26:30] [INFO ] Flatten gal took : 99 ms
FORMULA ParamProductionCell-PT-4-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:26:30] [INFO ] Applying decomposition
[2021-05-14 15:26:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 15:26:30] [INFO ] Flatten gal took : 17 ms
[2021-05-14 15:26:30] [INFO ] Decomposing Gal with order
[2021-05-14 15:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:26:30] [INFO ] Removed a total of 137 redundant transitions.
[2021-05-14 15:26:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 15:26:30] [INFO ] Flatten gal took : 82 ms
[2021-05-14 15:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 10 ms.
[2021-05-14 15:26:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ParamProductionCell-PT-4-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:26:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-14 15:26:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ParamProductionCell-PT-4 @ 3570 seconds

FORMULA ParamProductionCell-PT-4-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3539
rslt: Output for LTLCardinality @ ParamProductionCell-PT-4

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 15:26:31 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((((p101 <= 0)) OR ((1 <= p116))))) OR X ((F ((((p101 <= 0)) OR ((1 <= p116)))) U G (((1 <= p4))))))))",
"processed_size": 116,
"rewrites": 28
},
"result":
{
"edges": 270,
"markings": 268,
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 1,
"X": 2,
"aconj": 9,
"adisj": 4,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (((G (((G ((((p146 <= 0)) OR ((1 <= p220)))) OR G ((((p92 <= 0)) OR ((1 <= p67))))) AND X ((((p230 <= 0)) OR ((1 <= p218)))))) AND (((p162 <= 0)) OR ((1 <= p144)))) U ((1 <= p110))))",
"processed_size": 188,
"rewrites": 28
},
"result":
{
"edges": 284,
"markings": 284,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((((p85 <= 0)) OR F (((p40 <= 0))))) AND ((1 <= p85))))))",
"processed_size": 69,
"rewrites": 28
},
"result":
{
"edges": 13893755,
"markings": 2919889,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((((p69 <= 0)))))",
"processed_size": 22,
"rewrites": 28
},
"result":
{
"edges": 305,
"markings": 305,
"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": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p146 <= 0)) OR ((1 <= p176)))))",
"processed_size": 41,
"rewrites": 28
},
"result":
{
"edges": 207,
"markings": 207,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1179
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1179
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((p110 <= 0)) OR ((1 <= p130)))",
"processed_size": 33,
"rewrites": 30
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 1769
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((1 <= p153)))",
"processed_size": 17,
"rewrites": 28
},
"result":
{
"edges": 195,
"markings": 195,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1769
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p119))))",
"processed_size": 21,
"rewrites": 28
},
"result":
{
"edges": 1246,
"markings": 958,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p210 <= 0)) OR ((1 <= p7)))))",
"processed_size": 39,
"rewrites": 28
},
"result":
{
"edges": 270,
"markings": 269,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 31720,
"runtime": 31.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((F(G(**)) OR X((F(**) U G(**)))))) : X(((G(((G(**) OR G(**)) AND X(**))) AND **) U **)) : X(X(F((G((** OR F(*))) AND **)))) : X(G(*)) : G(F(**)) : F(G(*)) : X(G(*)) : (X(**) OR ((** U **) AND F(*)))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no no yes no yes no no no ",
"value": "no no yes no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: F (X ((F (G ((((p101 <= 0)) OR ((1 <= p116))))) OR X ((F ((((p101 <= 0)) OR ((1 <= p116)))) U G (((1 <= p4)))))))) : X (((G (((G ((((p146 <= 0)) OR ((1 <= p220)))) OR G ((((p92 <= 0)) OR ((1 <= p67))))) AND X ((((p230 <= 0)) OR ((1 <= p218)))))) AND (((p162 <= 0)) OR ((1 <= p144)))) U ((1 <= p110)))) : F (X (X ((G ((((p85 <= 0)) OR NOT(G (((1 <= p40)))))) AND ((1 <= p85)))))) : X (G (NOT(F ((((1 <= p69))))))) : X (G (X (G (F (((1 <= p119))))))) : F (X (G (F (NOT(F (X (F ((((1 <= p210)) AND ((p7 <= 0))))))))))) : NOT(X (F ((((F ((((p4 <= 0)) OR ((1 <= p81)))) AND F ((((p146 <= 0)) OR ((1 <= p176))))) AND (((p146 <= 0)) OR ((1 <= p176)) OR ((p4 <= 0)) OR ((1 <= p81)))) U (((1 <= p146)) AND ((p176 <= 0))))))) : (X (((1 <= p153))) OR (((((p10 <= 0)) OR ((1 <= p115))) U (((p110 <= 0)) OR ((1 <= p130)))) AND NOT(G ((((p110 <= 0)) OR ((1 <= p130)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((((p101 <= 0)) OR ((1 <= p116))))) OR X ((F ((((p101 <= 0)) OR ((1 <= p116)))) U G (((1 <= p4))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((((p101 <= 0)) OR ((1 <= p116))))) OR X ((F ((((p101 <= 0)) OR ((1 <= p116)))) U G (((1 <= p4))))))))
lola: processed formula length: 116
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 268 markings, 270 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (((G ((((p146 <= 0)) OR ((1 <= p220)))) OR G ((((p92 <= 0)) OR ((1 <= p67))))) AND X ((((p230 <= 0)) OR ((1 <= p218)))))) AND (((p162 <= 0)) OR ((1 <= p144)))) U ((1 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (((G ((((p146 <= 0)) OR ((1 <= p220)))) OR G ((((p92 <= 0)) OR ((1 <= p67))))) AND X ((((p230 <= 0)) OR ((1 <= p218)))))) AND (((p162 <= 0)) OR ((1 <= p144)))) U ((1 <= p110))))
lola: processed formula length: 188
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 284 markings, 284 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((((p85 <= 0)) OR F (((p40 <= 0))))) AND ((1 <= p85))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((((p85 <= 0)) OR F (((p40 <= 0))))) AND ((1 <= p85))))))
lola: processed formula length: 69
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 855849 markings, 2494009 edges, 171170 markings/sec, 0 secs
lola: 1638722 markings, 4936828 edges, 156575 markings/sec, 5 secs
lola: 2285442 markings, 7407573 edges, 129344 markings/sec, 10 secs
lola: 2409171 markings, 9560496 edges, 24746 markings/sec, 15 secs
lola: 2721932 markings, 12267514 edges, 62552 markings/sec, 20 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: 2919889 markings, 13893755 edges
lola: ========================================
lola: subprocess 3 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p69 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p69 <= 0)))))
lola: processed formula length: 22
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 305 markings, 305 edges
lola: ========================================
lola: subprocess 4 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p146 <= 0)) OR ((1 <= p176)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p146 <= 0)) OR ((1 <= p176)))))
lola: processed formula length: 41
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 207 markings, 207 edges
lola: ========================================
lola: subprocess 5 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p153))) OR (((((p10 <= 0)) OR ((1 <= p115))) U (((p110 <= 0)) OR ((1 <= p130)))) AND F ((((1 <= p110)) AND ((p130 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p110)) AND ((p130 <= 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: (((p110 <= 0)) OR ((1 <= p130)))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file LTLCardinality.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: 214 markings, 214 edges
lola: ========================================
lola: subprocess 6 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p153)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p153)))
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 195 markings, 195 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p119))))
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 <= p119))))
lola: processed formula length: 21
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 958 markings, 1246 edges
lola: ========================================
lola: subprocess 7 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p210 <= 0)) OR ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p210 <= 0)) OR ((1 <= p7)))))
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: add low 186
lola: add low 185
lola: add low 176
lola: add low 179
lola: add low 180
lola: add low 178
lola: add low 177
lola: add low 183
lola: add low 184
lola: add low 182
lola: add low 181
lola: add low 174
lola: add low 172
lola: add low 48
lola: add low 192
lola: add low 193
lola: add low 191
lola: add low 190
lola: add low 189
lola: add low 200
lola: add low 201
lola: add low 199
lola: add low 198
lola: add low 196
lola: add low 197
lola: add low 195
lola: add low 194
lola: add low 175
lola: add low 37
lola: add low 42
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 39
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: 269 markings, 270 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no
lola:
preliminary result: no no yes no yes no no no
lola: memory consumption: 31720 KB
lola: time consumption: 31 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="ParamProductionCell-PT-4"
export BK_EXAMINATION="LTLCardinality"
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 ParamProductionCell-PT-4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-tall-162089151200197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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