About the Execution of 2019-Gold for HypercubeGrid-PT-C4K3P3B12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4369.820 | 414802.00 | 404853.00 | 37.50 | TFFFFFTFFTTTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r105-oct2-158940199600065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is HypercubeGrid-PT-C4K3P3B12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199600065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 5.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 3.0M Apr 27 15:14 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-00
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-01
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-02
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-03
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-04
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-05
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-06
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-07
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-08
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-09
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-10
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-11
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-12
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-13
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-14
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-15
=== Now, execution of the tool begins
BK_START 1589718993280
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ HypercubeGrid-PT-C4K3P3B12 @ 3570 seconds
FORMULA HypercubeGrid-PT-C4K3P3B12-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C4K3P3B12-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3155
rslt: Output for LTLCardinality @ HypercubeGrid-PT-C4K3P3B12
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 17 12:36:33 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"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": "A (X ((1 <= po_d1_n1_3_2_1_3)))",
"processed_size": 31,
"rewrites": 104
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "A (X (X (G ((po_d4_n1_2_2_1_2 + 1 <= pb_d2_n2_1_1_3_1)))))",
"processed_size": 58,
"rewrites": 104
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((X ((pb_d2_n2_1_1_1_2 <= po_d1_n1_2_2_2_3)) U ((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) AND (po_d1_n1_2_2_2_3 + 1 <= pb_d2_n2_1_1_1_2))) U (F (G ((3 <= pb_d2_n1_2_1_3_3))) AND G (((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) OR X (G ((3 <= pb_d2_n1_2_1_3_3))))))))",
"processed_size": 262,
"rewrites": 104
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 51
},
"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": 441
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "A (X ((po_d3_n1_1_1_4_1 <= po_d3_n1_3_1_4_2)))",
"processed_size": 46,
"rewrites": 104
},
"result":
{
"edges": 648,
"markings": 649,
"produced_by": "LTL model checker",
"value": true
},
"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": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "A (X (X (F ((pil_d3_n1_3_1_4_3 <= pil_d3_n1_2_1_4_3)))))",
"processed_size": 56,
"rewrites": 104
},
"result":
{
"edges": 22673,
"markings": 22664,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 104
},
"result":
{
"edges": 648,
"markings": 649,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "A (((pi_d3_n1_2_3_2_1 + 1 <= pil_d4_n1_3_2_3_1) U X (F ((1 <= po_d4_n1_1_2_3_4)))))",
"processed_size": 83,
"rewrites": 104
},
"result":
{
"edges": 13269,
"markings": 13260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (F (G ((2 <= pb_d4_n1_2_2_2_1))))",
"processed_size": 35,
"rewrites": 104
},
"result":
{
"edges": 16547,
"markings": 16420,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "A (G (F ((po_d4_n1_1_1_1_2 + 1 <= po_d2_n1_3_2_1_1))))",
"processed_size": 54,
"rewrites": 104
},
"result":
{
"edges": 1923,
"markings": 1923,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1121
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": "A (G (F (((pb_d1_n2_2_3_1_1 + 1 <= pbl_3_2_3_3) OR F (((pb_d1_n2_1_2_1_1 <= 1)))))))",
"processed_size": 84,
"rewrites": 104
},
"result":
{
"edges": 11585,
"markings": 11566,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1669
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((po_d1_n1_3_1_1_3 + 1 <= pol_d3_n1_3_2_1_2)) OR F (G (((2 <= pb_d2_n1_2_1_1_3) OR (pb_d3_n2_2_3_3_2 <= 0))))))",
"processed_size": 116,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3339
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G (F (((2 <= pb_d2_n2_2_1_3_3) OR ((pi_d2_n1_2_4_1_2 + 1 <= po_d2_n1_2_4_1_2) R (pi_d2_n1_2_2_3_2 + 1 <= po_d2_n1_2_4_1_2))))))",
"processed_size": 130,
"rewrites": 104
},
"result":
{
"edges": 15781,
"markings": 15708,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"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": 119376,
"runtime": 390.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(X(X(G(*)))) : FALSE : A(G(F((* OR F(*))))) : A(G(F((* OR (* R *))))) : A(((X(**) U **) U (F(G(**)) AND G((** OR X(G(**))))))) : A((** OR F(G(**)))) : (A(X(X(F(**)))) AND A(X(**))) : (A(X(**)) AND A(X(X((G(**) OR X(**)))))) : TRUE : TRUE : TRUE : A(F(G(**))) : A(G(F(*))) : A(X(TRUE)) : A((** U X(F(**))))"
},
"net":
{
"arcs": 21600,
"conflict_clusters": 945,
"places": 2457,
"places_significant": 1511,
"singleton_clusters": 0,
"transitions": 5400
},
"result":
{
"preliminary_value": "yes no no no no no yes no no yes yes yes no no yes no ",
"value": "yes no no no no no yes no no yes yes yes 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: 7857/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 78624
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 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 false: (3 <= pi_d4_n1_2_2_3_1)
lola: LP says that atomic proposition is always false: (2 <= pil_d3_n1_2_2_2_3)
lola: LP says that atomic proposition is always false: (3 <= pi_d2_n1_1_3_1_2)
lola: LP says that atomic proposition is always false: (2 <= pil_d2_n1_2_4_1_2)
lola: LP says that atomic proposition is always false: (2 <= pil_d2_n1_2_4_1_2)
lola: LP says that atomic proposition is always false: (3 <= pil_d1_n1_1_2_2_1)
lola: LP says that atomic proposition is always false: (2 <= po_d2_n1_3_1_1_1)
lola: LP says that atomic proposition is always false: (3 <= pil_d3_n1_2_2_1_2)
lola: LP says that atomic proposition is always false: (2 <= po_d1_n1_1_3_3_1)
lola: LP says that atomic proposition is always false: (2 <= po_d1_n1_1_3_3_1)
lola: LP says that atomic proposition is always false: (3 <= pol_d3_n1_3_2_1_1)
lola: LP says that atomic proposition is always false: (3 <= pol_d2_n1_1_1_1_2)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_1_1_1_3)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_1_1_1_3)
lola: A (G (NOT(F ((3 <= pi_d4_n1_2_2_3_1))))) : A (X ((F (X ((2 <= pil_d3_n1_2_2_2_3))) OR NOT(F (((3 <= pi_d2_n1_1_3_1_2) OR F (X ((pb_d2_n2_1_1_3_1 <= po_d4_n1_2_2_1_2))))))))) : A ((X ((2 <= pil_d2_n1_2_4_1_2)) U F (G ((X (X (X ((pb_d2_n2_2_1_3_2 + 1 <= pi_d2_n1_3_2_2_3)))) U X ((2 <= pil_d2_n1_2_4_1_2))))))) : A (G (F (NOT(G ((X ((pbl_3_2_3_3 <= pb_d1_n2_2_3_1_1)) AND X (G (((2 <= pb_d1_n2_1_2_1_1)))))))))) : A (F (G (F (X (F ((X ((po_d2_n1_2_4_1_2 <= pi_d2_n1_2_2_3_2)) U NOT(((pb_d2_n2_2_1_3_3 <= 1) AND ((po_d2_n1_2_4_1_2 <= pi_d2_n1_2_4_1_2) U (po_d2_n1_2_4_1_2 <= pi_d2_n1_2_2_3_2))))))))))) : A (((X ((pb_d2_n2_1_1_1_2 <= po_d1_n1_2_2_2_3)) U ((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) AND (po_d1_n1_2_2_2_3 + 1 <= pb_d2_n2_1_1_1_2))) U G (((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) U X (G ((3 <= pb_d2_n1_2_1_3_3))))))) : A ((((po_d1_n1_3_1_1_3 + 1 <= pol_d3_n1_3_2_1_2)) OR F (G (((2 <= pb_d2_n1_2_1_1_3) OR (pb_d3_n2_2_3_3_2 <= 0)))))) : A (X ((((2 <= po_d2_n1_3_1_1_1) OR F (X ((pil_d3_n1_3_1_4_3 <= pil_d3_n1_2_1_4_3)))) AND (G ((3 <= pil_d3_n1_2_2_1_2)) U (po_d3_n1_1_1_4_1 <= po_d3_n1_3_1_4_2))))) : A (X (((1 <= po_d1_n1_3_2_1_3) AND (X (G (((pi_d2_n1_2_1_1_1 <= pb_d1_n1_2_2_1_1)))) OR X (X (((pb_d4_n2_3_2_3_1 <= pb_d2_n2_2_3_1_3) AND (1 <= po_d1_n1_3_2_1_3)))))))) : A (G ((0 <= pbl_3_2_3_3))) : A (F ((F ((NOT(((2 <= po_d1_n1_1_3_3_1) OR F ((3 <= pb_d1_n1_2_2_3_3)))) U (3 <= pb_d1_n1_2_2_3_3))) U (po_d1_n1_1_3_3_1 <= 1)))) : A ((X (F (G (((pb_d3_n1_3_1_1_1 <= po_d3_n1_1_2_4_3) U (po_d1_n1_4_1_3_1 + 1 <= po_d3_n1_2_2_4_2))))) U NOT(G ((3 <= pol_d3_n1_3_2_1_1))))) : A (G ((((pb_d2_n1_2_1_3_1 <= pol_d1_n1_2_3_1_1) OR ((pb_d4_n1_3_3_3_3 <= pb_d4_n2_1_1_1_3))) U F (G ((2 <= pb_d4_n1_2_2_2_1)))))) : A (X ((F ((0 <= pb_d4_n2_2_2_2_3)) AND F (NOT(G (F (G ((po_d2_n1_3_2_1_1 <= po_d4_n1_1_1_1_2))))))))) : A ((X (G ((3 <= pi_d3_n1_1_1_1_3))) OR X ((F ((pb_d3_n1_3_3_2_1 <= pil_d3_n1_2_3_4_1)) OR NOT(X (())))))) : A (((pi_d3_n1_2_3_2_1 + 1 <= pil_d4_n1_3_2_3_1) U X (F ((1 <= po_d4_n1_1_2_3_4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:315
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: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 104 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 104 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 104 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 104 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 104 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= po_d1_n1_3_2_1_3))) AND A (X (X ((G (((pi_d2_n1_2_1_1_1 <= pb_d1_n1_2_2_1_1))) OR X (((pb_d4_n2_3_2_3_1 <= pb_d2_n2_2_3_1_3) AND (1 <= po_d1_n1_3_2_1_3))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= po_d1_n1_3_2_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= po_d1_n1_3_2_1_3)))
lola: processed formula length: 31
lola: 104 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: 13075 markings, 13075 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((po_d4_n1_2_2_1_2 + 1 <= pb_d2_n2_1_1_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((po_d4_n1_2_2_1_2 + 1 <= pb_d2_n2_1_1_3_1)))))
lola: processed formula length: 58
lola: 104 rewrites
lola: closed formula file LTLCardinality.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: 13075 markings, 13075 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X ((pb_d2_n2_1_1_1_2 <= po_d1_n1_2_2_2_3)) U ((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) AND (po_d1_n1_2_2_2_3 + 1 <= pb_d2_n2_1_1_1_2))) U (F (G ((3 <= pb_d2_n1_2_1_3_3))) AND G (((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) OR X (G ((3 <= pb_d2_n1_2_1_3_3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X ((pb_d2_n2_1_1_1_2 <= po_d1_n1_2_2_2_3)) U ((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) AND (po_d1_n1_2_2_2_3 + 1 <= pb_d2_n2_1_1_1_2))) U (F (G ((3 <= pb_d2_n1_2_1_3_3))) AND G (((po_d4_n1_2_1_3_4 <= pol_d1_n1_2_1_3_2) OR X (G ((3 <= pb_d2_n1_2_1_3_3))))))))
lola: processed formula length: 262
lola: 104 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 51 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: 13075 markings, 13075 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (X (F ((pil_d3_n1_3_1_4_3 <= pil_d3_n1_2_1_4_3))))) AND A (X ((po_d3_n1_1_1_4_1 <= po_d3_n1_3_1_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((po_d3_n1_1_1_4_1 <= po_d3_n1_3_1_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((po_d3_n1_1_1_4_1 <= po_d3_n1_3_1_4_2)))
lola: processed formula length: 46
lola: 104 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: 649 markings, 648 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((pil_d3_n1_3_1_4_3 <= pil_d3_n1_2_1_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((pil_d3_n1_3_1_4_3 <= pil_d3_n1_2_1_4_3)))))
lola: processed formula length: 56
lola: 104 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: 22664 markings, 22673 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 104 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: 649 markings, 648 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((pi_d3_n1_2_3_2_1 + 1 <= pil_d4_n1_3_2_3_1) U X (F ((1 <= po_d4_n1_1_2_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((pi_d3_n1_2_3_2_1 + 1 <= pil_d4_n1_3_2_3_1) U X (F ((1 <= po_d4_n1_1_2_3_4)))))
lola: processed formula length: 83
lola: 104 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: 13260 markings, 13269 edges
lola: ========================================
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= pb_d4_n1_2_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= pb_d4_n1_2_2_2_1))))
lola: processed formula length: 35
lola: 104 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: 2808 markings, 2826 edges, 562 markings/sec, 0 secs
lola: 2848 markings, 2866 edges, 8 markings/sec, 5 secs
lola: 2897 markings, 2915 edges, 10 markings/sec, 10 secs
lola: 2944 markings, 2962 edges, 9 markings/sec, 15 secs
lola: 2980 markings, 2998 edges, 7 markings/sec, 20 secs
lola: 3021 markings, 3039 edges, 8 markings/sec, 25 secs
lola: 3060 markings, 3078 edges, 8 markings/sec, 30 secs
lola: 3102 markings, 3120 edges, 8 markings/sec, 35 secs
lola: 3175 markings, 3193 edges, 15 markings/sec, 40 secs
lola: 3265 markings, 3283 edges, 18 markings/sec, 45 secs
lola: 3334 markings, 3352 edges, 14 markings/sec, 50 secs
lola: 3382 markings, 3400 edges, 10 markings/sec, 55 secs
lola: 3443 markings, 3461 edges, 12 markings/sec, 60 secs
lola: 3485 markings, 3503 edges, 8 markings/sec, 65 secs
lola: 3536 markings, 3554 edges, 10 markings/sec, 70 secs
lola: 3594 markings, 3612 edges, 12 markings/sec, 75 secs
lola: 3663 markings, 3681 edges, 14 markings/sec, 80 secs
lola: 3799 markings, 3817 edges, 27 markings/sec, 85 secs
lola: 3966 markings, 3984 edges, 33 markings/sec, 90 secs
lola: 4138 markings, 4156 edges, 34 markings/sec, 95 secs
lola: 4298 markings, 4316 edges, 32 markings/sec, 100 secs
lola: 4561 markings, 4579 edges, 53 markings/sec, 105 secs
lola: 4938 markings, 4956 edges, 75 markings/sec, 110 secs
lola: 5869 markings, 5887 edges, 186 markings/sec, 115 secs
lola: 6325 markings, 6343 edges, 91 markings/sec, 120 secs
lola: 6661 markings, 6679 edges, 67 markings/sec, 125 secs
lola: 6945 markings, 6963 edges, 57 markings/sec, 130 secs
lola: 7273 markings, 7291 edges, 66 markings/sec, 135 secs
lola: 7665 markings, 7683 edges, 78 markings/sec, 140 secs
lola: 8405 markings, 8423 edges, 148 markings/sec, 145 secs
lola: 10220 markings, 10238 edges, 363 markings/sec, 150 secs
lola: 12615 markings, 12633 edges, 479 markings/sec, 155 secs
lola: 15360 markings, 15456 edges, 549 markings/sec, 160 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: 16420 markings, 16547 edges
lola: ========================================
lola: subprocess 12 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((po_d4_n1_1_1_1_2 + 1 <= po_d2_n1_3_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((po_d4_n1_1_1_1_2 + 1 <= po_d2_n1_3_2_1_1))))
lola: processed formula length: 54
lola: 104 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: 1923 markings, 1923 edges
lola: ========================================
lola: subprocess 13 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((pb_d1_n2_2_3_1_1 + 1 <= pbl_3_2_3_3) OR F (((pb_d1_n2_1_2_1_1 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((pb_d1_n2_2_3_1_1 + 1 <= pbl_3_2_3_3) OR F (((pb_d1_n2_1_2_1_1 <= 1)))))))
lola: processed formula length: 84
lola: 104 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: 2671 markings, 2689 edges, 534 markings/sec, 0 secs
lola: 3154 markings, 3172 edges, 97 markings/sec, 5 secs
lola: 4513 markings, 4531 edges, 272 markings/sec, 10 secs
lola: 8311 markings, 8329 edges, 760 markings/sec, 15 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: 11566 markings, 11585 edges
lola: ========================================
lola: subprocess 14 will run for 1669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((po_d1_n1_3_1_1_3 + 1 <= pol_d3_n1_3_2_1_2)) OR F (G (((2 <= pb_d2_n1_2_1_1_3) OR (pb_d3_n2_2_3_3_2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((po_d1_n1_3_1_1_3 + 1 <= pol_d3_n1_3_2_1_2)) OR F (G (((2 <= pb_d2_n1_2_1_1_3) OR (pb_d3_n2_2_3_3_2 <= 0))))))
lola: processed formula length: 116
lola: 104 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: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((2 <= pb_d2_n2_2_1_3_3) OR ((pi_d2_n1_2_4_1_2 + 1 <= po_d2_n1_2_4_1_2) R (pi_d2_n1_2_2_3_2 + 1 <= po_d2_n1_2_4_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((2 <= pb_d2_n2_2_1_3_3) OR ((pi_d2_n1_2_4_1_2 + 1 <= po_d2_n1_2_4_1_2) R (pi_d2_n1_2_2_3_2 + 1 <= po_d2_n1_2_4_1_2))))))
lola: processed formula length: 130
lola: 104 rewrites
lola: closed formula file LTLCardinality.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: 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: 2446 markings, 2464 edges, 489 markings/sec, 0 secs
lola: 2517 markings, 2535 edges, 14 markings/sec, 5 secs
lola: 2574 markings, 2592 edges, 11 markings/sec, 10 secs
lola: 2649 markings, 2667 edges, 15 markings/sec, 15 secs
lola: 2728 markings, 2746 edges, 16 markings/sec, 20 secs
lola: 2877 markings, 2895 edges, 30 markings/sec, 25 secs
lola: 2984 markings, 3002 edges, 21 markings/sec, 30 secs
lola: 3072 markings, 3090 edges, 18 markings/sec, 35 secs
lola: 3180 markings, 3198 edges, 22 markings/sec, 40 secs
lola: 3291 markings, 3309 edges, 22 markings/sec, 45 secs
lola: 3472 markings, 3490 edges, 36 markings/sec, 50 secs
lola: 3608 markings, 3626 edges, 27 markings/sec, 55 secs
lola: 3670 markings, 3688 edges, 12 markings/sec, 60 secs
lola: 3738 markings, 3756 edges, 14 markings/sec, 65 secs
lola: 3800 markings, 3818 edges, 12 markings/sec, 70 secs
lola: 3869 markings, 3887 edges, 14 markings/sec, 75 secs
lola: 3935 markings, 3953 edges, 13 markings/sec, 80 secs
lola: 3998 markings, 4016 edges, 13 markings/sec, 85 secs
lola: 4073 markings, 4091 edges, 15 markings/sec, 90 secs
lola: 4148 markings, 4166 edges, 15 markings/sec, 95 secs
lola: 4230 markings, 4248 edges, 16 markings/sec, 100 secs
lola: 4338 markings, 4356 edges, 22 markings/sec, 105 secs
lola: 4458 markings, 4476 edges, 24 markings/sec, 110 secs
lola: 4688 markings, 4706 edges, 46 markings/sec, 115 secs
lola: 4940 markings, 4958 edges, 50 markings/sec, 120 secs
lola: 5976 markings, 5994 edges, 207 markings/sec, 125 secs
lola: 6472 markings, 6490 edges, 99 markings/sec, 130 secs
lola: 7065 markings, 7083 edges, 119 markings/sec, 135 secs
lola: 8427 markings, 8445 edges, 272 markings/sec, 140 secs
lola: 9975 markings, 9993 edges, 310 markings/sec, 145 secs
lola: 12300 markings, 12318 edges, 465 markings/sec, 150 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: 15708 markings, 15781 edges
lola: RESULT
lola:
SUMMARY: yes no no no no no yes no no yes yes yes no no yes no
lola:
preliminary result: yes no no no no no yes no no yes yes yes no no yes no
lola: ========================================
lola: memory consumption: 119376 KB
lola: time consumption: 390 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589719408082
--------------------
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="HypercubeGrid-PT-C4K3P3B12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is HypercubeGrid-PT-C4K3P3B12, 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 r105-oct2-158940199600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C4K3P3B12.tgz
mv HypercubeGrid-PT-C4K3P3B12 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 ;