About the Execution of ITS-LoLa for DES-PT-01a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15756.480 | 3600000.00 | 53334.00 | 158.40 | TFTTTFFTFFTFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899800193.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-01a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 32K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-01a-00
FORMULA_NAME DES-PT-01a-01
FORMULA_NAME DES-PT-01a-02
FORMULA_NAME DES-PT-01a-03
FORMULA_NAME DES-PT-01a-04
FORMULA_NAME DES-PT-01a-05
FORMULA_NAME DES-PT-01a-06
FORMULA_NAME DES-PT-01a-07
FORMULA_NAME DES-PT-01a-08
FORMULA_NAME DES-PT-01a-09
FORMULA_NAME DES-PT-01a-10
FORMULA_NAME DES-PT-01a-11
FORMULA_NAME DES-PT-01a-12
FORMULA_NAME DES-PT-01a-13
FORMULA_NAME DES-PT-01a-14
FORMULA_NAME DES-PT-01a-15
=== Now, execution of the tool begins
BK_START 1591166500034
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:41:43] [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]
[2020-06-03 06:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:41:43] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2020-06-03 06:41:43] [INFO ] Transformed 119 places.
[2020-06-03 06:41:43] [INFO ] Transformed 76 transitions.
[2020-06-03 06:41:43] [INFO ] Found NUPN structural information;
[2020-06-03 06:41:43] [INFO ] Parsed PT model containing 119 places and 76 transitions in 176 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3953 resets, run finished after 512 ms. (steps per millisecond=195 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 62 rows 119 cols
[2020-06-03 06:41:44] [INFO ] Computed 59 place invariants in 17 ms
[2020-06-03 06:41:44] [INFO ] [Real]Absence check using 33 positive place invariants in 76 ms returned sat
[2020-06-03 06:41:44] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 35 ms returned sat
[2020-06-03 06:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:44] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-06-03 06:41:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 122 ms returned sat
[2020-06-03 06:41:45] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 19 ms returned unsat
[2020-06-03 06:41:45] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2020-06-03 06:41:45] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 31 ms returned sat
[2020-06-03 06:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:45] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-03 06:41:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned unsat
[2020-06-03 06:41:45] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 06:41:45] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 06:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:45] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-06-03 06:41:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 17 ms returned unsat
[2020-06-03 06:41:46] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:46] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-06-03 06:41:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned unsat
[2020-06-03 06:41:46] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 37 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:46] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-06-03 06:41:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 44 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 12 ms returned sat
[2020-06-03 06:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:46] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-06-03 06:41:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:41:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:41:46] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 25 ms.
[2020-06-03 06:41:47] [INFO ] Added : 48 causal constraints over 10 iterations in 281 ms. Result :unsat
[2020-06-03 06:41:47] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-06-03 06:41:47] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 12 ms returned sat
[2020-06-03 06:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:47] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-03 06:41:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2020-06-03 06:41:47] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 06:41:47] [INFO ] Flatten gal took : 84 ms
FORMULA DES-PT-01a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:41:47] [INFO ] Applying decomposition
[2020-06-03 06:41:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:41:47] [INFO ] Flatten gal took : 26 ms
[2020-06-03 06:41:47] [INFO ] Decomposing Gal with order
[2020-06-03 06:41:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 06:41:47] [INFO ] Removed a total of 20 redundant transitions.
[2020-06-03 06:41:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:41:47] [INFO ] Flatten gal took : 78 ms
[2020-06-03 06:41:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 18 ms.
[2020-06-03 06:41:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-01a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:41:47] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 06:41:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DES-PT-01a @ 3570 seconds
FORMULA DES-PT-01a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3538
rslt: Output for LTLCardinality @ DES-PT-01a
{
"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": "Wed Jun 3 06:41:48 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((p25 <= 0)) OR ((1 <= p30)))))",
"processed_size": 39,
"rewrites": 25
},
"result":
{
"edges": 5290769,
"markings": 626021,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p90)) AND ((p61 <= 0))))))",
"processed_size": 43,
"rewrites": 25
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((p6 <= 0)) OR ((1 <= p2)))))",
"processed_size": 37,
"rewrites": 25
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p61)) AND ((p48 <= 0)))))",
"processed_size": 39,
"rewrites": 25
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 889
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p30)))",
"processed_size": 16,
"rewrites": 25
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (((F ((((p23 <= 0)) OR ((1 <= p86)))) OR (((p83 <= 0)) OR ((1 <= p66)))) AND F ((((p15 <= 0)) OR ((1 <= p116)))))) AND (((p23 <= 0)) OR ((1 <= p86)))))",
"processed_size": 160,
"rewrites": 25
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((p31 <= 0)) OR ((1 <= p78)))))",
"processed_size": 39,
"rewrites": 25
},
"result":
{
"edges": 9985145,
"markings": 1414963,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3538
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3538
},
"exit":
{
"localtimelimitreached": false
},
"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": "(((p65 <= 0)) OR ((1 <= p68)))",
"processed_size": 31,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"child":
[
{
"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": "(((p65 <= 0)) OR ((1 <= p68)))",
"processed_size": 31,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((((p97 <= 0)) OR ((1 <= p79))))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24956,
"runtime": 32.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(**)) OR X(X(F(*)))) : F(G(**)) : X(G(**)) : X(F(*)) : (G(**) AND **) : X(**) : X((F(((F(**) OR (** OR **)) AND F(**))) AND **))"
},
"net":
{
"arcs": 317,
"conflict_clusters": 46,
"places": 119,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no no no no no yes yes ",
"value": "no no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 181/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 119
lola: finding significant places
lola: 119 places, 62 transitions, 60 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: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: (F (G (X ((((p25 <= 0)) OR ((1 <= p30)))))) OR F (NOT(X (X (G ((((p90 <= 0)) OR ((1 <= p61))))))))) : (((1 <= 0) U (0 <= 0)) U G ((((p31 <= 0)) OR ((1 <= p78))))) : G (X ((((p6 <= 0)) OR ((1 <= p2))))) : ((0 <= 0) U NOT(X (G ((((p61 <= 0)) OR ((1 <= p48))))))) : (G ((((p97 <= 0)) OR ((1 <= p79)))) AND (((p65 <= 0)) OR ((1 <= p68)))) : X (((1 <= p30))) : X (((F (X ((((p30 <= 0)) OR ((1 <= p97))))) U F ((((F ((((p23 <= 0)) OR ((1 <= p86)))) OR ((p83 <= 0))) OR ((1 <= p66))) AND F ((((p15 <= 0)) OR ((1 <= p116))))))) AND (((p23 <= 0)) OR ((1 <= p86)))))
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:335
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p25 <= 0)) OR ((1 <= p30))))) OR X (X (F ((((1 <= p90)) AND ((p61 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p25 <= 0)) OR ((1 <= p30)))))
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 ((((p25 <= 0)) OR ((1 <= p30)))))
lola: processed formula length: 39
lola: 25 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: 407202 markings, 3001376 edges, 81440 markings/sec, 0 secs
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: 626021 markings, 5290769 edges
lola: ========================================
lola: subprocess 1 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p90)) AND ((p61 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p90)) AND ((p61 <= 0))))))
lola: processed formula length: 43
lola: 25 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: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p6 <= 0)) OR ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p6 <= 0)) OR ((1 <= p2)))))
lola: processed formula length: 37
lola: 25 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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 2 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p61)) AND ((p48 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p61)) AND ((p48 <= 0)))))
lola: processed formula length: 39
lola: 25 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: 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: 27 markings, 27 edges
lola: subprocess 3 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((1 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p30)))
lola: processed formula length: 16
lola: 25 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((F ((((p23 <= 0)) OR ((1 <= p86)))) OR (((p83 <= 0)) OR ((1 <= p66)))) AND F ((((p15 <= 0)) OR ((1 <= p116)))))) AND (((p23 <= 0)) OR ((1 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((F ((((p23 <= 0)) OR ((1 <= p86)))) OR (((p83 <= 0)) OR ((1 <= p66)))) AND F ((((p15 <= 0)) OR ((1 <= p116)))))) AND (((p23 <= 0)) OR ((1 <= p86)))))
lola: processed formula length: 160
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p31 <= 0)) OR ((1 <= p78)))))
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 ((((p31 <= 0)) OR ((1 <= p78)))))
lola: processed formula length: 39
lola: 25 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: 445306 markings, 2830345 edges, 89061 markings/sec, 0 secs
lola: 832681 markings, 5687186 edges, 77475 markings/sec, 5 secs
lola: 1205209 markings, 8463703 edges, 74506 markings/sec, 10 secs
lola: add low 7
lola: add low 54
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: 1414963 markings, 9985145 edges
lola: ========================================
lola: subprocess 6 will run for 3538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p97 <= 0)) OR ((1 <= p79)))) AND (((p65 <= 0)) OR ((1 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p65 <= 0)) OR ((1 <= p68)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p65 <= 0)) OR ((1 <= p68)))
lola: processed formula length: 31
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((((p97 <= 0)) OR ((1 <= p79)))) AND (((p65 <= 0)) OR ((1 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p65 <= 0)) OR ((1 <= p68)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p65 <= 0)) OR ((1 <= p68)))
lola: processed formula length: 31
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p97 <= 0)) OR ((1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p97 <= 0)) OR ((1 <= p79))))
lola: processed formula length: 35
lola: 25 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no yes yes
lola:
preliminary result: no no no no no yes yes
lola: ========================================
lola: memory consumption: 24956 KB
lola: time consumption: 32 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="DES-PT-01a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-01a, 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 r180-ebro-158987899800193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01a.tgz
mv DES-PT-01a 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 '
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 ;