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.r211-tajo-159033477800681.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 ShieldPPPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 3.4K May 14 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 201K May 12 20:42 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 ShieldPPPt-PT-030A-00
FORMULA_NAME ShieldPPPt-PT-030A-01
FORMULA_NAME ShieldPPPt-PT-030A-02
FORMULA_NAME ShieldPPPt-PT-030A-03
FORMULA_NAME ShieldPPPt-PT-030A-04
FORMULA_NAME ShieldPPPt-PT-030A-05
FORMULA_NAME ShieldPPPt-PT-030A-06
FORMULA_NAME ShieldPPPt-PT-030A-07
FORMULA_NAME ShieldPPPt-PT-030A-08
FORMULA_NAME ShieldPPPt-PT-030A-09
FORMULA_NAME ShieldPPPt-PT-030A-10
FORMULA_NAME ShieldPPPt-PT-030A-11
FORMULA_NAME ShieldPPPt-PT-030A-12
FORMULA_NAME ShieldPPPt-PT-030A-13
FORMULA_NAME ShieldPPPt-PT-030A-14
FORMULA_NAME ShieldPPPt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1591320842049

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:34:04] [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-05 01:34:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:34:04] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2020-06-05 01:34:04] [INFO ] Transformed 753 places.
[2020-06-05 01:34:04] [INFO ] Transformed 543 transitions.
[2020-06-05 01:34:04] [INFO ] Found NUPN structural information;
[2020-06-05 01:34:04] [INFO ] Parsed PT model containing 753 places and 543 transitions in 235 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 844 ms. (steps per millisecond=118 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1]
// Phase 1: matrix 542 rows 753 cols
[2020-06-05 01:34:05] [INFO ] Computed 331 place invariants in 39 ms
[2020-06-05 01:34:05] [INFO ] [Real]Absence check using 331 positive place invariants in 214 ms returned sat
[2020-06-05 01:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:07] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2020-06-05 01:34:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 509 ms returned sat
[2020-06-05 01:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:08] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2020-06-05 01:34:09] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 49 ms.
[2020-06-05 01:34:17] [INFO ] Added : 533 causal constraints over 111 iterations in 8541 ms. Result :sat
[2020-06-05 01:34:17] [INFO ] [Real]Absence check using 331 positive place invariants in 129 ms returned sat
[2020-06-05 01:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:18] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2020-06-05 01:34:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:18] [INFO ] [Nat]Absence check using 331 positive place invariants in 20 ms returned unsat
[2020-06-05 01:34:19] [INFO ] [Real]Absence check using 331 positive place invariants in 157 ms returned sat
[2020-06-05 01:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:20] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2020-06-05 01:34:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:20] [INFO ] [Nat]Absence check using 331 positive place invariants in 158 ms returned sat
[2020-06-05 01:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:21] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2020-06-05 01:34:21] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 32 ms.
[2020-06-05 01:34:28] [INFO ] Added : 526 causal constraints over 106 iterations in 7186 ms. Result :sat
[2020-06-05 01:34:28] [INFO ] [Real]Absence check using 331 positive place invariants in 154 ms returned sat
[2020-06-05 01:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:30] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-06-05 01:34:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:30] [INFO ] [Nat]Absence check using 331 positive place invariants in 20 ms returned unsat
[2020-06-05 01:34:30] [INFO ] [Real]Absence check using 331 positive place invariants in 192 ms returned sat
[2020-06-05 01:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:31] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2020-06-05 01:34:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:31] [INFO ] [Nat]Absence check using 331 positive place invariants in 18 ms returned unsat
[2020-06-05 01:34:32] [INFO ] [Real]Absence check using 331 positive place invariants in 182 ms returned sat
[2020-06-05 01:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:33] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2020-06-05 01:34:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 137 ms returned sat
[2020-06-05 01:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:34] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2020-06-05 01:34:34] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 38 ms.
[2020-06-05 01:34:41] [INFO ] Added : 529 causal constraints over 108 iterations in 7593 ms. Result :sat
[2020-06-05 01:34:42] [INFO ] [Real]Absence check using 331 positive place invariants in 179 ms returned sat
[2020-06-05 01:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:43] [INFO ] [Real]Absence check using state equation in 1029 ms returned sat
[2020-06-05 01:34:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:43] [INFO ] [Nat]Absence check using 331 positive place invariants in 202 ms returned sat
[2020-06-05 01:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:44] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2020-06-05 01:34:44] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 39 ms.
[2020-06-05 01:34:53] [INFO ] Added : 538 causal constraints over 111 iterations in 9019 ms. Result :sat
[2020-06-05 01:34:54] [INFO ] [Real]Absence check using 331 positive place invariants in 127 ms returned sat
[2020-06-05 01:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:55] [INFO ] [Real]Absence check using state equation in 1104 ms returned sat
[2020-06-05 01:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:55] [INFO ] [Nat]Absence check using 331 positive place invariants in 178 ms returned sat
[2020-06-05 01:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:56] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2020-06-05 01:34:56] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 43 ms.
[2020-06-05 01:35:02] [INFO ] Added : 516 causal constraints over 105 iterations in 5833 ms. Result :sat
[2020-06-05 01:35:02] [INFO ] [Real]Absence check using 331 positive place invariants in 177 ms returned sat
[2020-06-05 01:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:03] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2020-06-05 01:35:04] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 29 ms.
[2020-06-05 01:35:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:04] [INFO ] [Nat]Absence check using 331 positive place invariants in 178 ms returned sat
[2020-06-05 01:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:05] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2020-06-05 01:35:05] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 29 ms.
[2020-06-05 01:35:11] [INFO ] Added : 511 causal constraints over 104 iterations in 5798 ms. Result :sat
[2020-06-05 01:35:11] [INFO ] [Real]Absence check using 331 positive place invariants in 183 ms returned sat
[2020-06-05 01:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:12] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2020-06-05 01:35:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:13] [INFO ] [Nat]Absence check using 331 positive place invariants in 185 ms returned sat
[2020-06-05 01:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:14] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2020-06-05 01:35:14] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 46 ms.
[2020-06-05 01:35:21] [INFO ] Added : 500 causal constraints over 101 iterations in 7006 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 01:35:21] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-05 01:35:21] [INFO ] Flatten gal took : 202 ms
FORMULA ShieldPPPt-PT-030A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 01:35:21] [INFO ] Applying decomposition
[2020-06-05 01:35:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 01:35:21] [INFO ] Flatten gal took : 65 ms
[2020-06-05 01:35:21] [INFO ] Decomposing Gal with order
[2020-06-05 01:35:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 01:35:22] [INFO ] Removed a total of 180 redundant transitions.
[2020-06-05 01:35:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 01:35:22] [INFO ] Flatten gal took : 428 ms
[2020-06-05 01:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2020-06-05 01:35:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-030A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 01:35:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 01:35:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-030A @ 3570 seconds

FORMULA ShieldPPPt-PT-030A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ ShieldPPPt-PT-030A

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 01:35:23 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((((((p503 <= 0)) OR ((1 <= p394))) U G (((1 <= p160)))) AND X ((((1 <= p576)) AND ((p693 <= 0)))))))",
"processed_size": 107,
"rewrites": 65
},
"result":
{
"edges": 493,
"markings": 492,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((((p367 <= 0)) OR ((1 <= p149)))) AND G ((((p195 <= 0)) OR ((1 <= p523))))))",
"processed_size": 85,
"rewrites": 65
},
"result":
{
"edges": 533,
"markings": 533,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G (((1 <= p563))))",
"processed_size": 21,
"rewrites": 65
},
"result":
{
"edges": 489,
"markings": 489,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 10,
"adisj": 3,
"aneg": 7,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p480)) AND ((p330 <= 0))) AND (G ((((1 <= p480)) AND ((p330 <= 0)))) OR G (F ((X (F ((((1 <= p131)) AND ((p489 <= 0))))) AND (((1 <= p480)) AND (((p330 <= 0)) AND (((1 <= p131)) AND ((p489 <= 0)))))))))))",
"processed_size": 216,
"rewrites": 65
},
"result":
{
"edges": 489,
"markings": 489,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1782
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p49)) AND ((p139 <= 0)))))",
"processed_size": 40,
"rewrites": 65
},
"result":
{
"edges": 489,
"markings": 489,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (X (F (((p401 <= 0) OR ((1 <= p366)))))) U ((1 <= p395)))",
"processed_size": 61,
"rewrites": 65
},
"result":
{
"edges": 4973,
"markings": 4952,
"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": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G ((((1 <= p272)) AND ((p679 <= 0)))))",
"processed_size": 41,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 9,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 29576,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(((** U G(**)) AND X(**)))) : F(G(*)) : F((X(**) AND G(**))) : X(G(**)) : X((* AND (G(*) OR G(F((X(F(*)) AND (* AND (* AND (* AND *))))))))) : (X(F(*)) OR (X(X(F(*))) U **))"
},
"net":
{
"arcs": 2164,
"conflict_clusters": 333,
"places": 753,
"places_significant": 422,
"singleton_clusters": 0,
"transitions": 542
},
"result":
{
"preliminary_value": "no no no no no no ",
"value": "no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1295/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24096
lola: finding significant places
lola: 753 places, 542 transitions, 422 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: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p693 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p679 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p523 <= 1)
lola: LP says that atomic proposition is always true: (p563 <= 1)
lola: LP says that atomic proposition is always true: (p489 <= 1)
lola: LP says that atomic proposition is always true: (p330 <= 1)
lola: LP says that atomic proposition is always true: (p489 <= 1)
lola: LP says that atomic proposition is always true: (p330 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p366 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: F (NOT(F (G ((NOT(((((p503 <= 0)) OR ((1 <= p394))) U G (((1 <= p160))))) OR NOT(X ((((1 <= p576)) AND ((p693 <= 0)))))))))) : NOT(G (X (G ((X ((X ((((p656 <= 0)) OR ((1 <= p13)))) U (1 <= 0))) U F ((((p272 <= 0)) OR ((1 <= p679))))))))) : F (((0 <= 0) U (X ((((p367 <= 0)) OR ((1 <= p149)))) AND G ((((p195 <= 0)) OR ((1 <= p523))))))) : X (G (((1 <= p563)))) : NOT(X ((G (X (F (G (((((G (X ((((p131 <= 0)) OR ((1 <= p489))))) OR ((p480 <= 0))) OR ((1 <= p330))) OR ((p131 <= 0))) OR ((1 <= p489))))))) U (((p480 <= 0)) OR ((1 <= p330)))))) : (NOT(X (G ((((p49 <= 0)) OR ((1 <= p139)))))) OR (NOT(X (G (X (((1 <= p401) AND ((p366 <= 0))))))) U ((1 <= p395))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((((p503 <= 0)) OR ((1 <= p394))) U G (((1 <= p160)))) AND X ((((1 <= p576)) AND ((p693 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((((p503 <= 0)) OR ((1 <= p394))) U G (((1 <= p160)))) AND X ((((1 <= p576)) AND ((p693 <= 0)))))))
lola: processed formula length: 107
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 492 markings, 493 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((p367 <= 0)) OR ((1 <= p149)))) AND G ((((p195 <= 0)) OR ((1 <= p523))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((p367 <= 0)) OR ((1 <= p149)))) AND G ((((p195 <= 0)) OR ((1 <= p523))))))
lola: processed formula length: 85
lola: 65 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: 533 markings, 533 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p563))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p563))))
lola: processed formula length: 21
lola: 65 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: 489 markings, 489 edges
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p480)) AND ((p330 <= 0))) AND (G ((((1 <= p480)) AND ((p330 <= 0)))) OR G (F ((X (F ((((1 <= p131)) AND ((p489 <= 0))))) AND (((1 <= p480)) AND (((p330 <= 0)) AND (((1 <= p131)) AND ((p489 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p480)) AND ((p330 <= 0))) AND (G ((((1 <= p480)) AND ((p330 <= 0)))) OR G (F ((X (F ((((1 <= p131)) AND ((p489 <= 0))))) AND (((1 <= p480)) AND (((p330 <= 0)) AND (((1 <= p131)) AND ((p489 <= 0)))))))))))
lola: processed formula length: 216
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 489 markings, 489 edges
lola: ========================================
lola: subprocess 4 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p49)) AND ((p139 <= 0))))) OR (X (X (F (((p401 <= 0) OR ((1 <= p366)))))) U ((1 <= p395))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p49)) AND ((p139 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p49)) AND ((p139 <= 0)))))
lola: processed formula length: 40
lola: 65 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: 489 markings, 489 edges
lola: ========================================
lola: subprocess 5 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((p401 <= 0) OR ((1 <= p366)))))) U ((1 <= p395)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F (((p401 <= 0) OR ((1 <= p366)))))) U ((1 <= p395)))
lola: processed formula length: 61
lola: 65 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: 4952 markings, 4973 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p272)) AND ((p679 <= 0)))))
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 ((((1 <= p272)) AND ((p679 <= 0)))))
lola: processed formula length: 41
lola: 65 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: 9 markings, 10 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: memory consumption: 29576 KB
lola: time consumption: 5 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="ShieldPPPt-PT-030A"
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 ShieldPPPt-PT-030A, 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 r211-tajo-159033477800681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030A.tgz
mv ShieldPPPt-PT-030A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;