Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r113-smll-162075355600041.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is FlexibleBarrier-PT-14a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355600041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 169K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-14a-00
FORMULA_NAME FlexibleBarrier-PT-14a-01
FORMULA_NAME FlexibleBarrier-PT-14a-02
FORMULA_NAME FlexibleBarrier-PT-14a-03
FORMULA_NAME FlexibleBarrier-PT-14a-04
FORMULA_NAME FlexibleBarrier-PT-14a-05
FORMULA_NAME FlexibleBarrier-PT-14a-06
FORMULA_NAME FlexibleBarrier-PT-14a-07
FORMULA_NAME FlexibleBarrier-PT-14a-08
FORMULA_NAME FlexibleBarrier-PT-14a-09
FORMULA_NAME FlexibleBarrier-PT-14a-10
FORMULA_NAME FlexibleBarrier-PT-14a-11
FORMULA_NAME FlexibleBarrier-PT-14a-12
FORMULA_NAME FlexibleBarrier-PT-14a-13
FORMULA_NAME FlexibleBarrier-PT-14a-14
FORMULA_NAME FlexibleBarrier-PT-14a-15

=== Now, execution of the tool begins

BK_START 1620916279663

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 14:31:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 14:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:31:23] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2021-05-13 14:31:23] [INFO ] Transformed 171 places.
[2021-05-13 14:31:23] [INFO ] Transformed 578 transitions.
[2021-05-13 14:31:23] [INFO ] Found NUPN structural information;
[2021-05-13 14:31:23] [INFO ] Parsed PT model containing 171 places and 578 transitions in 367 ms.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 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 436 ms. (steps per millisecond=229 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-13 14:31:24] [INFO ] Flow matrix only has 394 transitions (discarded 14 similar events)
// Phase 1: matrix 394 rows 171 cols
[2021-05-13 14:31:24] [INFO ] Computed 16 place invariants in 20 ms
[2021-05-13 14:31:24] [INFO ] [Real]Absence check using 16 positive place invariants in 39 ms returned sat
[2021-05-13 14:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:24] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-13 14:31:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned unsat
[2021-05-13 14:31:24] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2021-05-13 14:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:25] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-13 14:31:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 19 ms returned unsat
[2021-05-13 14:31:25] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2021-05-13 14:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:25] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-13 14:31:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 19 ms returned unsat
[2021-05-13 14:31:25] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2021-05-13 14:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:26] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2021-05-13 14:31:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned unsat
[2021-05-13 14:31:26] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2021-05-13 14:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:26] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2021-05-13 14:31:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned unsat
[2021-05-13 14:31:26] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2021-05-13 14:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:27] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2021-05-13 14:31:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 22 ms returned unsat
[2021-05-13 14:31:27] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2021-05-13 14:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:31:27] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-13 14:31:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:31:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-13 14:31:28] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 14:31:28] [INFO ] Flatten gal took : 161 ms
FORMULA FlexibleBarrier-PT-14a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:31:28] [INFO ] Applying decomposition
[2021-05-13 14:31:28] [INFO ] Flatten gal took : 64 ms
[2021-05-13 14:31:28] [INFO ] Decomposing Gal with order
[2021-05-13 14:31:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 14:31:28] [INFO ] Removed a total of 576 redundant transitions.
[2021-05-13 14:31:28] [INFO ] Flatten gal took : 176 ms
[2021-05-13 14:31:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 24 ms.
[2021-05-13 14:31:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2021-05-13 14:31:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FlexibleBarrier-PT-14a @ 3570 seconds

FORMULA FlexibleBarrier-PT-14a-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-14a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3562
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-14a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 14:31:29 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p141 <= 0)) OR ((1 <= p70)) OR ((p123 <= 0)) OR ((1 <= p103))))",
"processed_size": 72,
"rewrites": 33
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p99)) U (X (X (F (((p73 <= 0))))) AND (((p56 <= 0)) OR ((1 <= p48)))))",
"processed_size": 79,
"rewrites": 33
},
"result":
{
"edges": 44,
"markings": 31,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (G (((1 <= p124)))) OR (X ((((1 <= p71)) AND ((p89 <= 0)))) AND (((p71 <= 0)) OR ((1 <= p89))))))",
"processed_size": 104,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p142 <= 0)) OR ((1 <= p117)))))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"edges": 26719,
"markings": 6027,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p40 <= 0)) OR ((1 <= p52)))))",
"processed_size": 39,
"rewrites": 33
},
"result":
{
"edges": 26129,
"markings": 6155,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((F (((1 <= p64))) AND ((((p77 <= 0)) OR ((1 <= p100))) OR ((1 <= p64))))) AND ((1 <= p64))))",
"processed_size": 100,
"rewrites": 33
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((((p8 <= 0)) OR ((1 <= p37))) OR (F ((((p8 <= 0)) OR ((1 <= p37)))) AND G ((((1 <= p106)) AND ((p133 <= 0))))))))",
"processed_size": 122,
"rewrites": 33
},
"result":
{
"edges": 95684,
"markings": 33308,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"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": 3564
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p138 <= 0)) OR ((1 <= p8)))",
"processed_size": 31,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p138 <= 0)) OR ((1 <= p8)))",
"processed_size": 31,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p87 <= 0)) OR ((1 <= p161))))",
"processed_size": 36,
"rewrites": 33
},
"result":
{
"edges": 81679,
"markings": 17174,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 33852,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((G((F(**) AND (** OR **))) AND **)) : F(G((** OR (F(**) AND G(*))))) : F(G(*)) : X(**) : F(G(**)) : (** U (X(X(F(*))) AND **)) : (G(**) AND **) : F((X(G(**)) OR (X(*) AND **)))"
},
"net":
{
"arcs": 1703,
"conflict_clusters": 60,
"places": 171,
"places_significant": 155,
"singleton_clusters": 0,
"transitions": 408
},
"result":
{
"preliminary_value": "no no no yes no yes no no ",
"value": "no no no yes no yes 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: 579/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 171
lola: finding significant places
lola: 171 places, 408 transitions, 155 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: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: ((((p46 <= 0)) AND (NOT(G ((((p77 <= 0)) OR ((1 <= p100))))) OR ((p64 <= 0)))) U F ((G (((((p77 <= 0)) OR ((1 <= p100))) U ((1 <= p64)))) AND ((1 <= p64))))) : F (G (((((p8 <= 0)) OR ((1 <= p37))) OR (F ((((p8 <= 0)) OR ((1 <= p37)))) AND NOT(F ((((p106 <= 0)) OR ((1 <= p133))))))))) : G (F (NOT(F (G (F ((((1 <= p142)) AND ((p117 <= 0))))))))) : X ((NOT(X (X ((F (((((p93 <= 0)) OR ((1 <= p5))) U (((1 <= p93)) AND ((p5 <= 0))))) U (1 <= 0))))) AND (((p141 <= 0)) OR ((1 <= p70)) OR ((p123 <= 0)) OR ((1 <= p103))))) : NOT(G (NOT(G ((((p40 <= 0)) OR ((1 <= p52))))))) : (((1 <= p99)) U (F (((((p119 <= 0)) OR ((1 <= p13))) U X (NOT(X (((1 <= p73))))))) AND (((p56 <= 0)) OR ((1 <= p48))))) : (G ((((p87 <= 0)) OR ((1 <= p161)))) AND (((p138 <= 0)) OR ((1 <= p8)))) : F ((G (X (((1 <= p124)))) OR (NOT(X ((((p71 <= 0)) OR ((1 <= p89))))) AND (((p71 <= 0)) OR ((1 <= p89))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p141 <= 0)) OR ((1 <= p70)) OR ((p123 <= 0)) OR ((1 <= p103))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p141 <= 0)) OR ((1 <= p70)) OR ((p123 <= 0)) OR ((1 <= p103))))
lola: processed formula length: 72
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p99)) U (X (X (F (((p73 <= 0))))) AND (((p56 <= 0)) OR ((1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p99)) U (X (X (F (((p73 <= 0))))) AND (((p56 <= 0)) OR ((1 <= p48)))))
lola: processed formula length: 79
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 31 markings, 44 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p124)))) OR (X ((((1 <= p71)) AND ((p89 <= 0)))) AND (((p71 <= 0)) OR ((1 <= p89))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p124)))) OR (X ((((1 <= p71)) AND ((p89 <= 0)))) AND (((p71 <= 0)) OR ((1 <= p89))))))
lola: processed formula length: 104
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p142 <= 0)) OR ((1 <= p117)))))
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 ((((p142 <= 0)) OR ((1 <= p117)))))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 114
lola: add low 19
lola: add low 156
lola: add low 20
lola: add low 383
lola: add low 224
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: 6027 markings, 26719 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p40 <= 0)) OR ((1 <= p52)))))
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 ((((p40 <= 0)) OR ((1 <= p52)))))
lola: processed formula length: 39
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 379
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: 6155 markings, 26129 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p64))) AND ((((p77 <= 0)) OR ((1 <= p100))) OR ((1 <= p64))))) AND ((1 <= p64))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p64))) AND ((((p77 <= 0)) OR ((1 <= p100))) OR ((1 <= p64))))) AND ((1 <= p64))))
lola: processed formula length: 100
lola: 33 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 20 edges
lola: ========================================
lola: subprocess 6 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((p8 <= 0)) OR ((1 <= p37))) OR (F ((((p8 <= 0)) OR ((1 <= p37)))) AND G ((((1 <= p106)) AND ((p133 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((p8 <= 0)) OR ((1 <= p37))) OR (F ((((p8 <= 0)) OR ((1 <= p37)))) AND G ((((1 <= p106)) AND ((p133 <= 0))))))))
lola: processed formula length: 122
lola: 33 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 354
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: 33308 markings, 95684 edges
lola: ========================================
lola: subprocess 7 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p87 <= 0)) OR ((1 <= p161)))) AND (((p138 <= 0)) OR ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p138 <= 0)) OR ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p138 <= 0)) OR ((1 <= p8)))
lola: processed formula length: 31
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((((p87 <= 0)) OR ((1 <= p161)))) AND (((p138 <= 0)) OR ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p138 <= 0)) OR ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p138 <= 0)) OR ((1 <= p8)))
lola: processed formula length: 31
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p87 <= 0)) OR ((1 <= p161))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p87 <= 0)) OR ((1 <= p161))))
lola: processed formula length: 36
lola: 33 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: 17174 markings, 81679 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no yes no yes no no
lola:
preliminary result: no no no yes no yes no no
lola: ========================================
lola: memory consumption: 33852 KB
lola: time consumption: 8 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="FlexibleBarrier-PT-14a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is FlexibleBarrier-PT-14a, 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 r113-smll-162075355600041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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